Corollary 6.9 — Systems of distinct representatives
ProvedYogeshwaranDM.sdr_iffCorollary 6.9 — Systems of distinct representatives. Let be a finite index set and let be any family of sets in an ambient set . The individual sets are not required to be finite. A system of distinct representatives is an injective function with for every , as in Definition 6.8. Then
The empty family is allowed.
Formalization note. The arbitrary sets use Set rather than Finset. Set.encard takes values in the extended natural numbers, so an infinite union has cardinality infinity and does not incorrectly become zero. Only the index family is assumed finite.
import Mathlib.Combinatorics.Hall.Finite import Mathlib.Data.Set.Card import Mathlib.Tactic set_option autoImplicit false
namespace YogeshwaranDM
theorem sdr_iff {ι α : Type*} [Fintype ι] (A : ι → Set α) :
(∃ f : ι → α, Function.Injective f ∧ ∀ i, f i ∈ A i) ↔
∀ I : Finset ι, (I.card : ℕ∞) ≤ (⋃ i ∈ I, A i).encard := by sorry
end YogeshwaranDM
Read-back
What the Lean code literally says, in plain math · Codex (exact model identifier unavailable in auditor runtime)
For every type equipped with a finite enumeration, every type , and every family of sets indexed by , the following assertions are equivalent: there exists a function such that for every and is injective, meaning that implies for all indices ; and, for every finite set of indices, as an inequality in . On the left of this inequality, the ordinary finite cardinality of is embedded into the extended natural numbers. On the right, the union has its ordinary finite cardinality if it is finite and has value if it is infinite, regardless of the size of that infinite set; thus an infinite union automatically satisfies the inequality for that particular . The union counts each element of once even if it belongs to several sets of the family. Only the index type is assumed finite: and individual sets may be finite, infinite, or empty, and no decidable-equality or nonemptiness assumption is made on either type. Different indices may index equal sets, but their chosen representatives must still be distinct. The existence of does not assert that it is unique. The condition includes , when it is . If the index type is empty, both assertions hold, including when is empty, since the empty function is injective and satisfies all membership requirements. If any indexed set is empty, both assertions are false, with the singleton index set violating the inequality; in particular, when is empty and the index type is nonempty, both assertions are false. Infinite index types are outside the hypotheses.
Confirmed by the mission captain (proposal self-audit).