Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Values of integer cyclotomic polynomials at both signs

Open
QAlgorithms.Papers.Independent.Intakenext100.P03.cyclotomic_values_at_signs

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

prove2quantum

Let Φd∈Z[X]\Phi_d\in\mathbb Z[X]Φd​∈Z[X] be the monic dddth cyclotomic polynomial. Then

d≥3, d∉{2j:j∈N}⟹Φd(1),Φd(−1) are odd,k≥2⟹Φ2k(1)=Φ2k(−1)=2.\begin{aligned} d\ge3,\ d\notin\{2^j:j\in\mathbb N\}&\Longrightarrow\Phi_d(1),\Phi_d(-1)\text{ are odd},\\ k\ge2&\Longrightarrow\Phi_{2^k}(1)=\Phi_{2^k}(-1)=2. \end{aligned}d≥3, d∈/{2j:j∈N}k≥2​⟹Φd​(1),Φd​(−1) are odd,⟹Φ2k​(1)=Φ2k​(−1)=2.​

This result is independent of the gate parameter nnn. It provides the parity input for the normalized-numerator argument.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P03
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P03

open scoped BigOperators Classical

-- Reuse the Mathlib matrix type without declaring a second Mat.

local notation "Mat" => Matrix Bool Bool ℂ

/-- Canonical data: the axis/exponent list and the actual residual matrix D,
not a nonunique phase/Clifford witness pair, PDF pp.6-7. -/
local notation "CanonicalData" => List (Fin 3 × ℕ) × Matrix Bool Bool ℂ

/-- Theorem 6.2, PDF pp.15-16. The cyclotomic variable is independent of
the gate parameter; both signs and both regimes appear in this one statement. -/
theorem cyclotomic_values_at_signs :
    (∀ d : ℕ, 3 ≤ d → ¬ IsTwoPower d →
      Odd ((Polynomial.cyclotomic d ℤ).eval 1) ∧
      Odd ((Polynomial.cyclotomic d ℤ).eval (-1))) ∧
    (∀ k : ℕ, 2 ≤ k →
      (Polynomial.cyclotomic (2 ^ k) ℤ).eval 1 = 2 ∧
      (Polynomial.cyclotomic (2 ^ k) ℤ).eval (-1) = 2) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P03

end
Source
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets, arXiv:1501.04944v2, PDF p. 15, Theorem 6.2
Read-back

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

Writing Φd(X)∈Z[X]\Phi_d(X)\in\mathbb Z[X]Φd​(X)∈Z[X] for the ddd-th cyclotomic polynomial, both of the following hold: for every natural number d≥3d\ge3d≥3 that is not 2j2^j2j for any natural number jjj, the integers Φd(1)\Phi_d(1)Φd​(1) and Φd(−1)\Phi_d(-1)Φd​(−1) are odd; and for every natural number k≥2k\ge2k≥2,

Φ2k(1)=2andΦ2k(−1)=2.\Phi_{2^k}(1)=2 \qquad\text{and}\qquad \Phi_{2^k}(-1)=2.Φ2k​(1)=2andΦ2k​(−1)=2.

Here being a power of two includes 20=12^0=120=1, although the first assertion already restricts d≥3d\ge3d≥3.

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