Documentation

Complexity.Computability.Circuit.Rational.IntegralLift

Integer form of the regular lift #

The generator's rational matrices are regular representations of matrices over the cyclotomic field CyclotomicRing.R e. Every regular-representation entry of a cyclotomic monomial is 0 or ±1, so after clearing the common denominator 2 ^ (e + 1) each lifted matrix entry is an explicit signed sum of integer monomials. This file defines that integer formula, proves it agrees with the rational lift, and bounds its entries. The integer matrices are computable and feed the executable generator.

Main definitions #

Main results #

References #

The signed coefficient of the cyclotomic regular representation.

Instances For

    Integer computation of the exact expanded Taylor-reversal matrix at t.

    Instances For

      The integer Taylor test matrix with discarded columns set to zero.

      Instances For
        theorem Cslib.Circuits.Rational.IntegralTest.coeff_bound (a : ℤ) (w M k j : ℕ) (hw : 1 ≤ w) (ha : |a| ≤ ↑w) (hk : k ≤ M) :
        |((Polynomial.X + Polynomial.C a) ^ k).coeff j| ≤ (2 * ↑w) ^ M

        For |a| ≤ w with 1 ≤ w and k ≤ M, every coefficient of (X + C a) ^ k has absolute value at most (2 * w) ^ M.

        theorem Cslib.Circuits.Rational.ThreeLift.eval_uni {K : Type u_1} [Field K] (x : Fin 3 → K) (p : Polynomial K) :

        Evaluating uni p on a three-variable tuple x evaluates p at x 0.

        theorem Cslib.Circuits.Rational.ThreeLift.eval_lift {K : Type u_1} [Field K] {d : ℕ} [NeZero d] (χ : AddChar (ZMod d) K) (R : Matrix (ZMod d) (ZMod d) (Polynomial K)) (x : Fin 3 → K) (i j : ZMod d) :
        (MvPolynomial.eval x) (lift χ R i j) = (↑d)⁻¹ * ∑ a : ZMod d, ∑ b : ZMod d, ∑ k : ZMod d, χ (-a * k) * Polynomial.eval (x 0) (R k (k - b)) * QuantumMatrices.weyl χ a b i j * x 1 ^ a.val * x 2 ^ b.val

        Evaluating lift χ R i j at x expands to the Weyl-matrix character sum at x 0, x 1, x 2.

        The fixed signed-monomial integer formula for M times a regular lift entry.

        Instances For

          The integer formula entry e T p r u v i j equals dimension e times the (i, j) regular representation entry of ThreeLift.lift (character e) P u v at (t, p, r).

          The (i, j) entry of regular e A is the corresponding entry of CyclotomicRing.rho e under coordinate e.

          Exact integer Taylor matrices, with the same fixed order of residues.

          Instances For

            The common-denominator-cleared regular matrices used in exact arithmetic.

            Instances For
              theorem Cslib.Circuits.Rational.Generator.U_cast (n N e : ℕ) (x : Fin 3 → ℕ) (a : Fin (n + 1)) :

              Casting integralLift n N e x a to ℚ equals CyclotomicRing.dimension e times rationalLift n N e x a.

              theorem Cslib.Circuits.Rational.Generator.U_bound (n N e H : ℕ) (x : Fin 3 → ℕ) (hH : 1 ≤ H) (hx : ∀ (l : Fin 3), x l ≤ H) (a : Fin (n + 1)) (i j : Fin (matrixDimension e)) :
              |integralLift n N e x a i j| ≤ ↑(CyclotomicRing.dimension e) ^ 4 * (2 * (↑n + 1)) ^ (2 * CyclotomicRing.dimension e) * ↑H ^ (3 * CyclotomicRing.dimension e)

              For grid points bounded by H ≥ 1, every entry of integralLift n N e x a has absolute value at most M ^ 4 * (2 * (n + 1)) ^ (2 * M) * H ^ (3 * M), where M = CyclotomicRing.dimension e.

              theorem Cslib.Circuits.Rational.Generator.tupleAt_integer (n N e : ℕ) (x : Fin 3 → ℕ) (hz : Matrix.det (rationalLift n N e x 0) ≠ 0) (a : Fin n) :
              tupleAt n N e x a = ((integralLift n N e x 0).map ⇑(Int.castRingHom ℚ))⁻¹ * (integralLift n N e x a.succ).map ⇑(Int.castRingHom ℚ)

              When (rationalLift n N e x 0).det ≠ 0, the normalized matrix tupleAt n N e x a is the ratio (integralLift n N e x 0)⁻¹ * integralLift n N e x a.succ over ℚ.

              theorem Cslib.Circuits.Rational.Generator.U_det_ne_zero (n N e : ℕ) (x : Fin 3 → ℕ) (hz : Matrix.det (rationalLift n N e x 0) ≠ 0) :
              (integralLift n N e x 0).det ≠ 0

              If (rationalLift n N e x 0).det ≠ 0, then (integralLift n N e x 0).det ≠ 0.