AFTD Auto-Formalizing Theoretical Domains

Lottery.expectedValue_mono

theoremverifiedformalizationimported Lean

Expected value is monotone: if f ≤ g pointwise, then E[f] ≤ E[g].

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
set_option linter.unusedSectionVars false in
variable {O : Type*} [Fintype O] in
theorem Lottery.expectedValue_mono {L : Lottery 𝕜 O} {f g : O → 𝕜}
    (h : ∀ o, f o ≤ g o) :
    Lottery.expectedValue L f ≤ Lottery.expectedValue L g
Formalizes
EconCSLib, `Lottery.expectedValue_mono`
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
  • LotteryA lottery over outcomes O: a probability distribution. Just stdSimplex 𝕜 O with a game-theoretic name.
  • wsum_le_wsumWeighted sum is monotone: pointwise ≤ implies wsum ≤.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Lottery.expectedValueExpected value of f under lottery L: E_L[f] = ∑ o, L(o) · f(o). Alias of wsum from Math.Simplex.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
set_option linter.unusedSectionVars false in
variable {O : Type*} [Fintype O] in
/-- Expected value is monotone: if `f ≤ g` pointwise, then `E[f] ≤ E[g]`. -/
theorem Lottery.expectedValue_mono {L : Lottery 𝕜 O} {f g : O → 𝕜}
    (h : ∀ o, f o ≤ g o) :
    Lottery.expectedValue L f ≤ Lottery.expectedValue L g :=
  wsum_le_wsum L h
See it in the graphDiscuss this resultChallenge it