The group of permutations (self-equivalences) of a type α

This file defines the Group structure on Equiv.Perm α.

instance Equiv.Perm.instOne {α : Type u} : One (Equiv.Perm α)

Equations

• Equiv.Perm.instOne = { one := Equiv.refl α }

instance Equiv.Perm.instMul {α : Type u} : Mul (Equiv.Perm α)

Equations

• Equiv.Perm.instMul = { mul := fun (f g : Equiv.Perm α) => Equiv.trans g f }

instance Equiv.Perm.instInv {α : Type u} : Inv (Equiv.Perm α)

Equations

• Equiv.Perm.instInv = { inv := Equiv.symm }

instance Equiv.Perm.instPowNat {α : Type u} : Pow (Equiv.Perm α) ℕ

Equations

• Equiv.Perm.instPowNat = { pow := fun (f : Equiv.Perm α) (n : ℕ) => { toFun := (⇑f)^[n], invFun := (⇑(Equiv.symm f))^[n], left_inv := ⋯, right_inv := ⋯ } }

instance Equiv.Perm.permGroup {α : Type u} : Group (Equiv.Perm α)

Equations

• Equiv.Perm.permGroup = Group.mk ⋯

@[simp]

theorem Equiv.Perm.default_eq {α : Type u} : default = 1

@[simp]

theorem Equiv.Perm.val_inv_equivUnitsEnd_apply {α : Type u} (e : Equiv.Perm α) : ∀ (a : α), ↑(Equiv.Perm.equivUnitsEnd e)⁻¹ a = (Equiv.symm e).toFun a

@[simp]

theorem Equiv.Perm.equivUnitsEnd_symm_apply_symm_apply {α : Type u} (u : (Function.End α)ˣ) : ⇑(Equiv.symm (Equiv.Perm.equivUnitsEnd.symm u)) = ↑u⁻¹

@[simp]

theorem Equiv.Perm.equivUnitsEnd_symm_apply_apply {α : Type u} (u : (Function.End α)ˣ) : ⇑(Equiv.Perm.equivUnitsEnd.symm u) = ↑u

@[simp]

theorem Equiv.Perm.val_equivUnitsEnd_apply {α : Type u} (e : Equiv.Perm α) : ∀ (a : α), ↑(Equiv.Perm.equivUnitsEnd e) a = e.toFun a

def Equiv.Perm.equivUnitsEnd {α : Type u} : Equiv.Perm α ≃* (Function.End α)ˣ

The permutation of a type is equivalent to the units group of the endomorphisms monoid of this type.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem MonoidHom.toHomPerm_apply_symm_apply {α : Type u} {G : Type u_1} [Group G] (f : G →* Function.End α) : ∀ (a : G), ⇑(Equiv.symm (f.toHomPerm a)) = ↑(f.toHomUnits a)⁻¹

@[simp]

theorem MonoidHom.toHomPerm_apply_apply {α : Type u} {G : Type u_1} [Group G] (f : G →* Function.End α) : ∀ (a : G), ⇑(f.toHomPerm a) = f a

def MonoidHom.toHomPerm {α : Type u} {G : Type u_1} [Group G] (f : G →* Function.End α) : G →* Equiv.Perm α

Lift a monoid homomorphism f : G →* Function.End α to a monoid homomorphism f : G →* Equiv.Perm α.

Equations

• f.toHomPerm = Equiv.Perm.equivUnitsEnd.symm.toMonoidHom.comp f.toHomUnits

theorem Equiv.Perm.mul_apply {α : Type u} (f : Equiv.Perm α) (g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)

theorem Equiv.Perm.one_apply {α : Type u} (x : α) : 1 x = x

@[simp]

theorem Equiv.Perm.inv_apply_self {α : Type u} (f : Equiv.Perm α) (x : α) : f⁻¹ (f x) = x

@[simp]

theorem Equiv.Perm.apply_inv_self {α : Type u} (f : Equiv.Perm α) (x : α) : f (f⁻¹ x) = x

theorem Equiv.Perm.one_def {α : Type u} : 1 = Equiv.refl α

theorem Equiv.Perm.mul_def {α : Type u} (f : Equiv.Perm α) (g : Equiv.Perm α) : f * g = Equiv.trans g f

theorem Equiv.Perm.inv_def {α : Type u} (f : Equiv.Perm α) : f⁻¹ = Equiv.symm f

@[simp]

theorem Equiv.Perm.coe_one {α : Type u} : ⇑1 = id

@[simp]

theorem Equiv.Perm.coe_mul {α : Type u} (f : Equiv.Perm α) (g : Equiv.Perm α) : ⇑(f * g) = ⇑f ∘ ⇑g

theorem Equiv.Perm.coe_pow {α : Type u} (f : Equiv.Perm α) (n : ℕ) : ⇑(f ^ n) = (⇑f)^[n]

@[simp]

theorem Equiv.Perm.iterate_eq_pow {α : Type u} (f : Equiv.Perm α) (n : ℕ) : (⇑f)^[n] = ⇑(f ^ n)

theorem Equiv.Perm.eq_inv_iff_eq {α : Type u} {f : Equiv.Perm α} {x : α} {y : α} : x = f⁻¹ y ↔ f x = y

theorem Equiv.Perm.inv_eq_iff_eq {α : Type u} {f : Equiv.Perm α} {x : α} {y : α} : f⁻¹ x = y ↔ x = f y

theorem Equiv.Perm.zpow_apply_comm {α : Type u_1} (σ : Equiv.Perm α) (m : ℤ) (n : ℤ) {x : α} : (σ ^ m) ((σ ^ n) x) = (σ ^ n) ((σ ^ m) x)

@[simp]

theorem Equiv.Perm.image_inv {α : Type u} (f : Equiv.Perm α) (s : Set α) : ⇑f⁻¹ '' s = ⇑f ⁻¹' s

@[simp]

theorem Equiv.Perm.preimage_inv {α : Type u} (f : Equiv.Perm α) (s : Set α) : ⇑f⁻¹ ⁻¹' s = ⇑f '' s

Lemmas about mixing Perm with Equiv. Because we have multiple ways to express Equiv.refl, Equiv.symm, and Equiv.trans, we want simp lemmas for every combination. The assumption made here is that if you're using the group structure, you want to preserve it after simp.

@[simp]

theorem Equiv.Perm.trans_one {α : Sort u_1} {β : Type u_2} (e : α ≃ β) : e.trans 1 = e

@[simp]

theorem Equiv.Perm.mul_refl {α : Type u} (e : Equiv.Perm α) : e * Equiv.refl α = e

@[simp]

theorem Equiv.Perm.one_symm {α : Type u} : Equiv.symm 1 = 1

@[simp]

theorem Equiv.Perm.refl_inv {α : Type u} : (Equiv.refl α)⁻¹ = 1

@[simp]

theorem Equiv.Perm.one_trans {α : Type u_1} {β : Sort u_2} (e : α ≃ β) : Equiv.trans 1 e = e

@[simp]

theorem Equiv.Perm.refl_mul {α : Type u} (e : Equiv.Perm α) : Equiv.refl α * e = e

@[simp]

theorem Equiv.Perm.inv_trans_self {α : Type u} (e : Equiv.Perm α) : Equiv.trans e⁻¹ e = 1

@[simp]

theorem Equiv.Perm.mul_symm {α : Type u} (e : Equiv.Perm α) : e * Equiv.symm e = 1

@[simp]

theorem Equiv.Perm.self_trans_inv {α : Type u} (e : Equiv.Perm α) : Equiv.trans e e⁻¹ = 1

@[simp]

theorem Equiv.Perm.symm_mul {α : Type u} (e : Equiv.Perm α) : Equiv.symm e * e = 1

Lemmas about Equiv.Perm.sumCongr re-expressed via the group structure.

@[simp]

theorem Equiv.Perm.sumCongr_mul {α : Type u_1} {β : Type u_2} (e : Equiv.Perm α) (f : Equiv.Perm β) (g : Equiv.Perm α) (h : Equiv.Perm β) : e.sumCongr f * g.sumCongr h = (e * g).sumCongr (f * h)

@[simp]

theorem Equiv.Perm.sumCongr_inv {α : Type u_1} {β : Type u_2} (e : Equiv.Perm α) (f : Equiv.Perm β) : (e.sumCongr f)⁻¹ = e⁻¹.sumCongr f⁻¹

@[simp]

theorem Equiv.Perm.sumCongr_one {α : Type u_1} {β : Type u_2} : Equiv.Perm.sumCongr 1 1 = 1

@[simp]

theorem Equiv.Perm.sumCongrHom_apply (α : Type u_1) (β : Type u_2) (a : Equiv.Perm α × Equiv.Perm β) : (Equiv.Perm.sumCongrHom α β) a = a.1.sumCongr a.2

def Equiv.Perm.sumCongrHom (α : Type u_1) (β : Type u_2) : Equiv.Perm α × Equiv.Perm β →* Equiv.Perm (α ⊕ β)

Equiv.Perm.sumCongr as a MonoidHom, with its two arguments bundled into a single Prod.

This is particularly useful for its MonoidHom.range projection, which is the subgroup of permutations which do not exchange elements between α and β.

Equations

• Equiv.Perm.sumCongrHom α β = { toFun := fun (a : Equiv.Perm α × Equiv.Perm β) => a.1.sumCongr a.2, map_one' := ⋯, map_mul' := ⋯ }

theorem Equiv.Perm.sumCongrHom_injective {α : Type u_1} {β : Type u_2} : Function.Injective ⇑(Equiv.Perm.sumCongrHom α β)

@[simp]

theorem Equiv.Perm.sumCongr_swap_one {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] (i : α) (j : α) : (Equiv.swap i j).sumCongr 1 = Equiv.swap (Sum.inl i) (Sum.inl j)

@[simp]

theorem Equiv.Perm.sumCongr_one_swap {α : Type u_1} {β : Type u_2} [DecidableEq α] [DecidableEq β] (i : β) (j : β) : Equiv.Perm.sumCongr 1 (Equiv.swap i j) = Equiv.swap (Sum.inr i) (Sum.inr j)

Lemmas about Equiv.Perm.sigmaCongrRight re-expressed via the group structure.

@[simp]

theorem Equiv.Perm.sigmaCongrRight_mul {α : Type u_1} {β : α → Type u_2} (F : (a : α) → Equiv.Perm (β a)) (G : (a : α) → Equiv.Perm (β a)) : Equiv.Perm.sigmaCongrRight F * Equiv.Perm.sigmaCongrRight G = Equiv.Perm.sigmaCongrRight (F * G)

@[simp]

theorem Equiv.Perm.sigmaCongrRight_inv {α : Type u_1} {β : α → Type u_2} (F : (a : α) → Equiv.Perm (β a)) : (Equiv.Perm.sigmaCongrRight F)⁻¹ = Equiv.Perm.sigmaCongrRight fun (a : α) => (F a)⁻¹

@[simp]

theorem Equiv.Perm.sigmaCongrRight_one {α : Type u_1} {β : α → Type u_2} : Equiv.Perm.sigmaCongrRight 1 = 1

@[simp]

theorem Equiv.Perm.sigmaCongrRightHom_apply {α : Type u_1} (β : α → Type u_2) (F : (a : α) → Equiv.Perm (β a)) : (Equiv.Perm.sigmaCongrRightHom β) F = Equiv.Perm.sigmaCongrRight F

def Equiv.Perm.sigmaCongrRightHom {α : Type u_1} (β : α → Type u_2) : ((a : α) → Equiv.Perm (β a)) →* Equiv.Perm ((a : α) × β a)

Equiv.Perm.sigmaCongrRight as a MonoidHom.

This is particularly useful for its MonoidHom.range projection, which is the subgroup of permutations which do not exchange elements between fibers.

Equations

• Equiv.Perm.sigmaCongrRightHom β = { toFun := Equiv.Perm.sigmaCongrRight, map_one' := ⋯, map_mul' := ⋯ }

theorem Equiv.Perm.sigmaCongrRightHom_injective {α : Type u_1} {β : α → Type u_2} : Function.Injective ⇑(Equiv.Perm.sigmaCongrRightHom β)

@[simp]

theorem Equiv.Perm.subtypeCongrHom_apply {α : Type u} (p : α → Prop) [DecidablePred p] (pair : Equiv.Perm { a : α // p a } × Equiv.Perm { a : α // ¬p a }) : (Equiv.Perm.subtypeCongrHom p) pair = pair.1.subtypeCongr pair.2

def Equiv.Perm.subtypeCongrHom {α : Type u} (p : α → Prop) [DecidablePred p] : Equiv.Perm { a : α // p a } × Equiv.Perm { a : α // ¬p a } →* Equiv.Perm α

Equiv.Perm.subtypeCongr as a MonoidHom.

Equations

• Equiv.Perm.subtypeCongrHom p = { toFun := fun (pair : Equiv.Perm { a : α // p a } × Equiv.Perm { a : α // ¬p a }) => pair.1.subtypeCongr pair.2, map_one' := ⋯, map_mul' := ⋯ }

theorem Equiv.Perm.subtypeCongrHom_injective {α : Type u} (p : α → Prop) [DecidablePred p] : Function.Injective ⇑(Equiv.Perm.subtypeCongrHom p)

@[simp]

theorem Equiv.Perm.permCongr_eq_mul {α : Type u} (e : Equiv.Perm α) (p : Equiv.Perm α) : (Equiv.permCongr e) p = e * p * e⁻¹

If e is also a permutation, we can write permCongr completely in terms of the group structure.

Lemmas about Equiv.Perm.extendDomain re-expressed via the group structure.

@[simp]

theorem Equiv.Perm.extendDomain_one {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) : Equiv.Perm.extendDomain 1 f = 1

@[simp]

theorem Equiv.Perm.extendDomain_inv {α : Type u} {β : Type v} (e : Equiv.Perm α) {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) : (e.extendDomain f)⁻¹ = e⁻¹.extendDomain f

@[simp]

theorem Equiv.Perm.extendDomain_mul {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) (e : Equiv.Perm α) (e' : Equiv.Perm α) : e.extendDomain f * e'.extendDomain f = (e * e').extendDomain f

@[simp]

theorem Equiv.Perm.extendDomainHom_apply {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) (e : Equiv.Perm α) : (Equiv.Perm.extendDomainHom f) e = e.extendDomain f

def Equiv.Perm.extendDomainHom {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) : Equiv.Perm α →* Equiv.Perm β

extendDomain as a group homomorphism

Equations

• Equiv.Perm.extendDomainHom f = { toFun := fun (e : Equiv.Perm α) => e.extendDomain f, map_one' := ⋯, map_mul' := ⋯ }

theorem Equiv.Perm.extendDomainHom_injective {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) : Function.Injective ⇑(Equiv.Perm.extendDomainHom f)

@[simp]

theorem Equiv.Perm.extendDomain_eq_one_iff {α : Type u} {β : Type v} {p : β → Prop} [DecidablePred p] {e : Equiv.Perm α} {f : α ≃ Subtype p} : e.extendDomain f = 1 ↔ e = 1

@[simp]

theorem Equiv.Perm.extendDomain_pow {α : Type u} {β : Type v} (e : Equiv.Perm α) {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) (n : ℕ) : (e ^ n).extendDomain f = e.extendDomain f ^ n

@[simp]

theorem Equiv.Perm.extendDomain_zpow {α : Type u} {β : Type v} (e : Equiv.Perm α) {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) (n : ℤ) : (e ^ n).extendDomain f = e.extendDomain f ^ n

def Equiv.Perm.subtypePerm {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (h : ∀ (x : α), p x ↔ p (f x)) : Equiv.Perm { x : α // p x }

If the permutation f fixes the subtype {x // p x}, then this returns the permutation on {x // p x} induced by f.

Equations

• f.subtypePerm h = { toFun := fun (x : { x : α // p x }) => ⟨f ↑x, ⋯⟩, invFun := fun (x : { x : α // p x }) => ⟨f⁻¹ ↑x, ⋯⟩, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem Equiv.Perm.subtypePerm_apply {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (h : ∀ (x : α), p x ↔ p (f x)) (x : { x : α // p x }) : (f.subtypePerm h) x = ⟨f ↑x, ⋯⟩

@[simp]

theorem Equiv.Perm.subtypePerm_one {α : Type u} (p : α → Prop) (h : optParam (∀ (x : α), p x ↔ p x) ⋯) : Equiv.Perm.subtypePerm 1 h = 1

@[simp]

theorem Equiv.Perm.subtypePerm_mul {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (g : Equiv.Perm α) (hf : ∀ (x : α), p x ↔ p (f x)) (hg : ∀ (x : α), p x ↔ p (g x)) : f.subtypePerm hf * g.subtypePerm hg = (f * g).subtypePerm ⋯

theorem Equiv.Perm.subtypePerm_inv {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (hf : ∀ (x : α), p x ↔ p (f⁻¹ x)) : f⁻¹.subtypePerm hf = (f.subtypePerm ⋯)⁻¹

See Equiv.Perm.inv_subtypePerm

@[simp]

theorem Equiv.Perm.inv_subtypePerm {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (hf : ∀ (x : α), p x ↔ p (f x)) : (f.subtypePerm hf)⁻¹ = f⁻¹.subtypePerm ⋯

See Equiv.Perm.subtypePerm_inv

@[simp]

theorem Equiv.Perm.subtypePerm_pow {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (n : ℕ) (hf : ∀ (x : α), p x ↔ p (f x)) : f.subtypePerm hf ^ n = (f ^ n).subtypePerm ⋯

@[simp]

theorem Equiv.Perm.subtypePerm_zpow {α : Type u} {p : α → Prop} (f : Equiv.Perm α) (n : ℤ) (hf : ∀ (x : α), p x ↔ p (f x)) : f.subtypePerm hf ^ n = (f ^ n).subtypePerm ⋯

def Equiv.Perm.ofSubtype {α : Type u} {p : α → Prop} [DecidablePred p] : Equiv.Perm (Subtype p) →* Equiv.Perm α

The inclusion map of permutations on a subtype of α into permutations of α, fixing the other points.

Equations

• Equiv.Perm.ofSubtype = { toFun := fun (f : Equiv.Perm (Subtype p)) => f.extendDomain (Equiv.refl (Subtype p)), map_one' := ⋯, map_mul' := ⋯ }

theorem Equiv.Perm.ofSubtype_subtypePerm {α : Type u} {p : α → Prop} [DecidablePred p] {f : Equiv.Perm α} (h₁ : ∀ (x : α), p x ↔ p (f x)) (h₂ : ∀ (x : α), f x ≠ x → p x) : Equiv.Perm.ofSubtype (f.subtypePerm h₁) = f

theorem Equiv.Perm.ofSubtype_apply_of_mem {α : Type u} {p : α → Prop} [DecidablePred p] {a : α} (f : Equiv.Perm (Subtype p)) (ha : p a) : (Equiv.Perm.ofSubtype f) a = ↑(f ⟨a, ha⟩)

@[simp]

theorem Equiv.Perm.ofSubtype_apply_coe {α : Type u} {p : α → Prop} [DecidablePred p] (f : Equiv.Perm (Subtype p)) (x : Subtype p) : (Equiv.Perm.ofSubtype f) ↑x = ↑(f x)

theorem Equiv.Perm.ofSubtype_apply_of_not_mem {α : Type u} {p : α → Prop} [DecidablePred p] {a : α} (f : Equiv.Perm (Subtype p)) (ha : ¬p a) : (Equiv.Perm.ofSubtype f) a = a

theorem Equiv.Perm.mem_iff_ofSubtype_apply_mem {α : Type u} {p : α → Prop} [DecidablePred p] (f : Equiv.Perm (Subtype p)) (x : α) : p x ↔ p ((Equiv.Perm.ofSubtype f) x)

@[simp]

theorem Equiv.Perm.subtypePerm_ofSubtype {α : Type u} {p : α → Prop} [DecidablePred p] (f : Equiv.Perm (Subtype p)) : (Equiv.Perm.ofSubtype f).subtypePerm ⋯ = f

theorem Equiv.Perm.ofSubtype_subtypePerm_of_mem {α : Type u} {p : α → Prop} [DecidablePred p] {g : Equiv.Perm α} (hg : ∀ (x : α), p x ↔ p (g x)) {a : α} (ha : p a) : (Equiv.Perm.ofSubtype (g.subtypePerm hg)) a = g a

theorem Equiv.Perm.ofSubtype_subtypePerm_of_not_mem {α : Type u} {p : α → Prop} [DecidablePred p] {g : Equiv.Perm α} (hg : ∀ (x : α), p x ↔ p (g x)) {a : α} (ha : ¬p a) : (Equiv.Perm.ofSubtype (g.subtypePerm hg)) a = a

@[simp]

theorem Equiv.Perm.subtypeEquivSubtypePerm_apply_coe {α : Type u} (p : α → Prop) [DecidablePred p] (f : Equiv.Perm (Subtype p)) : ↑((Equiv.Perm.subtypeEquivSubtypePerm p) f) = Equiv.Perm.ofSubtype f

@[simp]

theorem Equiv.Perm.subtypeEquivSubtypePerm_symm_apply {α : Type u} (p : α → Prop) [DecidablePred p] (f : { f : Equiv.Perm α // ∀ (a : α), ¬p a → f a = a }) : (Equiv.Perm.subtypeEquivSubtypePerm p).symm f = (↑f).subtypePerm ⋯

def Equiv.Perm.subtypeEquivSubtypePerm {α : Type u} (p : α → Prop) [DecidablePred p] : Equiv.Perm (Subtype p) ≃ { f : Equiv.Perm α // ∀ (a : α), ¬p a → f a = a }

Permutations on a subtype are equivalent to permutations on the original type that fix pointwise the rest.

Equations

• One or more equations did not get rendered due to their size.

theorem Equiv.Perm.subtypeEquivSubtypePerm_apply_of_mem {α : Type u} {p : α → Prop} [DecidablePred p] {a : α} (f : Equiv.Perm (Subtype p)) (h : p a) : ↑((Equiv.Perm.subtypeEquivSubtypePerm p).toFun f) a = ↑(f ⟨a, h⟩)

theorem Equiv.Perm.subtypeEquivSubtypePerm_apply_of_not_mem {α : Type u} {p : α → Prop} [DecidablePred p] {a : α} (f : Equiv.Perm (Subtype p)) (h : ¬p a) : ↑((Equiv.Perm.subtypeEquivSubtypePerm p).toFun f) a = a

@[simp]

theorem Equiv.swap_inv {α : Type u} [DecidableEq α] (x : α) (y : α) : (Equiv.swap x y)⁻¹ = Equiv.swap x y

@[simp]

theorem Equiv.swap_mul_self {α : Type u} [DecidableEq α] (i : α) (j : α) : Equiv.swap i j * Equiv.swap i j = 1

theorem Equiv.swap_mul_eq_mul_swap {α : Type u} [DecidableEq α] (f : Equiv.Perm α) (x : α) (y : α) : Equiv.swap x y * f = f * Equiv.swap (f⁻¹ x) (f⁻¹ y)

theorem Equiv.mul_swap_eq_swap_mul {α : Type u} [DecidableEq α] (f : Equiv.Perm α) (x : α) (y : α) : f * Equiv.swap x y = Equiv.swap (f x) (f y) * f

theorem Equiv.swap_apply_apply {α : Type u} [DecidableEq α] (f : Equiv.Perm α) (x : α) (y : α) : Equiv.swap (f x) (f y) = f * Equiv.swap x y * f⁻¹

@[simp]

theorem Equiv.swap_smul_self_smul {α : Type u} {β : Type v} [DecidableEq α] [MulAction (Equiv.Perm α) β] (i : α) (j : α) (x : β) : Equiv.swap i j • Equiv.swap i j • x = x

theorem Equiv.swap_smul_involutive {α : Type u} {β : Type v} [DecidableEq α] [MulAction (Equiv.Perm α) β] (i : α) (j : α) : Function.Involutive fun (x : β) => Equiv.swap i j • x

@[simp]

theorem Equiv.swap_mul_self_mul {α : Type u} [DecidableEq α] (i : α) (j : α) (σ : Equiv.Perm α) : Equiv.swap i j * (Equiv.swap i j * σ) = σ

Left-multiplying a permutation with swap i j twice gives the original permutation.

This specialization of swap_mul_self is useful when using cosets of permutations.

@[simp]

theorem Equiv.mul_swap_mul_self {α : Type u} [DecidableEq α] (i : α) (j : α) (σ : Equiv.Perm α) : σ * Equiv.swap i j * Equiv.swap i j = σ

Right-multiplying a permutation with swap i j twice gives the original permutation.

This specialization of swap_mul_self is useful when using cosets of permutations.

@[simp]

theorem Equiv.swap_mul_involutive {α : Type u} [DecidableEq α] (i : α) (j : α) : Function.Involutive fun (x : Equiv.Perm α) => Equiv.swap i j * x

A stronger version of mul_right_injective

@[simp]

theorem Equiv.mul_swap_involutive {α : Type u} [DecidableEq α] (i : α) (j : α) : Function.Involutive fun (x : Equiv.Perm α) => x * Equiv.swap i j

A stronger version of mul_left_injective

@[simp]

theorem Equiv.swap_eq_one_iff {α : Type u} [DecidableEq α] {i : α} {j : α} : Equiv.swap i j = 1 ↔ i = j

theorem Equiv.swap_mul_eq_iff {α : Type u} [DecidableEq α] {i : α} {j : α} {σ : Equiv.Perm α} : Equiv.swap i j * σ = σ ↔ i = j

theorem Equiv.mul_swap_eq_iff {α : Type u} [DecidableEq α] {i : α} {j : α} {σ : Equiv.Perm α} : σ * Equiv.swap i j = σ ↔ i = j

theorem Equiv.swap_mul_swap_mul_swap {α : Type u} [DecidableEq α] {x : α} {y : α} {z : α} (hxy : x ≠ y) (hxz : x ≠ z) : Equiv.swap y z * Equiv.swap x y * Equiv.swap y z = Equiv.swap z x

@[simp]

theorem Equiv.addLeft_zero {α : Type u} [AddGroup α] : Equiv.addLeft 0 = 1

@[simp]

theorem Equiv.addRight_zero {α : Type u} [AddGroup α] : Equiv.addRight 0 = 1

@[simp]

theorem Equiv.addLeft_add {α : Type u} [AddGroup α] (a : α) (b : α) : Equiv.addLeft (a + b) = Equiv.addLeft a * Equiv.addLeft b

@[simp]

theorem Equiv.addRight_add {α : Type u} [AddGroup α] (a : α) (b : α) : Equiv.addRight (a + b) = Equiv.addRight b * Equiv.addRight a

@[simp]

theorem Equiv.inv_addLeft {α : Type u} [AddGroup α] (a : α) : (Equiv.addLeft a)⁻¹ = Equiv.addLeft (-a)

@[simp]

theorem Equiv.inv_addRight {α : Type u} [AddGroup α] (a : α) : (Equiv.addRight a)⁻¹ = Equiv.addRight (-a)

@[simp]

theorem Equiv.pow_addLeft {α : Type u} [AddGroup α] (a : α) (n : ℕ) : Equiv.addLeft a ^ n = Equiv.addLeft (n • a)

@[simp]

theorem Equiv.pow_addRight {α : Type u} [AddGroup α] (a : α) (n : ℕ) : Equiv.addRight a ^ n = Equiv.addRight (n • a)

@[simp]

theorem Equiv.zpow_addLeft {α : Type u} [AddGroup α] (a : α) (n : ℤ) : Equiv.addLeft a ^ n = Equiv.addLeft (n • a)

@[simp]

theorem Equiv.zpow_addRight {α : Type u} [AddGroup α] (a : α) (n : ℤ) : Equiv.addRight a ^ n = Equiv.addRight (n • a)

@[simp]

theorem Equiv.mulLeft_one {α : Type u} [Group α] : Equiv.mulLeft 1 = 1

@[simp]

theorem Equiv.mulRight_one {α : Type u} [Group α] : Equiv.mulRight 1 = 1

@[simp]

theorem Equiv.mulLeft_mul {α : Type u} [Group α] (a : α) (b : α) : Equiv.mulLeft (a * b) = Equiv.mulLeft a * Equiv.mulLeft b

@[simp]

theorem Equiv.mulRight_mul {α : Type u} [Group α] (a : α) (b : α) : Equiv.mulRight (a * b) = Equiv.mulRight b * Equiv.mulRight a

@[simp]

theorem Equiv.inv_mulLeft {α : Type u} [Group α] (a : α) : (Equiv.mulLeft a)⁻¹ = Equiv.mulLeft a⁻¹

@[simp]

theorem Equiv.inv_mulRight {α : Type u} [Group α] (a : α) : (Equiv.mulRight a)⁻¹ = Equiv.mulRight a⁻¹

@[simp]

theorem Equiv.pow_mulLeft {α : Type u} [Group α] (a : α) (n : ℕ) : Equiv.mulLeft a ^ n = Equiv.mulLeft (a ^ n)

@[simp]

theorem Equiv.pow_mulRight {α : Type u} [Group α] (a : α) (n : ℕ) : Equiv.mulRight a ^ n = Equiv.mulRight (a ^ n)

@[simp]

theorem Equiv.zpow_mulLeft {α : Type u} [Group α] (a : α) (n : ℤ) : Equiv.mulLeft a ^ n = Equiv.mulLeft (a ^ n)

@[simp]

theorem Equiv.zpow_mulRight {α : Type u} [Group α] (a : α) (n : ℤ) : Equiv.mulRight a ^ n = Equiv.mulRight (a ^ n)

theorem Set.BijOn.perm_inv {α : Type u_1} {f : Equiv.Perm α} {s : Set α} (hf : Set.BijOn (⇑f) s s) : Set.BijOn (⇑f⁻¹) s s

theorem Set.MapsTo.perm_pow {α : Type u_1} {f : Equiv.Perm α} {s : Set α} : Set.MapsTo (⇑f) s s → ∀ (n : ℕ), Set.MapsTo (⇑(f ^ n)) s s

theorem Set.SurjOn.perm_pow {α : Type u_1} {f : Equiv.Perm α} {s : Set α} : Set.SurjOn (⇑f) s s → ∀ (n : ℕ), Set.SurjOn (⇑(f ^ n)) s s

theorem Set.BijOn.perm_pow {α : Type u_1} {f : Equiv.Perm α} {s : Set α} : Set.BijOn (⇑f) s s → ∀ (n : ℕ), Set.BijOn (⇑(f ^ n)) s s

theorem Set.BijOn.perm_zpow {α : Type u_1} {f : Equiv.Perm α} {s : Set α} (hf : Set.BijOn (⇑f) s s) (n : ℤ) : Set.BijOn (⇑(f ^ n)) s s