Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 28, proof of Theorem 1 — (1) has a C.D.R. provided T_m is not contained in the meet of all C.D.R.s of (4)

Proved
HallReps.CDR.cdr_of_not_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 consider the shorter system

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

obtained by deleting the last set. Let R∗R^*R∗ be the meet of all the C.D.R.s of (4): the set of elements of SSS occurring as representatives in every C.D.R. of (4). If TmT_mTm​ is not contained in R∗R^*R∗,

Tm⊈R∗,T_m \not\subseteq R^*,Tm​⊆R∗,

then the full system T1,…,TmT_1, \dots, T_mT1​,…,Tm​ has a C.D.R.

This is the first half of the induction step in Hall's proof of Theorem 1: an element am∈Tm∖R∗a_m \in T_m \setminus R^*am​∈Tm​∖R∗ is avoided by some C.D.R. of (4), and that C.D.R. together with ama_mam​ represents the whole system.

Formalization Note. The paper's mmm sets are T : Fin (m + 1) → Set α (so the Lean m + 1 is the paper's mmm, and m≥1m \ge 1m≥1 is built in); the system (4) is fun i : Fin m => T i.castSucc and TmT_mTm​ is T (Fin.last m). The paper also has, at this point, a C.D.R. of (4) from the induction hypothesis; it is not assumed here because the hypothesis Tm⊈R∗T_m \not\subseteq R^*Tm​⊆R∗ already implies it (if (4) had no C.D.R., R∗R^*R∗ would be all of SSS).

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

theorem cdr_of_not_subset_cdrMeet {α : Type*} {m : ℕ} (T : Fin (m + 1) → Set α)
    (hT : ¬ T (Fin.last m) ⊆ cdrMeet (fun i : Fin m => T i.castSucc)) :
    ∃ a : Fin (m + 1) → α, IsCDR T a := by sorry

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