SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree
defimported Lean
The multisets of cardinality 3 containing elements from a finite set s.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {๐ฉ : Type} in def SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree [DecidableEq ๐ฉ] (s : Finset ๐ฉ) : Multiset (Multiset ๐ฉ)
- Defined in
- Physlib, `SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Joseph Tooby-Smith. 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.SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree← SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree (Physlib/Particles/SuperSymmetry/SU5/ChargeSpectrum/MinimallyAllowsTerm/OfFinset.lean:145): verbatim
- Verified
- 10 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {๐ฉ : Type} in /-- The multisets of cardinality `3` containing elements from a finite set `s`. -/ def SuperSymmetry.SU5.ChargeSpectrum.toMultisetsThree [DecidableEq ๐ฉ] (s : Finset ๐ฉ) : Multiset (Multiset ๐ฉ) := let X1 := (s.powersetCard 1).val.map (fun X => X.val.bind (fun x => Multiset.replicate 3 x)) let X2 := s.val.bind (fun x => (s \ {x}).val.map (fun y => {x} + Multiset.replicate 2 y)) let X3 := (s.powersetCard 3).val.map fun X => X.val X1 + X2 + X3