Theorems · Theorem · combinatorics
IsCornerFree.of_image
∀ {G : Type u_1} {H : Type u_2} [inst : AddCommMonoid G] [inst_1 : AddCommMonoid H] {A : Set (G × G)} {s : Set G}
{t : Set H} {f : G → H},
IsAddFreimanHom 2 s t f → Set.InjOn f s → A ⊆ s ×ˢ s → IsCornerFree (Prod.map f f '' A) → IsCornerFree ACorners are preserved under 2-Freiman homomorphisms.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Quot.sound
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- AddCommMonoidstatement and proof · cited by 12,281
- Set.imagestatement and proof · cited by 5,609
- SProd.sprodstatement and proof · cited by 1,750
- Set.InjOnstatement and proof · cited by 543
- IsAddFreimanHomstatement and proof · cited by 32
- IsCornerproof · cited by 16
- IsCornerFreestatement and proof · cited by 10
- IsCorner.fst_fst_memproof · cited by 4
- IsCorner.snd_fst_memproof · cited by 4
- IsCorner.imageproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- corners_theorem_natproof · cited by 0