AFTD Auto-Formalizing Theoretical Domains

z_uniform

defimported Lean

The uniform point in the big simplex.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Filter in
variable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in
noncomputable def z_uniform : BigSimplex card
Defined in
EconCSLib, `z_uniform`
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 2
  • BigSimplexThe big simplex on total_card card coordinates.
  • total_cardTotal number of coordinates: the sum of card i over all i.
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Filter in
variable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in
/-- The uniform point in the big simplex. -/
noncomputable def z_uniform : BigSimplex card :=
  ⟨fun _ => (1 : ℝ) / (total_card card : ℝ), by
    simp only [stdSimplex, Set.mem_setOf_eq]
    constructor
    · intro _; apply div_nonneg; norm_num;
      have : 0 < (total_card card : ℝ) := by
        norm_cast; exact PNat.pos (total_card card)
      exact le_of_lt this
    · have hpos : 0 < (total_card card : ℝ) := by
        norm_cast; exact PNat.pos (total_card card)
      have hcard : (Fintype.card (Fin (total_card card)) : ℝ) = (total_card card : ℝ) := by
        simp
      simp [Finset.sum_const, (ne_of_gt hpos)]
  ⟩
See it in the graphDiscuss this resultChallenge it