AFTD Auto-Formalizing Theoretical Domains

Lottery.expectedValue_mix

theoremverifiedformalizationimported Lean

Linearity of expected value under convex combination. E[mix α L₁ L₂] = α · E[L₁] + (1-α) · E[L₂] This is the key property corresponding to [MSZ Axiom 2.16] (simplification of compound lotteries).

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_mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (L₁ L₂ : Lottery 𝕜 O) (f : O → 𝕜) :
    Lottery.expectedValue (Lottery.mix α hα₀ hα₁ L₁ L₂) f =
    α * Lottery.expectedValue L₁ f + (1 - α) * Lottery.expectedValue L₂ f
Formalizes
EconCSLib, `Lottery.expectedValue_mix`
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 6
  • LotteryA lottery over outcomes O: a probability distribution. Just stdSimplex 𝕜 O with a game-theoretic name.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • wsum_mixBilinearity of wsum over stdSimplex.mix: wsum (mix α x y) f = α · wsum x f + (1-α) · wsum y f.
  • Lottery.mixConvex combination of two lotteries: the compound lottery [α(L₁), (1-α)(L₂)] after simplification. [MSZ Axiom 2.16] Alias of…
  • stdSimplex.mix_applystdSimplex.mix_apply
  • Lottery.expectedValueExpected value of f under lottery L: E_L[f] = ∑ o, L(o) · f(o). Alias of wsum from Math.Simplex.
Used by 2

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
/-- **Linearity of expected value** under convex combination. `E[mix α L₁ L₂] = α · E[L₁] + (1-α) · E[L₂]` This is the key property corresponding to [MSZ Axiom 2.16] (simplification of compound lotteries). -/
theorem Lottery.expectedValue_mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (L₁ L₂ : Lottery 𝕜 O) (f : O → 𝕜) :
    Lottery.expectedValue (Lottery.mix α hα₀ hα₁ L₁ L₂) f =
    α * Lottery.expectedValue L₁ f + (1 - α) * Lottery.expectedValue L₂ f :=
  wsum_mix α hα₀ hα₁ L₁ L₂ f
See it in the graphDiscuss this resultChallenge it