Lemma, p. 27 — the sets represented by the meet R of all C.D.R.s contain between them exactly the elements of R
ProvedHallReps.CDR.lemma_cdrMeetLet () be a finite system of subsets of a set , and let be a C.D.R. of it. Let be the meet of all the C.D.R.s of the system, i.e. the set of elements of that occur as representatives in every C.D.R. Since is itself a C.D.R., every element of is some ; let
be the indices of the sets whose representative in lies in (in the paper, after renumbering, and these are the sets ). Then these sets contain between them exactly elements, namely the elements of :
The case (that is, ) 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 "; " 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.
import Mathlib import Definitions.Def_HallReps_CDR_System
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.