AFTD Auto-Formalizing Theoretical Domains

nc_sum_le_nn

theoremverifiedformalizationimported Lean

∑ nextChoice ≤ n * n is preserved over daRun.

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_le_nn (w m : Preferences n) (fuel : ℕ) (s : DAState n)
    (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n)
    (hj : JInv m s)
    (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2)
    (hsum0 : ∑ i : Fin n, s.nextChoice i ≤ n * n) :
    ∑ i : Fin n, (daRun w m fuel s).nextChoice i ≤ n * n
Formalizes
EconCSLib, `nc_sum_le_nn`
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 9
  • holding_injective_stepIn daStep, holding remains injective.
  • GS.PreferencesList-based preferences: prefs i is a full permutation of Fin n, ordered from most to least preferred.
  • GS.DAStateDA state: per-man proposal cursor + per-woman tentative hold.
  • JInvJInv (Proposed → Held): once man i has proposed to woman p in some prior step, p is currently held by *someone* (possibly i,…
  • GS.daRunRun DA for at most fuel steps, stopping early if no free men remain.
  • GS.freeMenSetThe finset of all free men in s.
  • 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…
  • daStep_nc_le_nnextChoice i ≤ n for daStep.
  • jinv_stepJInv is preserved by one daStep.
Used by 1
  • finalState_no_free_menAt termination, every man is held (no free man remains). Proof: if a free man remained, nc_sum_grows would give n*n + 1 ≤ n*n,…

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 ≤ n * n` is preserved over `daRun`. -/lemma nc_sum_le_nn (w m : Preferences n) (fuel : ℕ) (s : DAState n)    (hnc0 : ∀ i : Fin n, s.nextChoice i ≤ n)    (hj : JInv m s)    (hinj : ∀ j1 j2 k : Fin n, s.holding j1 = some k → s.holding j2 = some k → j1 = j2)    (hsum0 : ∑ i : Fin n, s.nextChoice i ≤ n * n) :    ∑ i : Fin n, (daRun w m fuel s).nextChoice i ≤ n * n := by  induction fuel generalizing s with  | zero   => exact hsum0  | succ k ih =>      simp only [daRun]; split_ifs with hne      · apply ih _ (daStep_nc_le_n w m s hnc0 hj hinj) (jinv_step w m s hj)            (holding_injective_step w m s hinj)        calc ∑ i : Fin n, (daStep w m s).nextChoice i            ≤ ∑ _i : Fin n, n :=              Finset.sum_le_sum (fun i _ => daStep_nc_le_n w m s hnc0 hj hinj i)          _ = n * n := by              simp [Finset.sum_const, Finset.card_univ, Fintype.card_fin, mul_comm]      · exact hsum0
See it in the graphDiscuss this resultChallenge it