@stevenvo780/st-lang 4.11.0 → 4.13.0

package/dist/tests/reasoning/lattice/lattice.test.js

@@ -0,0 +1,238 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const lattice_1 = require("../../../reasoning/lattice");
+const eq = (L, a, b) => L.leq(a, b) && L.leq(b, a);
+(0, vitest_1.describe)('Lattice — power set 2^{a,b}', () => {
+    const L = (0, lattice_1.powerSetLattice)(['a', 'b']);
+    (0, vitest_1.it)('contiene exactamente 4 elementos', () => {
+        (0, vitest_1.expect)(L.elements.length).toBe(4);
+    });
+    (0, vitest_1.it)('es booleana: distributiva + complementada', () => {
+        (0, vitest_1.expect)((0, lattice_1.isBoolean)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isComplemented)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('es Heyting (corolario de distributividad finita)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isHeyting)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('cada subconjunto tiene complemento único (el complemento de conjuntos)', () => {
+        for (const s of L.elements) {
+            const c = (0, lattice_1.complement)(L, s);
+            (0, vitest_1.expect)(c).not.toBeNull();
+            // a ∪ c = top, a ∩ c = bottom
+            (0, vitest_1.expect)(eq(L, L.join(s, c), L.top)).toBe(true);
+            (0, vitest_1.expect)(eq(L, L.meet(s, c), L.bottom)).toBe(true);
+        }
+    });
+});
+(0, vitest_1.describe)('Lattice — divisores de 30', () => {
+    const L = (0, lattice_1.divisibilityLattice)(30);
+    (0, vitest_1.it)('elementos = {1,2,3,5,6,10,15,30}', () => {
+        const sorted = L.elements.slice().sort((a, b) => a - b);
+        (0, vitest_1.expect)(sorted).toEqual([1, 2, 3, 5, 6, 10, 15, 30]);
+    });
+    (0, vitest_1.it)('top = 30, bottom = 1', () => {
+        (0, vitest_1.expect)(L.top).toBe(30);
+        (0, vitest_1.expect)(L.bottom).toBe(1);
+    });
+    (0, vitest_1.it)('es distributiva (n libre de cuadrados ⇒ 2^k Booleana)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isBoolean)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('join = lcm, meet = gcd: join(6,10)=30, meet(6,10)=2', () => {
+        (0, vitest_1.expect)(L.join(6, 10)).toBe(30);
+        (0, vitest_1.expect)(L.meet(6, 10)).toBe(2);
+    });
+    (0, vitest_1.it)('átomos = primos {2,3,5}', () => {
+        const a = (0, lattice_1.atoms)(L)
+            .slice()
+            .sort((x, y) => x - y);
+        (0, vitest_1.expect)(a).toEqual([2, 3, 5]);
+    });
+    (0, vitest_1.it)('coátomos = {6,10,15}', () => {
+        const c = (0, lattice_1.coatoms)(L)
+            .slice()
+            .sort((x, y) => x - y);
+        (0, vitest_1.expect)(c).toEqual([6, 10, 15]);
+    });
+});
+(0, vitest_1.describe)('Lattice — divisores de 12 (no libre de cuadrados)', () => {
+    // 12 = 2^2 · 3: distributive pero NO complementada (2 y 6 no tienen complemento)
+    const L = (0, lattice_1.divisibilityLattice)(12);
+    (0, vitest_1.it)('es distributiva pero NO Booleana (12 no es libre de cuadrados)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isComplemented)(L)).toBe(false);
+        (0, vitest_1.expect)((0, lattice_1.isBoolean)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('el elemento 2 no tiene complemento', () => {
+        (0, vitest_1.expect)((0, lattice_1.complement)(L, 2)).toBeNull();
+    });
+});
+(0, vitest_1.describe)('Lattice — chain(5)', () => {
+    const L = (0, lattice_1.chain)(5);
+    (0, vitest_1.it)('es totally ordered (lattice trivialmente)', () => {
+        (0, vitest_1.expect)(L.elements.length).toBe(5);
+        (0, vitest_1.expect)(L.top).toBe(4);
+        (0, vitest_1.expect)(L.bottom).toBe(0);
+    });
+    (0, vitest_1.it)('es distributiva pero NO complementada (excepto en cadena de 2)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isComplemented)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('cadena de 2 sí es Booleana', () => {
+        const L2 = (0, lattice_1.chain)(2);
+        (0, vitest_1.expect)((0, lattice_1.isBoolean)(L2)).toBe(true);
+    });
+    (0, vitest_1.it)('no contiene N5 ni M3', () => {
+        (0, vitest_1.expect)((0, lattice_1.containsPentagon)(L)).toBe(false);
+        (0, vitest_1.expect)((0, lattice_1.containsDiamond)(L)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Lattice — pentágono N5', () => {
+    const L = (0, lattice_1.pentagonN5)();
+    (0, vitest_1.it)('contiene un subreticulado N5 (a sí mismo)', () => {
+        (0, vitest_1.expect)((0, lattice_1.containsPentagon)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('NO es modular (Dedekind)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isModular)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('NO es distributivo', () => {
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('es complementado (cada elemento medio cumple a∨x=T, a∧x=B)', () => {
+        // En N5 con {B,a,c,b,T}: complemento de 'a' es 'b'; de 'c' también es 'b';
+        // 'b' tiene dos complementos posibles (a o c). Todos tienen alguno.
+        (0, vitest_1.expect)((0, lattice_1.isComplemented)(L)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Lattice — diamante M3', () => {
+    const L = (0, lattice_1.diamondM3)();
+    (0, vitest_1.it)('contiene un subreticulado M3', () => {
+        (0, vitest_1.expect)((0, lattice_1.containsDiamond)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('es modular pero NO distributivo', () => {
+        (0, vitest_1.expect)((0, lattice_1.isModular)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('NO contiene N5', () => {
+        (0, vitest_1.expect)((0, lattice_1.containsPentagon)(L)).toBe(false);
+    });
+    (0, vitest_1.it)('es complementado pero no Booleano (complementos no únicos)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isComplemented)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isBoolean)(L)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Lattice — Dedekind / Birkhoff', () => {
+    (0, vitest_1.it)('Dedekind: modular ⇔ libre de N5', () => {
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.pentagonN5)())).toMatchObject({
+            modular: false,
+            pentagonFree: false,
+        });
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.diamondM3)())).toMatchObject({
+            modular: true,
+            pentagonFree: true,
+        });
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.chain)(4))).toMatchObject({
+            modular: true,
+            pentagonFree: true,
+        });
+    });
+    (0, vitest_1.it)('Birkhoff: distributiva ⇔ libre de N5 y M3', () => {
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.powerSetLattice)(['a', 'b', 'c']))).toMatchObject({
+            distributive: true,
+            pentagonFree: true,
+            diamondFree: true,
+        });
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.diamondM3)())).toMatchObject({
+            distributive: false,
+            diamondFree: false,
+        });
+        (0, vitest_1.expect)((0, lattice_1.dedekindAnalysis)((0, lattice_1.pentagonN5)())).toMatchObject({
+            distributive: false,
+            pentagonFree: false,
+        });
+    });
+});
+(0, vitest_1.describe)('Lattice — pseudo-complemento / Heyting', () => {
+    const L = (0, lattice_1.powerSetLattice)(['x', 'y']);
+    (0, vitest_1.it)('en una Booleana: a ⇒ b coincide con ¬a ∪ b', () => {
+        const a = new Set(['x']);
+        const b = new Set(['y']);
+        const impl = (0, lattice_1.relativeComplement)(L, a, b);
+        (0, vitest_1.expect)(impl).not.toBeNull();
+        // ¬a ∪ b = {y} ∪ {y} = {y}
+        (0, vitest_1.expect)(eq(L, impl, b)).toBe(true);
+    });
+    (0, vitest_1.it)('cadena finita es Heyting (distributiva finita)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isHeyting)((0, lattice_1.chain)(5))).toBe(true);
+    });
+    (0, vitest_1.it)('N5 NO es Heyting (no distributiva)', () => {
+        (0, vitest_1.expect)((0, lattice_1.isHeyting)((0, lattice_1.pentagonN5)())).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Lattice — makeLattice rejection / validación', () => {
+    (0, vitest_1.it)('rechaza un poset que no es lattice (V-shape sin top)', () => {
+        // Elementos: {0, 1, 2}. 0 ≤ 1 y 0 ≤ 2; 1 y 2 incomparables y sin top.
+        const els = [0, 1, 2];
+        const leq = (a, b) => {
+            if (a === b)
+                return true;
+            if (a === 0)
+                return true;
+            return false;
+        };
+        (0, vitest_1.expect)((0, lattice_1.isLattice)(els, leq)).toBe(false);
+        (0, vitest_1.expect)((0, lattice_1.makeLattice)(els, leq)).toBeNull();
+    });
+    (0, vitest_1.it)('rechaza relación no transitiva', () => {
+        const els = [0, 1, 2];
+        const leq = (a, b) => {
+            if (a === b)
+                return true;
+            // 0 ≤ 1, 1 ≤ 2, pero NO 0 ≤ 2 → no transitiva
+            if (a === 0 && b === 1)
+                return true;
+            if (a === 1 && b === 2)
+                return true;
+            return false;
+        };
+        (0, vitest_1.expect)((0, lattice_1.isLattice)(els, leq)).toBe(false);
+    });
+    (0, vitest_1.it)('acepta el lattice trivial de 1 elemento', () => {
+        const L = (0, lattice_1.makeLattice)([42], (a, b) => a === b);
+        (0, vitest_1.expect)(L).not.toBeNull();
+        (0, vitest_1.expect)(L.top).toBe(42);
+        (0, vitest_1.expect)(L.bottom).toBe(42);
+    });
+});
+(0, vitest_1.describe)('Lattice — propiedades estructurales', () => {
+    (0, vitest_1.it)('powerSet sobre 3 elementos: 8 átomos? No, 3 átomos (singletons)', () => {
+        const L = (0, lattice_1.powerSetLattice)(['x', 'y', 'z']);
+        (0, vitest_1.expect)(L.elements.length).toBe(8);
+        (0, vitest_1.expect)((0, lattice_1.atoms)(L).length).toBe(3);
+        (0, vitest_1.expect)((0, lattice_1.coatoms)(L).length).toBe(3);
+    });
+    (0, vitest_1.it)('toda lattice distributiva es modular', () => {
+        const L = (0, lattice_1.powerSetLattice)(['a', 'b']);
+        (0, vitest_1.expect)((0, lattice_1.isDistributive)(L)).toBe(true);
+        (0, vitest_1.expect)((0, lattice_1.isModular)(L)).toBe(true);
+    });
+    (0, vitest_1.it)('en lattice Booleana el complemento es único', () => {
+        const L = (0, lattice_1.powerSetLattice)(['a', 'b', 'c']);
+        for (const s of L.elements) {
+            // No hay dos complementos distintos.
+            let found = null;
+            for (const x of L.elements) {
+                if (eq(L, L.join(s, x), L.top) && eq(L, L.meet(s, x), L.bottom)) {
+                    if (found !== null) {
+                        (0, vitest_1.expect)(eq(L, found, x)).toBe(true);
+                    }
+                    found = x;
+                }
+            }
+            (0, vitest_1.expect)(found).not.toBeNull();
+        }
+    });
+});
+//# sourceMappingURL=lattice.test.js.map

package/dist/tests/reasoning/lattice/lattice.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lattice.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/lattice/lattice.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,wDAoBoC;AAEpC,MAAM,EAAE,GAAG,CAAI,CAAmC,EAAE,CAAI,EAAE,CAAI,EAAW,EAAE,CACzE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAE7B,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,MAAM,CAAC,GAAG,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAEtC,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YACzB,8BAA8B;YAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAgB,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7D,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAgB,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClE,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,MAAM,CAAC,GAAG,IAAA,6BAAmB,EAAC,EAAE,CAAC,CAAC;IAElC,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,GAAG,IAAA,eAAK,EAAC,CAAC,CAAC;aACf,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,GAAG,IAAA,iBAAO,EAAC,CAAC,CAAC;aACjB,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,iFAAiF;IACjF,MAAM,CAAC,GAAG,IAAA,6BAAmB,EAAC,EAAE,CAAC,CAAC;IAElC,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,oBAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,MAAM,CAAC,GAAG,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC;IAEnB,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,EAAE,GAAG,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,yBAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,MAAM,CAAC,GAAG,IAAA,oBAAU,GAAE,CAAC;IAEvB,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,2EAA2E;QAC3E,oEAAoE;QACpE,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,MAAM,CAAC,GAAG,IAAA,mBAAS,GAAE,CAAC;IAEtB,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,IAAA,eAAM,EAAC,IAAA,yBAAe,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,oBAAU,GAAE,CAAC,CAAC,CAAC,aAAa,CAAC;YACnD,OAAO,EAAE,KAAK;YACd,YAAY,EAAE,KAAK;SACpB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,mBAAS,GAAE,CAAC,CAAC,CAAC,aAAa,CAAC;YAClD,OAAO,EAAE,IAAI;YACb,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YAC/C,OAAO,EAAE,IAAI;YACb,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YACvE,YAAY,EAAE,IAAI;YAClB,YAAY,EAAE,IAAI;YAClB,WAAW,EAAE,IAAI;SAClB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,mBAAS,GAAE,CAAC,CAAC,CAAC,aAAa,CAAC;YAClD,YAAY,EAAE,KAAK;YACnB,WAAW,EAAE,KAAK;SACnB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,0BAAgB,EAAC,IAAA,oBAAU,GAAE,CAAC,CAAC,CAAC,aAAa,CAAC;YACnD,YAAY,EAAE,KAAK;YACnB,YAAY,EAAE,KAAK;SACpB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,MAAM,CAAC,GAAG,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAEtC,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAA,4BAAkB,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,2BAA2B;QAC3B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,EAAE,IAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,IAAA,oBAAU,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,sEAAsE;QACtE,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;YAC5C,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,qBAAW,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;YAC5C,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzB,8CAA8C;YAC9C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,qBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAE,CAA2B,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,IAAA,eAAM,EAAE,CAA2B,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAG,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,eAAK,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,iBAAO,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,wBAAc,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,yBAAe,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,qCAAqC;YACrC,IAAI,KAAK,GAAuB,IAAI,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;oBAChE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;wBACnB,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrC,CAAC;oBACD,KAAK,GAAG,CAAC,CAAC;gBACZ,CAAC;YACH,CAAC;YACD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=linear-algebra.test.d.ts.map

package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linear-algebra.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/linear-algebra/linear-algebra.test.ts"],"names":[],"mappings":""}

package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js

@@ -0,0 +1,369 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const linear_algebra_1 = require("../../../reasoning/linear-algebra");
+const EPS = 1e-6;
+function expectMatrixClose(actual, expected, eps = EPS) {
+    (0, vitest_1.expect)(actual.length).toBe(expected.length);
+    for (let i = 0; i < expected.length; i++) {
+        const a = actual[i];
+        const e = expected[i];
+        (0, vitest_1.expect)(a, `row ${i}`).toBeDefined();
+        (0, vitest_1.expect)(e, `row ${i}`).toBeDefined();
+        if (!a || !e) {
+            throw new Error(`undefined row at ${i}`);
+        }
+        (0, vitest_1.expect)(a.length).toBe(e.length);
+        for (let j = 0; j < e.length; j++) {
+            const av = a[j];
+            const ev = e[j];
+            if (av === undefined || ev === undefined) {
+                throw new Error(`undefined cell at ${i},${j}`);
+            }
+            (0, vitest_1.expect)(Math.abs(av - ev), `cell ${i},${j} got ${av} want ${ev}`).toBeLessThan(eps);
+        }
+    }
+}
+function expectVectorClose(actual, expected, eps = EPS) {
+    (0, vitest_1.expect)(actual.length).toBe(expected.length);
+    for (let i = 0; i < expected.length; i++) {
+        const av = actual[i];
+        const ev = expected[i];
+        if (av === undefined || ev === undefined) {
+            throw new Error(`undefined value at ${i}`);
+        }
+        (0, vitest_1.expect)(Math.abs(av - ev), `index ${i} got ${av} want ${ev}`).toBeLessThan(eps);
+    }
+}
+(0, vitest_1.describe)('linear-algebra/construction', () => {
+    (0, vitest_1.it)('identity * A = A', () => {
+        const A = [
+            [1, 2, 3],
+            [4, 5, 6],
+            [7, 8, 10]
+        ];
+        const I = (0, linear_algebra_1.identity)(3);
+        expectMatrixClose((0, linear_algebra_1.multiply)(I, A), A);
+        expectMatrixClose((0, linear_algebra_1.multiply)(A, I), A);
+    });
+    (0, vitest_1.it)('zeros and ones produce correct shapes and fill values', () => {
+        const Z = (0, linear_algebra_1.zeros)(2, 3);
+        (0, vitest_1.expect)(Z).toEqual([
+            [0, 0, 0],
+            [0, 0, 0]
+        ]);
+        const O = (0, linear_algebra_1.diagonal)([1, 2, 3]);
+        (0, vitest_1.expect)(O).toEqual([
+            [1, 0, 0],
+            [0, 2, 0],
+            [0, 0, 3]
+        ]);
+    });
+    (0, vitest_1.it)('transpose(transpose(A)) = A', () => {
+        const A = [
+            [1, 2, 3],
+            [4, 5, 6]
+        ];
+        expectMatrixClose((0, linear_algebra_1.transpose)((0, linear_algebra_1.transpose)(A)), A);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/basic-ops', () => {
+    (0, vitest_1.it)('add and sub work on equal-shape matrices', () => {
+        const A = [[1, 2], [3, 4]];
+        const B = [[5, 6], [7, 8]];
+        expectMatrixClose((0, linear_algebra_1.add)(A, B), [[6, 8], [10, 12]]);
+        expectMatrixClose((0, linear_algebra_1.sub)(B, A), [[4, 4], [4, 4]]);
+    });
+    (0, vitest_1.it)('scalarMul scales every entry', () => {
+        const A = [[1, -2], [3, 4]];
+        expectMatrixClose((0, linear_algebra_1.scalarMul)(2, A), [[2, -4], [6, 8]]);
+    });
+    (0, vitest_1.it)('matVec, dot, norm, normalize work', () => {
+        const A = [[1, 2], [3, 4]];
+        expectVectorClose((0, linear_algebra_1.matVec)(A, [1, 1]), [3, 7]);
+        (0, vitest_1.expect)((0, linear_algebra_1.dot)([1, 2, 3], [4, 5, 6])).toBe(32);
+        (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.norm)([3, 4]) - 5)).toBeLessThan(EPS);
+        expectVectorClose((0, linear_algebra_1.normalize)([3, 4]), [0.6, 0.8]);
+    });
+    (0, vitest_1.it)('cross product (R^3) gives orthogonal result', () => {
+        const c = (0, linear_algebra_1.cross)([1, 0, 0], [0, 1, 0]);
+        expectVectorClose(c, [0, 0, 1]);
+        (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.dot)(c, [1, 0, 0]))).toBeLessThan(EPS);
+        (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.dot)(c, [0, 1, 0]))).toBeLessThan(EPS);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/determinant', () => {
+    (0, vitest_1.it)('determinant 2x2', () => {
+        (0, vitest_1.expect)((0, linear_algebra_1.determinant)([[1, 2], [3, 4]])).toBeCloseTo(-2);
+    });
+    (0, vitest_1.it)('determinant 3x3 and product property', () => {
+        const A = [
+            [6, 1, 1],
+            [4, -2, 5],
+            [2, 8, 7]
+        ];
+        (0, vitest_1.expect)((0, linear_algebra_1.determinant)(A)).toBeCloseTo(-306);
+        const I = (0, linear_algebra_1.identity)(3);
+        (0, vitest_1.expect)((0, linear_algebra_1.determinant)(I)).toBeCloseTo(1);
+    });
+    (0, vitest_1.it)('determinant is 0 for singular matrix', () => {
+        const S = [
+            [1, 2, 3],
+            [2, 4, 6],
+            [7, 8, 9]
+        ];
+        (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.determinant)(S))).toBeLessThan(EPS);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/inverse-and-solve', () => {
+    (0, vitest_1.it)('inverse(A) * A = I for 5x5', () => {
+        const A = [
+            [2, 0, 1, 0, 0],
+            [0, 3, 0, 1, 0],
+            [1, 0, 4, 0, 1],
+            [0, 1, 0, 5, 0],
+            [0, 0, 1, 0, 6]
+        ];
+        const Ainv = (0, linear_algebra_1.inverse)(A);
+        (0, vitest_1.expect)(Ainv).not.toBeNull();
+        if (!Ainv)
+            return;
+        expectMatrixClose((0, linear_algebra_1.multiply)(Ainv, A), (0, linear_algebra_1.identity)(5));
+        expectMatrixClose((0, linear_algebra_1.multiply)(A, Ainv), (0, linear_algebra_1.identity)(5));
+    });
+    (0, vitest_1.it)('inverse returns null for singular matrix', () => {
+        const S = [
+            [1, 2, 3],
+            [2, 4, 6],
+            [7, 8, 9]
+        ];
+        (0, vitest_1.expect)((0, linear_algebra_1.inverse)(S)).toBeNull();
+    });
+    (0, vitest_1.it)('solve Ax = b for 3x3 invertible', () => {
+        const A = [
+            [3, 2, -1],
+            [2, -2, 4],
+            [-1, 0.5, -1]
+        ];
+        const b = [1, -2, 0];
+        const x = (0, linear_algebra_1.solve)(A, b);
+        (0, vitest_1.expect)(x).not.toBeNull();
+        if (!x)
+            return;
+        expectVectorClose(x, [1, -2, -2]);
+        expectVectorClose((0, linear_algebra_1.matVec)(A, x), b);
+    });
+    (0, vitest_1.it)('solve returns null for inconsistent system', () => {
+        const A = [
+            [1, 1],
+            [2, 2]
+        ];
+        (0, vitest_1.expect)((0, linear_algebra_1.solve)(A, [1, 3])).toBeNull();
+    });
+    (0, vitest_1.it)('leastSquares fits a line y = 2x + 1', () => {
+        const A = [
+            [0, 1],
+            [1, 1],
+            [2, 1],
+            [3, 1]
+        ];
+        const b = [1, 3, 5, 7];
+        const x = (0, linear_algebra_1.leastSquares)(A, b);
+        expectVectorClose(x, [2, 1]);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/rref-rank', () => {
+    (0, vitest_1.it)('rref of singular matrix yields rank < n', () => {
+        const S = [
+            [1, 2, 3],
+            [2, 4, 6],
+            [3, 6, 9]
+        ];
+        const { rank: r } = (0, linear_algebra_1.rref)(S);
+        (0, vitest_1.expect)(r).toBe(1);
+        (0, vitest_1.expect)((0, linear_algebra_1.rank)(S)).toBe(1);
+    });
+    (0, vitest_1.it)('rank of full-rank matrix equals min(rows, cols)', () => {
+        const A = [
+            [1, 0, 2],
+            [0, 1, 3],
+            [4, 5, 0]
+        ];
+        (0, vitest_1.expect)((0, linear_algebra_1.rank)(A)).toBe(3);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/lu', () => {
+    (0, vitest_1.it)('LU decomp: P*A = L*U', () => {
+        const A = [
+            [2, 1, 1],
+            [4, 3, 3],
+            [8, 7, 9]
+        ];
+        const lu = (0, linear_algebra_1.decomposeLU)(A);
+        (0, vitest_1.expect)(lu).not.toBeNull();
+        if (!lu)
+            return;
+        const P = (0, linear_algebra_1.permutationMatrix)(lu.P);
+        expectMatrixClose((0, linear_algebra_1.multiply)(P, A), (0, linear_algebra_1.multiply)(lu.L, lu.U));
+        for (let i = 0; i < lu.L.length; i++) {
+            for (let j = i + 1; j < (lu.L[i]?.length ?? 0); j++) {
+                const v = lu.L[i]?.[j];
+                if (v === undefined)
+                    throw new Error('L missing entry');
+                (0, vitest_1.expect)(Math.abs(v)).toBeLessThan(EPS);
+            }
+            const diag = lu.L[i]?.[i];
+            (0, vitest_1.expect)(diag).toBeCloseTo(1);
+        }
+    });
+});
+(0, vitest_1.describe)('linear-algebra/qr', () => {
+    (0, vitest_1.it)('QR: Q*R = A and Q has orthonormal columns', () => {
+        const A = [
+            [12, -51, 4],
+            [6, 167, -68],
+            [-4, 24, -41]
+        ];
+        const { Q, R } = (0, linear_algebra_1.decomposeQR)(A);
+        expectMatrixClose((0, linear_algebra_1.multiply)(Q, R), A);
+        const QtQ = (0, linear_algebra_1.multiply)((0, linear_algebra_1.transpose)(Q), Q);
+        expectMatrixClose(QtQ, (0, linear_algebra_1.identity)(3));
+    });
+    (0, vitest_1.it)('QR of rectangular matrix preserves A = Q*R', () => {
+        const A = [
+            [1, 1],
+            [1, 0],
+            [0, 1]
+        ];
+        const { Q, R } = (0, linear_algebra_1.decomposeQR)(A);
+        expectMatrixClose((0, linear_algebra_1.multiply)(Q, R), A);
+        expectMatrixClose((0, linear_algebra_1.multiply)((0, linear_algebra_1.transpose)(Q), Q), (0, linear_algebra_1.identity)(2));
+    });
+});
+(0, vitest_1.describe)('linear-algebra/svd', () => {
+    (0, vitest_1.it)('SVD: U*diag(S)*V^T = A and singular values are non-negative descending', () => {
+        const A = [
+            [3, 1, 1],
+            [-1, 3, 1]
+        ];
+        const { U, S, V } = (0, linear_algebra_1.decomposeSVD)(A, 500);
+        const Sigma = (0, linear_algebra_1.diagonal)(S);
+        const reconstructed = (0, linear_algebra_1.multiply)((0, linear_algebra_1.multiply)(U, Sigma), (0, linear_algebra_1.transpose)(V));
+        expectMatrixClose(reconstructed, A, 1e-4);
+        for (let i = 0; i + 1 < S.length; i++) {
+            const a = S[i];
+            const b = S[i + 1];
+            if (a === undefined || b === undefined)
+                throw new Error('missing S');
+            (0, vitest_1.expect)(a).toBeGreaterThanOrEqual(b - EPS);
+            (0, vitest_1.expect)(a).toBeGreaterThanOrEqual(-EPS);
+        }
+    });
+});
+(0, vitest_1.describe)('linear-algebra/eigenvalues', () => {
+    (0, vitest_1.it)('eigenvalues of 2x2 known matrix', () => {
+        const A = [
+            [4, 1],
+            [2, 3]
+        ];
+        const vals = (0, linear_algebra_1.eigenvalues)(A).slice().sort((a, b) => b - a);
+        expectVectorClose(vals, [5, 2]);
+    });
+    (0, vitest_1.it)('eigenvalues of diagonal matrix are diagonal entries', () => {
+        const D = (0, linear_algebra_1.diagonal)([7, 3, -2]);
+        const vals = (0, linear_algebra_1.eigenvalues)(D).slice().sort((a, b) => b - a);
+        expectVectorClose(vals, [7, 3, -2]);
+    });
+    (0, vitest_1.it)('eigenvectors of symmetric matrix satisfy A*v = lambda*v', () => {
+        const S = [
+            [2, 1],
+            [1, 2]
+        ];
+        const { values, vectors } = (0, linear_algebra_1.eigenvectors)(S);
+        (0, vitest_1.expect)(values.length).toBe(2);
+        for (let j = 0; j < values.length; j++) {
+            const lambda = values[j];
+            if (lambda === undefined)
+                throw new Error('missing eigenvalue');
+            const v = [vectors[0]?.[j] ?? 0, vectors[1]?.[j] ?? 0];
+            const Av = (0, linear_algebra_1.matVec)(S, v);
+            const lv = v.map((x) => x * lambda);
+            expectVectorClose(Av, lv, 1e-4);
+        }
+    });
+    (0, vitest_1.it)('powerIteration converges to dominant eigenvalue', () => {
+        const A = [
+            [4, 1],
+            [2, 3]
+        ];
+        const { eigenvalue, eigenvector } = (0, linear_algebra_1.powerIteration)(A, { maxIter: 2000, eps: 1e-12 });
+        (0, vitest_1.expect)(Math.abs(eigenvalue - 5)).toBeLessThan(1e-4);
+        const Av = (0, linear_algebra_1.matVec)(A, eigenvector);
+        expectVectorClose(Av, eigenvector.map((x) => x * eigenvalue), 1e-3);
+    });
+});
+(0, vitest_1.describe)('linear-algebra/spaces', () => {
+    (0, vitest_1.it)('gramSchmidt produces orthonormal basis', () => {
+        const vecs = [
+            [1, 1, 0],
+            [1, 0, 1],
+            [0, 1, 1]
+        ];
+        const ortho = (0, linear_algebra_1.gramSchmidt)(vecs);
+        (0, vitest_1.expect)(ortho.length).toBe(3);
+        for (let i = 0; i < ortho.length; i++) {
+            const u = ortho[i];
+            if (!u)
+                throw new Error('missing vec');
+            (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.norm)(u) - 1)).toBeLessThan(EPS);
+            for (let j = i + 1; j < ortho.length; j++) {
+                const v = ortho[j];
+                if (!v)
+                    throw new Error('missing vec');
+                (0, vitest_1.expect)(Math.abs((0, linear_algebra_1.dot)(u, v))).toBeLessThan(EPS);
+            }
+        }
+    });
+    (0, vitest_1.it)('gramSchmidt drops dependent vectors', () => {
+        const ortho = (0, linear_algebra_1.gramSchmidt)([[1, 0], [2, 0], [0, 1]]);
+        (0, vitest_1.expect)(ortho.length).toBe(2);
+    });
+    (0, vitest_1.it)('nullSpace contains kernel basis: M*v = 0', () => {
+        const M = [
+            [1, 2, 3],
+            [2, 4, 6]
+        ];
+        const basis = (0, linear_algebra_1.nullSpace)(M);
+        (0, vitest_1.expect)(basis.length).toBeGreaterThanOrEqual(2);
+        for (const v of basis) {
+            const Mv = (0, linear_algebra_1.matVec)(M, v);
+            for (const x of Mv) {
+                (0, vitest_1.expect)(Math.abs(x)).toBeLessThan(EPS);
+            }
+        }
+    });
+    (0, vitest_1.it)('nullSpace is empty for full-rank square matrix', () => {
+        const A = [
+            [1, 0, 0],
+            [0, 1, 0],
+            [0, 0, 1]
+        ];
+        (0, vitest_1.expect)((0, linear_algebra_1.nullSpace)(A).length).toBe(0);
+    });
+    (0, vitest_1.it)('columnSpace returns rank-many independent columns', () => {
+        const M = [
+            [1, 2, 0],
+            [2, 4, 1],
+            [3, 6, 1]
+        ];
+        const basis = (0, linear_algebra_1.columnSpace)(M);
+        (0, vitest_1.expect)(basis.length).toBe((0, linear_algebra_1.rank)(M));
+        (0, vitest_1.expect)((0, linear_algebra_1.isLinearlyIndependent)(basis)).toBe(true);
+    });
+    (0, vitest_1.it)('isLinearlyIndependent detects dependence and independence', () => {
+        (0, vitest_1.expect)((0, linear_algebra_1.isLinearlyIndependent)([[1, 0], [0, 1]])).toBe(true);
+        (0, vitest_1.expect)((0, linear_algebra_1.isLinearlyIndependent)([[1, 2], [2, 4]])).toBe(false);
+        (0, vitest_1.expect)((0, linear_algebra_1.isLinearlyIndependent)([[1, 0], [0, 1], [1, 1]])).toBe(false);
+    });
+});
+//# sourceMappingURL=linear-algebra.test.js.map