Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma, p. 27 — the sets represented by the meet R of all C.D.R.s contain between them exactly the elements of R

Proved
HallReps.CDR.lemma_cdrMeet

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

hall-marriage-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-of-distinct-representatives

Let TiT_iTi​ (i∈Ii \in Ii∈I) be a finite system of subsets of a set SSS, and let a=(ai)i∈Ia = (a_i)_{i \in I}a=(ai​)i∈I​ be a C.D.R. of it. Let RRR be the meet of all the C.D.R.s of the system, i.e. the set of elements of SSS that occur as representatives in every C.D.R. Since aaa is itself a C.D.R., every element of RRR is some aia_iai​; let

IR={i∈I:ai∈R}I_R = \{i \in I : a_i \in R\}IR​={i∈I:ai​∈R}

be the indices of the sets whose representative in aaa lies in RRR (in the paper, after renumbering, R={a1,…,aρ}R = \{a_1, \dots, a_\rho\}R={a1​,…,aρ​} and these are the sets T1,…,TρT_1, \dots, T_\rhoT1​,…,Tρ​). Then these ρ=∣IR∣\rho = |I_R|ρ=∣IR​∣ sets contain between them exactly ρ\rhoρ elements, namely the elements of RRR:

⋃i∈IRTi=Rand∣R∣=∣IR∣.\bigcup_{i \in I_R} T_i = R \qquad\text{and}\qquad |R| = |I_R|.i∈IR​⋃​Ti​=Rand∣R∣=∣IR​∣.

The case ρ=0\rho = 0ρ=0 (that is, R=∅R = \varnothingR=∅) is included.

The lemma is the engine of Hall's inductive proof of Theorem 1: it says that the elements forced into every C.D.R. form a "tight" block of sets which can only be represented by those elements.

Formalization Note. The system is T : ι → Set α with [Finite ι]; the paper's silent renumbering "R=a1,…,aρR = a_1, \dots, a_\rhoR=a1​,…,aρ​; T1,…,TρT_1, \dots, T_\rhoT1​,…,Tρ​" is encoded by the index set {i | a i ∈ cdrMeet T}. The count is stated in ℕ∞ (Set.encard and ENat.card). The finiteness of the system is necessary: the paper's system (1) is finite.

Preamble
import Mathlib
import Definitions.Def_HallReps_CDR_System
Formal statement
namespace HallReps.CDR

theorem lemma_cdrMeet {ι α : Type*} [Finite ι] (T : ι → Set α) (a : ι → α)
    (ha : IsCDR T a) :
    (⋃ (i : ι) (_ : a i ∈ cdrMeet T), T i) = cdrMeet T ∧
      (cdrMeet T).encard = ENat.card {i : ι // a i ∈ cdrMeet T} := by sorry

end HallReps.CDR
Source
P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935), p. 27, Lemma (proof pp. 27–28)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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