Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered §IV: spherical trace levels and Clifford fundamental tiles

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.trace_level_sphere_and_tiles

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All circuits are single-qubit circuits without ancillas or measurements. Products act from right to left. Let H=i 2−1/2(111−1)H=i\,2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=i2−1/2(11​1−1​), T=diag⁡(e−iπ/8,eiπ/8)T=\operatorname{diag}(e^{-i\pi/8},e^{i\pi/8})T=diag(e−iπ/8,eiπ/8), S=T2S=T^2S=T2, and C=⟨H,S⟩⊂PSU⁡(2)C=\langle H,S\rangle\subset\operatorname{PSU}(2)C=⟨H,S⟩⊂PSU(2). The two distinct syllable letters are a=THa=THa=TH and b=SHb=SHb=SH. A normalized word is empty, or ends in aaa with no adjacent bbb letters. A canonical word is normalized and its first four syllables, when present, are all aaa. Write τ(c)\tau(c)τ(c) for the number of aaa letters in ccc; Clifford gates have zero charged cost.

Fix 0<t<20<t<20<t<2. Every projective gate of absolute trace ttt has a unique positive-trace special-unitary representative, parametrized uniquely by v=(x,y,z)∈S2v=(x,y,z)\in S^2v=(x,y,z)∈S2 as

Ut(v)=t2I+i1−t2/4 (xX+yY+zZ).U_t(v)=\frac t2 I+i\sqrt{1-t^2/4}\,(xX+yY+zZ).Ut​(v)=2t​I+i1−t2/4​(xX+yY+zZ).

Every unit vector gives a special-unitary matrix of trace ttt, and all such matrices arise uniquely. Clifford conjugation becomes the faithful group of 24 orientation-preserving octahedral rotations. The closed spherical triangle with vertices +X,+Z,(1,1,1)/3+X,+Z,(1,1,1)/\sqrt3+X,+Z,(1,1,1)/3​ has 24 translates covering S2S^2S2 with pairwise disjoint relative interiors, and the union of their vertex sets has cardinality 14. These coordinates support the source's secondary geometric search indices.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P82
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P82

open scoped BigOperators

local notation "Mat" => Matrix Bool Bool ℂ

/-- Unnumbered §IV, PDF pp.4--5: the nonextreme trace level is a sphere,
Clifford conjugation is the faithful rotational octahedral action, and the stated
triangle has 24 translates with disjoint relative interiors and 14 total vertices. -/
theorem trace_level_sphere_and_tiles (t : ℝ) (ht : 0 < t) (ht2 : t < 2) :
    (∀ U : Mat, U ∈ Matrix.unitaryGroup Bool ℂ → ‖Matrix.trace U‖ = t →
      ∃! V : Mat, V ∈ Matrix.unitaryGroup Bool ℂ ∧ V.det = 1 ∧
        Matrix.trace V = (t : ℂ) ∧ SameGate U V) ∧
    (∀ v ∈ unitSphere,
      sphereGate t v ∈ Matrix.unitaryGroup Bool ℂ ∧
      (sphereGate t v).det = 1 ∧ Matrix.trace (sphereGate t v) = (t : ℂ)) ∧
    (∀ U : Mat, U ∈ Matrix.unitaryGroup Bool ℂ → U.det = 1 →
      Matrix.trace U = (t : ℂ) → ∃! v : BsSphereVector, v ∈ unitSphere ∧ sphereGate t v = U) ∧
    (∀ g : Fin 24, ∀ v ∈ unitSphere,
      (bsCliffordRotation g).mulVec v ∈ unitSphere ∧
      sphereGate t ((bsCliffordRotation g).mulVec v) =
        cliffordMatrix g * sphereGate t v * star (cliffordMatrix g)) ∧
    Function.Injective (fun g : Fin 24 => fun v : {v : BsSphereVector // v ∈ unitSphere} =>
      (bsCliffordRotation g).mulVec v.val) ∧
    Set.range bsCliffordRotation = octahedronRotations ∧ Nat.card octahedronRotations = 24 ∧
    (⋃ g : Fin 24, tile g) = unitSphere ∧
    (∀ g h : Fin 24, g ≠ h → Disjoint (tileInterior g) (tileInterior h)) ∧
    Nat.card (Set.range tile) = 24 ∧ Nat.card tileVertices = 14 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P82

end
Source
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits, arXiv:1206.3223v1, PDF p. 4, Unnumbered §IV: spherical trace levels and Clifford fundamental tiles
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every real number ttt satisfying 0<t<20<t<20<t<2, the following assertions all hold, with the notation specified here. Matrices acting on two coordinates are complex 2×22\times22×2 matrices, with coordinates ordered as false, true; †\dagger† denotes conjugate transpose. Put

P0=(0110),P1=(0−ii0),P2=(100−1),H=12(111−1),S=(100i),\begin{gathered} P_0=\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad P_1=\begin{pmatrix}0&-\mathrm i\\ \mathrm i&0\end{pmatrix},\qquad P_2=\begin{pmatrix}1&0\\0&-1\end{pmatrix},\\ H=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix},\qquad S=\begin{pmatrix}1&0\\0&\mathrm i\end{pmatrix}, \end{gathered}P0​=(01​10​),P1​=(0i​−i0​),P2​=(10​0−1​),H=2​1​(11​1−1​),S=(10​0i​),​

define the indexed matrices by

(C0,…,C23)=(I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3),\begin{aligned} (C_0,\ldots,C_{23})=\big(&I,H,HS^2H,S^2,S,S^3,HS^2,S^2H,SH,S^3H,\\ &S^2HS^2H,SHS^2H,S^3HS^2H,HS,HS^3,S^2HS^2,SHS^2,S^3HS^2,\\ &HSH,HS^3H,HSHS^2H,HS^3HS^2H,S^3HS,SHS^3\big), \end{aligned}(C0​,…,C23​)=(​I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3),​

and write

Σ={v∈R3:v02+v12+v22=1},Ft(v)=t2I+i1−t24∑j=02vjPj,(Rg)ij=12Re⁡tr⁡(PiCgPjCg†),D={v∈Σ:0≤v1, v1≤v0, v1≤v2},D∘={v∈Σ:0<v1, v1<v0, v1<v2},A={±e0,±e1,±e2},W={e0,e2,(13,13,13)},O={R∈R3×3:RTR=I, det⁡R=1, {Rv:v∈A}=A},\begin{gathered} \Sigma=\{v\in\mathbb R^3:v_0^2+v_1^2+v_2^2=1\},\\ F_t(v)=\frac t2 I+\mathrm i\sqrt{1-\frac{t^2}{4}}\sum_{j=0}^2v_jP_j,\qquad (R_g)_{ij}=\frac12\operatorname{Re}\operatorname{tr}(P_iC_gP_jC_g^\dagger),\\ D=\{v\in\Sigma:0\le v_1,\ v_1\le v_0,\ v_1\le v_2\},\qquad D^\circ=\{v\in\Sigma:0<v_1,\ v_1<v_0,\ v_1<v_2\},\\ A=\{\pm e_0,\pm e_1,\pm e_2\},\qquad W=\left\{e_0,e_2,\left(\frac1{\sqrt3},\frac1{\sqrt3},\frac1{\sqrt3}\right)\right\},\\ \mathcal O=\{R\in\mathbb R^{3\times3}:R^{\mathsf T}R=I,\ \det R=1,\ \{Rv:v\in A\}=A\}, \end{gathered}Σ={v∈R3:v02​+v12​+v22​=1},Ft​(v)=2t​I+i1−4t2​​j=0∑2​vj​Pj​,(Rg​)ij​=21​Retr(Pi​Cg​Pj​Cg†​),D={v∈Σ:0≤v1​, v1​≤v0​, v1​≤v2​},D∘={v∈Σ:0<v1​, v1​<v0​, v1​<v2​},A={±e0​,±e1​,±e2​},W={e0​,e2​,(3​1​,3​1​,3​1​)},O={R∈R3×3:RTR=I, detR=1, {Rv:v∈A}=A},​

where eje_jej​ is the jjjth coordinate vector and RgD={Rgv:v∈D}R_gD=\{R_gv:v\in D\}Rg​D={Rg​v:v∈D}, with the same image notation for D∘D^\circD∘. The assertions are: (1) for every unitary complex 2×22\times22×2 matrix UUU with ∣tr⁡U∣=t|\operatorname{tr}U|=t∣trU∣=t, there exists exactly one complex 2×22\times22×2 matrix VVV that is unitary, has det⁡V=1\det V=1detV=1 and tr⁡V=t\operatorname{tr}V=ttrV=t, and satisfies U=zVU=zVU=zV for some complex number zzz with ∣z∣=1|z|=1∣z∣=1; (2) for every v∈Σv\in\Sigmav∈Σ, the matrix Ft(v)F_t(v)Ft​(v) is unitary, has determinant 111, and has trace ttt; (3) for every unitary complex 2×22\times22×2 matrix UUU with determinant 111 and trace ttt, there exists exactly one vector v∈R3v\in\mathbb R^3v∈R3 satisfying both v∈Σv\in\Sigmav∈Σ and Ft(v)=UF_t(v)=UFt​(v)=U; (4) for every g∈{0,…,23}g\in\{0,\ldots,23\}g∈{0,…,23} and v∈Σv\in\Sigmav∈Σ, one has Rgv∈ΣR_gv\in\SigmaRg​v∈Σ and Ft(Rgv)=CgFt(v)Cg†F_t(R_gv)=C_gF_t(v)C_g^\daggerFt​(Rg​v)=Cg​Ft​(v)Cg†​; (5) for any g,h∈{0,…,23}g,h\in\{0,\ldots,23\}g,h∈{0,…,23}, if Rgv=RhvR_gv=R_hvRg​v=Rh​v for every v∈Σv\in\Sigmav∈Σ, then g=hg=hg=h; (6) {Rg:g∈{0,…,23}}=O\{R_g:g\in\{0,\ldots,23\}\}=\mathcal O{Rg​:g∈{0,…,23}}=O; (7) O\mathcal OO has exactly 242424 elements; (8) ⋃g=023RgD=Σ\bigcup_{g=0}^{23}R_gD=\Sigma⋃g=023​Rg​D=Σ; (9) for all distinct g,h∈{0,…,23}g,h\in\{0,\ldots,23\}g,h∈{0,…,23}, the sets RgD∘R_gD^\circRg​D∘ and RhD∘R_hD^\circRh​D∘ are disjoint; (10) the set of distinct sets {RgD:g∈{0,…,23}}\{R_gD:g\in\{0,\ldots,23\}\}{Rg​D:g∈{0,…,23}} has exactly 242424 elements; and (11) the set {Rgw:g∈{0,…,23}, w∈W}\{R_gw:g\in\{0,\ldots,23\},\ w\in W\}{Rg​w:g∈{0,…,23}, w∈W} has exactly 141414 elements.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me