Theorems · Theorem · combinatorics
IsMulFreimanIso.invFunOn
∀ {α : Type u_2} {β : Type u_3} [inst : CommMonoid α] [inst_1 : CommMonoid β] {A : Set α} {B : Set β} {f : α → β}
{n : ℕ}, IsMulFreimanIso n A B f → IsMulFreimanIso n B A (Function.invFunOn f A)If f is a multiplicative Freiman isomorphism from A to B, then f.invFunOn A is
a multiplicative Freiman isomorphism from B to A.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoidCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- CommMonoidstatement and proof · cited by 2,264
- Function.invFunOnstatement · cited by 35
- Set.BijOn.surjOnproof · cited by 31
- IsMulFreimanIsostatement and proof · cited by 22
- IsMulFreimanIso.bijOnproof · cited by 13
- Set.SurjOn.rightInvOn_invFunOnproof · cited by 9
- Set.SurjOn.mapsTo_invFunOnproof · cited by 7
- IsMulFreimanIso.symmproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- IsMulFreimanIso.monoproof · cited by 0
- IsMulFreimanIso.prodMapproof · cited by 0