Generating-series criterion for root admissibility
ProvedQAlgorithms.Papers.Independent.Intake100.P65.rootAdmissibleSeriesLet be a commutative unital ring with invertible, , , and . Then is -admissible if and only if, in ,
This is the formal identity of Lemma 3.8 at infinity with its unit power-series denominators cleared. It allows coincident and zero roots.
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
/-- 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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any commutative ring in which is invertible, let , let , and let . Define as the coefficient of in , and define by applying coefficientwise integer division by , rounded down, to
Then for every , where integer coefficients are mapped canonically to , if and only if the following equality holds in :
Here denotes the specified inverse of . The statement allows repeated roots, zero roots, rings with zero divisors, and the zero ring.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.