AFTD Auto-Formalizing Theoretical Domains

Lottery.mix

abbrevimported Lean

Convex combination of two lotteries: the compound lottery [α(L₁), (1-α)(L₂)] after simplification. [MSZ Axiom 2.16] Alias of stdSimplex.mix: mix α L₁ L₂ = α · L₁ + (1-α) · L₂ pointwise.

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
abbrev Lottery.mix {O : Type*} [Fintype O]
    (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (L₁ L₂ : Lottery 𝕜 O) : Lottery 𝕜 O
Defined in
EconCSLib, `Lottery.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
none listed
Built on 3
  • LotteryA lottery over outcomes O: a probability distribution. Just stdSimplex 𝕜 O with a game-theoretic name.
  • stdSimplex.mixConvex combination of two simplex points: mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for…
  • stdSimplex.mix_applystdSimplex.mix_apply
Used by 14

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
/-- Convex combination of two lotteries: the compound lottery `[α(L₁), (1-α)(L₂)]` after simplification. [MSZ Axiom 2.16] Alias of `stdSimplex.mix`: `mix α L₁ L₂ = α · L₁ + (1-α) · L₂` pointwise. -/
abbrev Lottery.mix {O : Type*} [Fintype O]
    (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (L₁ L₂ : Lottery 𝕜 O) : Lottery 𝕜 O :=
  stdSimplex.mix α hα₀ hα₁ L₁ L₂
See it in the graphDiscuss this resultChallenge it