Theorems · Inductive type · combinatorics
IsMulFreimanHom
{α : Type u_2} → {β : Type u_3} → [CommMonoid α] → [CommMonoid β] → ℕ → Set α → Set β → (α → β) → PropAn n-Freiman homomorphism from a set A to a set B is a map which preserves products of n
elements.
- Cited by
- 31 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- CommMonoidCommMonoid
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
- CommMonoidstatement · cited by 2,264
Cited by33
Results whose statement or proof uses this declaration.
- IsMulFreimanHom.mapsTostatement and proof · cited by 12
- IsMulFreimanHom.map_prod_eq_map_prodstatement and proof · cited by 11
- MulHomClass.isMulFreimanHomstatement and proof · cited by 4
- IsMulFreimanIso.isMulFreimanHomstatement · cited by 3
- IsMulFreimanHom.compstatement and proof · cited by 3
- isMulFreimanHom_idstatement · cited by 2
- IsMulFreimanHom.mul_eq_mulstatement and proof · cited by 2
- IsMulFreimanHom.to_isMulFreimanIsostatement and proof · cited by 2
- IsMulFreimanHom.fststatement · cited by 1
- IsMulFreimanHom.monostatement and proof · cited by 1
- IsMulFreimanHom.mulRothNumber_monostatement and proof · cited by 1
- isMulFreimanHom_antitonestatement and proof · cited by 1