Root admissibility implies ordinary admissibility
ProvedQAlgorithms.Papers.Independent.Intake100.P65.rootAdmissibleAdmissibleLet be a commutative unital ring with invertible, , and . If is -admissible, then, for every ,
Thus is admissible in Definition 2.10. This permits use of the affine admissibility results at all root-admissible parameters.
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 3.9, PDF p.16: u-admissibility implies ordinary admissibility
without a field, distinctness, or nonzero-root restriction. -/
theorem rootAdmissibleAdmissible (R : Type u) [CommRing R] [Invertible (2 : R)]
(omega : ℕ → R) (r : ℕ) (hr : 1 ≤ r) (roots : Fin r → R)
(ha : RootAdmissible omega roots) : OmegaAdmissible omega := 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 . For every , define as the coefficient of in , and obtain by replacing every integer coefficient of
by its integer quotient , rounded down. Suppose for every , using the canonical map from to to evaluate coefficients. Then, for every ,
In particular, the conclusion includes . There are no distinctness or nonvanishing assumptions on the roots, no nonvanishing assumption on , and no domain or nontriviality assumption on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.