@stevenvo780/st-lang 4.10.0 → 4.12.0

package/dist/tests/reasoning/group-presentation/group-presentation.test.js

@@ -0,0 +1,229 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const group_presentation_1 = require("../../../reasoning/group-presentation");
+(0, vitest_1.describe)('Group Presentation — palabras y reducción libre', () => {
+    (0, vitest_1.it)('inverse intercambia caja a↔A, r↔R', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('a')).toBe('A');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('A')).toBe('a');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('r')).toBe('R');
+        (0, vitest_1.expect)((0, group_presentation_1.inverse)('R')).toBe('r');
+    });
+    (0, vitest_1.it)('reduceWord cancela pares adyacentes inverso-mutuos', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'b', 'B', 'a'])).toEqual(['a', 'a']);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['A', 'a', 'b'])).toEqual(['b']);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'A'])).toEqual([]);
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)([])).toEqual([]);
+    });
+    (0, vitest_1.it)('reduceWord es idempotente y elimina cascadas', () => {
+        // a b B A → ε (cancelaciones encadenadas)
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'b', 'B', 'A'])).toEqual([]);
+        // a a b B A A → ε  (a²b · b⁻¹ · a⁻² )
+        (0, vitest_1.expect)((0, group_presentation_1.reduceWord)(['a', 'a', 'b', 'B', 'A', 'A'])).toEqual([]);
+    });
+    (0, vitest_1.it)('multiplyWords concatena y reduce', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(['a', 'b'], ['B', 'a'])).toEqual(['a', 'a']);
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)([], ['a'])).toEqual(['a']);
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(['a'], ['A'])).toEqual([]);
+    });
+    (0, vitest_1.it)('invertWord invierte y aplica inverso a cada letra', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.invertWord)(['a', 'b', 'A'])).toEqual(['a', 'B', 'A']);
+        (0, vitest_1.expect)((0, group_presentation_1.invertWord)([])).toEqual([]);
+        // (w · w⁻¹) reduce a ε
+        const w = ['a', 'b', 'c', 'A'];
+        (0, vitest_1.expect)((0, group_presentation_1.multiplyWords)(w, (0, group_presentation_1.invertWord)(w))).toEqual([]);
+    });
+    (0, vitest_1.it)('wordEquals compara sintácticamente', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a', 'b'], ['a', 'b'])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a', 'b'], ['a', 'B'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)([], [])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.wordEquals)(['a'], ['a', 'b'])).toBe(false);
+    });
+    (0, vitest_1.it)('isReduced detecta y rechaza cancelaciones pendientes', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'b'])).toBe(true);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'A'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)(['a', 'b', 'B'])).toBe(false);
+        (0, vitest_1.expect)((0, group_presentation_1.isReduced)([])).toBe(true);
+    });
+    (0, vitest_1.it)('parseWord y wordToString son inversas', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.parseWord)('abAb')).toEqual(['a', 'b', 'A', 'b']);
+        (0, vitest_1.expect)((0, group_presentation_1.wordToString)(['a', 'b', 'A', 'b'])).toBe('abAb');
+        (0, vitest_1.expect)((0, group_presentation_1.wordToString)([])).toBe('1');
+    });
+});
+(0, vitest_1.describe)('Group Presentation — Todd-Coxeter coset enumeration', () => {
+    (0, vitest_1.it)('cyclicGroupZn(5) tiene orden 5', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(5))).toBe(5);
+    });
+    (0, vitest_1.it)('cyclicGroupZn(1) es trivial: orden 1', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(1))).toBe(1);
+    });
+    (0, vitest_1.it)('cyclicGroupZn(7) — primo: orden 7', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.cyclicGroupZn)(7))).toBe(7);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(3) tiene orden 6 (≅ S_3)', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(3))).toBe(6);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(4) tiene orden 8', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(4))).toBe(8);
+    });
+    (0, vitest_1.it)('dihedralGroupDn(5) tiene orden 10', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(5))).toBe(10);
+    });
+    (0, vitest_1.it)('grupo libre F_2 tiene orden infinito', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.freeGroupFn)(2))).toBe('infinite');
+    });
+    (0, vitest_1.it)('grupo libre F_1 tiene orden infinito', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.freeGroupFn)(1))).toBe('infinite');
+    });
+    (0, vitest_1.it)('grupo trivial ⟨ | ⟩ tiene orden 1', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)({ generators: [], relations: [] })).toBe(1);
+    });
+    (0, vitest_1.it)('S_3 vía symmetricGroupSn(3) tiene orden 6', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.symmetricGroupSn)(3))).toBe(6);
+    });
+    (0, vitest_1.it)('S_4 vía symmetricGroupSn(4) tiene orden 24', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.symmetricGroupSn)(4), 256)).toBe(24);
+    });
+    (0, vitest_1.it)('Klein four-group ⟨a,b | a², b², (ab)²⟩ tiene orden 4', () => {
+        const klein = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a'],
+                ['b', 'b'],
+                ['a', 'b', 'a', 'b'],
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(klein)).toBe(4);
+    });
+    (0, vitest_1.it)('cap maxCosets demasiado bajo en F_2 devuelve unknown', () => {
+        // F_2 es infinito; con maxCosets=10, Todd-Coxeter no termina,
+        // aunque la rama 'infinite' lo detecta antes por ausencia de
+        // relaciones. Forzamos relación trivial para evitar el shortcut.
+        const almostFree = {
+            generators: ['a', 'b'],
+            relations: [['a', 'A']], // relación trivialmente reducible a vacío
+        };
+        // Como la relación reduce a ε, sigue siendo libre → 'infinite' por shortcut.
+        // Para forzar 'unknown' añadimos una relación no-trivial que no acote rápido:
+        const slow = {
+            generators: ['a', 'b'],
+            relations: [['a', 'b', 'A', 'B']], // commutator → Z²; con cap chico no termina
+        };
+        // Z² es infinito; cap pequeño da 'unknown'.
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(slow, 8)).toBe('unknown');
+        // El caso almostFree mantiene la rama 'infinite'.
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(almostFree)).toBe('infinite');
+    });
+});
+(0, vitest_1.describe)('Group Presentation — tabla de cosets y subgrupos', () => {
+    (0, vitest_1.it)('toddCoxeter sobre Z_6 produce 6 cosets', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(6));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(6);
+    });
+    (0, vitest_1.it)('isInSubgroup: ⟨a²⟩ en Z_6 tiene índice 2 (Lagrange: |Z_6|/|⟨a²⟩|=6/3=2)', () => {
+        const z6 = (0, group_presentation_1.cyclicGroupZn)(6);
+        const t = (0, group_presentation_1.toddCoxeter)(z6, [['a', 'a']]);
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(2);
+        // a² ∈ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a'], t)).toBe(true);
+        // a ∉ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a'], t)).toBe(false);
+        // a⁴ ∈ ⟨a²⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a', 'a', 'a'], t)).toBe(true);
+    });
+    (0, vitest_1.it)('isInSubgroup: ⟨a³⟩ en Z_6 tiene índice 3 (Lagrange: 6/2=3)', () => {
+        const z6 = (0, group_presentation_1.cyclicGroupZn)(6);
+        const t = (0, group_presentation_1.toddCoxeter)(z6, [['a', 'a', 'a']]);
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)(t.numCosets).toBe(3);
+        // a³ ∈ ⟨a³⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a', 'a', 'a'], t)).toBe(true);
+        // a ∉ ⟨a³⟩
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)(['a'], t)).toBe(false);
+    });
+    (0, vitest_1.it)('isInSubgroup: ε siempre está en cualquier subgrupo', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(4));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        (0, vitest_1.expect)((0, group_presentation_1.isInSubgroup)([], t)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Group Presentation — Cayley graph', () => {
+    (0, vitest_1.it)('grafo de Cayley de Z_4 tiene 4 vértices y 4 aristas con un generador', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.cyclicGroupZn)(4));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(4);
+        (0, vitest_1.expect)(g.edges.length).toBe(4); // solo el generador positivo 'a'
+        // Cada vértice tiene exactamente una arista saliente con 'a'.
+        const out = new Map();
+        for (const [v, ,] of g.edges) {
+            out.set(v, (out.get(v) ?? 0) + 1);
+        }
+        for (const v of g.vertices) {
+            (0, vitest_1.expect)(out.get(v)).toBe(1);
+        }
+    });
+    (0, vitest_1.it)('grafo de Cayley de D_3 tiene 6 vértices y 12 aristas (2 generadores)', () => {
+        const t = (0, group_presentation_1.toddCoxeter)((0, group_presentation_1.dihedralGroupDn)(3));
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(6);
+        (0, vitest_1.expect)(g.edges.length).toBe(12); // 6 vértices × 2 generadores positivos
+    });
+    (0, vitest_1.it)('grafo de Cayley del grupo trivial tiene 1 vértice', () => {
+        const t = (0, group_presentation_1.toddCoxeter)({ generators: ['a'], relations: [['a']] });
+        (0, vitest_1.expect)(t).not.toBe('incomplete');
+        if (t === 'incomplete')
+            return;
+        const g = (0, group_presentation_1.cayleyGraph)(t);
+        (0, vitest_1.expect)(g.vertices.length).toBe(1);
+        // El bucle a: 1 → 1 cuenta como una arista.
+        (0, vitest_1.expect)(g.edges.length).toBe(1);
+    });
+});
+(0, vitest_1.describe)('Group Presentation — más familias clásicas', () => {
+    (0, vitest_1.it)('Z_2 × Z_2 (Klein) usando otra presentación', () => {
+        // ⟨a, b | a², b², ab=ba⟩  ↔  conmutador [a,b]=1
+        const v4 = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a'],
+                ['b', 'b'],
+                ['a', 'b', 'A', 'B'], // [a,b] = 1
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(v4)).toBe(4);
+    });
+    (0, vitest_1.it)('grupo cuaternio Q_8: ⟨a,b | a⁴, a²b⁻², bab⁻¹a⟩ tiene orden 8', () => {
+        // Presentación clásica: a^4 = 1, a^2 = b^2, b a b^{-1} = a^{-1}
+        // → relaciones a^4, a^2 b^{-2}, b a b^{-1} a
+        const q8 = {
+            generators: ['a', 'b'],
+            relations: [
+                ['a', 'a', 'a', 'a'],
+                ['a', 'a', 'B', 'B'],
+                ['b', 'a', 'B', 'a'],
+            ],
+        };
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)(q8, 128)).toBe(8);
+    });
+    (0, vitest_1.it)('D_2 = Z_2 × Z_2 (Klein) tiene orden 4', () => {
+        (0, vitest_1.expect)((0, group_presentation_1.groupOrder)((0, group_presentation_1.dihedralGroupDn)(2))).toBe(4);
+    });
+});
+//# sourceMappingURL=group-presentation.test.js.map

package/dist/tests/reasoning/group-presentation/group-presentation.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-presentation.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/group-presentation/group-presentation.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,8EAiB+C;AAE/C,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,0CAA0C;QAC1C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrD,sCAAsC;QACtC,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,uBAAuB;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,EAAE,IAAA,+BAAU,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,IAAA,eAAM,EAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAA,8BAAS,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,8BAAS,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,IAAA,eAAM,EAAC,IAAA,8BAAS,EAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,oCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,oCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,oCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,gCAAW,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,gCAAW,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,qCAAgB,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,qCAAgB,EAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG;YACZ,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACtB,SAAS,EAAE;gBACT,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aACrB;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,8DAA8D;QAC9D,6DAA6D;QAC7D,iEAAiE;QACjE,MAAM,UAAU,GAAG;YACjB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACtB,SAAS,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,0CAA0C;SACpE,CAAC;QACF,6EAA6E;QAC7E,8EAA8E;QAC9E,MAAM,IAAI,GAAG;YACX,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACtB,SAAS,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,4CAA4C;SAChF,CAAC;QACF,4CAA4C;QAC5C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,kDAAkD;QAClD,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,EAAE,GAAG,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,YAAY;QACZ,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,WAAW;QACX,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,YAAY;QACZ,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,EAAE,GAAG,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,YAAY;QACZ,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,WAAW;QACX,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,IAAA,kCAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;QACjE,8DAA8D;QAC9D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,KAAK,MAAM,CAAC,CAAC,EAAE,AAAD,EAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,IAAA,oCAAe,EAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,uCAAuC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,YAAY;YAAE,OAAO;QAC/B,MAAM,CAAC,GAAG,IAAA,gCAAW,EAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,4CAA4C;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,gDAAgD;QAChD,MAAM,EAAE,GAAG;YACT,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACtB,SAAS,EAAE;gBACT,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,YAAY;aACnC;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,gEAAgE;QAChE,6CAA6C;QAC7C,MAAM,EAAE,GAAG;YACT,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACtB,SAAS,EAAE;gBACT,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;gBACpB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;gBACpB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aACrB;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,IAAA,eAAM,EAAC,IAAA,+BAAU,EAAC,IAAA,oCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,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