§2, cyclic degenerate subgroup example
ProvedQAlgorithms.Papers.Independent.Bridge50.P05.primitiveCyclicLet , , and . In the specified orthonormal basis let , where and . Write . All spaces are finite dimensional. The norm is the Hilbert–Schmidt norm, and is the maximal output norm. A map in is complex linear, Weyl covariant and satisfies ; it need not be positive or completely positive. Its computed symbol is . Put and . At , explicitly set and . Write .
The alternating pairing is . 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 , define . Let be the additive subgroup generated by .
For every , is degenerate. With residues represented in ,
In particular, for prime , every nonzero generates a subgroup of order . The nonzero guard in the prime specialization is required: the zero label generates only the identity subgroup. This supplies explicit maximal cyclic examples.
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P05
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonzero natural number and every , let be the additive subgroup generated by . Then in for every . Moreover, if , where the superscript denotes the representative in , then has exactly elements; and if is prime and , then has exactly elements. The first assertion includes ; the statement also includes , when has one element.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.