Opposite parities of the primitive quadratic forms
ProvedQAlgorithms.Papers.Independent.Support21.P13.primitive_forms_opposite_parityprove2quantum
Let and . Define and . If the dividing exponent of is zero, then
This classifies the parity of the two quadratic forms for primitive cyclotomic numerators.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support21_P13
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Support21.P13
open scoped Classical
/-- Proposition 3, PDF p.20: P and Q have opposite parity in the primitive case. -/
theorem primitive_forms_opposite_parity (a : Fin 4 → ℤ)
(hprimitive : gde (coordinateValue a) = 0) :
(Even (formP a) ∧ Odd (formQ a)) ∨
(Odd (formP a) ∧ Even (formQ a)) := by sorry
end QAlgorithms.Papers.Independent.Support21.P13
end
Source
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates, arXiv:1206.5236v4, PDF p. 20, Proposition 3: opposite parity of P and Q
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let be the smallest subring of containing , and put . For , let be the supremum in of the natural exponents for which for some ; set when , and also when these exponents are unbounded. For every four integers , define , , and . If , then either is even and is odd, or is odd and is even.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.