AFTD Auto-Formalizing Theoretical Domains

index_combine_split_inverse

theoremverifiedformalizationimported Lean

index_combine is a left inverse to index_split.

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_combine_split_inverse (k : Fin (total_card card)) : index_combine card (index_split card k) = k
Formalizes
EconCSLib, `index_combine_split_inverse`
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 5
  • index_splitSplit a flat index k into its block/index pair (i, j).
  • index_split_specSpecification of index_split: bounds and value relation for (i, j).
  • total_cardTotal number of coordinates: the sum of card i over all i.
  • index_combineCombine a block/index pair (i, j) back into a flat index.
  • prefix_sumCumulative sum of card over indices strictly less than i.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Filter invariable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in/-- `index_combine` is a left inverse to `index_split`. -/lemma index_combine_split_inverse (k : Fin (total_card card)) : index_combine card (index_split card k) = k := by  classical  have hspec := index_split_spec card k  apply Fin.ext  simp [index_combine, hspec.2.2, Nat.add_sub_of_le hspec.1]
See it in the graphDiscuss this resultChallenge it