Theorems · Inductive type · combinatorics
IsAddFreimanIso
{α : Type u_2} → {β : Type u_3} → [AddCommMonoid α] → [AddCommMonoid β] → ℕ → Set α → Set β → (α → β) → PropAn additive n-Freiman homomorphism from a set A to a set B is a bijective map which
preserves sums of n elements.
- Cited by
- 30 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- AddCommMonoidstatement · cited by 12,281
Cited by32
Results whose statement or proof uses this declaration.
- IsAddFreimanIso.bijOnstatement and proof · cited by 14
- IsAddFreimanIso.isAddFreimanHomstatement and proof · cited by 5
- IsAddFreimanIso.map_sum_eq_map_sumstatement and proof · cited by 5
- Fin.isAddFreimanIso_Iiostatement and proof · cited by 3
- IsAddFreimanIso.add_eq_addstatement and proof · cited by 3
- threeAPFree_imagestatement and proof · cited by 2
- IsAddFreimanHom.to_isAddFreimanIsostatement · cited by 2
- IsAddFreimanIso.invFunOnstatement and proof · cited by 2
- isCorner_imagestatement and proof · cited by 2
- Fin.isAddFreimanIso_Iicstatement · cited by 1
- roth_3ap_theorem_natproof · cited by 1
- Fin.addRothNumber_eq_rothNumberNatproof · cited by 1