Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The degenerate rank-two contraction ideal and its center action

Open
QAlgorithms.Papers.Independent.Intakenext100.P34.remark4_3

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

prove2quantum

Let CCC be a commutative unital ring in which 222 is invertible, let ϵ∈{1,−1}\epsilon\in\{1,-1\}ϵ∈{1,−1}, and fix scalars z0(ℓ)∈Cz_0^{(\ell)}\in Cz0(ℓ)​∈C for all ℓ≥0\ell\ge0ℓ≥0. Write Wk\mathcal W_kWk​ for the actual quotient defined by (2.1)–(2.5) and (2.21)–(2.24), and z0(u)=∑ℓ≥0z0(ℓ)u−ℓz_0(u)=\sum_{\ell\ge0}z_0^{(\ell)}u^{-\ell}z0​(u)=∑ℓ≥0​z0(ℓ)​u−ℓ.

For the center statements, specialize κ0,κ1\kappa_0,\kappa_1κ0​,κ1​ to scalars and assume the identity

(z0(−u)−12−ϵu)(z0(u)−12+ϵu)=(12−ϵu)(12+ϵu).(z_0(-u)-\tfrac12-\epsilon u)(z_0(u)-\tfrac12+\epsilon u)=(\tfrac12-\epsilon u)(\tfrac12+\epsilon u).(z0​(−u)−21​−ϵu)(z0​(u)−21​+ϵu)=(21​−ϵu)(21​+ϵu).

Assume also C≠0C\ne0C=0 and work at level two. Then

W2e1=C[y1]e1,{y1ne1:n≥0} is linearly independent over C.\mathcal W_2e_1=C[y_1]e_1,\qquad \{y_1^ne_1:n\ge0\}\text{ is linearly independent over }C.W2​e1​=C[y1​]e1​,{y1n​e1​:n≥0} is linearly independent over C.

Every central element acts on this entire left ideal as multiplication by a scalar in CCC, and

W2 is not a finitely generated Z(W2)-module.\mathcal W_2\text{ is not a finitely generated }Z(\mathcal W_2)\text{-module}.W2​ is not a finitely generated Z(W2​)-module.

The ideal equality together with independence gives the exhibited infinite free CCC-basis. This is the ring-valued meaning of the source's infinite-dimensional assertion.

The unquantified parenthetical generic-irreducibility claim is recorded separately as a source-ambiguity gap; it is not a hypothesis or an asserted conclusion here.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P34
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P34

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

noncomputable section

universe u

variable (C : Type u) [CommRing C]

/-- Remark 4.3, PDF p.22: the ideal, its free indexed family, scalar
center action, and failure of finite generation over the center.
The unpinned generic-irreducibility parenthetical is documented in the audit. -/
theorem remark4_3 [Nontrivial C] (P : DParams C)
    (hscalar : P.scalarKappa.isSome) (hadm : DAdmissible C P) :
    let j : Adj 2 := ⟨0, by decide⟩
    let e := dwMap C P 2 (de C j)
    let y := dwMap C P 2 (dy C (adjacentLeft j))
    leftMultiples e = {a | ∃ p : Polynomial C,
      a = Polynomial.eval₂ (algebraMap C (DW C P 2)) y p * e} ∧
    LinearIndependent C (fun n : ℕ => y^n*e) ∧
    (∀ c : DW C P 2, Central c → ∃ s : C,
      ∀ a ∈ leftMultiples e, c*a = algebraMap C (DW C P 2) s*a) ∧
    ¬ Module.Finite (Subalgebra.center C (DW C P 2)) (DW C P 2) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P34
Source
Affine and degenerate affine BMW algebras: The center, arXiv:1105.4207v2, PDF p. 22, Remark 4.3
Read-back

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

Let CCC be a nontrivial commutative ring, and let PPP consist of a unit u∈C×u\in C^\timesu∈C× with u=2u=2u=2, a scalar ε∈{1,−1}\varepsilon\in\{1,-1\}ε∈{1,−1}, moments μ:N→C\mu:\mathbb N\to Cμ:N→C, and an optional scalar pair that is present, say (α,β)(\alpha,\beta)(α,β). Put h=u−1h=u^{-1}h=u−1, Z(t)=∑n≥0μntnZ(t)=\sum_{n\ge0}\mu_nt^nZ(t)=∑n≥0​μn​tn, and Z−(t)=∑n≥0(−1)nμntnZ_-(t)=\sum_{n\ge0}(-1)^n\mu_nt^nZ−​(t)=∑n≥0​(−1)nμn​tn, and assume

(tZ−−ht−ε)(tZ−ht+ε)=(ht−ε)(ht+ε).(tZ_--ht-\varepsilon)(tZ-ht+\varepsilon) =(ht-\varepsilon)(ht+\varepsilon).(tZ−​−ht−ε)(tZ−ht+ε)=(ht−ε)(ht+ε).

Here the two-strand quotient algebra WWW can be presented as the unital associative CCC-algebra generated by T,y0,y1T,y_0,y_1T,y0​,y1​, with T2=1T^2=1T2=1, y0y1=y1y0y_0y_1=y_1y_0y0​y1​=y1​y0​, and T(y0+y1)=(y0+y1)TT(y_0+y_1)=(y_0+y_1)TT(y0​+y1​)=(y0​+y1​)T, together with the relations, on setting e=1+Ty0−y1Te=1+Ty_0-y_1Te=1+Ty0​−y1​T,

eT=Te=εe,ey0ne=μne(n∈N),e(y0+y1)=(y0+y1)e=0;eT=Te=\varepsilon e,\qquad ey_0^ne=\mu_ne\quad(n\in\mathbb N),\qquad e(y_0+y_1)=(y_0+y_1)e=0;eT=Te=εe,ey0n​e=μn​e(n∈N),e(y0​+y1​)=(y0​+y1​)e=0;

the two additional kappa generators in the quotient are fixed to the scalars α,β\alpha,\betaα,β. Put y=y0y=y_0y=y0​ and L={be:b∈W}L=\{be:b\in W\}L={be:b∈W}. Then all four assertions hold:

L={p(y)e:p∈C[X]};L=\{p(y)e:p\in C[X]\};L={p(y)e:p∈C[X]};

the family (yne)n∈N(y^ne)_{n\in\mathbb N}(yne)n∈N​, including eee at n=0n=0n=0, is linearly independent over CCC; for every c∈Wc\in Wc∈W that commutes with every element of WWW, there exists s∈Cs\in Cs∈C such that ca=ι(s)aca=\iota(s)aca=ι(s)a for every a∈La\in La∈L, where ι:C→W\iota:C\to Wι:C→W is the scalar map; and WWW, with the action of its center given by multiplication, is not a finitely generated module over that center. In the first equality, p(y)p(y)p(y) is ordinary polynomial evaluation using ι\iotaι.

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