Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generating-series criterion for root admissibility

Proved
QAlgorithms.Papers.Independent.Intake100.P65.rootAdmissibleSeries

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

prove2quantum

Let RRR be a commutative unital ring with 222 invertible, r≥1r\ge1r≥1, u∈Rru\in R^ru∈Rr, and O(z)=∑a≥0ωazaO(z)=\sum_{a\ge0}\omega_a z^aO(z)=∑a≥0​ωa​za. Then Ω\OmegaΩ is uuu-admissible if and only if, in R[[z]]R[[z]]R[[z]],

(zO(z)+1−z/2)∏i=1r(1−uiz)=(1−(−1)rz/2)∏i=1r(1+uiz).(zO(z)+1-z/2)\prod_{i=1}^r(1-u_i z)=(1-(-1)^rz/2)\prod_{i=1}^r(1+u_i z).(zO(z)+1−z/2)i=1∏r​(1−ui​z)=(1−(−1)rz/2)i=1∏r​(1+ui​z).

This is the formal identity of Lemma 3.8 at infinity with its unit power-series denominators cleared. It allows coincident and zero roots.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P65
Formal statement
noncomputable section

open scoped BigOperators TensorProduct

open QAlgorithms.Papers.Independent.Renew46.P16

open QAlgorithms.Papers.Independent.Support21.P08 (IrreducibleRepresentation)

open QAlgorithms.Papers.Independent.Support21.P12

open QAlgorithms.Papers.Independent.Support21.P14 (BrauerPairing oddPairingCount)

namespace QAlgorithms.Papers.Independent.Intake100.P65

universe u v

/-- Lemma 3.8, PDF p.16, with unit formal denominators cleared after z=y^{-1}.
Repeated roots and zero roots are permitted. -/
theorem rootAdmissibleSeries (R : Type u) [CommRing R] [Invertible (2 : R)]
    (omega : ℕ → R) (r : ℕ) (hr : 1 ≤ r) (roots : Fin r → R) :
    RootAdmissible omega roots ↔
      (PowerSeries.X * PowerSeries.mk omega + 1 -
        PowerSeries.C (⅟ (2 : R)) * PowerSeries.X) *
          (∏ i : Fin r, (1 - PowerSeries.C (roots i) * PowerSeries.X)) =
      (1 - PowerSeries.C (⅟ (2 : R) * (-1 : R)^r) * PowerSeries.X) *
        (∏ i : Fin r, (1 + PowerSeries.C (roots i) * PowerSeries.X)) := by sorry

end QAlgorithms.Papers.Independent.Intake100.P65

end
Source
Cyclotomic Nazarov-Wenzl algebras, arXiv:math/0506467v5, PDF p. 16, Lemma 3.8
Read-back

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

Let RRR be any commutative ring in which 222 is invertible, let ω:N→R\omega:\mathbb N\to Rω:N→R, let r≥1r\geq1r≥1, and let u0,…,ur−1∈Ru_0,\ldots,u_{r-1}\in Ru0​,…,ur−1​∈R. Define Qr,b∈Z[Z0,…,Zr−1]Q_{r,b}\in\mathbb Z[Z_0,\ldots,Z_{r-1}]Qr,b​∈Z[Z0​,…,Zr−1​] as the coefficient of TbT^bTb in ∏i<r(1+2∑m≥1ZimTm)\prod_{i<r}(1+2\sum_{m\geq1}Z_i^mT^m)∏i<r​(1+2∑m≥1​Zim​Tm), and define Ur,bU_{r,b}Ur,b​ by applying coefficientwise integer division by 222, rounded down, to

2Qr,b+1+(−1)r−1Qr,b+{1,b=0,0,b≠0.2Q_{r,b+1}+(-1)^{r-1}Q_{r,b} +\begin{cases}1,&b=0,\\0,&b\neq0.\end{cases}2Qr,b+1​+(−1)r−1Qr,b​+{1,0,​b=0,b=0.​

Then ωb=Ur,b(u0,…,ur−1)\omega_b=U_{r,b}(u_0,\ldots,u_{r-1})ωb​=Ur,b​(u0​,…,ur−1​) for every b∈Nb\in\mathbb Nb∈N, where integer coefficients are mapped canonically to RRR, if and only if the following equality holds in R[[T]]R[[T]]R[[T]]:

(T∑b≥0ωbTb+1−12T)∏i=0r−1(1−uiT)=(1−12(−1)rT)∏i=0r−1(1+uiT).\left(T\sum_{b\geq0}\omega_bT^b+1-\frac12T\right) \prod_{i=0}^{r-1}(1-u_iT) = \left(1-\frac12(-1)^rT\right) \prod_{i=0}^{r-1}(1+u_iT).(Tb≥0∑​ωb​Tb+1−21​T)i=0∏r−1​(1−ui​T)=(1−21​(−1)rT)i=0∏r−1​(1+ui​T).

Here 12\frac1221​ denotes the specified inverse of 222. The statement allows repeated roots, zero roots, rings with zero divisors, and the zero ring.

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

    Confirmed by the moderator at approval.

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