Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 29, proof of Theorem 1 — if T_m ⊆ R*, the ρ+1 sets T_1, …, T_ρ, T_m contain between them only the ρ elements of R*

Proved
HallReps.CDR.card_lt_of_subset_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 T1,…,TmT_1, \dots, T_mT1​,…,Tm​ (m≥1m \ge 1m≥1) be subsets of a set SSS and suppose the system

T1,T2,…,Tm−1(4)T_1, T_2, \dots, T_{m-1} \tag{4}T1​,T2​,…,Tm−1​(4)

has a C.D.R. Let R∗R^*R∗ be the meet of all the C.D.R.s of (4), and write ρ=∣R∗∣\rho = |R^*|ρ=∣R∗∣. If

Tm⊆R∗,T_m \subseteq R^*,Tm​⊆R∗,

then R∗R^*R∗ is finite and there are k=ρ+1k = \rho + 1k=ρ+1 of the sets — namely TmT_mTm​ together with the ρ\rhoρ sets T1,…,TρT_1, \dots, T_\rhoT1​,…,Tρ​ represented by the elements of R∗R^*R∗ — which contain between them only the ρ\rhoρ elements of R∗R^*R∗: there is a set JJJ of indices with m∈Jm \in Jm∈J, ∣J∣=ρ+1|J| = \rho + 1∣J∣=ρ+1 and

⋃j∈JTj=R∗.\bigcup_{j \in J} T_j = R^*.j∈J⋃​Tj​=R∗.

This is the second half of the induction step in Hall's proof of Theorem 1: it exhibits ρ+1\rho + 1ρ+1 sets with only ρ\rhoρ elements between them, contradicting the hypothesis of Theorem 1.

Formalization Note. Indexing as in the companion step: the paper's mmm sets are T : Fin (m + 1) → Set α, (4) is fun i : Fin m => T i.castSucc, TmT_mTm​ is T (Fin.last m). The C.D.R. b of (4) is a hypothesis, as on the page (without one, R∗R^*R∗ would be all of SSS). The count is stated with Set.ncard together with the finiteness of R∗R^*R∗, so the junk value of ncard on an infinite set cannot occur.

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

theorem card_lt_of_subset_cdrMeet {α : Type*} {m : ℕ} (T : Fin (m + 1) → Set α)
    (b : Fin m → α) (hb : IsCDR (fun i : Fin m => T i.castSucc) b)
    (hT : T (Fin.last m) ⊆ cdrMeet (fun i : Fin m => T i.castSucc)) :
    ∃ s : Finset (Fin (m + 1)), Fin.last m ∈ s ∧
      (⋃ i ∈ s, T i) = cdrMeet (fun i : Fin m => T i.castSucc) ∧
      (cdrMeet (fun i : Fin m => T i.castSucc)).Finite ∧
      s.card = (cdrMeet (fun i : Fin m => T i.castSucc)).ncard + 1 := by sorry

end HallReps.CDR
Source
P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935), p. 29, proof of Theorem 1 (first paragraph)
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