AFTD Auto-Formalizing Theoretical Domains

nc_sum_increase

theoremverifiedformalizationimported Lean

∑ nextChoice strictly increases when free men exist.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List Finset in
open GS in
variable {n : ℕ} [NeZero n] in
lemma nc_sum_increase (w m : Preferences n) (s : DAState n)
    (hne : (freeMenSet s).Nonempty) :
    ∑ i : Fin n, s.nextChoice i < ∑ i : Fin n, (daStep w m s).nextChoice i
Formalizes
EconCSLib, `nc_sum_increase`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
  • GS.daStepOne step of standard men-proposing DA. All free men propose; women pick the best of {held, new proposers} by rank; free men advance their…
  • GS.freeMenSetThe finset of all free men in s.
  • GS.daStep_nc_heldGS.daStep_nc_held
  • GS.daStep_nc_freeGS.daStep_nc_free
  • GS.isFreeMan i is free in s iff no woman holds him.
  • GS.mem_freeMenSetGS.mem_freeMenSet
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
Used by 1
  • nc_sum_growsAfter fuel rounds ending with free men, ∑ nextChoice grew by ≥ fuel.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen List Finset inopen GS invariable {n : ℕ} [NeZero n] in/-- `∑ nextChoice` strictly increases when free men exist. -/lemma nc_sum_increase (w m : Preferences n) (s : DAState n)    (hne : (freeMenSet s).Nonempty) :    ∑ i : Fin n, s.nextChoice i < ∑ i : Fin n, (daStep w m s).nextChoice i := by  obtain ⟨i0, hi0⟩ := hne  rw [mem_freeMenSet] at hi0  apply Finset.sum_lt_sum  · intro i _    by_cases hfi : isFree s i = true    · simp [daStep_nc_free hfi]    · simp [daStep_nc_held (by simpa using hfi)]  · exact ⟨i0, Finset.mem_univ _, by simp [daStep_nc_free hi0]⟩
See it in the graphDiscuss this resultChallenge it