multiset_map_ofReal_injective
theoremverifiedformalizationimported Lean
Mapping RCLike.ofReal over a multiset is injective.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace in lemma multiset_map_ofReal_injective {R : Type*} [RCLike R] {M N : Multiset ℝ} : M.map (RCLike.ofReal : ℝ → R) = N.map RCLike.ofReal ↔ M = N
- Formalizes
- QuantumInfo, `multiset_map_ofReal_injective`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.multiset_map_ofReal_injective← multiset_map_ofReal_injective (QuantumInfo/Entropy/VonNeumann.lean:290): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- MixableA
Mixable Ttypeclass instance gives a compact way of talking about the action of probabilities for forming linear combinations in…
- MixableA
Lean source view module on GitHub
set_option quotPrecheck false open Mixable local notation p "[" x₁:80 "↔" x₂ "]" => mix p x₁ x₂ local notation p "[" x₁:80 "↔" x₂ ":" M "]" => mix (inst := M) p x₁ x₂ set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {d d₁ d₂ d₃ : Type*} in variable [Fintype d] [Fintype d₁] [Fintype d₂] [Fintype d₃] in variable [DecidableEq d] [DecidableEq d₁] [DecidableEq d₂] [DecidableEq d₃] in variable {dA dB dC dA₁ dA₂ : Type*} in variable [Fintype dA] [Fintype dB] [Fintype dC] [Fintype dA₁] [Fintype dA₂] in variable [DecidableEq dA] [DecidableEq dB] [DecidableEq dC] [DecidableEq dA₁] [DecidableEq dA₂] in variable {𝕜 : Type*} [RCLike 𝕜] in variable {α : ℝ} in open scoped InnerProductSpace RealInnerProductSpace in /-- Mapping `RCLike.ofReal` over a multiset is injective. -/ lemma multiset_map_ofReal_injective {R : Type*} [RCLike R] {M N : Multiset ℝ} : M.map (RCLike.ofReal : ℝ → R) = N.map RCLike.ofReal ↔ M = N := by exact ⟨fun h ↦ by simpa using congr(($h).map RCLike.re), fun h ↦ by rw [h]⟩