AFTD Auto-Formalizing Theoretical Domains

balanced_draft_value_order_iff

theoremverified

In the induced order, a good is at most another exactly when its value is smaller, or the values agree and its index is at most the other index.

Statement

theorem balanced_draft_value_order_iff {m : ℕ} (v : Fin m → ℝ) (g h : Fin m) :
    @LE.le (Fin m) (balanced_draft_value_order v).toLE g h ↔
      v g < v h ∨ (v g = v h ∧ g ≤ h)
Source
Definitions and auxiliary facts for OP-1493, the joint Gaussian limit for balanced sincere drafting.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • balanced_draft_value_orderThe strict preference order induced by a real value vector, ordered first by increasing value and then by increasing good index; hence a…

The proof, explained

The draft value order on goods is defined by lifting the lexicographical order on ℝ × Fin m along the map sending each good g to the pair (v g, g). The comparison g ≤ h therefore unfolds definitionally to comparing (v g, g) and (v h, h) lexicographically. Applying the standard characterization of the lexicographic product order (Prod.Lex.toLex_le_toLex) directly yields the equivalence.

  1. The relation g ≤ h in the draft value order is definitionally the lexicographic inequality toLex (v g, g) ≤ toLex (v h, h).

    By definition, `balanced_draft_value_order v` is constructed by pulling back the lexicographic order on ℝ × Fin m along the map sending each good i to the pair (v i, i). Replacing the left-hand side g ≤ h with this lexicographical comparison between (v g, g) and (v h, h) is a definitional rephrasing.

    line 7

      change toLex (v g, g) ≤ toLex (v h, h) ↔ _
  2. The lexicographical inequality toLex (v g, g) ≤ toLex (v h, h) is equivalent to v g < v h ∨ (v g = v h ∧ g ≤ h).

    The lemma `Prod.Lex.toLex_le_toLex` characterizes the lexicographical order on product pairs: a pair is less than or equal to another if and only if its first component is strictly smaller, or the first components are equal and its second component is at most the other's. Applying this to the pairs (v g, g) and (v h, h) closes the goal.

    line 8

    uses Prod.Lex.toLex_le_toLex

      exact Prod.Lex.toLex_le_toLex
Prod.Lex.toLex_le_toLex
For elements x and y in a lexicographically ordered product type, toLex x ≤ toLex y holds if and only if x.1 < y.1, or x.1 = y.1 and x.2 ≤ y.2.

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

open MeasureTheory ProbabilityTheory Filteropen scoped BigOperators Topologytheorem balanced_draft_value_order_iff {m : ℕ} (v : Fin m → ℝ) (g h : Fin m) :    @LE.le (Fin m) (balanced_draft_value_order v).toLE g h ↔      v g < v h ∨ (v g = v h ∧ g ≤ h) := by  change toLex (v g, g) ≤ toLex (v h, h) ↔ _  exact Prod.Lex.toLex_le_toLex
See it in the graphDiscuss this resultChallenge it