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*
ProvedHallReps.CDR.card_lt_of_subset_cdrMeetLet () be subsets of a set and suppose the system
has a C.D.R. Let be the meet of all the C.D.R.s of (4), and write . If
then is finite and there are of the sets — namely together with the sets represented by the elements of — which contain between them only the elements of : there is a set of indices with , and
This is the second half of the induction step in Hall's proof of Theorem 1: it exhibits sets with only elements between them, contradicting the hypothesis of Theorem 1.
Formalization Note. Indexing as in the companion step: the paper's sets are T : Fin (m + 1) → Set α, (4) is fun i : Fin m => T i.castSucc, is T (Fin.last m). The C.D.R. b of (4) is a hypothesis, as on the page (without one, would be all of ). The count is stated with Set.ncard together with the finiteness of , so the junk value of ncard on an infinite set cannot occur.
import Mathlib import Definitions.Def_HallReps_CDR_System
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.