Intersection of two cosets
ProvedBFFPyramidal.lemma_ILemma I. Let and be subgroups of a group and let . Then the intersection is either empty or a coset of . In particular, when it is nonempty,
This is the basic combinatorial fact underlying every counting argument about coset partitions.
Formalization note. The statement is a disjunction: either the intersection of the two cosets, as sets, is empty, or there exists with . The cardinality assertion follows, since a coset of has exactly elements. Cosets are pointwise scalar multiples of the underlying sets (• on Set G, requiring open Pointwise), and is the lattice meet K ⊓ L of subgroups. No finiteness is needed.
import Mathlib open Pointwise
namespace BFFPyramidal
theorem lemma_I {G : Type*} [Group G] (K L : Subgroup G) (a b : G) :
(a • (K : Set G)) ∩ (b • (L : Set G)) = ∅ ∨
∃ c : G, (a • (K : Set G)) ∩ (b • (L : Set G)) = c • ((K ⊓ L : Subgroup G) : Set G) := by
sorry
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: BFFPyramidal.lemma_I
The declaration is a single theorem, stated in the namespace BFFPyramidal, whose only import is Mathlib (no definitions from this workspace are used; every notion below is standard Mathlib, and the pointwise scalar-action notation on sets is in scope).
Binders, in order. The statement quantifies universally over:
- a type (an implicit argument, in an arbitrary universe — so may be any type, of any size, including a type with exactly one element);
- an instance-implicit assumption that carries a group structure (a
Group Ginstance — multiplicative, with no commutativity, no topology, no finiteness, and no decidability assumed); - two explicit arguments and , each a subgroup of (arbitrary subgroups: no normality, no finiteness, no finite index, no nontriviality, no relation between and );
- two explicit elements (arbitrary, with no hypothesis such as or membership in any subgroup).
There are no further hypotheses whatsoever: the theorem's statement is the conclusion alone, universally closed over , the group instance, , , , . In particular nothing can be vacuous for lack of satisfiable hypotheses; the claim is asserted for every group and every choice of the four data.
The objects involved. Each subgroup is coerced to its underlying subset of , and the action of a group element on a subset is the pointwise left translate
Thus denotes the left coset as a subset of , and likewise . The symbol is the lattice meet of subgroups, i.e. the subgroup whose underlying set is the set-theoretic intersection (it is a subgroup, and it contains the identity, so it is never empty); it too is coerced to a subset, and is the left coset .
The assertion. For all such , , , , , the following disjunction holds:
Two points about the exact logical form. First, this is an ordinary (inclusive, non-exclusive) "or" of two propositions; it is not stated as an exclusive disjunction, nor as an iff, nor as an implication from nonemptiness. (As it happens the two alternatives are mutually exclusive anyway, since always contains and so is nonempty; so the content of the disjunction is: if the two left cosets meet at all, their intersection is exactly some single left coset of .) Second, the existential is a plain , not : the witness is merely asserted to exist somewhere in , with no requirement that lie in , in , in their intersection, or that be expressible in terms of , , , in any particular way; and no uniqueness is claimed (indeed is only determined up to right multiplication by ).
Equalities are equalities of sets. Both alternatives are equalities of subsets of (extensional equality of the underlying sets), not equalities of subgroups or of coset-space elements; the emptiness claim is literally as sets.
Degenerate and boundary cases silently included.
- trivial (one element): then , , both cosets are , the intersection is , so the right disjunct holds.
- or equal to the trivial subgroup : the cosets are singletons , ; if the left disjunct holds, if the right disjunct holds with and .
- or equal to all of : e.g. gives and the intersection is , a coset of , so the right disjunct holds with .
- : the intersection is and the right disjunct holds with ; the statement does not exclude this case.
- Infinite , infinite-index subgroups, non-abelian : all included; nothing restricts to the finite setting.
Absent features. No natural-number arithmetic appears, so there is no truncated subtraction or division; no cardinalities, indices, measures, or orders are mentioned; no inequalities appear at all (hence no question of strictness); no number-theoretic function is applied to or ; no index type is quantified over (hence no empty-index-type case). Nothing in the statement refers to any notion of "pyramidal" or to any structure beyond a group, two subgroups, and two elements — the namespace name is the only trace of a wider context.
Proof status. The declaration's proof is sorry: the statement is asserted but not proved in this file, so the artifact contributes an axiom-like placeholder rather than a verified result.
Confirmed by the mission captain (proposal self-audit).