Implement helpers related to lattice bases

Variants for add, sub, dot and scale.
Unnormalized Gram-Schmidt orthogonalization.
LLL basis reduction.

src/__tests__/basis.spec.ts

@@ -0,0 +1,160 @@
+import {describe, expect, it} from 'vitest';
+import {
+  fractionalGram,
+  fractionalLenstraLenstraLovasz,
+  gram,
+  lenstraLenstraLovasz,
+} from '../basis';
+import {
+  applyWeights,
+  fractionalDot,
+  fractionalMonzosEqual,
+  monzoToFraction,
+  monzosEqual,
+  toMonzo,
+  unapplyWeights,
+} from '../monzo';
+import {dot} from '../number-array';
+import {LOG_PRIMES} from '../primes';
+
+describe('Gram process', () => {
+  it('orthogonalizes a basis', () => {
+    const basis = [
+      [1, 2, 3],
+      [4, -5, 6],
+      [-7, 8, 9],
+    ];
+    const {ortho, dual} = gram(basis);
+    // Leading orientation
+    expect(monzosEqual(basis[0], ortho[0]));
+    // Geometric duals
+    expect(dot(ortho[0], dual[0])).toBeCloseTo(1);
+    expect(dot(ortho[1], dual[1])).toBeCloseTo(1);
+    expect(dot(ortho[2], dual[2])).toBeCloseTo(1);
+    // Orthogonality
+    expect(dot(ortho[0], ortho[1])).toBeCloseTo(0);
+    expect(dot(ortho[0], ortho[2])).toBeCloseTo(0);
+    expect(dot(ortho[1], ortho[2])).toBeCloseTo(0);
+    // Value
+    expect(ortho.map(o => o.map(c => c.toFixed(2)))).toEqual([
+      ['1.00', '2.00', '3.00'],
+      ['3.14', '-6.71', '3.43'],
+      ['-7.46', '-1.66', '3.59'],
+    ]);
+  });
+});
+
+describe('Gram process for arrays of fractions', () => {
+  it('orthogonalizes a basis', () => {
+    const basis = [
+      [1, 2, 3],
+      [4, -5, 6],
+      [-7, 8, 9],
+    ];
+    const {ortho, dual} = fractionalGram(basis);
+    // Leading orientation
+    expect(fractionalMonzosEqual(basis[0], ortho[0]));
+    // Geometric duals
+    expect(fractionalDot(ortho[0], dual[0]).toFraction()).toBe('1');
+    expect(fractionalDot(ortho[1], dual[1]).toFraction()).toBe('1');
+    expect(fractionalDot(ortho[2], dual[2]).toFraction()).toBe('1');
+    // Orthogonality
+    expect(fractionalDot(ortho[0], ortho[1]).n).toBe(0);
+    expect(fractionalDot(ortho[0], ortho[2]).n).toBe(0);
+    expect(fractionalDot(ortho[1], ortho[2]).n).toBe(0);
+    // Value
+    expect(ortho.map(o => o.map(c => c.toFraction()))).toEqual([
+      ['1', '2', '3'],
+      ['22/7', '-47/7', '24/7'],
+      ['-3483/467', '-774/467', '1677/467'],
+    ]);
+  });
+});
+
+describe('LLL basis reduction', () => {
+  it('can LLL reduce', () => {
+    const basis = [
+      [1, 1, 1],
+      [-1, 0, 2],
+      [3, 5, 6],
+    ];
+    const lll = lenstraLenstraLovasz(basis);
+    // Size-reduction
+    for (let i = 0; i < 3; ++i) {
+      for (let j = 0; j < i; ++j) {
+        expect(
+          Math.abs(dot(lll.basis[i], lll.gram.dual[j]))
+        ).toBeLessThanOrEqual(0.5);
+      }
+    }
+    // Lovász condition
+    for (let k = 1; k < 3; ++k) {
+      const ok = lll.gram.ortho[k];
+      const ok1 = lll.gram.ortho[k - 1];
+      const mu = dot(lll.basis[k], lll.gram.dual[k - 1]);
+      const n1 = dot(ok1, ok1);
+      expect((n1 * 3) / 4).toBeLessThanOrEqual(dot(ok, ok) + n1 * mu * mu);
+    }
+
+    expect(lll.basis).toEqual([
+      [0, 1, 0],
+      [1, 0, 1],
+      [-1, 0, 2],
+    ]);
+  });
+
+  it('can mess up the basis of miracle with naïve weights', () => {
+    const basis = ['225/224', '1029/1024'].map(toMonzo);
+    const lll = lenstraLenstraLovasz(basis);
+    expect(lll.basis.map(m => monzoToFraction(m).toFraction())).toEqual([
+      '225/224',
+      '2401/2400',
+    ]);
+  });
+
+  it('can fix the basis of miracle with Tenney weights', () => {
+    const basis = ['225/224', '2401/2400']
+      .map(toMonzo)
+      .map(m => applyWeights(m, LOG_PRIMES));
+    const lll = lenstraLenstraLovasz(basis);
+    const commas = lll.basis
+      .map(m => unapplyWeights(m, LOG_PRIMES).map(Math.round))
+      .map(m => monzoToFraction(m).toFraction());
+    expect(commas).toEqual(['225/224', '1029/1024']);
+  });
+});
+
+describe('Precise LLL basis reduction', () => {
+  it('can LLL reduce', () => {
+    const basis = [
+      [1, 1, 1],
+      [-1, 0, 2],
+      [3, 5, 6],
+    ];
+    const lll = fractionalLenstraLenstraLovasz(basis);
+    // Size-reduction
+    for (let i = 0; i < 3; ++i) {
+      for (let j = 0; j < i; ++j) {
+        expect(
+          fractionalDot(lll.basis[i], lll.gram.dual[j]).compare(0.5)
+        ).toBeLessThanOrEqual(0);
+      }
+    }
+    // Lovász condition
+    for (let k = 1; k < 3; ++k) {
+      const ok = lll.gram.ortho[k];
+      const ok1 = lll.gram.ortho[k - 1];
+      const mu = fractionalDot(lll.basis[k], lll.gram.dual[k - 1]);
+      const n1 = fractionalDot(ok1, ok1);
+      expect(
+        n1.mul('3/4').compare(fractionalDot(ok, ok).add(n1.mul(mu.mul(mu))))
+      ).toBeLessThanOrEqual(0);
+    }
+
+    expect(lll.basis.map(row => row.map(f => f.valueOf()))).toEqual([
+      [0, 1, 0],
+      [1, 0, 1],
+      [-1, 0, 2],
+    ]);
+  });
+});

src/__tests__/monzo.spec.ts

@@ -1,6 +1,9 @@
 import {describe, it, expect} from 'vitest';
 import {Fraction} from '../fraction';
 import {
+  fractionalAdd,
+  fractionalMonzosEqual,
+  fractionalNorm,
   monzoToBigInt,
   monzoToFraction,
   primeFactorize,
@@ -468,3 +471,31 @@ describe('Sparse monzos', () => {
     }
   });
 });
+
+describe('Fractional monzo methods', () => {
+  it('test for equality between two monzos (equal)', () => {
+    const yes = fractionalMonzosEqual(
+      ['1/2', '7/9'],
+      [0.5, new Fraction(14, 18), 0]
+    );
+    expect(yes).toBe(true);
+  });
+
+  it('test for equality between two monzos (not equal)', () => {
+    const no = fractionalMonzosEqual(
+      ['1/2', '7/9'],
+      [0.75, new Fraction(7, 9)]
+    );
+    expect(no).toBe(false);
+  });
+
+  it('adds two fractional monzos', () => {
+    const result = fractionalAdd(['1/2', '2/3'], [new Fraction(1), 0.75]);
+    expect(result.map(f => f.toFraction())).toEqual(['3/2', '17/12']);
+  });
+
+  it('measures the naïve squared length of a fractional monzo', () => {
+    const l2 = fractionalNorm([0.5, '1/3', '5/7']);
+    expect(l2.toFraction()).toBe('1537/1764');
+  });
+});