Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, cyclic degenerate subgroup example

Proved
QAlgorithms.Papers.Independent.Bridge50.P05.primitiveCyclic

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

prove2quantum

Let d≥1d\ge1d≥1, H=CZdH=\mathbb C^{\mathbb Z_d}H=CZd​, and Z=Zd×ZdZ=\mathbb Z_d\times\mathbb Z_dZ=Zd​×Zd​. In the specified orthonormal basis let W(x,y)=UxVyW_{(x,y)}=U^xV^yW(x,y)​=UxVy, where Uek=ek+1Ue_k=e_{k+1}Uek​=ek+1​ and Vek=e2πik/dekVe_k=e^{2\pi i k/d}e_kVek​=e2πik/dek​. Write fX(z)=Tr⁡(XWz∗)/df_X(z)=\operatorname{Tr}(XW_z^*)/dfX​(z)=Tr(XWz∗​)/d. All spaces are finite dimensional. The norm ∥X∥2=Tr⁡(X∗X)\|X\|_2=\sqrt{\operatorname{Tr}(X^*X)}∥X∥2​=Tr(X∗X)​ is the Hilbert–Schmidt norm, and ν2(Φ)=sup⁡ρ≥0,Tr⁡ρ=1∥Φ(ρ)∥2\nu_2(\Phi)=\sup_{\rho\ge0,\operatorname{Tr}\rho=1}\|\Phi(\rho)\|_2ν2​(Φ)=supρ≥0,Trρ=1​∥Φ(ρ)∥2​ is the maximal output norm. A map in W1(H)W_1(H)W1​(H) is complex linear, Weyl covariant and satisfies Φ(I)=I\Phi(I)=IΦ(I)=I; it need not be positive or completely positive. Its computed symbol is ϕ(z)=fΦ(Wz)(z)\phi(z)=f_{\Phi(W_z)}(z)ϕ(z)=fΦ(Wz​)​(z). Put m(ϕ)=max⁡z≠0∣ϕ(z)∣2m(\phi)=\max_{z\ne0}|\phi(z)|^2m(ϕ)=maxz=0​∣ϕ(z)∣2 and Emax⁡(ϕ)={z≠0:∣ϕ(z)∣2=m(ϕ)}E_{\max}(\phi)=\{z\ne0:|\phi(z)|^2=m(\phi)\}Emax​(ϕ)={z=0:∣ϕ(z)∣2=m(ϕ)}. At d=1d=1d=1, explicitly set m=0m=0m=0 and Emax⁡=∅E_{\max}=\varnothingEmax​=∅. Write S(ϕ)=d−1/21+(d−1)m(ϕ)S(\phi)=d^{-1/2}\sqrt{1+(d-1)m(\phi)}S(ϕ)=d−1/21+(d−1)m(ϕ)​.

The alternating pairing is [u,v]=uxvy−uyvx∈Zd[u,v]=u_xv_y-u_yv_x\in\mathbb Z_d[u,v]=ux​vy​−uy​vx​∈Zd​. A subset is degenerate when this pairing vanishes for every pair of its elements. A maximal degenerate subgroup is inclusion maximal among degenerate subsets. For a unit vector ψ\psiψ, define Gψ={z:∃c∈C, Wzψ=cψ}G_\psi=\{z:\exists c\in\mathbb C,\ W_z\psi=c\psi\}Gψ​={z:∃c∈C, Wz​ψ=cψ}. Let G(z)G(z)G(z) be the additive subgroup generated by zzz.

For every z=(α,β)z=(\alpha,\beta)z=(α,β), G(z)G(z)G(z) is degenerate. With residues represented in {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1},

gcd⁡(gcd⁡(α,β),d)=1 ⟹ ∣G(z)∣=d.\gcd(\gcd(\alpha,\beta),d)=1\ \Longrightarrow\ |G(z)|=d.gcd(gcd(α,β),d)=1 ⟹ ∣G(z)∣=d.

In particular, for prime ddd, every nonzero zzz generates a subgroup of order ddd. The nonzero guard in the prime specialization is required: the zero label generates only the identity subgroup. This supplies explicit maximal cyclic examples.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P05
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Bridge50.P05

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Information100.P34 (cyclicPhase weyl dephasing)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Gap48.P36 (WeylLabel)

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)

open QAlgorithms.Papers.Independent.Claimed50.P48
  (nu superopTensor UniversalMultiplicative rowKraus indexedKrausDilation)

open QAlgorithms.Papers.Independent.Information100.P67 (complementaryChannel)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {d : ℕ} [NeZero d]

/-- Section 2, PDF p.7: cyclic degeneracy, primitive-generator order, and the
prime-dimension specialization with the necessary nonzero-generator guard. -/
theorem primitiveCyclic {d : ℕ} [NeZero d] (z : WeylLabel d) :
    Degenerate (AddSubgroup.zmultiples z : Set (WeylLabel d)) ∧
    (Nat.gcd (Nat.gcd z.1.val z.2.val) d = 1 →
      (AddSubgroup.zmultiples z : Set (WeylLabel d)).ncard = d) ∧
    (Nat.Prime d → z ≠ 0 → (AddSubgroup.zmultiples z : Set (WeylLabel d)).ncard = d) := by sorry

end QAlgorithms.Papers.Independent.Bridge50.P05

end
Source
On Weyl-covariant channels, arXiv:quant-ph/0510148v3, PDF p. 7, §2, cyclic degenerate subgroup example
Read-back

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

For every nonzero natural number ddd and every z=(z1,z2)∈(Z/dZ)2z=(z_1,z_2)\in(\mathbb Z/d\mathbb Z)^2z=(z1​,z2​)∈(Z/dZ)2, let H={nz:n∈Z}H=\{nz:n\in\mathbb Z\}H={nz:n∈Z} be the additive subgroup generated by zzz. Then u1v2−u2v1=0u_1v_2-u_2v_1=0u1​v2​−u2​v1​=0 in Z/dZ\mathbb Z/d\mathbb ZZ/dZ for every u,v∈Hu,v\in Hu,v∈H. Moreover, if gcd⁡(gcd⁡(z1val,z2val),d)=1\gcd(\gcd(z_1^{\mathrm{val}},z_2^{\mathrm{val}}),d)=1gcd(gcd(z1val​,z2val​),d)=1, where the superscript denotes the representative in {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}, then HHH has exactly ddd elements; and if ddd is prime and z≠0z\ne0z=0, then HHH has exactly ddd elements. The first assertion includes z=0z=0z=0; the statement also includes d=1d=1d=1, when H={0}H=\{0\}H={0} has one element.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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