Theorems · Theorem · number theory

IsMulFreimanIso.mulRothNumber_congr

∀ {α : Type u_2} {β : Type u_3} [inst : DecidableEq α] [inst_1 : CommMonoid α] [inst_2 : CommMonoid β]
  [inst_3 : DecidableEq β] {A : Finset α} {B : Finset β} {f : α → β},
  IsMulFreimanIso 2 (↑A) (↑B) f → mulRothNumber A = mulRothNumber B

Arithmetic progressions are preserved under 2-Freiman isos.

Defined in

Mathlib.Combinatorics.Additive.AP.Three.Defs

Cited by

0 results in Mathlib

Foundations

Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidableEqCommMonoidCommMonoidDecidableEq