Theorems · Definition · linear algebra
Finsupp.congr
{α : Type u_1} →
{M : Type u_2} →
{R : Type u_5} →
[inst : Semiring R] →
[inst_1 : AddCommMonoid M] →
[inst_2 : Module R M] →
{α' : Type u_7} →
(s : Set α) → (t : Set α') → ↑s ≃ ↑t → ↥(Finsupp.supported M R s) ≃ₗ[R] ↥(Finsupp.supported M R t)An equivalence of sets induces a linear equivalence of Finsupps supported on those sets.
- Defined in
- Mathlib.LinearAlgebra.Finsupp.Supported
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemiringAddCommMonoidModule
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- RingHom.idstatement · cited by 18,349
- Semiringstatement and proof · cited by 13,802
- AddCommMonoidstatement and proof · cited by 12,281
- Equivstatement and proof · cited by 8,337
- Submodulestatement · cited by 7,192
- Set.Elemstatement and proof · cited by 7,166
- Finsuppstatement · cited by 5,255
- LinearEquivstatement · cited by 3,317
- LinearEquiv.symmproof · cited by 1,461
- LinearEquiv.transproof · cited by 298
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.