Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Intersection of two cosets

Proved
BFFPyramidal.lemma_I

by burkh4rt · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricscoset-partitionsgroup-theoryherzog-schonheim

Lemma I. Let KKK and LLL be subgroups of a group GGG and let a,b∈Ga, b \in Ga,b∈G. Then the intersection aK∩bLaK \cap bLaK∩bL is either empty or a coset of K∩LK \cap LK∩L. In particular, when it is nonempty,

∣aK∩bL∣  =  ∣K∩L∣.|aK \cap bL| \;=\; |K \cap L| .∣aK∩bL∣=∣K∩L∣.

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 c∈Gc \in Gc∈G with aK∩bL=c(K∩L)aK \cap bL = c(K \cap L)aK∩bL=c(K∩L). The cardinality assertion follows, since a coset of K∩LK \cap LK∩L has exactly ∣K∩L∣|K \cap L|∣K∩L∣ elements. Cosets are pointwise scalar multiples of the underlying sets (• on Set G, requiring open Pointwise), and K∩LK \cap LK∩L is the lattice meet K ⊓ L of subgroups. No finiteness is needed.

Preamble
import Mathlib
open Pointwise
Formal statement
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
Source
Berger--Felzenbaum--Fraenkel 1987, Remark on the multiplicity of a partition of a group into cosets, Fund. Math. 128 (1987) 139-144, https://doi.org/10.4064/fm-128-3-139-144, p. 140, Lemma I and eq. (5)
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:

  1. a type GGG (an implicit argument, in an arbitrary universe — so GGG may be any type, of any size, including a type with exactly one element);
  2. an instance-implicit assumption that GGG carries a group structure (a Group G instance — multiplicative, with no commutativity, no topology, no finiteness, and no decidability assumed);
  3. two explicit arguments KKK and LLL, each a subgroup of GGG (arbitrary subgroups: no normality, no finiteness, no finite index, no nontriviality, no relation between KKK and LLL);
  4. two explicit elements a,b∈Ga, b \in Ga,b∈G (arbitrary, with no hypothesis such as a≠ba \neq ba=b or membership in any subgroup).

There are no further hypotheses whatsoever: the theorem's statement is the conclusion alone, universally closed over GGG, the group instance, KKK, LLL, aaa, bbb. 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 GGG, and the action g⋅Sg \cdot Sg⋅S of a group element on a subset is the pointwise left translate

g⋅S  =  { g s  :  s∈S }.g \cdot S \;=\; \{\, g\,s \;:\; s \in S \,\}.g⋅S={gs:s∈S}.

Thus a⋅Ka \cdot Ka⋅K denotes the left coset aK={ak:k∈K}aK = \{a k : k \in K\}aK={ak:k∈K} as a subset of GGG, and likewise b⋅L=bLb \cdot L = bLb⋅L=bL. The symbol K⊓LK \sqcap LK⊓L is the lattice meet of subgroups, i.e. the subgroup whose underlying set is the set-theoretic intersection K∩LK \cap LK∩L (it is a subgroup, and it contains the identity, so it is never empty); it too is coerced to a subset, and c⋅(K⊓L)c \cdot (K \sqcap L)c⋅(K⊓L) is the left coset c(K∩L)c(K \cap L)c(K∩L).

The assertion. For all such GGG, KKK, LLL, aaa, bbb, the following disjunction holds:

aK∩bL=∅or∃ c∈G,    aK∩bL  =  c (K∩L).aK \cap bL = \varnothing \qquad \textbf{or} \qquad \exists\, c \in G,\;\; aK \cap bL \;=\; c\,(K \cap L).aK∩bL=∅or∃c∈G,aK∩bL=c(K∩L).

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 c(K∩L)c(K\cap L)c(K∩L) always contains ccc 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 K∩LK \cap LK∩L.) Second, the existential is a plain ∃\exists∃, not ∃!\exists!∃!: the witness ccc is merely asserted to exist somewhere in GGG, with no requirement that ccc lie in aKaKaK, in bLbLbL, in their intersection, or that ccc be expressible in terms of aaa, bbb, KKK, LLL in any particular way; and no uniqueness is claimed (indeed ccc is only determined up to right multiplication by K∩LK \cap LK∩L).

Equalities are equalities of sets. Both alternatives are equalities of subsets of GGG (extensional equality of the underlying sets), not equalities of subgroups or of coset-space elements; the emptiness claim is literally aK∩bL=∅aK \cap bL = \varnothingaK∩bL=∅ as sets.

Degenerate and boundary cases silently included.

  • GGG trivial (one element): then K=L=K∩L={1}K = L = K \cap L = \{1\}K=L=K∩L={1}, a=b=1a = b = 1a=b=1, both cosets are {1}\{1\}{1}, the intersection is {1}=1⋅(K∩L)\{1\} = 1\cdot(K\cap L){1}=1⋅(K∩L), so the right disjunct holds.
  • KKK or LLL equal to the trivial subgroup {1}\{1\}{1}: the cosets are singletons {a}\{a\}{a}, {b}\{b\}{b}; if a≠ba \neq ba=b the left disjunct holds, if a=ba = ba=b the right disjunct holds with c=ac = ac=a and K∩L={1}K \cap L = \{1\}K∩L={1}.
  • KKK or LLL equal to all of GGG: e.g. K=GK = GK=G gives aK=GaK = GaK=G and the intersection is bLbLbL, a coset of L=K∩LL = K \cap LL=K∩L, so the right disjunct holds with c=bc = bc=b.
  • a=ba = ba=b: the intersection is a(K∩L)a(K \cap L)a(K∩L) and the right disjunct holds with c=ac = ac=a; the statement does not exclude this case.
  • Infinite GGG, infinite-index subgroups, non-abelian GGG: 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 000 or 111; 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.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by burkh4rt · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me