Formal generating-series characterization of admissibility
ProvedQAlgorithms.Papers.Independent.Intake100.P65.admissibleSeriesprove2quantum
Let be a commutative unital ring with invertible and . Put . Then is admissible in Definition 2.10 if and only if
This is the source identity at infinity after and is a coefficientwise formal identity.
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
/-- Remark 2.11, PDF p.8, as a formal identity after z=y^{-1}.
No evaluation at a pole or convergence assertion is involved. -/
theorem admissibleSeries (R : Type u) [CommRing R] [Invertible (2 : R)]
(omega : ℕ → R) :
OmegaAdmissible omega ↔
(PowerSeries.X * PowerSeries.mk omega + 1 -
PowerSeries.C (⅟ (2 : R)) * PowerSeries.X) *
(PowerSeries.X * PowerSeries.mk (fun a => (-1 : R)^a * omega a) - 1 -
PowerSeries.C (⅟ (2 : R)) * PowerSeries.X) =
PowerSeries.C ((⅟ (2 : R))^2) * PowerSeries.X^2 - 1 := by sorry
end QAlgorithms.Papers.Independent.Intake100.P65
end
Source
Cyclotomic Nazarov-Wenzl algebras, arXiv:math/0506467v5, PDF p. 8, Remark 2.11
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any commutative ring equipped with an inverse of , and let . Put , so . Then the requirement
is equivalent to the formal power series identity
The coefficient condition includes , namely ; the series identity is an equality in , with no analytic convergence requirement.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.