AFTD Auto-Formalizing Theoretical Domains

charity_empty

theoremverified

For any natural numbers m and n, the charity of the empty allocation (fun _ => ∅) : Fin n → Finset (Fin m) equals Finset.univ.

Statement

theorem charity_empty (m n : ℕ) :
    charity (m := m) (n := n) (fun _ => ∅) = (Finset.univ : Finset (Fin m))
Source
arXiv:2611.12740 Section 2
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • charityGiven natural numbers m and n and an allocation X : Fin n → Finset (Fin m), charity X is the finset of items in Fin m not allocated to any…

Read back from the Lean

For all natural numbers $m$ and $n$, applying charity to the constant function mapping each element of Fin n to the empty set of Fin m (i.e., fun _ => ∅) equals the universal finset of Fin m (Finset.univ).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof proceeds by set extensionality: two sets are equal if they have the same elements. By definition, the charity is the set difference between the universal set of all items and the union of all agents' allocated bundles. Under the empty allocation, every agent receives the empty set, so no items are allocated and the charity retains the entire universal set.

  1. By set extensionality, it suffices to show that an arbitrary item x belongs to the charity of the empty allocation if and only if x ∈ Finset.univ.

    Two finite sets are identical if and only if they contain the same elements. Applying extensionality introduces an arbitrary item x : Fin m and reduces the set equality to proving that membership in the charity under the empty allocation is equivalent to membership in Finset.univ.

    line 4

      ext x
  2. The membership equivalence holds for every item x, completing the proof.

    By definition, charity is Finset.univ \\ (⋃ i, X i). For the empty allocation fun _ => ∅, every agent receives the empty set, so the union of all shares is empty. The charity is therefore Finset.univ \\ ∅ = Finset.univ, and simp simplifies the membership equivalence to true.

    line 5

    uses charity

      simp [charity]
charity
Given an allocation X mapping each agent to their assigned items, the charity is the set of unallocated items, defined as the universal set minus the union of all agents' shares.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Under the empty allocation, all items in Fin m remain in the charity. -/theorem charity_empty (m n : ℕ) :    charity (m := m) (n := n) (fun _ => ∅) = (Finset.univ : Finset (Fin m)) := by  ext x  simp [charity]
See it in the graphDiscuss this resultChallenge it