Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 3: conjugation and squared-norm coefficient formulas

Open
QAlgorithms.Papers.Independent.Intakethird100.P85.conjugation_norm_formulas

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let a,b,c,da,b,c,da,b,c,d be dyadic real numbers, put ω=eiπ/4\omega=e^{i\pi/4}ω=eiπ/4, and set t=aω3+bω2+cω+dt=a\omega^3+b\omega^2+c\omega+dt=aω3+bω2+cω+d. Then

t†=−cω3−bω2−aω+d,t^\dagger=-c\omega^3-b\omega^2-a\omega+d,t†=−cω3−bω2−aω+d, ∣t∣2=t†t=(a2+b2+c2+d2)+(cd+bc+ab−da)2.|t|^2=t^\dagger t=(a^2+b^2+c^2+d^2)+(cd+bc+ab-da)\sqrt2.∣t∣2=t†t=(a2+b2+c2+d2)+(cd+bc+ab−da)2​.

The equality with t†tt^\dagger tt†t views the real squared norm inside C\mathbb CC. The coefficient formula identifies the dyadic part of the squared norm and underlies the weight identity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P85
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P85

open scoped Classical BigOperators

open QAlgorithms

open QAlgorithms.Papers.Independent.Gap48.P10
  (InZomega InDomega Residue bits residue residueMultiply Reducible)

open QAlgorithms.Papers.Independent.Support21.P13
  (synthesisRing integralRing coordinateValue HTLetter htWordMatrix EntriesInRing cliffordTLibrary)

local notation "omega" => QAlgorithms.gateT true true

local notation "sqrtTwo" => ((Real.sqrt 2 : ℝ) : ℂ)

/-- Remark 3, equations (2),(3), PDF p.2: conjugation and both squared-norm identities. -/
theorem conjugation_norm_formulas (a : DyadicCoordinates) :
    star (dyadicValue a.val) =
      -(a.val 2 : ℂ) * omega ^ 3 - (a.val 1 : ℂ) * omega ^ 2 -
        (a.val 0 : ℂ) * omega + (a.val 3 : ℂ) ∧
    (Complex.normSq (dyadicValue a.val) : ℂ) =
      star (dyadicValue a.val) * dyadicValue a.val ∧
    Complex.normSq (dyadicValue a.val) =
      coordinateWeight a.val +
        (a.val 2 * a.val 3 + a.val 1 * a.val 2 + a.val 0 * a.val 1 - a.val 3 * a.val 0) *
          Real.sqrt 2 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P85

end
Source
Exact synthesis of multiqubit Clifford+T circuits, arXiv:1212.0506v3, PDF p. 2, Remark 3: conjugation and squared-norm coefficient formulas
Read-back

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

For every four-tuple a=(a0,a1,a2,a3)a=(a_0,a_1,a_2,a_3)a=(a0​,a1​,a2​,a3​) of real dyadic numbers, meaning that for each j∈{0,1,2,3}j\in\{0,1,2,3\}j∈{0,1,2,3} there exist zj∈Zz_j\in\mathbb Zzj​∈Z and kj∈Nk_j\in\mathbb Nkj​∈N with aj=zj/2kja_j=z_j/2^{k_j}aj​=zj​/2kj​, put ω=eiπ/4\omega=e^{i\pi/4}ω=eiπ/4 and v=a0ω3+a1ω2+a2ω+a3v=a_0\omega^3+a_1\omega^2+a_2\omega+a_3v=a0​ω3+a1​ω2+a2​ω+a3​. Then all three identities hold:

v‾=−a2ω3−a1ω2−a0ω+a3,(∣v∣2:C)=v‾ v,∣v∣2=∑j=03aj2+(a2a3+a1a2+a0a1−a3a0)2.\overline v=-a_2\omega^3-a_1\omega^2-a_0\omega+a_3, \qquad (|v|^2:\mathbb C)=\overline v\,v, \qquad |v|^2=\sum_{j=0}^3a_j^2+ (a_2a_3+a_1a_2+a_0a_1-a_3a_0)\sqrt2.v=−a2​ω3−a1​ω2−a0​ω+a3​,(∣v∣2:C)=vv,∣v∣2=j=0∑3​aj2​+(a2​a3​+a1​a2​+a0​a1​−a3​a0​)2​.

No normalization or nonzero hypothesis is imposed on the coordinates.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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