AFTD Auto-Formalizing Theoretical Domains

index_split_spec

theoremverifiedformalizationimported Lean

Specification of index_split: bounds and value relation for (i, j).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Filter in
variable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in
lemma index_split_spec (k : Fin (total_card card)) :
  let p := index_split card k
  prefix_sum card p.1 ≤ k.val ∧ k.val < prefix_sum card p.1 + (card p.1 : ℕ) ∧
  p.2.val = k.val - prefix_sum card p.1
Formalizes
EconCSLib, `index_split_spec`
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 4
  • index_splitSplit a flat index k into its block/index pair (i, j).
  • index_split_existenceA flat index k belongs to a unique block i with an in-block index j.
  • total_cardTotal number of coordinates: the sum of card i over all i.
  • prefix_sumCumulative sum of card over indices strictly less than i.
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Filter in
variable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in
/-- Specification of `index_split`: bounds and value relation for `(i, j)`. -/
lemma index_split_spec (k : Fin (total_card card)) :
  let p := index_split card k
  prefix_sum card p.1 ≤ k.val ∧ k.val < prefix_sum card p.1 + (card p.1 : ℕ) ∧
  p.2.val = k.val - prefix_sum card p.1 :=
  Classical.choose_spec (index_split_existence card k)
See it in the graphDiscuss this resultChallenge it