Burshtein-type inequality for subnormal uniform covers
ProvedSubnormalCover.burshtein_inequalityLet be a nontrivial uniform cover of a group : every lies in exactly of the cosets, and not all equal . Assume each is subnormal in of finite index, put , , and let be the largest prime divisor of . Then Burshtein's inequality holds in the sharp form used by Sun: there is a with and
which is Theorem 4.1's estimate (eq. (4.5)) weakened by and .
Formalization note. The inequality is stated over with denominators cleared, as ; every truncated subtraction is exact because is prime, and the finite-index hypothesis guarantees , so really is a prime divisor of .
import Mathlib import Definitions.Def_SubnormalCover_uniformCover import Definitions.Def_BFFPyramidal_arithmetic
namespace SubnormalCover
open BFFPyramidal
theorem burshtein_inequality {G : Type*} [Group G] {k : ℕ}
(K : Fin k → Subgroup G) (a : Fin k → G) (w : ℕ) (hcov : IsUniformCover K a w)
(hfin : ∀ i, (K i).FiniteIndex) (hsn : ∀ i, (K i).IsSubnormal) (hnt : ∃ i, K i ≠ ⊤) :
∃ j : Fin k, maxPrimeFac (coverLcm K) ∣ (K j).index ∧
maxPrimeFac (coverLcm K) * ∏ p ∈ (coverLcm K).primeFactors, (p - 1)
< indexMultiplicity K ((K j).index) * ∏ p ∈ (coverLcm K).primeFactors, p := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be any group (arbitrary type with a group structure) and a natural number, implicit and unconstrained a priori. We are given subgroups indexed by (repetitions allowed), elements , a natural number , and four hypotheses:
- is a uniform cover of weight : for every , the number of indices with — i.e. with — equals exactly. (The count is the cardinality of the subtype of such , a subtype of the finite type , so it is the ordinary cardinality.) Note this is an equality, not a lower bound: every element of lies in exactly of the cosets. Disjointness is not assumed and is not assumed.
- for every , has finite index, i.e. , where is the number of left cosets with the convention that it is when infinite. So for all .
- for every , is subnormal in : there is a finite chain , each subgroup normal in the next (Mathlib's inductive
IsSubnormal). - nontriviality: there exists an index with . This in particular forces , and combined with forces (take , which lies in ) and forces some .
Notation in the conclusion. Let (the Finset lcm over all indices; it would be if , and it is here by and ). Let denote the greatest prime factor of , defined as the supremum of the finite set of prime factors of with the bottom value when that set is empty; thus , and is the largest prime dividing for . Let be the multiplicity of the value among the indices. Products below range over , the finite set of primes dividing (empty for , in which case the products are ), and is natural-number subtraction (harmless, as ).
Conclusion. There exists an index (not asserted unique, and not asserted to be one of the with ) such that both:
- — the greatest prime factor of the lcm of all the indices divides the -th index; and
- the strict inequality
where the multiplicity on the right is the number of indices (including itself, so it is ) whose index equals .
Edge behaviour. Divisibility in clause 1 is the direction " divides ". If were then and clause 1 would read , i.e. , which excludes; rules out anyway. The case is excluded by (an existential over an empty index type is unsatisfiable), so the empty-family conventions , never arise. Nothing in the conclusion mentions , the elements , or subnormality; they enter only as hypotheses.
Confirmed by the mission captain (proposal self-audit).