Coprime normalized trigonometric numerators
OpenQAlgorithms.Papers.Independent.Intakenext100.P03.normalized_numeratorsLet be a positive even integer. Put , , , and , where , and .
Write with and positive odd . Define if , and otherwise. Set and for , for . For , set and , equivalently the piecewise normalization (32). Let and be its ring of integers. Then
If is a power of two, then also . Units and coprimality are taken in this ring of integers. These numerators control denominator cancellation.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P03
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P03
open scoped BigOperators Classical
-- Reuse the Mathlib matrix type without declaring a second Mat.
local notation "Mat" => Matrix Bool Bool ℂ
/-- Canonical data: the axis/exponent list and the actual residual matrix D,
not a nonunique phase/Clifford witness pair, PDF pp.6-7. -/
local notation "CanonicalData" => List (Fin 3 × ℕ) × Matrix Bool Bool ℂ
/-- Lemma 6.1, PDF pp.15-16: integrality, coprimality and the conditional
unit assertion in O_K. The normalization is equation (32), equivalently (33). -/
theorem normalized_numerators (n k s : ℕ) (hk : 1 ≤ k) (hs : 0 < s)
(hodd : Odd s) (hfactor : n = 2 ^ k * s)
(a : ℕ) (ha : 1 ≤ a) (halt : a < n / 2) :
InIntegers (numeratorField n k) (cosineNumerator n k a) ∧
InIntegers (numeratorField n k) (sineNumerator n k a) ∧
IntegerCoprime (numeratorField n k) (cosineNumerator n k a) (denominatorAlpha k) ∧
IntegerCoprime (numeratorField n k) (sineNumerator n k a) (denominatorAlpha k) ∧
(IsTwoPower (n / Nat.gcd a n) →
IntegerUnit (numeratorField n k) (cosineNumerator n k a) ∧
IntegerUnit (numeratorField n k) (sineNumerator n k a)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying , , odd, and , and every natural number satisfying , define
where in this formula is the natural-number logarithm and all natural-number subtractions, including the outer subtraction, are truncated at zero. The power-of-two condition includes . Put and , regarded as complex numbers, and let be the smallest subfield of containing and every with . Let . Then ; there exist , with , such that
Furthermore, if is a power of two, then there exist with and . The assertion is conditional on an in the stated range; in particular, when , that range is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.