Denominator exponent pattern with alpha in the enlarged field
OpenQAlgorithms.Papers.Independent.Intakenext100.P03.denominator_pattern_alphaLet be a positive even integer. Put , , , and , where , and .
For an axis with Pauli matrix , write . A canonical pair consists of an ordered finite list and an actual matrix , with consecutive axes distinct, , proportional to an element of , and . Products have the printed left-to-right order, and the empty list is permitted.
Write with and positive odd . Define if , and otherwise. Set and for , for .
Use ordered Pauli axes and the homomorphic Bloch matrix . This transposes printed equation (9), as required by the source's left-cancellation proof and row patterns.
Let with , take any canonical pair, and set . Work in the ring of integers of . A reduced exponent of a nonzero entry means , with , , and not divisible by . Coprimality means that the principal ideals sum to .
- Every nonzero entry has a reduced exponent.
- The global maximum is attained and satisfies
Exactly two rows contain an entry at exponent with numerator coprime to . 3. Exactly one row has no entry at exponent . It is the row indexed by the first axis , and its attained maximum is
That row contains an entry at this exponent with numerator coprime to . The non-Clifford premise guarantees a nonempty list.
The pattern exposes the leading canonical axis while retaining the stronger coprimality conclusion.
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 ℂ
/-- Theorem 6.3(a)-(c), PDF pp.16-18. Uses the enlarged field K and alpha,
not the smaller denominatorBeta field. Same disclosed Bloch transpose correction. -/
theorem denominator_pattern_alpha (n k s : ℕ) (hk : 1 ≤ k) (hs : 0 < s)
(hodd : Odd s) (hfactor : n = 2 ^ k * s)
(U : Mat) (hU : U ∈ cyclotomicGroup n) (hnot : homomorphicBloch U ∉ blochCliffords)
(d : CanonicalData) (hd : IsCyclotomicCanonical n U d) :
∃ p a rest, d.1 = (p, a) :: rest ∧
DenominatorPattern (numeratorField n k) (denominatorAlpha k) (homomorphicBloch U)
(canonicalTotalWeight n k d) (denominatorWeight n k a) p := 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 , define , let be the multiplicative submonoid generated by , , and their conjugate transposes, and let be the multiplicative submonoid generated by , , and . Index the Pauli matrices by , with , , and , and define the real matrix
For every complex matrix such that for every , and every pair , where is a finite list of pairs and is a complex matrix, assume that every in satisfies , consecutive pairs have different first coordinates, some real satisfies , and
with the product taken in list order. Set , and, for , set
using the natural-number logarithm and subtraction truncated at zero. Let be the smallest subfield of containing and all , for , and put . For a real number and , define to mean that and there exists such that and it is not the case that , , and for some . Define to mean that holds for some column , and define to mean that some column has and
for some . Then there exist and a remaining list such that . With and , every nonzero entry of satisfies for some natural ; every satisfying is at most ; some row satisfies ; exactly two rows satisfy ; there is exactly one row for which fails; and every such row is , has all its reduced exponents at most , and satisfies both and , where is natural subtraction truncated at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.