Section 4.1, unnumbered: dihedral quotient (phase typo corrected)
ProvedQAlgorithms.Papers.Independent.Gap48.P12.ct_dihedral_quotientLet for the exact Clifford group . With the source's scalar typo corrected, put
Then is the scalar normal subgroup of , and
where is the order-eight symmetry group of a square. The Lean statement identifies the carrier of the constructed ambient subgroup and the carrier of its constructed normal kernel before asserting a multiplicative isomorphism. The printed denominator would give a set that is not closed; denominator agrees with the exact symbolic generator . This correction requires independent moderation.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P12
local notation "Mat" => Matrix Bool Bool ℂ
local notation "Vec" => EuclideanSpace ℂ Bool
local notation "wordMatrix" => fun (B : CircuitBasis) (w : CircuitWord) =>
QAlgorithms.Papers.Independent.Next46.P21.wordMatrix (chronologicalInstructions B w)
/-- PDF p.7, §4.1: quotient by the scalar subgroup is D₄ (order eight).
Printed: K={exp(i*pi*k/8) I : k=0,...,7}; changed: denominator 4.
Why: the printed set omits the eighth power -I of its generator and is not
a subgroup. The corrected roots agree with (H P^3)^3=exp(-i*pi/4) I and
the stated orders 64 and 8. Carrier equalities are conclusions, so neither
subgroup closure nor the scalar correction is smuggled in as a hypothesis.
Independent moderation of this source correction is required. -/
theorem ct_dihedral_quotient :
(ctGroup : Set (Matrix.unitaryGroup Bool ℂ)) = {u : Matrix.unitaryGroup Bool ℂ | (u : Mat) ∈ ctSet} ∧
(∀ g : ctGroup, g ∈ scalarKernel ↔ ∃ k : Fin 8,
(((g : ctGroup) : Matrix.unitaryGroup Bool ℂ) : Mat) = scalarRoot k) ∧
Nonempty ((ctGroup ⧸ scalarKernel) ≃* DihedralGroup 4) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P12
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , , , let be the set of matrix values of all finite words over , including the empty word, and define . Let be the smallest subgroup of containing every unitary matrix whose underlying matrix lies in , and let be the smallest normal subgroup of containing every element of whose underlying matrix equals for some integer . Three assertions hold together: the underlying set of is exactly the unitary matrices whose underlying matrices belong to ; for every ,
and there exists a group isomorphism from to the dihedral group of order , equivalently the group presented by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.