Cslib.Probability.PMF.uniformOfFintype_map_equiv
theoremverifiedformalizationimported Lean
A uniform distribution on a finite type is invariant under any equivalence.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open ENNReal in universe u v in variable {α : Type u} {β : Type v} in theorem Cslib.Probability.PMF.uniformOfFintype_map_equiv {γ : Type v} [Fintype α] [Fintype γ] [Nonempty α] [Nonempty γ] (e : α ≃ γ) : (PMF.uniformOfFintype α).map e = PMF.uniformOfFintype γ
- Formalizes
- CSLib, `Cslib.Probability.PMF.uniformOfFintype_map_equiv`
- Lean proof
- By Samuel Schlesinger, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Probability.PMF.uniformOfFintype_map_equiv← Cslib.Probability.PMF.uniformOfFintype_map_equiv (Cslib/Probability/PMF.lean:64): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 3
- Cslib.Crypto.Protocols.SecretSharing.Shamir.uniformTailSamplerUniform tail coefficients form the canonical privacy-compatible sampler.
- pmf_uniform_group_convolution_eq_uniformLet G be a finite nonempty additive commutative group. For any probability mass function p on G, the convolution of p with the uniform…
- pmf_uniformOfFintype_bind_prod_eq_uniformOfFintypeLet α and β be finite nonempty types. Then the sequential monadic bind of the uniform distribution on α with the uniform distribution on…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen ENNReal inuniverse u v invariable {α : Type u} {β : Type v} in/-- A uniform distribution on a finite type is invariant under any equivalence. -/theorem Cslib.Probability.PMF.uniformOfFintype_map_equiv {γ : Type v} [Fintype α] [Fintype γ] [Nonempty α] [Nonempty γ] (e : α ≃ γ) : (PMF.uniformOfFintype α).map e = PMF.uniformOfFintype γ := by classical have hcard : Fintype.card α = Fintype.card γ := Fintype.card_congr e ext c rw [PMF.map_apply, PMF.uniformOfFintype_apply, tsum_eq_single (e.symm c)] · simp_rw [PMF.uniformOfFintype_apply] simp [hcard] · intro a ha simp_rw [PMF.uniformOfFintype_apply] split_ifs with h · exfalso apply ha simpa using congrArg e.symm h.symm · simp