AFTD Auto-Formalizing Theoretical Domains

stdSimplex.mix

defimported Lean

Convex combination of two simplex points: mix α hα₀ hα₁ x y = α·x + (1-α)·y. This is the basic vocabulary for compound lotteries and for any inductive argument that interpolates between two mixed strategies (Loomis, Sion, fictitious play). The hypotheses are passed as plain (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) rather than via a unit-interval subtype to match Mathlib idioms and to keep call sites lightweight.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
def stdSimplex.mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (x y : stdSimplex 𝕜 I) : stdSimplex 𝕜 I
Defined in
EconCSLib, `stdSimplex.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
Used by 18

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
/-- Convex combination of two simplex points: `mix α hα₀ hα₁ x y = α·x + (1-α)·y`. This is the basic vocabulary for compound lotteries and for any inductive argument that interpolates between two mixed strategies (Loomis, Sion, fictitious play). The hypotheses are passed as plain `(α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)` rather than via a unit-interval subtype to match Mathlib idioms and to keep call sites lightweight. -/
def stdSimplex.mix (α : 𝕜) (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1)
    (x y : stdSimplex 𝕜 I) : stdSimplex 𝕜 I where
  val i := α * x.val i + (1 - α) * y.val i
  property := by
    refine ⟨fun i => ?_, ?_⟩
    · have hx := x.property.1 i
      have hy := y.property.1 i
      have hα' : 0 ≤ 1 - α := by linarith
      have h₁ : 0 ≤ α * x.val i := mul_nonneg hα₀ hx
      have h₂ : 0 ≤ (1 - α) * y.val i := mul_nonneg hα' hy
      linarith
    · have hxsum := x.property.2
      have hysum := y.property.2
      have : (∑ i, (α * x.val i + (1 - α) * y.val i))
          = α * (∑ i, x.val i) + (1 - α) * (∑ i, y.val i) := by
        rw [Finset.sum_add_distrib, ← Finset.mul_sum, ← Finset.mul_sum]
      rw [this, hxsum, hysum]; ring
See it in the graphDiscuss this resultChallenge it