Odd loop-parameter relation with the contraction factor
ProvedQAlgorithms.Papers.Independent.Intake100.P65.oddCompressionLet be a commutative unital ring with invertible, let , and let be any scalar sequence. For every , in ,
This records the restriction forced by the unwrapping relations without cancelling a possibly torsion contraction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P65
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
/-- Corollary 2.4, PDF p.5. The E_1 factor is retained over rings with torsion;
there is no scalar admissibility assumption or cancellation. -/
theorem oddCompression (R : Type u) [CommRing R] [Invertible (2 : R)]
(omega : ℕ → R) (n : ℕ) (hn : 2 ≤ n) (a : ℕ) :
omega (2*a+1) • affineE R omega n 0 =
(⅟ (2 : R) * (-omega (2*a) +
∑ b ∈ Finset.range (2*a+1), (-1 : R)^b * omega b * omega (2*a-b))) •
affineE R omega n 0 := by sorry
end QAlgorithms.Papers.Independent.Intake100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every commutative ring equipped with an inverse of , sequence , integer , and integer , let be the quotient of the free associative unital -algebra on for and for , by
Every index lies in its generator range, and adjacent relations require . Then the following equality of scalar multiples holds in :
This includes , giving . There is no assumption that is nonzero or that scalar multiplication on is injective.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.