Loogle!
Result
Found 164 declarations mentioning Equiv.Perm.support.
- Equiv.Perm.support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) : Finset α - Equiv.Perm.support_refl 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] : Equiv.Perm.support (Equiv.refl α) = ∅ - Equiv.Perm.card_support_ne_one 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) : f.support.card ≠ 1 - Equiv.Perm.support_inv 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (σ : Equiv.Perm α) : σ⁻¹.support = σ.support - Equiv.Perm.card_support_eq_two 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} : f.support.card = 2 ↔ f.IsSwap - Equiv.Perm.support_one 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] : Equiv.Perm.support 1 = ∅ - Equiv.Perm.card_support_swap 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {x y : α} (hxy : x ≠ y) : (Equiv.swap x y).support.card = 2 - Equiv.Perm.Disjoint.disjoint_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : f.Disjoint g) : Disjoint f.support g.support - Equiv.Perm.disjoint_iff_disjoint_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} : f.Disjoint g ↔ Disjoint f.support g.support - Equiv.Perm.support_eq_empty_iff 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} : σ.support = ∅ ↔ σ = 1 - Equiv.Perm.card_support_eq_zero 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} : f.support.card = 0 ↔ f = 1 - Equiv.Perm.one_lt_card_support_of_ne_one 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} (h : f ≠ 1) : 1 < f.support.card - Equiv.Perm.two_le_card_support_of_ne_one 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} (h : f ≠ 1) : 2 ≤ f.support.card - Equiv.Perm.card_support_le_one 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} : f.support.card ≤ 1 ↔ f = 1 - Equiv.Perm.support_swap 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {x y : α} (h : x ≠ y) : (Equiv.swap x y).support = {x, y} - Equiv.Perm.support_swap_iff 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (x y : α) : (Equiv.swap x y).support = {x, y} ↔ x ≠ y - Equiv.Perm.support_pow_le 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (σ : Equiv.Perm α) (n : ℕ) : (σ ^ n).support ⊆ σ.support - Equiv.Perm.coe_support_eq_set_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) : ↑f.support = {x | f x ≠ x} - Equiv.Perm.card_support_extend_domain 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {β : Type u_2} [DecidableEq β] [Fintype β] {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) {g : Equiv.Perm α} : (g.extendDomain f).support.card = g.support.card - Equiv.Perm.mem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x : α} : x ∈ f.support ↔ f x ≠ x - Equiv.Perm.notMem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x : α} : x ∉ f.support ↔ f x = x - Equiv.Perm.Disjoint.mem_imp 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : f.Disjoint g) {x : α} (hx : x ∈ f.support) : x ∉ g.support - Equiv.Perm.support_extend_domain 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {β : Type u_2} [DecidableEq β] [Fintype β] {p : β → Prop} [DecidablePred p] (f : α ≃ Subtype p) {g : Equiv.Perm α} : (g.extendDomain f).support = Finset.map f.asEmbedding g.support - Equiv.Perm.Disjoint.support_mul 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : f.Disjoint g) : (f * g).support = f.support ∪ g.support - Equiv.Perm.support_zpow_le 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (σ : Equiv.Perm α) (n : ℤ) : (σ ^ n).support ⊆ σ.support - Equiv.Perm.support_le_prod_of_mem 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {l : List (Equiv.Perm α)} (h : f ∈ l) (hl : List.Pairwise Equiv.Perm.Disjoint l) : f.support ⊆ l.prod.support - Equiv.Perm.apply_mem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x : α} : f x ∈ f.support ↔ x ∈ f.support - Equiv.Perm.card_support_conj 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [Fintype α] [DecidableEq α] {σ τ : Equiv.Perm α} : (σ * τ * σ⁻¹).support.card = τ.support.card - Equiv.Perm.Disjoint.card_support_mul 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : f.Disjoint g) : (f * g).support.card = f.support.card + g.support.card - Equiv.Perm.card_support_prod_list_of_pairwise_disjoint 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {l : List (Equiv.Perm α)} (h : List.Pairwise Equiv.Perm.Disjoint l) : l.prod.support.card = (List.map (Finset.card ∘ Equiv.Perm.support) l).sum - Equiv.Perm.support_conj 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [Fintype α] [DecidableEq α] {σ τ : Equiv.Perm α} : (σ * τ * σ⁻¹).support = Finset.map (Equiv.toEmbedding σ) τ.support - Equiv.Perm.support_mul_le 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f g : Equiv.Perm α) : (f * g).support ⊆ f.support ⊔ g.support - Equiv.Perm.Disjoint.mono 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g x y : Equiv.Perm α} (h : f.Disjoint g) (hf : x.support ⊆ f.support) (hg : y.support ⊆ g.support) : x.Disjoint y - Equiv.Perm.exists_mem_support_of_mem_support_prod 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {l : List (Equiv.Perm α)} {x : α} (hx : x ∈ l.prod.support) : ∃ f ∈ l, x ∈ f.support - Equiv.Perm.mem_support_iff_of_commute 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {g c : Equiv.Perm α} (hgc : Commute g c) (x : α) : g x ∈ c.support ↔ x ∈ c.support - Equiv.Perm.isInvariant_of_support_le 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {c : Equiv.Perm α} {s : Finset α} (hcs : c.support ⊆ s) (x : α) : c x ∈ s ↔ x ∈ s - Equiv.Perm.support_swap_mul_ge_support_diff 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (x y : α) : f.support \ {x, y} ⊆ (Equiv.swap x y * f).support - Equiv.Perm.support_swap_mul_ge_support_sdiff 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (x y : α) : f.support \ {x, y} ⊆ (Equiv.swap x y * f).support - Equiv.Perm.pow_apply_mem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {n : ℕ} {x : α} : (f ^ n) x ∈ f.support ↔ x ∈ f.support - Equiv.Perm.support_prod_of_pairwise_disjoint 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (l : List (Equiv.Perm α)) (h : List.Pairwise Equiv.Perm.Disjoint l) : l.prod.support = List.foldr (fun x1 x2 => x1 ⊔ x2) ⊥ (List.map Equiv.Perm.support l) - Equiv.Perm.support_swap_mul_swap 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {x y z : α} (h : [x, y, z].Nodup) : (Equiv.swap x y * Equiv.swap y z).support = {x, y, z} - Equiv.Perm.support_prod_le 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (l : List (Equiv.Perm α)) : l.prod.support ⊆ List.foldr (fun x1 x2 => x1 ⊔ x2) ⊥ (List.map Equiv.Perm.support l) - Equiv.Perm.card_support_swap_mul 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x : α} (hx : f x ≠ x) : (Equiv.swap x (f x) * f).support.card < f.support.card - Equiv.Perm.mem_support_swap_mul_imp_mem_support_ne 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x y : α} (hy : y ∈ (Equiv.swap x (f x) * f).support) : y ∈ f.support ∧ y ≠ x - Equiv.Perm.zpow_apply_mem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {n : ℤ} {x : α} : (f ^ n) x ∈ f.support ↔ x ∈ f.support - Equiv.Perm.eq_on_support_mem_disjoint 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {l : List (Equiv.Perm α)} (h : f ∈ l) (hl : List.Pairwise Equiv.Perm.Disjoint l) (x : α) : x ∈ f.support → f x = l.prod x - Equiv.Perm.support_congr 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : f.support ⊆ g.support) (h' : ∀ x ∈ g.support, f x = g x) : f = g - Equiv.Perm.support_noncommProd 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {ι : Type u_2} {k : ι → Equiv.Perm α} {s : Finset ι} (hs : (↑s).Pairwise fun i j => (k i).Disjoint (k j)) : (s.noncommProd k ⋯).support = s.biUnion fun i => (k i).support - Equiv.Perm.support_swap_mul_eq 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (x : α) (h : f (f x) ≠ x) : (Equiv.swap x (f x) * f).support = f.support \ {x} - Equiv.Perm.mem_support_of_mem_noncommProd_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_2} {β : Type u_3} [DecidableEq β] [Fintype β] {s : Finset α} {f : α → Equiv.Perm β} {comm : (↑s).Pairwise (Function.onFun Commute f)} {x : β} (hx : x ∈ (s.noncommProd f comm).support) : ∃ a ∈ s, x ∈ (f a).support - Equiv.Perm.support_ofSubtype 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {p : α → Prop} [DecidablePred p] (u : Equiv.Perm (Subtype p)) : (Equiv.Perm.ofSubtype u).support = Finset.map (Function.Embedding.subtype p) u.support - Equiv.Perm.pow_eq_on_of_mem_support 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {f g : Equiv.Perm α} (h : ∀ x ∈ f.support ∩ g.support, f x = g x) (k : ℕ) (x : α) : x ∈ f.support ∩ g.support → (f ^ k) x = (g ^ k) x - Equiv.Perm.mem_support_ofSubtype 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {p : α → Prop} [DecidablePred p] (x : α) (u : Equiv.Perm (Subtype p)) : x ∈ (Equiv.Perm.ofSubtype u).support ↔ ∃ (hx : p x), ⟨x, hx⟩ ∈ u.support - Equiv.Perm.support_subtypePerm 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] {s : Finset α} (f : Equiv.Perm α) (h : ∀ (x : α), f x ∈ s ↔ x ∈ s) : (f.subtypePerm h).support = {x | f ↑x ≠ ↑x} - Equiv.Perm.ofSubtype_eq_iff 📋 Mathlib.GroupTheory.Perm.Support
{α : Type u_1} [DecidableEq α] [Fintype α] {g c : Equiv.Perm α} {s : Finset α} (hg : ∀ (x : α), g x ∈ s ↔ x ∈ s) : Equiv.Perm.ofSubtype (g.subtypePerm hg) = c ↔ c.support ⊆ s ∧ ∀ (hc' : ∀ (x : α), c x ∈ s ↔ x ∈ s), c.subtypePerm hc' = g.subtypePerm hg - Equiv.Perm.support_pow_coprime 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} {n : ℕ} (h : n.Coprime (orderOf σ)) : (σ ^ n).support = σ.support - Equiv.Perm.mem_range_ofSubtype_iff 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {p : α → Prop} [DecidablePred p] {g : Equiv.Perm α} : g ∈ Equiv.Perm.ofSubtype.range ↔ ↑g.support ⊆ Set.ofPred p - Equiv.Perm.support_closure_subset_union 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] (S : Set (Equiv.Perm α)) (a : Equiv.Perm α) : a ∈ Subgroup.closure S → ↑a.support ⊆ ⋃ b ∈ S, ↑b.support - Equiv.Perm.disjoint_closure_of_disjoint_support 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {S T : Set (Equiv.Perm α)} (h : ∀ a ∈ S, ∀ b ∈ T, Disjoint a.support b.support) : Disjoint (Subgroup.closure S) (Subgroup.closure T) - Equiv.Perm.disjoint_of_disjoint_support 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {H K : Subgroup (Equiv.Perm α)} (h : ∀ a ∈ H, ∀ b ∈ K, Disjoint a.support b.support) : Disjoint H K - Equiv.Perm.disjoint_support_closure_of_disjoint_support 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {S T : Set (Equiv.Perm α)} (h : ∀ a ∈ S, ∀ b ∈ T, Disjoint a.support b.support) (a : Equiv.Perm α) : a ∈ Subgroup.closure S → ∀ b ∈ Subgroup.closure T, Disjoint a.support b.support - Equiv.Perm.ofSubtype_support_disjoint 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} (x : Equiv.Perm ↑(Function.fixedPoints ⇑σ)) : Disjoint (Equiv.Perm.ofSubtype x).support σ.support - Equiv.Perm.isConj_of_support_equiv 📋 Mathlib.GroupTheory.Perm.Finite
{α : Type u} [DecidableEq α] [Fintype α] {σ τ : Equiv.Perm α} (f : { x // x ∈ ↑σ.support } ≃ { x // x ∈ ↑τ.support }) (hf : ∀ (x : α) (hx : x ∈ ↑σ.support), ↑(f ⟨σ x, ⋯⟩) = τ ↑(f ⟨x, hx⟩)) : IsConj σ τ - List.support_formPerm_le 📋 Mathlib.GroupTheory.Perm.List
{α : Type u_1} [DecidableEq α] (l : List α) [Fintype α] : l.formPerm.support ⊆ l.toFinset - List.support_formPerm_of_nodup 📋 Mathlib.GroupTheory.Perm.List
{α : Type u_1} [DecidableEq α] [Fintype α] (l : List α) (h : l.Nodup) (h' : ∀ (x : α), l ≠ [x]) : l.formPerm.support = l.toFinset - List.zipWith_swap_prod_support 📋 Mathlib.GroupTheory.Perm.List
{α : Type u_1} [DecidableEq α] [Fintype α] (l l' : List α) : (List.zipWith Equiv.swap l l').prod.support ⊆ l.toFinset ⊔ l'.toFinset - Equiv.Perm.IsCycle.nonempty_support 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} (hg : g.IsCycle) : g.support.Nonempty - Equiv.Perm.IsCycle.two_le_card_support 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (h : f.IsCycle) : 2 ≤ f.support.card - Equiv.Perm.subtypePermOfSupport 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] (c : Equiv.Perm α) : Equiv.Perm ↥c.support - Equiv.Perm.IsCycle.orderOf 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (hf : f.IsCycle) : orderOf f = f.support.card - Finset.exists_cycleOn 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [DecidableEq α] [Fintype α] (s : Finset α) : ∃ f, f.IsCycleOn ↑s ∧ f.support ⊆ s - Equiv.Perm.subtypePerm_of_support_le 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] (c : Equiv.Perm α) {s : Finset α} (hcs : c.support ⊆ s) : Equiv.Perm ↥s - Equiv.Perm.IsCycle.isConj 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {σ τ : Equiv.Perm α} (hσ : σ.IsCycle) (hτ : τ.IsCycle) (h : σ.support.card = τ.support.card) : IsConj σ τ - Equiv.Perm.IsCycle.isConj_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {σ τ : Equiv.Perm α} (hσ : σ.IsCycle) (hτ : τ.IsCycle) : IsConj σ τ ↔ σ.support.card = τ.support.card - Equiv.Perm.IsCycle.support_pow_eq_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (hf : f.IsCycle) {n : ℕ} : (f ^ n).support = f.support ↔ ¬orderOf f ∣ n - Equiv.Perm.IsCycle.of_pow 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] {n : ℕ} (h1 : (f ^ n).IsCycle) (h2 : f.support ⊆ (f ^ n).support) : f.IsCycle - Equiv.Perm.IsCycle.support_pow_of_pos_of_lt_orderOf 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (hf : f.IsCycle) {n : ℕ} (npos : 0 < n) (hn : n < orderOf f) : (f ^ n).support = f.support - Equiv.Perm.IsCycle.zpowersEquivSupport 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} (hσ : σ.IsCycle) : ↥(Subgroup.zpowers σ) ≃ ↥σ.support - Equiv.Perm.IsCycle.of_zpow 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] {n : ℤ} (h1 : (f ^ n).IsCycle) (h2 : f.support ⊆ (f ^ n).support) : f.IsCycle - Equiv.Perm.IsCycle.support_congr 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f g : Equiv.Perm α} [DecidableEq α] [Fintype α] (hf : f.IsCycle) (hg : g.IsCycle) (h : f.support ⊆ g.support) (h' : ∀ x ∈ f.support, f x = g x) : f = g - Equiv.Perm.cycle_zpow_mem_support_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} (hg : g.IsCycle) {n : ℤ} {x : α} (hx : g x ≠ x) : (g ^ n) x = x ↔ n % ↑g.support.card = 0 - Equiv.Perm.IsCycle.eq_on_support_inter_nonempty_congr 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} {f g : Equiv.Perm α} {x : α} [DecidableEq α] [Fintype α] (hf : f.IsCycle) (hg : g.IsCycle) (h : ∀ x ∈ f.support ∩ g.support, f x = g x) (hx : f x = g x) (hx' : x ∈ f.support) : f = g - Equiv.Perm.IsCycle.sign 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} (hf : f.IsCycle) : Equiv.Perm.sign f = -(-1) ^ f.support.card - Equiv.Perm.IsCycle.commute_iff' 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {g c : Equiv.Perm α} (hc : c.IsCycle) : Commute g c ↔ ∃ (hc' : ∀ (x : α), g x ∈ c.support ↔ x ∈ c.support), g.subtypePerm hc' ∈ Subgroup.zpowers c.subtypePermOfSupport - Equiv.Perm.IsCycle.commute_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {g c : Equiv.Perm α} (hc : c.IsCycle) : Commute g c ↔ ∃ (hc' : ∀ (x : α), g x ∈ c.support ↔ x ∈ c.support), Equiv.Perm.ofSubtype (g.subtypePerm hc') ∈ Subgroup.zpowers c - Equiv.Perm.zpow_eq_ofSubtype_subtypePerm_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [Fintype α] [DecidableEq α] {g c : Equiv.Perm α} {s : Finset α} (hg : ∀ (x : α), g x ∈ s ↔ x ∈ s) (hc : c.support ⊆ s) (n : ℤ) : c ^ n = Equiv.Perm.ofSubtype (g.subtypePerm hg) ↔ c.subtypePerm ⋯ ^ n = g.subtypePerm hg - Equiv.Perm.IsCycle.zpowersEquivSupport_apply 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} (hσ : σ.IsCycle) {n : ℕ} : hσ.zpowersEquivSupport ⟨σ ^ n, ⋯⟩ = ⟨(σ ^ n) (Classical.choose hσ), ⋯⟩ - Equiv.Perm.IsCycle.zpowersEquivSupport_symm_apply 📋 Mathlib.GroupTheory.Perm.Cycle.Basic
{α : Type u_2} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} (hσ : σ.IsCycle) (n : ℕ) : hσ.zpowersEquivSupport.symm ⟨(σ ^ n) (Classical.choose hσ), ⋯⟩ = ⟨σ ^ n, ⋯⟩ - Equiv.Perm.closure_prime_cycle_swap 📋 Mathlib.GroupTheory.Perm.Closure
{α : Type u_1} [DecidableEq α] [Fintype α] {σ τ : Equiv.Perm α} (h0 : Nat.Prime (Fintype.card α)) (h1 : σ.IsCycle) (h2 : σ.support = Finset.univ) (h3 : τ.IsSwap) : Subgroup.closure {σ, τ} = ⊤ - Equiv.Perm.closure_cycle_adjacent_swap 📋 Mathlib.GroupTheory.Perm.Closure
{α : Type u_1} [DecidableEq α] [Fintype α] {σ : Equiv.Perm α} (h1 : σ.IsCycle) (h2 : σ.support = Finset.univ) (x : α) : Subgroup.closure {σ, Equiv.swap x (σ x)} = ⊤ - Equiv.Perm.closure_cycle_coprime_swap 📋 Mathlib.GroupTheory.Perm.Closure
{α : Type u_1} [DecidableEq α] [Fintype α] {n : ℕ} {σ : Equiv.Perm α} (h0 : n.Coprime (Fintype.card α)) (h1 : σ.IsCycle) (h2 : σ.support = Finset.univ) (x : α) : Subgroup.closure {σ, Equiv.swap x ((σ ^ n) x)} = ⊤ - Equiv.Perm.isCycleOn_support_cycleOf 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (x : α) : f.IsCycleOn ↑(f.cycleOf x).support - Equiv.Perm.support_cycleOf_le 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (x : α) : (f.cycleOf x).support ⊆ f.support - Equiv.Perm.isCycleOn_support_of_mem_cycleFactorsFinset 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g c : Equiv.Perm α} (hc : c ∈ g.cycleFactorsFinset) : g.IsCycleOn ↑c.support - Equiv.Perm.support_cycleOf_nonempty 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {f : Equiv.Perm α} {x : α} [DecidableEq α] [Fintype α] : (f.cycleOf x).support.Nonempty ↔ f x ≠ x - Equiv.Perm.SameCycle.mem_support_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {x y : α} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (h : f.SameCycle x y) : x ∈ f.support ↔ y ∈ f.support - Equiv.Perm.mem_cycleFactorsFinset_support_le 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {p f : Equiv.Perm α} (h : p ∈ f.cycleFactorsFinset) : p.support ⊆ f.support - Equiv.Perm.support_cycleOf_eq_nil_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {f : Equiv.Perm α} {x : α} [DecidableEq α] [Fintype α] : (f.cycleOf x).support = ∅ ↔ x ∉ f.support - Equiv.Perm.two_le_card_support_cycleOf_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {f : Equiv.Perm α} {x : α} [DecidableEq α] [Fintype α] : 2 ≤ (f.cycleOf x).support.card ↔ f x ≠ x - Equiv.Perm.cycleOf_mem_cycleFactorsFinset_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {f : Equiv.Perm α} {x : α} : f.cycleOf x ∈ f.cycleFactorsFinset ↔ x ∈ f.support - Equiv.Perm.mem_support_cycleOf_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {f : Equiv.Perm α} {x y : α} [DecidableEq α] [Fintype α] : y ∈ (f.cycleOf x).support ↔ f.SameCycle x y ∧ x ∈ f.support - Equiv.Perm.mem_support_cycleOf_iff' 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {f : Equiv.Perm α} {x y : α} (hx : f x ≠ x) [DecidableEq α] [Fintype α] : y ∈ (f.cycleOf x).support ↔ f.SameCycle x y - Equiv.Perm.cycle_is_cycleOf 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {f c : Equiv.Perm α} {a : α} (ha : a ∈ c.support) (hc : c ∈ f.cycleFactorsFinset) : c = f.cycleOf a - Equiv.Perm.eq_cycleOf_of_mem_cycleFactorsFinset_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (g c : Equiv.Perm α) (hc : c ∈ g.cycleFactorsFinset) (x : α) : c = g.cycleOf x ↔ x ∈ c.support - Equiv.Perm.mem_support_iff_mem_support_of_mem_cycleFactorsFinset 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {x : α} : x ∈ g.support ↔ ∃ c ∈ g.cycleFactorsFinset, x ∈ c.support - Equiv.Perm.sameCycle_iff_cycleOf_eq_of_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {x y : α} (hx : x ∈ g.support) (hy : y ∈ g.support) : g.SameCycle x y ↔ g.cycleOf x = g.cycleOf y - Equiv.Perm.mem_cycleFactorsFinset_support 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g c : Equiv.Perm α} (hc : c ∈ g.cycleFactorsFinset) (a : α) : g a ∈ c.support ↔ a ∈ c.support - Equiv.Perm.subtypePerm_on_cycleFactorsFinset 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g c : Equiv.Perm α} (hc : c ∈ g.cycleFactorsFinset) : g.subtypePerm ⋯ = c.subtypePermOfSupport - Equiv.Perm.mem_cycleFactorsFinset_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {f p : Equiv.Perm α} : p ∈ f.cycleFactorsFinset ↔ p.IsCycle ∧ ∀ a ∈ p.support, p a = f a - Equiv.Perm.SameCycle.exists_pow_eq_of_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {x y : α} {f : Equiv.Perm α} [DecidableEq α] [Fintype α] (h : f.SameCycle x y) (hx : x ∈ f.support) : ∃ i < (f.cycleOf x).support.card, (f ^ i) x = y - Equiv.Perm.pow_mod_card_support_cycleOf_self_apply 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (n : ℕ) (x : α) : (f ^ (n % (f.cycleOf x).support.card)) x = (f ^ n) x - Equiv.Perm.SameCycle.exists_pow_eq 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} {x y : α} [DecidableEq α] [Fintype α] (f : Equiv.Perm α) (h : f.SameCycle x y) : ∃ i, 0 < i ∧ i ≤ (f.cycleOf x).support.card + 1 ∧ (f ^ i) x = y - Equiv.Perm.mem_support_cycle_of_cycle 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g d c : Equiv.Perm α} (hc : c ∈ g.cycleFactorsFinset) (hd : d ∈ g.cycleFactorsFinset) (x : α) : d x ∈ c.support ↔ x ∈ c.support - Equiv.Perm.zpow_apply_mem_support_of_mem_cycleFactorsFinset_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {x : α} {m : ℤ} {c : ↥g.cycleFactorsFinset} : (g ^ m) x ∈ (↑c).support ↔ x ∈ (↑c).support - Equiv.Perm.zpow_eq_zpow_on_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (g : Equiv.Perm α) {m n : ℤ} {x : α} (hx : g x ≠ x) : (g ^ m) x = (g ^ n) x ↔ m % ↑(g.cycleOf x).support.card = n % ↑(g.cycleOf x).support.card - Equiv.Perm.support_zpowers_of_mem_cycleFactorsFinset_le 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {c : ↥g.cycleFactorsFinset} (v : ↥(Subgroup.zpowers ↑c)) : (↑v).support ⊆ g.support - Equiv.Perm.commute_iff_of_mem_cycleFactorsFinset 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] {g k c : Equiv.Perm α} (hc : c ∈ g.cycleFactorsFinset) : Commute k c ↔ ∃ (hc' : ∀ (x : α), k x ∈ c.support ↔ x ∈ c.support), k.subtypePerm hc' ∈ Subgroup.zpowers (g.subtypePerm ⋯) - Equiv.Perm.IsCycle.forall_commute_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Factors
{α : Type u_1} [DecidableEq α] [Fintype α] (g z : Equiv.Perm α) : (∀ c ∈ g.cycleFactorsFinset, Commute z c) ↔ ∀ c ∈ g.cycleFactorsFinset, ∃ (hc : ∀ (x : α), z x ∈ c.support ↔ x ∈ c.support), Equiv.Perm.ofSubtype (z.subtypePerm hc) ∈ Subgroup.zpowers c - Equiv.Perm.sum_cycleType 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] (σ : Equiv.Perm α) : σ.cycleType.sum = σ.support.card - Equiv.Perm.IsThreeCycle.card_support 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (h : σ.IsThreeCycle) : σ.support.card = 3 - card_support_eq_three_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} : σ.support.card = 3 ↔ σ.IsThreeCycle - Equiv.Perm.le_card_support_of_mem_cycleType 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {n : ℕ} {σ : Equiv.Perm α} (h : n ∈ σ.cycleType) : n ≤ σ.support.card - Equiv.Perm.IsCycle.cycleType 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (hσ : σ.IsCycle) : σ.cycleType = {σ.support.card} - Equiv.Perm.cycleType_def 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] (σ : Equiv.Perm α) : σ.cycleType = Multiset.map (Finset.card ∘ Equiv.Perm.support) σ.cycleFactorsFinset.val - Equiv.Perm.isCycle_of_prime_order 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (h1 : Nat.Prime (orderOf σ)) (h2 : σ.support.card < 2 * orderOf σ) : σ.IsCycle - Equiv.Perm.parts_partition 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} : σ.partition.parts = σ.cycleType + Multiset.replicate (Fintype.card α - σ.support.card) 1 - Equiv.Perm.two_dvd_card_support 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (hσ : σ ^ 2 = 1) : 2 ∣ σ.support.card - Equiv.Perm.mem_cycleType_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {n : ℕ} {σ : Equiv.Perm α} : n ∈ σ.cycleType ↔ ∃ c τ, σ = c * τ ∧ c.Disjoint τ ∧ c.IsCycle ∧ c.support.card = n - Equiv.Perm.cycleType_eq 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (l : List (Equiv.Perm α)) (h0 : l.prod = σ) (h1 : ∀ σ ∈ l, σ.IsCycle) (h2 : List.Pairwise Equiv.Perm.Disjoint l) : σ.cycleType = ↑(List.map (Finset.card ∘ Equiv.Perm.support) l) - Equiv.Perm.card_compl_support_modEq 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {p n : ℕ} [hp : Fact (Nat.Prime p)] {σ : Equiv.Perm α} (hσ : σ ^ p ^ n = 1) : σ.supportᶜ.card ≡ Fintype.card α [MOD p] - Equiv.Perm.IsThreeCycle.nodup_iff_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} {a : α} (hg3 : g.IsThreeCycle) : [a, g a, g (g a)].Nodup ↔ a ∈ g.support - Equiv.Perm.IsThreeCycle.support_eq_iff_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} {a : α} (hg3 : g.IsThreeCycle) : g.support = {a, g a, g (g a)} ↔ a ∈ g.support - Equiv.Perm.IsThreeCycle.eq_swap_mul_swap_iff_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} {a : α} (hg3 : g.IsThreeCycle) : g = Equiv.swap a (g a) * Equiv.swap (g a) (g (g a)) ↔ a ∈ g.support - Equiv.Perm.cycleType_eq' 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (s : Finset (Equiv.Perm α)) (h1 : ∀ f ∈ s, f.IsCycle) (h2 : (↑s).Pairwise Equiv.Perm.Disjoint) (h0 : s.noncommProd id ⋯ = σ) : σ.cycleType = Multiset.map (Finset.card ∘ Equiv.Perm.support) s.val - Equiv.Perm.CycleType.count_def 📋 Mathlib.GroupTheory.Perm.Cycle.Type
{α : Type u_1} [Fintype α] [DecidableEq α] {σ : Equiv.Perm α} (n : ℕ) : Multiset.count n σ.cycleType = Fintype.card { c // (↑c).support.card = n } - support_finRotate_of_le 📋 Mathlib.GroupTheory.Perm.Fin
{n : ℕ} (h : 2 ≤ n) : (finRotate n).support = Finset.univ - support_finRotate 📋 Mathlib.GroupTheory.Perm.Fin
{n : ℕ} : (finRotate (n + 2)).support = Finset.univ - Cycle.support_formPerm 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [DecidableEq α] [Fintype α] (s : Cycle α) (h : s.Nodup) (hn : s.Nontrivial) : (s.formPerm h).support = s.toFinset - Equiv.Perm.length_toList 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] (p : Equiv.Perm α) (x : α) : (p.toList x).length = (p.cycleOf x).support.card - Equiv.Perm.toList_eq_nil_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] {p : Equiv.Perm α} {x : α} : p.toList x = [] ↔ x ∉ p.support - Equiv.Perm.length_toList_pos_of_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] (p : Equiv.Perm α) (x : α) (h : x ∈ p.support) : 0 < (p.toList x).length - Equiv.Perm.two_le_length_toList_iff_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] {p : Equiv.Perm α} {x : α} : 2 ≤ (p.toList x).length ↔ x ∈ p.support - Equiv.Perm.mem_toList_iff 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] {p : Equiv.Perm α} {x y : α} : y ∈ p.toList x ↔ p.SameCycle x y ∧ x ∈ p.support - Equiv.Perm.toList_getElem_zero 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] (p : Equiv.Perm α) (x : α) (h : x ∈ p.support) : (p.toList x)[0] = x - Equiv.Perm.pow_apply_mem_toList_iff_mem_support 📋 Mathlib.GroupTheory.Perm.Cycle.Concrete
{α : Type u_1} [Fintype α] [DecidableEq α] {p : Equiv.Perm α} {x : α} {n : ℕ} : (p ^ n) x ∈ p.toList x ↔ x ∈ p.support - Polynomial.Gal.card_complex_roots_eq_card_real_add_card_not_gal_inv 📋 Mathlib.Analysis.Complex.Polynomial.Basic
(p : Polynomial ℚ) : (p.rootSet ℂ).toFinset.card = (p.rootSet ℝ).toFinset.card + ((Polynomial.Gal.galActionHom p ℂ) ((Polynomial.Gal.restrict p ℂ) (AlgEquiv.restrictScalars ℚ Complex.conjAe))).support.card - Equiv.Perm.support_toConjAct_eq_smul_support 📋 Mathlib.GroupTheory.Perm.ConjAct
{α : Type u_1} [DecidableEq α] [Fintype α] (k g : Equiv.Perm α) : (ConjAct.toConjAct k • g).support = k • g.support - Equiv.Perm.support_conj_eq_smul_support 📋 Mathlib.GroupTheory.Perm.ConjAct
{α : Type u_1} [DecidableEq α] [Fintype α] (k : ConjAct (Equiv.Perm α)) (g : Equiv.Perm α) : (k • g).support = ConjAct.ofConjAct k • g.support - Equiv.Perm.mem_conj_support 📋 Mathlib.GroupTheory.Perm.ConjAct
{α : Type u_1} [DecidableEq α] [Fintype α] (k : ConjAct (Equiv.Perm α)) (g : Equiv.Perm α) (a : α) : a ∈ (k • g).support ↔ (ConjAct.ofConjAct k⁻¹) a ∈ g.support - alternatingGroup.isConj_of 📋 Mathlib.GroupTheory.SpecificGroups.Alternating
{α : Type u_1} [Fintype α] [DecidableEq α] {σ τ : ↥(alternatingGroup α)} (hc : IsConj ↑σ ↑τ) (hσ : (↑σ).support.card + 2 ≤ Fintype.card α) : IsConj σ τ - alternatingGroup.mem_range_ofSubtype_iff 📋 Mathlib.GroupTheory.SpecificGroups.Alternating
{α : Type u_1} [Fintype α] [DecidableEq α] (s : Finset α) (k : ↥(alternatingGroup α)) : k ∈ (alternatingGroup.ofSubtype s).range ↔ (↑k).support ⊆ s - Equiv.Perm.isPretransitive_of_isCycle_mem 📋 Mathlib.GroupTheory.GroupAction.Jordan
{α : Type u_1} {G : Subgroup (Equiv.Perm α)} [Fintype α] [DecidableEq α] {g : Equiv.Perm α} (hgc : g.IsCycle) (hg : g ∈ G) : MulAction.IsPretransitive ↥(fixingSubgroup (↥G) (↑g.support)ᶜ) ↥(SubMulAction.ofFixingSubgroup (↥G) (↑g.support)ᶜ) - Equiv.Perm.Basis.mem_support_self' 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (self : g.Basis) (c : ↥g.cycleFactorsFinset) : self.toFun c ∈ (↑c).support - Equiv.Perm.Basis.mk 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (toFun : ↥g.cycleFactorsFinset → α) (mem_support_self' : ∀ (c : ↥g.cycleFactorsFinset), toFun c ∈ (↑c).support) : g.Basis - Equiv.Perm.Basis.mem_support_self 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (c : ↥g.cycleFactorsFinset) : a c ∈ (↑c).support - Equiv.Perm.Basis.mem_fixedPoints_or_exists_zpow_eq 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (x : α) : x ∈ Function.fixedPoints ⇑g ∨ ∃ c, ∃ (_ : x ∈ (↑c).support), ∃ m, (g ^ m) (a c) = x - Equiv.Perm.OnCycleFactors.mem_range_toPermHom'_iff 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {τ : Equiv.Perm ↥g.cycleFactorsFinset} : τ ∈ Equiv.Perm.OnCycleFactors.range_toPermHom' g ↔ ∀ (c : ↥g.cycleFactorsFinset), (↑(τ c)).support.card = (↑c).support.card - Equiv.Perm.OnCycleFactors.mem_range_toPermHom_iff 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {τ : Equiv.Perm ↥g.cycleFactorsFinset} : τ ∈ (Equiv.Perm.OnCycleFactors.toPermHom g).range ↔ ∀ (c : ↥g.cycleFactorsFinset), (↑(τ c)).support.card = (↑c).support.card - Equiv.Perm.OnCycleFactors.mem_range_toPermHom_iff' 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} {τ : Equiv.Perm ↥g.cycleFactorsFinset} : τ ∈ (Equiv.Perm.OnCycleFactors.toPermHom g).range ↔ (fun c => (↑c).support.card) ∘ ⇑τ = fun c => (↑c).support.card - Equiv.Perm.Basis.ofPermHomFun_apply_mem_support_cycle_iff 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (τ : ↥(Equiv.Perm.OnCycleFactors.range_toPermHom' g)) {x : α} {c : ↥g.cycleFactorsFinset} : a.ofPermHomFun τ x ∈ (↑(↑τ c)).support ↔ x ∈ (↑c).support - Equiv.Perm.Basis.ofPermHomFun_apply_of_cycleOf_mem 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (τ : ↥(Equiv.Perm.OnCycleFactors.range_toPermHom' g)) {x : α} {c : ↥g.cycleFactorsFinset} (hx : x ∈ (↑c).support) {m : ℤ} (hm : (g ^ m) (a c) = x) : a.ofPermHomFun τ x = (g ^ m) (a (↑τ c)) - Equiv.Perm.Basis.ofPermHom_support 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (τ : ↥(Equiv.Perm.OnCycleFactors.range_toPermHom' g)) : (a.ofPermHom τ).support = (↑τ).support.biUnion fun c => (↑c).support - Equiv.Perm.Basis.card_ofPermHom_support 📋 Mathlib.GroupTheory.Perm.Centralizer
{α : Type u_1} [DecidableEq α] [Fintype α] {g : Equiv.Perm α} (a : g.Basis) (τ : ↥(Equiv.Perm.OnCycleFactors.range_toPermHom' g)) : (a.ofPermHom τ).support.card = ∑ c ∈ (↑τ).support, (↑c).support.card - alternatingGroup.mem_map_kleinFour_ofSubtype 📋 Mathlib.GroupTheory.SpecificGroups.Alternating.Simple
{α : Type u_1} [DecidableEq α] [Fintype α] {s : Finset α} (hs : s.card = 4) (k : ↥(alternatingGroup α)) : k ∈ Subgroup.map (alternatingGroup.ofSubtype s) (alternatingGroup.kleinFour ↥s) ↔ (↑k).support ⊆ s ∧ (↑k = 1 ∨ (↑k).cycleType = {2, 2})
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c