A partial union in a uniform cover is a union of cosets
ProvedSubnormalCover.isUniformCover_mul_mem_biUnionLet be a uniform cover of a group by left cosets, i.e. the covering function is a constant . Sun's Lemma 4.1 introduces and shows that for any the set is a union of left cosets of ; for a uniform cover is constant, so and the conclusion becomes that is a union of left cosets of . This is the form used in the proof of Theorem 4.1, where .
Formalization note. 'Is a union of left cosets of ' is rendered equivalently as stability under right multiplication: if and then . The index subset is a Set (Fin k) (so is set complement and no DecidableEq is needed) and the intersection is the subgroup-valued ⨅ j ∈ Iᶜ, K j, which is ⊤ when is everything.
import Mathlib import Definitions.Def_SubnormalCover_uniformCover open Pointwise
namespace SubnormalCover
theorem isUniformCover_mul_mem_biUnion {G : Type*} [Group G] {k : ℕ}
(K : Fin k → Subgroup G) (a : Fin k → G) (w : ℕ) (hcov : IsUniformCover K a w)
(I : Set (Fin k)) {x y : G}
(hx : x ∈ ⋃ i ∈ I, (a i) • (K i : Set G))
(hy : y ∈ ⨅ j ∈ Iᶜ, K j) :
x * y ∈ ⋃ i ∈ I, (a i) • (K i : Set G) := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be a type in an arbitrary universe with a group structure, and fix an implicit natural number (possibly ), an explicit family of subgroups of , an explicit family of elements , and an explicit natural number . The hypothesis is the bundle's own definition and unfolds to:
where the count is Nat.card of the subtype of such indices (over the finite index set this is the honest cardinality, and no decidability instance is required). Equivalently: every element of lies in exactly of the left cosets , counted with multiplicity over indices. Nothing here requires , nor that the be proper, distinct, normal, or of finite index.
Further data: an arbitrary subset of the index set (a Set, so no finiteness or decidability assumption), and implicit elements subject to two hypotheses:
- , i.e. there is some index with (pointwise left translation of the underlying set of );
- , the infimum in the lattice of subgroups of over all indices not in ; membership in this infimum is exactly for every .
Assertion. Under all of the above,
that is, there exists an index with . The product is in this order, on the left and on the right, and the index witnessing membership for is not required to be the same one witnessing it for .
Degenerate cases silently allowed.
- : the index set is empty, so , the union is empty and the hypothesis on is unsatisfiable — the statement is vacuous. (The cover hypothesis then also forces as soon as is inhabited, which it is, containing .)
- (for any ): same situation, the hypothesis on cannot hold, and the statement is vacuously true.
- the whole index set: then , the infimum over the empty family is the top subgroup , so the hypothesis on holds for every and imposes nothing.
- : the cover hypothesis then says no element of lies in any , so all the unions are empty and the hypothesis on is again unsatisfiable.
- The number appears only inside the hypothesis; it does not occur in the conclusion, and no relation between and , , or the indices is assumed.
Confirmed by the mission captain (proposal self-audit).