Membership reduces to exact first-column synthesis
OpenQAlgorithms.Papers.Independent.Intakenext100.P03.first_column_reductionLet be a positive even integer. Put , , , and , where , and . Write , with and positive odd , and assume for some positive integer . For every ,
Column equality includes absolute phase. This reduction holds under the congruence condition, beyond the five small parameters.
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 7.1, PDF pp.18-19: exact first-column equality, retaining phase,
under the congruence condition beyond the five small parameters. -/
theorem first_column_reduction (n k s : ℕ) (hk : 1 ≤ k) (hs : 0 < s)
(hodd : Odd s) (hfactor : n = 2 ^ k * s) (hcong : MinusOneIsTwoPower s)
(U : Mat) (hU : U ∈ ringUnitaries n) :
U ∈ cyclotomicGroup n ↔ ∃ V ∈ cyclotomicGroup n,
∀ b : Bool, V b false = U b false := 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 with , , odd, , and such that divides for some natural number , let be the smallest subring of containing and . Let be the multiplicative submonoid generated by
and let be the multiplicative submonoid generated by , , and , where ; empty products are allowed. For every unitary complex matrix whose entries belong to ,
Thus the existential condition requires exact equality of the two entries of the column indexed by . The hypotheses allow , for which the divisibility condition holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.