Canonical degenerate compression elements and their recursions
OpenQAlgorithms.Papers.Independent.Intakenext100.P34.theorem3_2Let be a commutative unital ring in which is invertible, let , and fix scalars for all . Write for the actual quotient defined by (2.1)–(2.5) and (2.21)–(2.24), and .
There is a compatible choice of polynomial representatives (), starting at the supplied scalars , such that these representatives are central and
The representatives are the coefficients of the explicit polynomial-valued series
For every , in level ,
In level ,
For , in level ,
Every representative is evaluated at a larger level using its explicit polynomial in the initial variables. No injectivity of a tower map or uniqueness of a compression representative is assumed. The level-zero representatives are scalars.
This gives central compression elements and all three source identities even for nonadmissible parameters.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P34
namespace QAlgorithms.Papers.Independent.Intakenext100.P34
open QAlgorithms.Papers.Independent.Support21.P08 (Central)
noncomputable section
universe u
variable (C : Type u) [CommRing C]
/-- Theorem 3.2, PDF pp.13--14. Existence is witnessed by the explicitly
constructed coefficient polynomials; centrality, compression and all three
identities remain conclusions, with no admissibility assumption. In (3.9)
the two printed e_(i+1) are corrected to e_k, as forced by iteration of (3.8). -/
theorem theorem3_2 (P : DParams C) :
(∀ (n ell : ℕ), 0 < n → Central (dMomentAt C P n n ell (le_refl n))) ∧
(∀ (n ell : ℕ),
let j : Adj (n+2) := ⟨n, by omega⟩
let m := dwMap C P (n+2)
m (de C j)*m (dy C (adjacentLeft j))^ell*m (de C j) =
dMomentAt C P n (n+2) ell (by omega)*m (de C j)) ∧
(∀ n : ℕ,
let j : Adj (n+2) := ⟨n, by omega⟩
let e := ps (dwMap C P (n+2) (de C j))
let half := ps (algebraMap C (DW C P (n+2)) (↑P.two⁻¹ : C))
let eps := ps (algebraMap C (DW C P (n+2)) P.epsilon)
let t : PowerSeries (DW C P (n+2)) := PowerSeries.X
(t*dMomentSeries C P n (n+2) (by omega) true-half*t-eps)*
(t*dMomentSeries C P n (n+2) (by omega) false-half*t+eps)*e =
(half*t-eps)*(half*t+eps)*e) ∧
(∀ n : ℕ,
let j : Adj (n+3) := ⟨n+1, by omega⟩
let y : Fin (n+3) := ⟨n, by omega⟩
let e := ps (dwMap C P (n+3) (de C j))
let half := ps (algebraMap C (DW C P (n+3)) (↑P.two⁻¹ : C))
let eps := ps (algebraMap C (DW C P (n+3)) P.epsilon)
let t : PowerSeries (DW C P (n+3)) := PowerSeries.X
(t*dMomentSeries C P (n+1) (n+3) (by omega)+eps-half*t)*e =
(t*dMomentSeries C P n (n+3) (by omega)+eps-half*t)*
dRatio (dwMap C P (n+3) (dy C y))*e) ∧
(∀ (k : ℕ) (hk : 0 < k),
let j : Adj (k+1) := ⟨k-1, by omega⟩
let e := ps (dwMap C P (k+1) (de C j))
let half := ps (algebraMap C (DW C P (k+1)) (↑P.two⁻¹ : C))
let eps := ps (algebraMap C (DW C P (k+1)) P.epsilon)
let t : PowerSeries (DW C P (k+1)) := PowerSeries.X
(t*dMomentSeries C P (k-1) (k+1) (by omega)+eps-half*t)*e =
(t*dMomentSeries C P 0 (k+1) (by omega)+eps-half*t)*
dRatioProduct (fun a : Fin (k-1) => dwMap C P (k+1)
(dy C (⟨a.val, by have := a.isLt; omega⟩ : Fin (k+1))))*e) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P34
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a commutative ring, and let consist of a unit with value , an element , a sequence , and an optional pair ; put . For every , let be the associative unital -algebra generated by permutation symbols for , by , and by for . Set , , , and . Its relations, for existing indices, are
and, if , also , with neither scalar relation imposed when . For an element of any of these algebras or of a polynomial ring, define
using constant series for coefficients and the formal inverse of the denominator, whose constant coefficient is . In , set
where . For , define by evaluating as , with factors in increasing index order, and put
The theorem asserts the conjunction of the following five statements, with , and each interpreted as constant series whenever needed: for every and every , commutes with every element of ; for every , the identity
holds in ; for every , the identity
holds in ; for every , the identity
holds in ; and for every , the identity
holds in . All displayed products retain their written order. Empty products are , so as a constant polynomial, the second through fourth assertions include , and the final product is empty when . Beyond the conditions built into , the theorem assumes neither a scalar pair nor an additional identity for the moment series.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.