Definition · Subject of the article ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself). Show all
Subgroup. toGroup more general
instance Subgroup.toGroup {G : Type*} [Group G] (H : Subgroup G) : Group ↥H
Mathlib.Algebra.Group.Subgroup.Defs · lines 555–556
Why more general: Lean's product on Equiv.Perm M is composition of the two maps, so the structure inherited by H multiplies by composing permutations; the declaration is written for an arbitrary ambient group, where the passage fixes the permutations of M.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 09bc63f02ae2 · pair key 72cd5aa93390.
Equiv.Perm. permGroup special case
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why a special case: This is the passage's notion at the largest group of permutations of M rather than at an arbitrary one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0072f929d7ce · pair key 11c82cda0ba0.
Related, but states something else (1)
Equiv.Perm. mul_def related
theorem Equiv.Perm.mul_def {α : Type*} (f g : Equiv.Perm α) : f * g = Equiv.trans g f
Mathlib.Algebra.Group.End · lines 112–113
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9bb344631791 · pair key 371a39a08e38.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
The group of all permutations of a set M is the symmetric group of M, often written as Sym(M).[1] Show all
Equiv.Perm. permGroup exact match
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Note: Lean writes this group as Equiv.Perm M, each member a self-equivalence that carries its inverse map alongside, which is the bijection itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cb67863e190d · pair key 8fe7f072dbf6.
Related, but states something else (1)
Equiv. Perm related
abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)
Mathlib.Logic.Equiv.Defs · lines 94–95
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0faaa1acadb1 · pair key 3a5e83c73bf7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The term permutation group thus means a subgroup of the symmetric group. Show all
Subgroup more general
structure Subgroup (G : Type*) [Group G]
Mathlib.Algebra.Group.Subgroup.Defs · lines 296–298
Why more general: Lean keeps no separate notion for a permutation group: one is a term of Subgroup applied to Equiv.Perm M, and the structure is written for any ambient group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 85c771db5796 · pair key 76f2f68f8c0f.
Related, but states something else (1)
Equiv.Perm. permGroup related
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9005ee18b19e · pair key 43f350bfde9a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters. Show all
Equiv.Perm. permGroup more general
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why more general: Lean names this group Equiv.Perm (Fin n), with Fin n the n letters indexed by the naturals below n, and the declaration is written for an arbitrary type of points; the passage's symbol and spoken name are the article's way of writing that same group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3a8ea0abcae8 · pair key d453110d473a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
By Cayley's theorem, every group is isomorphic to some permutation group. Show all
Equiv.Perm. subgroupOfMulAction more general
def Equiv.Perm.subgroupOfMulAction (G : Type*) (H : Type*) [Group G] [MulAction G H] [FaithfulSMul G H] : G ≃* ↥(MulAction.toPermHom G H).range
Mathlib.GroupTheory.Perm.Subgroup · lines 72–74
Why more general: Lean states the result for an arbitrary faithful action; the regular action of a group on itself is the case the passage makes, and the image is a subgroup of the permutations of that set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d0423ecc95eb · pair key 5438a1c6033d.
Related, but states something else (1)
Equiv. permutationRepresentation_injective related
theorem Equiv.permutationRepresentation_injective {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} [FaithfulSMul G α] (e : α ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation
TauCeti.Algebra.GroupAction.PermutationRepresentation · lines 85–87
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 6fe7ce88ce14 · pair key ee7b85caf67c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The way in which the elements of a permutation group permute the elements of the set is called its group action. Show all
Subgroup. instMulActionSubtypeMem more general
instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α
Mathlib.Algebra.Group.Subgroup.Actions · line 32
Why more general: Lean reaches this instance from the tautological action of the permutations of M on M, so a member of the permutation group acts on a point by applying the permutation to it; the instance is written for any ambient group and any set it acts on.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2ebc68355783 · pair key 3830182825e3.
Equiv.Perm. applyMulAction special case
instance Equiv.Perm.applyMulAction (α : Type*) : MulAction (Equiv.Perm α) α
Mathlib.Algebra.Group.Action.End · lines 84–87
Why a special case: This is the passage's notion at the largest permutation group of M; for a smaller one Lean restricts this action.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c6890350ee2a · pair key e346c86bf4e0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Basic properties and terminology ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
A permutation group is a subgroup of a symmetric group; that is, its elements are permutations of a given set. Show all
Subgroup more general
structure Subgroup (G : Type*) [Group G]
Mathlib.Algebra.Group.Subgroup.Defs · lines 296–298
Why more general: Lean writes a permutation group as a term of Subgroup applied to Equiv.Perm M, whose members live in the type of bijections of M; the structure itself is written for any ambient group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ab9c37a3bdf5 · pair key 92d288c741f4.
Related, but states something else (1)
Equiv. Perm related
abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)
Mathlib.Logic.Equiv.Defs · lines 94–95
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f033937e0cb9 · pair key d5db7c37e692.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Basic properties and terminology ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Formalized by 3 parts together (more general):
Subgroup. mul_mem Mathlib (proved) the subset is closed under composing permutations Subgroup. one_mem Mathlib (proved) the subset contains the identity permutation Subgroup. inv_mem Mathlib (proved) the subset contains the inverse of each element it contains
It is thus a subset of a symmetric group that is closed under composition of permutations, contains the identity permutation, and contains the inverse permutation of each of its elements.[2] Show all
Subgroup more general
structure Subgroup (G : Type*) [Group G]
Mathlib.Algebra.Group.Subgroup.Defs · lines 296–298
Why more general: The structure carries a carrier subset together with the three conditions, and Lean's unit and product on Equiv.Perm M are the identity permutation and composition; it is written for any ambient group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 71ed2e09b420 · pair key 630b5aec4807.
Subgroup. mul_mem states part
theorem Subgroup.mul_mem {G : Type*} [Group G] (H : Subgroup G) {x y : G} : x ∈ H → y ∈ H → x * y ∈ H
Mathlib.Algebra.Group.Subgroup.Defs · lines 441–442
Why only part: Stated for a subgroup of any group; at the permutations of M the product is composition of the two maps.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 94e5571fcbce · pair key 2f09265cfbd2.
Subgroup. one_mem states part
theorem Subgroup.one_mem {G : Type*} [Group G] (H : Subgroup G) : 1 ∈ H
Mathlib.Algebra.Group.Subgroup.Defs · lines 436–437
Why only part: Stated for a subgroup of any group; the unit of Equiv.Perm M is the identity permutation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 554fb069e162 · pair key b4b6f05490ac.
Subgroup. inv_mem states part
theorem Subgroup.inv_mem {G : Type*} [Group G] (H : Subgroup G) {x : G} : x ∈ H → x⁻¹ ∈ H
Mathlib.Algebra.Group.Subgroup.Defs · lines 446–447
Why only part: Stated for a subgroup of any group; the inverse in Equiv.Perm M is the inverse bijection.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cfb15d4016b3 · pair key 4bb9d49df7ab.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Basic properties and terminology ◔ Partial
Partial: Mathlib states part of this (a definition).
A general property of finite groups implies that a finite nonempty subset of a symmetric group is a permutation group if and only if it is closed under permutation composition. Show all
subgroupOfIdempotent states part
def subgroupOfIdempotent {G : Type*} [Group G] [Finite G] (S : Set G) : S.Nonempty → S * S = S → Subgroup G
Mathlib.GroupTheory.OrderOfElement · lines 1329–1335
Why only part: It gives the substantive direction, from closure of the subset to subgroup, and it asks both that the ambient permutation group be finite and that the product set be equal to the subset rather than contained in it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6f4386058090 · pair key e918085ccd21.
Related, but states something else (1)
Subgroup. mul_mem related
theorem Subgroup.mul_mem {G : Type*} [Group G] (H : Subgroup G) {x y : G} : x ∈ H → y ∈ H → x * y ∈ H
Mathlib.Algebra.Group.Subgroup.Defs · lines 441–442
How it differs: It records that a subgroup is closed under the group operation, the easy direction of the passage, but it only unfolds what Lean's subgroup structure already carries.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 54ead3a9f51e · pair key 223a1a260c89.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Basic properties and terminology ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The degree of a group of permutations of a finite set is the number of elements in the set. Show all
Fintype. card more general
def Fintype.card (α : Type*) [Fintype α] : ℕ
Mathlib.Data.Fintype.Card · lines 40–41
Why more general: Lean counts the elements of any finite type; the passage attaches that count, taken at the set a permutation group acts on, to the group as its degree.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3de49dd4272c · pair key d5da4c207f24.
Nat. card more general
def Nat.card : Type* → ℕ
Mathlib.SetTheory.Cardinal.Finite · lines 39–40
Why more general: This is Lean's cardinality of an arbitrary type as a natural number, with the value zero on infinite types, which the passage's finite setting leaves aside.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 60e64b9162bf · pair key 48a40f64000d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Basic properties and terminology ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The order of a group (of any type) is the number of elements (cardinality) in the group. Show all
Nat. card more general
def Nat.card : Type* → ℕ
Mathlib.SetTheory.Cardinal.Finite · lines 39–40
Why more general: This is Lean's standard count of the elements of a type, and it is the quantity Mathlib treats as the order of a group, with the value zero reserved for a group with infinitely many elements.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6a811d517c9b · pair key f85f4be09d39.
Cardinal. mk more general
def Cardinal.mk : Type u → Cardinal
Mathlib.SetTheory.Cardinal.Defs · lines 88–89
Why more general: Lean's cardinal of a type gives the count of elements for an infinite group too, which matches the passage's wording about a group of any kind.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4cd0065a0564 · pair key 8a98b4f0f254.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Basic properties and terminology ◔ Partial
Partial: TauCeti states a special case (proved).
By Lagrange's theorem, the order of any finite permutation group of degree n must divide n! Show all
TauCeti. card_dvd_natCard_and_natCard_dvd_factorial_of_isPretransitive special case
theorem TauCeti.card_dvd_natCard_and_natCard_dvd_factorial_of_isPretransitive {α : Type*} [Fintype α] (G : Subgroup (Equiv.Perm α)) [MulAction.IsPretransitive (↥G) α] [Nonempty α] : Fintype.card α ∣ Nat.card ↥G ∧ Nat.card ↥G ∣ (Fintype.card α).factorial
TauCeti.GroupTheory.Perm.Recognition · lines 68–73
Why a special case: It reaches the passage's divisibility only for a permutation group that acts transitively on the points, a case the passage covers among others, and it also records that the number of points divides the order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key f931bc7c5a21 · pair key d7ec5cf01e5e.
Related, but states something else (2)
Subgroup. card_subgroup_dvd_card related
theorem Subgroup.card_subgroup_dvd_card {α : Type*} [Group α] (s : Subgroup α) : Nat.card ↥s ∣ Nat.card α
Mathlib.GroupTheory.Coset.Card · lines 69–70
How it differs: Lagrange's theorem gives that the order of the permutation group divides the order of the whole symmetric group, and turning that order into the factorial needs the separate count of the permutations.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 795a477c260e · pair key cc180eeb675f.
Nat. card_perm related
theorem Nat.card_perm {α : Type*} [Finite α] : Nat.card (Equiv.Perm α) = (Nat.card α).factorial
Mathlib.Data.Finite.Perm · lines 37–40
How it differs: It supplies the other half, the count of the permutations of a finite set, but on its own it says nothing about a subgroup.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ed2c9f4a1d0c · pair key 3fa698f38a2c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Basic properties and terminology ✓ Formalized
Formalized: Mathlib states this exactly (proved).
By Lagrange's theorem, the order of any finite permutation group of degree n must divide n! since n-factorial is the order of the symmetric group Sn. Show all
Nat. card_perm exact match
theorem Nat.card_perm {α : Type*} [Finite α] : Nat.card (Equiv.Perm α) = (Nat.card α).factorial
Mathlib.Data.Finite.Perm · lines 37–40
Note: Lean writes the order of the group of permutations of a finite set as the factorial of the number of elements of that set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a3ecc4670cd0 · pair key ff413ba860ed.
Fintype. card_perm exact match
theorem Fintype.card_perm {α : Type*} [DecidableEq α] [Fintype α] : Fintype.card (Equiv.Perm α) = (Fintype.card α).factorial
Mathlib.Data.Fintype.Perm · lines 156–157
Note: This is the same count written with Lean's Fintype cardinality, which needs decidable equality on the letters for the enumeration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 950a2509371f · pair key 4dda9f085638.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Notation ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
Since permutations are bijections of a set , they can be represented by Cauchy's two-line notation. Show all
Equiv. Perm close match
abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)
Mathlib.Logic.Equiv.Defs · lines 94–95
Why close, not exact: Lean's permutation type packages each self-map of M with its inverse map and the two round-trip identities, which is how it records a one-to-one onto self-map.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8b213fc6a05a · pair key 63ca67cea2e2.
Equiv. bijective more general
theorem Equiv.bijective {α : Sort u} {β : Sort v} (e : α ≃ β) : Function.Bijective ⇑e
Mathlib.Logic.Equiv.Defs · line 181
Why more general: The declaration is stated for an equivalence between two sorts, and the passage is the case where both are the same set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 6b51e2532160 · pair key 93770218e2a9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Notation ◔ Partial
Partial: TauCeti states a special case (a definition).
Since permutations are bijections of a set, they can be represented by Cauchy's two-line notation.[4] Show all
TauCeti. permutationWordEquiv special case
def TauCeti.permutationWordEquiv (n : ℕ) : Equiv.Perm (Fin n) ≃ { w // w.Perm (List.finRange n) }
TauCeti.GroupTheory.Perm.List · lines 26–45
Why a special case: The library writes the notation in its one-line form, for the points of a finite initial segment taken in their natural order, so the upper line of the passage's display is left implicit.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 0e063f896fe3 · pair key b470105ce380.
Related, but states something else (1)
TauCeti. permutationWordEquiv_apply_coe related
theorem TauCeti.permutationWordEquiv_apply_coe (n : ℕ) (σ : Equiv.Perm (Fin n)) : ↑((TauCeti.permutationWordEquiv n) σ) = List.ofFn ⇑σ
TauCeti.GroupTheory.Perm.List · lines 49–52
How it differs: It unfolds the representation, giving the row attached to a permutation as the list of its values, and so restates what the preceding construction means.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key e8de04aa3f82 · pair key 6a234e3ff9ab.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Notation ◔ Partial
Partial: TauCeti states a special case (proved).
This notation lists each of the elements of M in the first row, and for each element, its image under the permutation below it in the second row. Show all
TauCeti. permutationWordEquiv_apply_coe special case
theorem TauCeti.permutationWordEquiv_apply_coe (n : ℕ) (σ : Equiv.Perm (Fin n)) : ↑((TauCeti.permutationWordEquiv n) σ) = List.ofFn ⇑σ
TauCeti.GroupTheory.Perm.List · lines 49–52
Why a special case: The library states the content of the lower line only, for the points of a finite initial segment in their natural order, so the upper line of the passage's display is carried by that fixed order rather than written out.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key c9086ef2e8ac · pair key a4c05d568550.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Notation ✕ Not formalized
If σ is a permutation of the set M = {x 1 , x 2 , …, x n } then, σ = ( x 1 x 2 x 3 ⋯ x n σ (x 1 )σ (x 2 )σ (x 3 )⋯ σ (x n )) . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 80dd24158e41). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Related, but states something else (1)
TauCeti. permutationWordEquiv related
def TauCeti.permutationWordEquiv (n : ℕ) : Equiv.Perm (Fin n) ≃ { w // w.Perm (List.finRange n) }
TauCeti.GroupTheory.Perm.List · lines 26–45
How it differs: It records a permutation of Fin n as the word of its images, which its docstring calls one-line notation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 13f82dfa776d · pair key 650212d15ac2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
For instance, a particular permutation of the set {1, 2, 3, 4, 5} can be written as σ = ( 1 2 3 4 5 2 5 4 3 1 ) ; this means that σ satisfies σ(1) = 2, σ(2) = 5, σ(3) = 4, σ(4) = 3, and σ(5) = 1. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 6dd83e085d12). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Notation ✕ Not formalized
The elements of M need not appear in any special order in the first row , so the same permutation could also be written as Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt ab80e1712dc0). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
List. formPerm_rotate related
theorem List.formPerm_rotate {α : Type*} [DecidableEq α] (l : List α) : l.Nodup → ∀ (n : ℕ), (l.rotate n).formPerm = l.formPerm
Mathlib.GroupTheory.Perm.List · lines 225–232
How it differs: It says that rotating the list of a cycle leaves the permutation it denotes unchanged.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d9b8d639d901 · pair key 8887507bb208.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
The elements of M need not appear in any special order in the first row, so the same permutation could also be written as σ = ( 3 2 5 1 4 4 5 1 2 3 ) . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt e1915c569ec3). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · main statement · Notation ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Permutations are also often written in cycle notation (cyclic form)[5] so that given the set M = {1, 2, 3, 4}, a permutation g of M with g(1) = 2, g(2) = 4, g(4) = 1 and g(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4) since 3 is left unchanged; if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124). Show all
List. formPerm more general
def List.formPerm {α : Type*} [DecidableEq α] : List α → Equiv.Perm α
Mathlib.GroupTheory.Perm.List · lines 50–51
Why more general: Lean turns a list into the permutation carrying each listed element to the next and wrapping round at the end, over an arbitrary carrier type and an arbitrary list.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 31c8821711aa · pair key d32ceba3151f.
Cycle. formPerm more general
def Cycle.formPerm {α : Type*} [DecidableEq α] (s : Cycle α) : s.Nodup → Equiv.Perm α
Mathlib.GroupTheory.Perm.Cycle.Concrete · lines 127–133
Why more general: Lean reads a cycle, a list taken up to rotation, as the permutation moving each of its entries to the next, for an arbitrary carrier type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c63fdc6ddd84 · pair key ef7983faa2f8.
Related, but states something else (1)
List. formPerm_apply_of_notMem related
theorem List.formPerm_apply_of_notMem {α : Type*} [DecidableEq α] {l : List α} {x : α} : x ∉ l → l.formPerm x = x
Mathlib.GroupTheory.Perm.List · lines 104–105
How it differs: It states that an element absent from the list is fixed by the permutation the list denotes.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 60b61cc3bd51 · pair key 254bb74b7540.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Notation ✕ Not formalized
The permutation written above in 2-line notation would be written in cycle notation as σ = (125)(34). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt bd2a4449e584). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (2)
List. formPerm related
def List.formPerm {α : Type*} [DecidableEq α] : List α → Equiv.Perm α
Mathlib.GroupTheory.Perm.List · lines 50–51
How it differs: It fixes what each of the two cycles denotes but asserts no equality between a given permutation and their product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 31520b518a2e · pair key 01edc2ead13f.
Equiv.Perm. cycleFactors related
def Equiv.Perm.cycleFactors {α : Type*} [Fintype α] [LinearOrder α] (f : Equiv.Perm α) : { l // l.prod = f ∧ (∀ g ∈ l, g.IsCycle) ∧ List.Pairwise Equiv.Perm.Disjoint l }
Mathlib.GroupTheory.Perm.Cycle.Factors · lines 460–462
How it differs: It produces for each permutation of a finite ordered carrier some list of pairwise disjoint cycles with that product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4179014e5ce5 · pair key 671920e47db7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
The product of two permutations is defined as their composition as functions, so σ ⋅ π is the function that maps any element x of the set to σ (π (x )) . Show all
Equiv.Perm. instMul exact match
instance Equiv.Perm.instMul {α : Type*} : Mul (Equiv.Perm α)
Mathlib.Algebra.Group.End · line 67
Note: This is the multiplication Lean puts on the permutations of a set, and Equiv.Perm.mul_def and Equiv.Perm.mul_apply fix its value as composition in the passage's order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 4147ee815439 · pair key d0b68bb6def3.
Equiv.Perm. mul_apply close match
theorem Equiv.Perm.mul_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)
Mathlib.Algebra.Group.End · lines 101–102
Why close, not exact: Lean states the value of the product at an arbitrary element, unfolding the product to the successive application of the two factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e39d4c0f1b67 · pair key 586274e45348.
Equiv.Perm. mul_def close match
theorem Equiv.Perm.mul_def {α : Type*} (f g : Equiv.Perm α) : f * g = Equiv.trans g f
Mathlib.Algebra.Group.End · lines 112–113
Why close, not exact: Lean unfolds the product of two permutations to the bundled composite in which the right factor acts first.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9fdd44f28ff1 · pair key 4c36ccfb5cee.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states a more general result (proved).
With this convention, the product is given by x σ ⋅ π = (x σ )π .[8] [9] [10] Show all
Equiv. trans_apply more general
theorem Equiv.trans_apply {α : Sort u} {β : Sort v} {γ : Sort w} (f : α ≃ β) (g : β ≃ γ) (a : α) : (f.trans g) a = g (f a)
Mathlib.Logic.Equiv.Defs · lines 244–245
Why more general: Lean writes the left-acting product as Equiv.trans and application as ordinary function application, and it allows the three sorts to be distinct.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 17f6bb8fc72b · pair key ad277afeffe6.
Related, but states something else (1)
Equiv.Perm. mul_apply related
theorem Equiv.Perm.mul_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)
Mathlib.Algebra.Group.End · lines 101–102
How it differs: This is the rule for the other convention, where the rightmost factor acts first, so the factors stand in the opposite order to the superscript product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 72e44676112c · pair key b689b7bcc1d8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Since the composition of two bijections always gives another bijection , the product of two permutations is again a permutation. Show all
Function.Bijective. comp exact match
theorem Function.Bijective.comp {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {g : β → φ} {f : α → β} : Function.Bijective g → Function.Bijective f → Function.Bijective (g ∘ f)
Mathlib.Logic.Function.Defs · lines 166–167
Note: Lean writes the composite with the circle operator and names the three sorts, which composability already requires.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f18bec6ebd80 · pair key fbfacf0b96cd.
Equiv. trans close match
def Equiv.trans {α : Sort u} {β : Sort v} {γ : Sort w} : α ≃ β → β ≃ γ → α ≃ γ
Mathlib.Logic.Equiv.Defs · lines 160–161
Why close, not exact: Lean packages each bijection with its inverse and the two round-trip proofs, and builds the composite in the same packaged form.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8c785fb871af · pair key 89388f524db7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Since the composition of two bijections always gives another bijection, the product of two permutations is again a permutation. Show all
Equiv. trans more general
def Equiv.trans {α : Sort u} {β : Sort v} {γ : Sort w} : α ≃ β → β ≃ γ → α ≃ γ
Mathlib.Logic.Equiv.Defs · lines 160–161
Why more general: Lean defines composition for equivalences between three possibly different types, and permutations of one set are the case the passage uses.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fee518c93606 · pair key a1b679ae28af.
Function.Bijective. comp more general
theorem Function.Bijective.comp {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {g : β → φ} {f : α → β} : Function.Bijective g → Function.Bijective f → Function.Bijective (g ∘ f)
Mathlib.Logic.Function.Defs · lines 166–167
Why more general: The lemma speaks of maps between three sorts; the passage uses the case where all three are the set M.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ff347132366a · pair key 5144906246a2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Composition of permutations–the group product ✕ Not formalized
P = ( 1 2 3 4 5 2 4 1 3 5 ) and Q = ( 1 2 3 4 5 5 4 3 2 1 ) , the product QP is: QP = ( 1 2 3 4 5 5 4 3 2 1 ) ( 1 2 3 4 5 2 4 1 3 5 ) = ( 2 4 1 3 5 4 2 5 3 1 ) ( 1 2 3 4 5 2 4 1 3 5 ) = ( 1 2 3 4 5 4 2 5 3 1 ) . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0a975be25340). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Composition of permutations–the group product ✕ Not formalized
Thus, the above product would be given by: Q ⋅ P = (15)(24) ⋅ (1243) = (1435). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0f5dc801bf0c). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Since function composition is associative , so is the product operation on permutations: (σ ⋅ π ) ⋅ ρ = σ ⋅ (π ⋅ ρ ) . Show all
Function. comp_assoc exact match
theorem Function.comp_assoc {α : Sort u₁} {β : Sort u₂} {φ : Sort u₃} {δ : Sort u₄} (f : φ → δ) (g : β → φ) (h : α → β) : (f ∘ g) ∘ h = f ∘ g ∘ h
Mathlib.Logic.Function.Defs · lines 28–29
Note: Lean writes composition with the circle operator and names the four sorts the three maps run between.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c704d9ccf9ea · pair key e991a6b01e52.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Composition of permutations–the group product ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Since function composition is associative, so is the product operation on permutations: (σ ⋅ π ) ⋅ ρ = σ ⋅ (π ⋅ ρ ) . Show all
Equiv.Perm. permGroup more general
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why more general: The instance also supplies the unit and inverses, which this passage does not assert.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7a0fd27ec908 · pair key d0f042028ae7.
Equiv. trans_assoc more general
theorem Equiv.trans_assoc {α : Sort u} {β : Sort v} {γ : Sort w} {δ : Sort*} (ab : α ≃ β) (bc : β ≃ γ) (cd : γ ≃ δ) : (ab.trans bc).trans cd = ab.trans (bc.trans cd)
Mathlib.Logic.Equiv.Defs · lines 317–318
Why more general: Lean states it for equivalences between four possibly different types and in the left-to-right composition order.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7dc1ed485093 · pair key fb8f93dfdeca.
mul_assoc more general
theorem mul_assoc {G : Type*} [Semigroup G] (a b c : G) : a * b * c = a * (b * c)
Mathlib.Algebra.Group.Semigroup · lines 161–162
Why more general: The lemma is stated for an arbitrary semigroup, and permutations of a set form one under composition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2e65acb89d29 · pair key a68492bf0e16.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The identity permutation, which maps every element of the set to itself, is the neutral element for this product. Show all
Equiv.Perm. permGroup more general
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why more general: The instance also supplies associativity and inverses, which this passage does not assert.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8ca78e89caa4 · pair key bbdf476e7eda.
Equiv. refl_trans states part
theorem Equiv.refl_trans {α : Sort u} {β : Sort v} (e : α ≃ β) : (Equiv.refl α).trans e = e
Mathlib.Logic.Equiv.Defs · line 311
Why only part: Lean states it for equivalences between two types, and it gives only the one side of neutrality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ae41ff820b0e · pair key 80a6c6759fcd.
Equiv. trans_refl states part
theorem Equiv.trans_refl {α : Sort u} {β : Sort v} (e : α ≃ β) : e.trans (Equiv.refl β) = e
Mathlib.Logic.Equiv.Defs · line 307
Why only part: Lean states it for equivalences between two types, and it gives only the other side of neutrality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 91a939d45a4d · pair key 4aff4a5edb14.
Related, but states something else (1)
Equiv.Perm. one_apply related
theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x
Mathlib.Algebra.Group.End · lines 104–105
How it differs: It unfolds how the unit of the permutation group acts on a point, without saying that it is neutral for the product.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 19feecd17d79 · pair key 3c6fd52e8d00.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In two-line notation, the identity is ( 1 2 3 ⋯ n 1 2 3 ⋯ n ) . Show all
Equiv.Perm. one_apply more general
theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x
Mathlib.Algebra.Group.End · lines 104–105
Why more general: Mathlib records the identity permutation by its value at each point, over an arbitrary type, where the article lays the same values out as two rows of an array.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 61b0d97a9678 · pair key 424a108c3155.
Equiv. refl more general
def Equiv.refl (α : Sort*) : α ≃ α
Mathlib.Logic.Equiv.Defs · line 138
Why more general: Mathlib builds the identity equivalence of any type; this is the object whose array the article displays.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, low confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key da34c04ed2f5 · pair key bd078def1e64.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Neutral element and inverses ◔ Partial
Partial: Mathlib states part of this (proved).
In cycle notation, e = (1)(2)(3)...(n) which by convention is also denoted by just (1) or even (). Show all
Cycle. formPerm_subsingleton states part
theorem Cycle.formPerm_subsingleton {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Subsingleton) : s.formPerm ⋯ = 1
Mathlib.GroupTheory.Perm.Cycle.Concrete · lines 140–147
Why only part: Mathlib reads a cycle of at most one entry as the identity permutation; the long product of one-entry cycles has no single lemma of its own.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ad616769c597 · pair key c97b5e2676b7.
List. formPerm_nil states part
theorem List.formPerm_nil {α : Type*} [DecidableEq α] : [].formPerm = 1
Mathlib.GroupTheory.Perm.List · lines 54–55
Why only part: Mathlib spells the cycle by the list of its entries and reads the empty one as the identity permutation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0acdb90f58ab · pair key a9cf4fd8d293.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Since bijections have inverses , so do permutations, and the inverse σ−1 of σ is again a permutation. Show all
Function. bijective_iff_has_inverse more general
theorem Function.bijective_iff_has_inverse {α : Sort u} {β : Sort v} {f : α → β} : Function.Bijective f ↔ ∃ g, Function.LeftInverse g f ∧ Function.RightInverse g f
Mathlib.Logic.Function.Basic · lines 591–593
Why more general: Mathlib proves the equivalence in both directions, and the article's claim is its left-to-right reading.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ac0d7f1e969d · pair key a90617169eb9.
Equiv. ofBijective more general
def Equiv.ofBijective {α : Sort u} {β : Sort v} (f : α → β) : Function.Bijective f → α ≃ β
Mathlib.Logic.Equiv.Defs · lines 819–823
Why more general: Mathlib packages a bijective map as an equivalence, which carries the backward map together with both cancellation laws.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c30f0c591df4 · pair key 321a6221e1b0.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Since bijections have inverses, so do permutations , and the inverse σ−1 of σ is again a permutation. Show all
Equiv.Perm. permGroup more general
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why more general: Mathlib records the permutations of a type as a group, whose inversion operation supplies each permutation's inverse alongside the group laws.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 20e97011f093 · pair key f72eca09074d.
Equiv. symm more general
def Equiv.symm {α : Sort u} {β : Sort v} : α ≃ β → β ≃ α
Mathlib.Logic.Equiv.Defs · line 144
Why more general: Mathlib defines inversion for an equivalence between two sorts; permutations are the case where the two sorts are one set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9dd6a834814c · pair key 0dd518193c9b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Since bijections have inverses, so do permutations, and the inverse σ−1 of σ is again a permutation. Show all
Equiv.Perm. permGroup more general
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Why more general: Mathlib makes the permutations of a type into a group, so inversion lands back in the permutations of that same type, along with the group laws.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cbb0973e8c2e · pair key c291c907b93f.
Equiv. symm more general
def Equiv.symm {α : Sort u} {β : Sort v} : α ≃ β → β ≃ α
Mathlib.Logic.Equiv.Defs · line 144
Why more general: Mathlib defines inversion for an equivalence between two sorts, and its type already says where the inverse lives.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 02b6eb7d1934 · pair key df23799df4f2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states this exactly (proved).
Explicitly, whenever σ(x)=y one also has σ−1(y)=x. Show all
Equiv.Perm. inv_eq_iff_eq exact match
theorem Equiv.Perm.inv_eq_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : f⁻¹ x = y ↔ x = f y
Mathlib.Algebra.Group.End · lines 133–134
Note: Mathlib writes each equation with the applied term on the left and the bare point on the right; the two sides of the equivalence are the article's, written that way round.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3a345702e1c6 · pair key 41a6acbbe87e.
Equiv.Perm. eq_inv_iff_eq exact match
theorem Equiv.Perm.eq_inv_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : x = f⁻¹ y ↔ f x = y
Mathlib.Algebra.Group.End · lines 130–131
Note: This is Mathlib's companion statement, with the equation of the left-hand side turned round.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 00d4caa47296 · pair key a2efbe190499.
Equiv. apply_eq_iff_eq_symm_apply more general
theorem Equiv.apply_eq_iff_eq_symm_apply {α : Sort u} {β : Sort v} {x : α} {y : β} (f : α ≃ β) : f x = y ↔ x = f.symm y
Deprecated at this commit, in favour of Equiv. eq_symm_apply .
Mathlib.Logic.Equiv.Defs · lines 299–300
Why more general: Mathlib states the rule for an equivalence between two sorts, of which a permutation is the one-set case.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ee284888637 · pair key 5ceb81c34cc7.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Neutral element and inverses ✕ Not formalized
For instance ( 1 2 3 4 5 2 5 4 3 1 ) −1 = ( 2 5 4 3 1 1 2 3 4 5 ) = ( 1 2 3 4 5 5 1 4 3 2 ) . Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 8f66a3a7444f). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else (1)
Equiv.Perm. inv_eq_iff_eq related
theorem Equiv.Perm.inv_eq_iff_eq {α : Type*} {f : Equiv.Perm α} {x y : α} : f⁻¹ x = y ↔ x = f y
Mathlib.Algebra.Group.End · lines 133–134
How it differs: This is the pointwise rule by which each value of an inverse is read off, but the five-element permutation the article writes out is defined nowhere in the universe, and assembling its inverse from the rule needs that definition and extensionality, not decidable arithmetic alone (PD8).
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 93a5c856f4ea · pair key 16b1c781a01b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states this exactly (proved).
To obtain the inverse of a single cycle, we reverse the order of its elements. Show all
Cycle. formPerm_reverse exact match
theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹
Mathlib.GroupTheory.Perm.Cycle.Concrete · lines 173–176
Note: Mathlib reads a cycle with distinct entries as a permutation and equates the turned-round cycle's permutation with the inverse of the original's.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key aa36e4124348 · pair key 9063e6e0bdbe.
List. formPerm_reverse more general
theorem List.formPerm_reverse {α : Type*} [DecidableEq α] (l : List α) : l.reverse.formPerm = l.formPerm⁻¹
Mathlib.GroupTheory.Perm.List · lines 246–250
Why more general: Mathlib states the rule for every list of labels, reaching beyond the lists with distinct entries that spell cycles.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bc72abdcde6e · pair key 613d6d162b54.
Equiv. swap_inv special case
theorem Equiv.swap_inv {α : Type*} [DecidableEq α] (x y : α) : (Equiv.swap x y)⁻¹ = Equiv.swap x y
Mathlib.Algebra.Group.End · lines 525–526
Why a special case: A cycle of length two turned round is itself, and this lemma is the article's rule at that length.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 20e0a2da501a · pair key 6abfa9c749cc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Thus, (125)−1 = (521) = (152). Show all
Cycle. formPerm_reverse more general
theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹
Mathlib.GroupTheory.Perm.Cycle.Concrete · lines 173–176
Why more general: Mathlib's cycles are taken up to rotation, so the backwards reading of the example's cycle and the spelling that starts at 1 are one and the same object here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a8a09ea68853 · pair key c06b7d02d4fd.
List. formPerm_reverse more general
theorem List.formPerm_reverse {α : Type*} [DecidableEq α] (l : List α) : l.reverse.formPerm = l.formPerm⁻¹
Mathlib.GroupTheory.Perm.List · lines 246–250
Why more general: Stated for lists rather than for cycles, so the reversed cycle comes out spelled from its last entry.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5f08060ac224 · pair key c8806a713c2d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (proved).
To obtain the inverse of a product of cycles, we first reverse the order of the cycles, and then we take the inverse of each as above. Show all
List. prod_inv_reverse more general
theorem List.prod_inv_reverse {G : Type*} [Group G] (L : List G) : L.prod⁻¹ = (List.map (fun x ↦ x⁻¹) L).reverse.prod
Mathlib.Algebra.BigOperators.Group.List.Basic · lines 312–314
Why more general: Written for a list of elements of an arbitrary group, of which the permutations of the article's set are one.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9ba44f912e8e · pair key 258b8af521b0.
mul_inv_rev special case
theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹
Mathlib.Algebra.Group.DivInvMonoid · lines 327–328
Why a special case: The two-factor instance of the recipe the sentence gives for a list of cycles of any length.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 630e29dccecd · pair key 1d7d1ef322fa.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Thus, [(125)(34)]−1 = (34)−1 (125)−1 = (43)(521) = (34)(152). Show all
mul_inv_rev more general
theorem mul_inv_rev {G : Type*} [DivisionMonoid G] (a b : G) : (a * b)⁻¹ = b⁻¹ * a⁻¹
Mathlib.Algebra.Group.DivInvMonoid · lines 327–328
Why more general: Written for any two elements of a group, which the example's two cycles are once the ambient permutation group is fixed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9b7f2f178cf1 · pair key 95a01a807f7c.
Cycle. formPerm_reverse states part
theorem Cycle.formPerm_reverse {α : Type*} [DecidableEq α] (s : Cycle α) (h : s.Nodup) : s.reverse.formPerm ⋯ = (s.formPerm h)⁻¹
Mathlib.GroupTheory.Perm.Cycle.Concrete · lines 173–176
Why only part: Covers the inversion of the three-element factor; the reordering of the two factors comes from the product rule instead.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 241bf4c3b493 · pair key b7d1da26b623.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Neutral element and inverses ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Having an associative product, an identity element, and inverses for all its elements, makes the set of all permutations of M into a group, Sym(M); a permutation group. Show all
Equiv.Perm. permGroup exact match
instance Equiv.Perm.permGroup {α : Type*} : Group (Equiv.Perm α)
Mathlib.Algebra.Group.End · lines 72–80
Note: Mathlib multiplies permutations by composing them with the right-hand factor acting first, the convention the article adopts, and the unit of the structure is the identity permutation.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 46a38df83f4e · pair key f20252903218.
Related, but states something else (1)
Equiv. Perm related
abbrev Equiv.Perm : Sort u_1 → Sort (max 1 u_1)
Mathlib.Logic.Equiv.Defs · lines 94–95
How it differs: Names the type of bijections of a set to itself, the carrier the sentence speaks of, while leaving the group structure to a separate declaration.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 80679e31e231 · pair key 759cca0ed685.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✓ Formalized
Formalized: Mathlib states a more general result (proved).
Consider the following set G1 of permutations of the set M = {1, 2, 3, 4}: e = (1)(2)(3)(4) = (1) This is the identity, the trivial permutation which fixes each element. Show all
Equiv.Perm. one_apply more general
theorem Equiv.Perm.one_apply {α : Type*} (x : α) : 1 x = x
Mathlib.Algebra.Group.End · lines 104–105
Why more general: Written for the unit of the permutations of any type; the article writes that unit in cycle notation as a product of one-point cycles.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 18a2ce1acf3a · pair key 08c0c4661ce8.
Related, but states something else (1)
List. formPerm_singleton related
theorem List.formPerm_singleton {α : Type*} [DecidableEq α] (x : α) : [x].formPerm = 1
Mathlib.GroupTheory.Perm.List · lines 58–59
How it differs: Accounts for the collapse of the one-point cycles in the article's notation, not for the behaviour of the resulting permutation at each point.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7c69ddf21508 · pair key ce7974d9deb2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✓ Formalized
Formalized: Mathlib states a more general result (proved).
a = (1 2)(3)(4) = (1 2) This permutation interchanges 1 and 2, and fixes 3 and 4. Show all
Equiv. swap_apply_def more general
theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x
Mathlib.Logic.Equiv.Basic · lines 648–649
Why more general: Gives the value of a transposition at every point as a two-way case split, so the untouched points fall out of its last branch.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a418b50d1401 · pair key be602e713616.
List. formPerm_pair states part
theorem List.formPerm_pair {α : Type*} [DecidableEq α] (x y : α) : [x, y].formPerm = Equiv.swap x y
Mathlib.GroupTheory.Perm.List · lines 66–67
Why only part: Identifies the article's cycle notation with Mathlib's transposition, without saying what either does at the remaining points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8dfbe1bdaa17 · pair key aeb67fc811d0.
Equiv. swap_apply_of_ne_of_ne states part
theorem Equiv.swap_apply_of_ne_of_ne {α : Sort*} [DecidableEq α] {a b x : α} : x ≠ a → x ≠ b → (Equiv.swap a b) x = x
Mathlib.Logic.Equiv.Basic · lines 659–660
Why only part: Covers the fixing of the two untouched points and says nothing about the exchange itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5aedae08b5b3 · pair key d034f0e7c2e2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✓ Formalized
Formalized: Mathlib states a more general result (proved).
b = (1)(2)(3 4) = (3 4) Like the previous one, but exchanging 3 and 4, and fixing the others. Show all
Equiv. swap_apply_def more general
theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x
Mathlib.Logic.Equiv.Basic · lines 648–649
Why more general: Gives the value of a transposition at every point as a two-way case split, so the untouched points fall out of its last branch.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3619ce4866a6 · pair key 59f8ee359d9a.
List. formPerm_pair states part
theorem List.formPerm_pair {α : Type*} [DecidableEq α] (x y : α) : [x, y].formPerm = Equiv.swap x y
Mathlib.GroupTheory.Perm.List · lines 66–67
Why only part: Identifies the article's cycle notation with Mathlib's transposition, without saying what either does at the remaining points.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3b3ebe88767e · pair key 82bfaec44b7d.
Equiv. swap_apply_of_ne_of_ne states part
theorem Equiv.swap_apply_of_ne_of_ne {α : Sort*} [DecidableEq α] {a b x : α} : x ≠ a → x ≠ b → (Equiv.swap a b) x = x
Mathlib.Logic.Equiv.Basic · lines 659–660
Why only part: Covers the fixing of the two untouched points and says nothing about the exchange itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3e441e692678 · pair key 0340b0d6d8fb.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ◔ Partial
With community edits: Partial. As published it is Formalized.
Partial, by a community edit: Mathlib states part of this (proved).
ab = (1 2)(3 4) This permutation, which is the composition of the previous two, exchanges simultaneously 1 with 2, and 3 with 4. Show all
Equiv.Perm. mul_apply states part
theorem Equiv.Perm.mul_apply {α : Type*} (f g : Equiv.Perm α) (x : α) : (f * g) x = f (g x)
Mathlib.Algebra.Group.End · lines 101–102
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why only part: Equiv.Perm.mul_apply states that a product of two permutations acts as their composite: apply the right factor first, then the left. That covers the clause that ab is the composition of the previous two permutations. It does not state the example's conclusion that this composite swaps 1 with 2 and 3 with 4 at the same time; that also needs how each transposition acts.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1524950d490a · pair key 5ed784f6ecbe.
Related, but states something else (1)
Equiv. swap_apply_def related
theorem Equiv.swap_apply_def {α : Sort*} [DecidableEq α] (a b x : α) : (Equiv.swap a b) x = if x = a then b else if x = b then a else x
Mathlib.Logic.Equiv.Basic · lines 648–649
How it differs: Gives the behaviour of each of the two factors on its own, whereas the sentence speaks of the single permutation their product is.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key cea59c176de5 · pair key 5565662d964c.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Examples ✕ Not formalized
G1 forms a group , since aa = bb = e, ba = ab, and abab = e. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 70b40524ef19). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples ◔ Partial
Partial: Mathlib states part of this (proved).
G1 forms a group, since aa = bb = e, ba = ab, and abab = e. Show all
Equiv. swap_mul_self states part
theorem Equiv.swap_mul_self {α : Type*} [DecidableEq α] (i j : α) : Equiv.swap i j * Equiv.swap i j = 1
Mathlib.Algebra.Group.End · lines 529–530
Why only part: The declaration is stated for an arbitrary transposition of any type with decidable equality.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 328b3f64c937 · pair key 27b307a9c12e.
Equiv.Perm.Disjoint. commute states part
theorem Equiv.Perm.Disjoint.commute {α : Type*} {f g : Equiv.Perm α} : f.Disjoint g → Commute f g
Mathlib.GroupTheory.Perm.Support · lines 63–71
Why only part: The hypothesis is checked point by point over the four labels, so no further result is needed.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 01f9eb02a4e4 · pair key 55824cfccd80.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Examples ✕ Not formalized
This permutation group is, as an abstract group, the Klein group V4. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 8becb6f25869). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples ✕ Not formalized
As another example consider the group of symmetries of a square. Let the vertices of a square be labeled 1, 2, 3 and 4 (counterclockwise around the square starting with 1 in the top left corner). The symmetries are determined by the images of the vertices, that can, in turn, be described by permutations. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 63124b5f2141). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✕ Not formalized
The rotation by 90° (counterclockwise) about the center of the square is described by the permutation (1234). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 15000d3cf5dd). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✕ Not formalized
The 180° and 270° rotations are given by (13)(24) and (1432), respectively. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 3008dd220fd6). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✕ Not formalized
The reflection about the horizontal line through the center is given by (12)(34) and the corresponding vertical line reflection is (14)(23). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 635ceb5f23ae). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Examples ✕ Not formalized
The reflection about the 1,3−diagonal line is (24) and reflection about the 2,4−diagonal is (13). Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 97d7bad2a1e6). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Examples ✓ Formalized
Formalized: TauCeti states a more general result (proved).
The only remaining symmetry is the identity (1)(2)(3)(4). Show all
TauCeti. mem_referenceSubgroup_four_two_iff more general
theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 205–228
Why more general: Lean numbers the vertices from zero where the article numbers them from one, and the criterion says a permutation belongs exactly when it commutes with the half turn, which pins the membership of the group elementwise.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 58338406b5be · pair key fe04c6e2551c.
Related, but states something else (1)
TauCeti. natCard_referenceSubgroup_four_two related
theorem TauCeti.natCard_referenceSubgroup_four_two : Nat.card ↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.natCard_referenceSubgroup_four_two._proof_1⟩) = 8
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Classification · lines 216–220
How it differs: It counts the symmetries of the square as eight but names none of them, so on its own it does not say which permutation completes the list.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 1e89cd38dbfe · pair key a58040a00d1f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Examples ✓ Formalized
Formalized: TauCeti states this up to a convention difference (a definition).
This permutation group is known, as an abstract group, as the dihedral group of order 8. Show all
TauCeti. referenceSubgroupFourTwoMulEquivDihedralGroup close match
def TauCeti.referenceSubgroupFourTwoMulEquivDihedralGroup : ↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroupFourTwoMulEquivDihedralGroup._proof_1⟩) ≃* DihedralGroup 4
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Dihedral · lines 41–85
Why close, not exact: The library indexes the dihedral family by the number of corners of the polygon, so its DihedralGroup 4 is the eight-element group the article names by its order, and a companion lemma sends the quarter turn to a rotation of that family.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 118c7488df63 · pair key 746a86938919.
Related, but states something else (1)
DihedralGroup. nat_card related
theorem DihedralGroup.nat_card {n : ℕ} : Nat.card (DihedralGroup n) = 2 * n
Mathlib.GroupTheory.SpecificGroups.Dihedral · lines 159–162
How it differs: It gives the size of the dihedral family as twice the index, which is what makes the target group here the one of order eight, but it asserts nothing about the square.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 70c1c6a72df5 · pair key e0fa1999f5fc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Group actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Let G be a group and M a nonempty set. An action of G on M is a function f: G × M → M such that Show all
MulAction more general
class MulAction (α : Type u_9) : Type u_10 → [Monoid α] → Type (max u_10 u_9)
Mathlib.Algebra.Group.Action.Defs · lines 133–135
Why more general: Lean carries the action as a curried scalar multiplication bundled together with its two axioms, and it allows the acting structure to be a monoid and the acted-on type to be empty, where the article fixes a group and a nonempty set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7b979ffd1b2f · pair key 4919704b1151.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Group actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Formalized by 2 parts together (more general):
one_smul Mathlib (proved) the identity element of the group leaves every point of the set where it is smul_smul Mathlib (proved) acting by h and then by g is the same as acting by the product gh
An action of G on M is a function f: G × M → M such that f(1, x) = x, for all x in M (1 is the identity (neutral) element of the group G), and f(g, f(h, x)) = f(gh, x), for all g,h in G and all x in M. Show all
MulAction more general
class MulAction (α : Type u_9) : Type u_10 → [Monoid α] → Type (max u_10 u_9)
Mathlib.Algebra.Group.Action.Defs · lines 133–135
Why more general: The class states the two conditions for a monoid acting on an arbitrary type, where the article imposes them on a group acting on a nonempty set, and it bundles the map in curried form with its proofs.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ce07ce162ac3 · pair key 9b7672606610.
one_smul states part
theorem one_smul (M : Type*) {α : Type*} [Monoid M] [MulAction M α] (b : α) : 1 • b = b
Mathlib.Algebra.Group.Action.Defs · line 416
Why only part: The equation is stated for a monoid acting on an arbitrary type, which covers a group acting on a nonempty set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key d6d76e239fa5 · pair key 1c9d35f920be.
smul_smul states part
theorem smul_smul {M : Type*} {α : Type*} [Monoid M] [MulAction M α] (a₁ a₂ : M) (b : α) : a₁ • a₂ • b = (a₁ * a₂) • b
Mathlib.Algebra.Group.Action.Defs · line 411
Why only part: The equation is stated for a monoid acting on an arbitrary type and is written with the iterated action on the left.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key fe3f936a128d · pair key 2a6567df4ecb.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Group actions ◔ Partial
Partial: Mathlib states part of this (a definition).
This pair of conditions can also be expressed as saying that the action induces a group homomorphism from G into Sym(M).[12] Show all
MulAction. toPermHom states part
def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α
Mathlib.Algebra.Group.Action.End · lines 184–187
Why only part: It builds the homomorphism out of an action but does not state the converse passage from a homomorphism back to an action, so it gives one direction of the stated equivalence.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 0aa656723e47 · pair key 4effd53f1d48.
MulAction. compHom states part
abbrev MulAction.compHom {M : Type*} {N : Type*} (α : Type*) [Monoid M] [MulAction M α] [Monoid N] : (N →* M) → MulAction N α
Mathlib.Algebra.Group.Action.Hom · lines 47–50
Why only part: It turns a homomorphism into an action by composing with an existing action, here the action of the permutations of M on M, and says nothing about the other direction.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78e5bef03534 · pair key 87d36cefb97f.
Related, but states something else (1)
MulAction. compHom_smul_def related
theorem MulAction.compHom_smul_def {E : Type*} {F : Type*} {G : Type*} [Monoid E] [Monoid F] [MulAction F G] (f : E →* F) (a : E) (x : G) : a • x = f a • x
Mathlib.Algebra.Group.Action.Hom · lines 59–62
How it differs: It records how the action built from a homomorphism acts, which supports the converse direction without itself asserting the equivalence.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 9dda4fd15667 · pair key 97d20a17c719.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Group actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Any such homomorphism is called a (permutation) representation of G on M. Show all
MonoidHom more general
structure MonoidHom (M : Type*) (N : Type*) [MulOne M] [MulOne N]
Mathlib.Algebra.Group.Hom.Defs · lines 366–367
Why more general: Lean has one type of homomorphism for monoids and groups alike, defined over arbitrary source and target, where the article fixes the source to be a group and the target to be the permutations of a set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 07d455c981b7 · pair key 42e1ffdd5cd2.
Equiv. permutationRepresentation special case
def Equiv.permutationRepresentation {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} : α ≃ Fin n → G →* Equiv.Perm (Fin n)
TauCeti.Algebra.GroupAction.PermutationRepresentation · lines 71–72
Why a special case: It names the notion the sentence defines but only constructs it for a finite point set read through a listing and only from an action, rather than for an arbitrary homomorphism.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key dd969f95312a · pair key 153d9886aaa2.
Related, but states something else (1)
MulAction. toPermHom related
def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α
Mathlib.Algebra.Group.Action.End · lines 184–187
How it differs: It produces one homomorphism of the kind the sentence names, but it defines a construction from an action rather than the notion itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 22fda1ded516 · pair key 763f069b9b9e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Group actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
For any permutation group, the action that sends (g, x) → g(x) is called the natural action of G on M. Show all
Subgroup. instMulActionSubtypeMem more general
instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α
Mathlib.Algebra.Group.Subgroup.Actions · line 32
Why more general: This is the instance Lean's resolution reaches for a subgroup of the permutations of M, sitting on top of the tautological action of all permutations on M, and it is stated for a subgroup of an arbitrary acting group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key ebd9a0480d67 · pair key e09e5027e6bc.
Equiv.Perm. applyMulAction special case
instance Equiv.Perm.applyMulAction (α : Type*) : MulAction (Equiv.Perm α) α
Mathlib.Algebra.Group.Action.End · lines 84–87
Why a special case: It supplies the natural action for the largest permutation group only; the action of a smaller permutation group is obtained from it by restriction.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 39d7d4d832ec · pair key 4e29cabea2c4.
Equiv.Perm. smul_def special case
theorem Equiv.Perm.smul_def {α : Type*} (f : Equiv.Perm α) (a : α) : f • a = f a
Mathlib.Algebra.Group.Action.End · line 90
Why a special case: It states the defining formula of that action for the full group of permutations rather than for an arbitrary permutation group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f2dedf307db8 · pair key 29efc31dc6c6.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Group actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In the example of the symmetry group of the square, the group's action on the set of vertices is the natural action. Show all
Subgroup. instMulActionSubtypeMem more general
instance Subgroup.instMulActionSubtypeMem {G : Type*} {α : Type*} [Group G] [MulAction G α] {S : Subgroup G} : MulAction (↥S) α
Mathlib.Algebra.Group.Subgroup.Actions · line 32
Why more general: In the library the symmetries of the square are a subgroup of the permutations of the four vertices, so the action spoken of in the example is the restricted one this instance provides, with no further identification required.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3be27bd61c99 · pair key 2b6656799fe9.
Related, but states something else (2)
TauCeti. referenceSubgroup_four_two related
theorem TauCeti.referenceSubgroup_four_two : TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ = Subgroup.closure {finRotate 4, Equiv.swap 0 2}
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 197–200
How it differs: It identifies the square's symmetry group as the subgroup of permutations of the four vertices generated by the quarter turn and a diagonal swap, but it says nothing about an action.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key e66c1a809b91 · pair key cd6584772710.
TauCeti.TransitiveGroupLabel. isPretransitive related
theorem TauCeti.TransitiveGroupLabel.isPretransitive {n : ℕ} {j : TauCeti.TransitiveGroupIndex n} {G : Subgroup (Equiv.Perm (Fin n))} : TauCeti.TransitiveGroupLabel j G → MulAction.IsPretransitive (↥G) (Fin n)
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 379–396
How it differs: It states transitivity of the action of a labelled permutation subgroup on the points, using the same restricted action, so it is a theorem about that action rather than the example's identification.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key e28a1e79f974 · pair key 6fa4bb5c1dc9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Group actions ✕ Not formalized
However, this group also induces an action on the set of four triangles in the square, which are: t1 = 234, t2 = 134, t3 = 124 and t4 = 123. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt b65040485544). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Group actions ✓ Formalized
Formalized: TauCeti states a more general result (proved).
It also acts on the two diagonals: d1 = 13 and d2 = 24. Show all
TauCeti. mem_referenceSubgroup_four_two_iff more general
theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 205–228
Why more general: Lean writes the pairing of opposite vertices as commuting with the shift by two, and gives both directions of the membership criterion, which is more than the passage asks for.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 12400adce8d8 · pair key 87512e2e382a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Transitive actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The action of a group G on a set M is said to be transitive if, for every two elements s, t of M, there is some group element g such that g(s) = t. Show all
MulAction. IsPretransitive more general
class MulAction.IsPretransitive (M : Type*) (α : Type*) [SMul M α] : Prop
Mathlib.Algebra.Group.Action.Pretransitive · lines 60–62
Why more general: Lean states the condition for an arbitrary scalar action, which is more general than a group acting on a set, and it leaves the carrier possibly empty just as the passage's condition does.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 746af94d032d · pair key d6443147b68e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transitive actions ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Equivalently, the set M forms a single orbit under the action of G.[13] Show all
MulAction. isPretransitive_iff_orbit_eq_univ close match
theorem MulAction.isPretransitive_iff_orbit_eq_univ {G : Type*} {X : Type*} [Group G] [MulAction G X] (a : X) : MulAction.IsPretransitive G X ↔ MulAction.orbit G a = Set.univ
Mathlib.GroupTheory.GroupAction.Transitive · lines 54–59
Why close, not exact: Lean encodes 'M is one orbit' as the orbit of an arbitrarily chosen point filling the whole carrier.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 73018ee5052b · pair key eb1b7564e6d9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Transitive actions ◔ Partial
Partial: TauCeti states part of this (proved).
Equivalently, the set M forms a single orbit under the action of G.[13] Of the examples above, the group {e, (1 2), (3 4), (1 2)(3 4)} of permutations of {1, 2, 3, 4} is not transitive (no group element takes 1 to 3) but the group of symmetries of a square is transitive on the vertices. Show all
TauCeti. isPretransitive_referenceSubgroup states part
theorem TauCeti.isPretransitive_referenceSubgroup (n : ℕ) (j : TauCeti.TransitiveGroupIndex n) : MulAction.IsPretransitive (↥(TauCeti.referenceSubgroup n j)) (Fin n)
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 315–344
Why only part: Lean proves this for every reference subgroup of degree at most five, the square's symmetry group being the one labelled 4T3.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 7af503bdef88 · pair key 06773f642467.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Transitive actions › Primitive actions ◐ Statement only
With community edits: Statement only. As published it is Not formalized.
Statement only, by a community edit: Mathlib states this up to a convention difference (statement only: the proof is not finished).
A permutation group G acting transitively on a non-empty finite set M is imprimitive if there is some nontrivial set partition of M that is preserved by the action of G, where "nontrivial" means that the partition isn't the partition into singleton sets nor the partition with only one part. Show all
MulAction. IsPreprimitive close match
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
Why close, not exact: Mathlib defines the complementary notion: an action is preprimitive if it is transitive and every block (a set whose translates are equal or disjoint) is empty, a singleton, or everything. Two convention differences: imprimitive means transitive but not preprimitive, and Mathlib uses blocks, not preserved partitions. These agree: each part of a preserved partition is a block, and a nonempty block's translates form one (IsBlock.isBlockSystem).
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 444d0acd6b06). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Transitive actions › Primitive actions ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Otherwise, if G is transitive but does not preserve any nontrivial partition of M, the group G is primitive. Show all
MulAction. IsPreprimitive more general
class MulAction.IsPreprimitive (G : Type*) (X : Type*) [SMul G X] : Prop
Mathlib.GroupTheory.GroupAction.Primitive · lines 92–95
Why more general: Lean defines this for an arbitrary scalar action rather than for a permutation group, which is more general, and records the condition through blocks, a block being a cell of an invariant partition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f9f6c4ad8559 · pair key 0c156dafd006.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Transitive actions › Primitive actions ✓ Formalized
Formalized: TauCeti states a more general result (proved).
For example, the group of symmetries of a square is imprimitive on the vertices: if they are numbered 1, 2, 3, 4 in cyclic order, then the partition {{1, 3}, {2, 4}} into opposite pairs is preserved by every group element. Show all
TauCeti. mem_referenceSubgroup_four_two_iff more general
theorem TauCeti.mem_referenceSubgroup_four_two_iff {σ : Equiv.Perm (Fin 4)} : σ ∈ TauCeti.referenceSubgroup 4 ⟨2, TauCeti.referenceSubgroup_four_two._proof_1⟩ ↔ ∀ (i : Fin 4), σ (i + 2) = σ i + 2
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Basic · lines 205–228
Why more general: Lean writes the pairing of opposite vertices as commuting with the shift by two and proves both directions of the membership criterion, which is more than the passage claims.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key a4b628a0b7e5 · pair key a6a3a4946a1d.
TauCeti. not_isPreprimitive_referenceSubgroup_four_two states part
theorem TauCeti.not_isPreprimitive_referenceSubgroup_four_two : ¬MulAction.IsPreprimitive (↥(TauCeti.referenceSubgroup 4 ⟨2, TauCeti.not_isPreprimitive_referenceSubgroup_four_two._proof_1⟩)) (Fin 4)
TauCeti.GroupTheory.Perm.TransitiveGroupLabel.Primitive · lines 65–68
Why only part: Lean names the square's symmetry group as the reference subgroup labelled 4T3 of the permutations of four points and records the article's property as the failure of its primitivity class, whose blocks are the cells of an invariant partition.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 09085f5056f0 · pair key 69d26b4775a5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Transitive actions › Primitive actions ✓ Formalized
Formalized: Mathlib states a more general result (proved).
On the other hand, the full symmetric group on a set M is always primitive. Show all
Equiv.Perm. instIsPreprimitive more general
instance Equiv.Perm.instIsPreprimitive {α : Type*} : MulAction.IsPreprimitive (Equiv.Perm α) α
Mathlib.GroupTheory.GroupAction.MultipleTransitivity · lines 527–528
Why more general: Lean phrases primitivity as a pretransitive action whose only blocks are the trivial ones, which is the block form of the article's condition that no nontrivial partition of M is preserved; the instance also covers infinite M, where the article defines primitivity only for a finite nonempty set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b7e26ce4a1d6 · pair key 7fafde875867.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Cayley's theorem ◔ Partial
With community edits: Partial. As published it is Formalized.
Partial, by a community edit: Mathlib states a special case (a definition).
Any group G can act on itself (the elements of the group being thought of as the set M) in many ways. Show all
Monoid. toMulAction special case
instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M
Mathlib.Algebra.Group.Action.Defs · lines 467–470
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
Why a special case: Monoid.toMulAction gives one action of a group on itself, the regular action by left multiplication. The passage says a group can act on itself in many ways, so this declaration is one special case of what the passage describes, not a more general statement that contains it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7e90ff88aa13 · pair key ed0d739b13a5.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Cayley's theorem ✓ Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
In particular, there is a regular action given by (left) multiplication in the group. Show all
Group. instTorsor close match
instance Group.instTorsor (G : Type*) [Group G] : Torsor G G
Mathlib.Algebra.Torsor.Defs · lines 85–88
Why close, not exact: Lean records a free and transitive action as a torsor structure, which carries the division operation of the action alongside the action itself; here the acting group and the acted-on set are both G, acting by multiplication.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 55f5cdcb0fc5 · pair key 8401917ebc88.
Monoid. toMulAction more general
instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M
Mathlib.Algebra.Group.Action.Defs · lines 467–470
Why more general: Lean's own docstring names this the regular action of a monoid on itself by left multiplication, so it is the object the passage defines, registered for any monoid.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 8bc61230944b · pair key 8dcff12e2d82.
MulAction.Regular. isPretransitive states part
instance MulAction.Regular.isPretransitive {G : Type*} [Group G] : MulAction.IsPretransitive G G
Mathlib.Algebra.Group.Action.Pretransitive · lines 82–83
Why only part: It states transitivity of the left regular action only, and says nothing about the freeness that regularity also requires.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 232b6af528e7 · pair key 7db7754f696d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Cayley's theorem ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
That is, f(g, x) = gx for all g and x in G. Show all
smul_eq_mul close match
theorem smul_eq_mul {α : Type*} [Mul α] (a b : α) : a • b = a * b
Mathlib.Algebra.Group.Action.Defs · line 72
Why close, not exact: Lean writes the regular action with the scalar dot, and this lemma unfolds g • x to the group product g * x, which is the passage's f(g, x) = gx.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key b0a6eaf42a62 · pair key 740e1c308fbb.
Monoid. toMulAction more general
instance Monoid.toMulAction (M : Type*) [Monoid M] : MulAction M M
Mathlib.Algebra.Group.Action.Defs · lines 467–470
Why more general: This is the action the passage is describing, defined in Lean for any monoid with the scalar product given by the multiplication.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a74b4150c058 · pair key cf6d284d7404.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Cayley's theorem ✓ Formalized
Formalized: Mathlib states this exactly (proved).
That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. Show all
Group. mulLeft_bijective exact match
theorem Group.mulLeft_bijective {G : Type*} [Group G] (a : G) : Function.Bijective fun x ↦ a * x
Mathlib.Algebra.Group.Units.Equiv · lines 115–116
Note: A bijection of G onto itself is a permutation of the set of elements of G, which is the second half of the passage's sentence.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 68cb977200fc · pair key fbc4151c683f.
Equiv. mulLeft exact match
def Equiv.mulLeft {G : Type*} [Group G] : G → Equiv.Perm G
Mathlib.Algebra.Group.Units.Equiv · lines 97–98
Note: Lean delivers the bijection as a permutation of G bundled with its inverse map and the two round-trip proofs, which is packaging of the same bijection; its docstring says left multiplication in a group is a permutation of the underlying type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 41bc1691d45b · pair key 263a81e0955a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Cayley's theorem ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. Each element of G can be thought of as a permutation in this way and so G is isomorphic to a permutation group; this is the content of Cayley's theorem. Show all
Equiv. mulLeft exact match
def Equiv.mulLeft {G : Type*} [Group G] : G → Equiv.Perm G
Mathlib.Algebra.Group.Units.Equiv · lines 97–98
Note: Lean's map takes an element of G and returns a permutation of G, the bijection x ↦ gx bundled with its inverse; its docstring says left multiplication in a group is a permutation of the underlying type.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c6268c53b55e · pair key 862288ba6290.
MulAction. toPermHom more general
def MulAction.toPermHom (G : Type*) (α : Type*) [Group G] [MulAction G α] : G →* Equiv.Perm α
Mathlib.Algebra.Group.Action.End · lines 184–187
Why more general: Lean's map is defined for an arbitrary action and asserts in addition that the assignment is a monoid homomorphism, which is structure beyond what the passage claims here.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 011b267285ea · pair key 2b635633efda.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Cayley's theorem ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
That is, f(g, x) = gx for all g and x in G. For each fixed g, the function fg(x) = gx is a bijection on G and therefore a permutation of the set of elements of G. Each element of G can be thought of as a permutation in this way and so G is isomorphic to a permutation group ; this is the content of Cayley's theorem. Show all
Equiv.Perm. subgroupOfMulAction more general
def Equiv.Perm.subgroupOfMulAction (G : Type*) (H : Type*) [Group G] [MulAction G H] [FaithfulSMul G H] : G ≃* ↥(MulAction.toPermHom G H).range
Mathlib.GroupTheory.Perm.Subgroup · lines 72–74
Why more general: Lean states Cayley's theorem for an arbitrary faithful action of G, and its docstring records that taking the acted-on set to be G recovers the usual statement; the image is a subgroup of the symmetric group of G, that is, a permutation group.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 512bd0cf6031 · pair key dd4b820a7139.
Related, but states something else (1)
Equiv. permutationRepresentation_injective related
theorem Equiv.permutationRepresentation_injective {G : Type*} {α : Type*} [Group G] [MulAction G α] {n : ℕ} [FaithfulSMul G α] (e : α ≃ Fin n) : Function.Injective ⇑e.permutationRepresentation
TauCeti.Algebra.GroupAction.PermutationRepresentation · lines 85–87
How it differs: It gives injectivity of the representation only; turning that into an isomorphism of G with its image needs a further theorem, and it also forces a finite numbering the passage does not impose.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab. Location key 6adc8c446ecb · pair key cad51e413fc2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting · Cayley's theorem ◔ Partial
Partial: Mathlib states part of this (proved).
For example, consider the group G1 acting on the set {1, 2, 3, 4} given above. Let the elements of this group be denoted by e, a, b and c = ab = ba. The action of G1 on itself described in Cayley's theorem gives the following permutation representation: fe ↦ (e)(a)(b)(c) fa ↦ (ea)(bc) fb ↦ (eb)(ac) fc ↦ (ec)(ab). Show all
MulAction. toPerm_one states part
theorem MulAction.toPerm_one (G : Type*) (α : Type*) [Group G] [MulAction G α] : MulAction.toPerm 1 = 1
Mathlib.Algebra.Group.Action.End · lines 194–196
Why only part: Lean states this for every group action; at the passage's action of G1 on itself it is the line for the identity element.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 64652a52a77a · pair key ea1f3c85cd27.
Related, but states something else (2)
IsKleinFour. eq_mul_of_ne_all related
theorem IsKleinFour.eq_mul_of_ne_all {G : Type*} [Group G] [IsKleinFour G] {x y z : G} : x ≠ 1 → y ≠ 1 → x ≠ y → z ≠ 1 → z ≠ x → z ≠ y → z = x * y
Mathlib.GroupTheory.SpecificGroups.KleinFour · lines 124–129
Community Agent The pipeline said states part ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: IsKleinFour.eq_mul_of_ne_all says that in a Klein four-group the third non-identity element is the product of the other two. That is a multiplication fact used to work out the lines for a, b and c, but it does not state any of the four permutation lines of the example. You also need x times x equals the identity, and the action itself.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key e3bb1a88afe0 · pair key 5246a5170b2e.
IsKleinFour. mul_self related
theorem IsKleinFour.mul_self {G : Type*} [Group G] [IsKleinFour G] (x : G) : x * x = 1
Mathlib.GroupTheory.SpecificGroups.KleinFour · lines 111–112
How it differs: It gives x·x = e, one half of the exchange of the identity with the multiplier, and reaches any of the three lines only together with the unit law.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key f03e10e8636d · pair key 6b1fc1aa64ec.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Isomorphisms of permutation groups ◔ Partial
Partial: Mathlib states a special case (a definition).
If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that Show all
Action. mkIso special case
def Action.mkIso {V : Type*} [CategoryTheory.Category V] {G : Type*} [Monoid G] {M N : Action V G} (f : M.V ≅ N.V) : autoParam (∀ (g : G), CategoryTheory.CategoryStruct.comp (M.ρ g).asHom f.hom = CategoryTheory.CategoryStruct.comp f.hom (N.ρ g).asHom) Action.mkIso._auto_1 → (M ≅ N)
Mathlib.CategoryTheory.Action.Basic · lines 154–161
Why a special case: The library carries no notion that lets the two acting groups differ by an isomorphism, so this covers only the case of one group acting on both sets.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7540b5ce789f · pair key 83afebda6fb2.
Related, but states something else (1)
MulActionHom related
structure MulActionHom {M : Type*} {N : Type*} : (M → N) → (X : Type u_5) → [SMul M X] → (Y : Type u_6) → [SMul N Y] → Type (max u_5 u_6)
Mathlib.GroupTheory.GroupAction.Hom · lines 84–88
How it differs: It bundles a map satisfying the compatibility equation, but it requires neither that the map be a bijection nor that the map between the acting monoids be an isomorphism of groups.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 5bde3f078fc8 · pair key 3510a38c5df4.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Isomorphisms of permutation groups ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
If G and H are two permutation groups on sets X and Y with actions f1 and f2 respectively, then we say that G and H are permutation isomorphic (or isomorphic as permutation groups) if there exists a bijective map λ : X → Y and a group isomorphism ψ : G → H such that λ(f1(g, x)) = f2(ψ(g), λ(x)) for all g in G and x in X. Show all
MulActionHom more general
structure MulActionHom {M : Type*} {N : Type*} : (M → N) → (X : Type u_5) → [SMul M X] → (Y : Type u_6) → [SMul N Y] → Type (max u_5 u_6)
Mathlib.GroupTheory.GroupAction.Hom · lines 84–88
Why more general: The library states the requirement for an arbitrary map between the two acting monoids, which covers the article's case where that map is an isomorphism of groups.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key bd2eabf64d99 · pair key a8ed2cb3cd77.
MulActionSemiHomClass more general
class MulActionSemiHomClass (F : Type*) {M : outParam (Type*)} {N : outParam (Type*)} : outParam (M → N) → (X : outParam (Type*)) → (Y : outParam (Type*)) → [SMul M X] → [SMul N Y] → [FunLike F X Y] → Prop
Mathlib.GroupTheory.GroupAction.Hom · lines 125–129
Why more general: This is the predicate form of the same requirement, stated for any type of morphisms carrying it.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 81b732ec7242 · pair key 2ca2e7d062b0.
MulActionHom. map_smul special case
theorem MulActionHom.map_smul {M' : Type*} {X : Type*} [SMul M' X] {Y : Type*} [SMul M' Y] (f : X →ₑ[id] Y) (m : M') (x : X) : f (m • x) = m • f x
Mathlib.GroupTheory.GroupAction.Hom · lines 194–195
Why a special case: It fixes the transporting map to be the identity, so it covers only the sub-case where the two groups are the same.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 229f425cc762 · pair key c11307914dcc.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Isomorphisms of permutation groups ✕ Not formalized
If X = Y this is equivalent to G and H being conjugate as subgroups of Sym(X).[15] Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 328946b5296b). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Isomorphisms of permutation groups ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
The special case where G = H and ψ is the identity map gives rise to the concept of equivalent actions of a group. Show all
Action. mkIso more general
def Action.mkIso {V : Type*} [CategoryTheory.Category V] {G : Type*} [Monoid G] {M N : Action V G} (f : M.V ≅ N.V) : autoParam (∀ (g : G), CategoryTheory.CategoryStruct.comp (M.ρ g).asHom f.hom = CategoryTheory.CategoryStruct.comp f.hom (N.ρ g).asHom) Action.mkIso._auto_1 → (M ≅ N)
Mathlib.CategoryTheory.Action.Basic · lines 154–161
Why more general: The library states this for an arbitrary ambient category, so it also covers linear representations, while at types it is the article's notion.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 78c165739f2b · pair key eeed11cb5cb6.
Related, but states something else (1)
MulActionHom. map_smul related
theorem MulActionHom.map_smul {M' : Type*} {X : Type*} [SMul M' X] {Y : Type*} [SMul M' Y] (f : X →ₑ[id] Y) (m : M') (x : X) : f (m • x) = m • f x
Mathlib.GroupTheory.GroupAction.Hom · lines 194–195
How it differs: It records the compatibility equation for a map that is not required to be a bijection, so it does not carry the sameness of the two actions.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 7f675266cae3 · pair key 6d09a0389986.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Isomorphisms of permutation groups ✕ Not formalized
In the example of the symmetries of a square given above, the natural action on the set {1,2,3,4} is equivalent to the action on the triangles. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt abe1b7ba1fc9). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Construction · supporting · Isomorphisms of permutation groups ✕ Not formalized
The bijection λ between the sets is given by i ↦ ti. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 9a783f438db2). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Isomorphisms of permutation groups ✕ Not formalized
The natural action of group G1 above and its action on itself (via left multiplication) are not equivalent as the natural action has fixed points and the second action does not. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt df02de76ab7c). Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Oligomorphic groups ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by Show all
Pi. mulAction more general
instance Pi.mulAction {ι : Type*} {α : ι → Type*} (M : Type*) {m : Monoid M} [(i : ι) → MulAction M (α i)] : MulAction M ((i : ι) → α i)
Mathlib.Algebra.Group.Action.Pi · lines 98–100
Why more general: The library builds the action on an arbitrary indexed product of possibly different factors, which covers the n-fold product of one set.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 46d16d8e8284 · pair key 51074df929b5.
Pi. smul_apply more general
theorem Pi.smul_apply {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] (a : α) (f : (i : ι) → M i) (i : ι) : (a • f) i = a • f i
Mathlib.Algebra.Notation.Pi.Defs · line 134
Why more general: This gives the defining formula of the product action for an arbitrary index type and family of factors.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 40363f06e2a6 · pair key a54b531538c8.
Action. diagonal special case
abbrev Action.diagonal (G : Type u) [Monoid G] : ℕ → Action (Type u) G
Mathlib.CategoryTheory.Action.Concrete · lines 99–100
Why a special case: It fixes the factor to be the group itself, so it covers only that instance of the construction.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 2e3d05e637f2 · pair key dc847c39eed2.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Oligomorphic groups ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
When a group G acts on a set S, the action may be extended naturally to the Cartesian product Sn of S, consisting of n-tuples of elements of S: the action of an element g on the n-tuple (s1, ..., sn) is given by g(s1, ..., sn) = (g(s1), ..., g(sn)). Show all
Pi. mulAction more general
instance Pi.mulAction {ι : Type*} {α : ι → Type*} (M : Type*) {m : Monoid M} [(i : ι) → MulAction M (α i)] : MulAction M ((i : ι) → α i)
Mathlib.Algebra.Group.Action.Pi · lines 98–100
Why more general: Lean builds the action on an arbitrary dependent product over an arbitrary index type, so the n-fold power of one set is the constant-fibre case over Fin n.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 3e201050e710 · pair key a7f6d9026ae9.
Pi. instSMul more general
instance Pi.instSMul {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] : SMul α ((i : ι) → M i)
Mathlib.Algebra.Notation.Pi.Defs · line 131
Why more general: This is the underlying coordinatewise scalar multiplication on a dependent product, stated for any index type rather than for a fixed tuple length.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key 1079c7d7c920 · pair key ffdc044625f0.
Pi. smul_apply more general
theorem Pi.smul_apply {ι : Type*} {α : Type*} {M : ι → Type*} [(i : ι) → SMul α (M i)] (a : α) (f : (i : ι) → M i) (i : ι) : (a • f) i = a • f i
Mathlib.Algebra.Notation.Pi.Defs · line 134
Why more general: Lean records the coordinate equation for an arbitrary index type and dependent fibres, and the passage's tuple identity is its reading at index Fin n with constant fibre S.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived. Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key a8c4037d1101 · pair key f9abb96487b4.
Action. diagonal special case
abbrev Action.diagonal (G : Type u) [Monoid G] : ℕ → Action (Type u) G
Mathlib.CategoryTheory.Action.Concrete · lines 99–100
Why a special case: The acted-on set is fixed to be the group itself with its regular action, where the passage allows any set S.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, medium confidence. Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC). Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a. Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2. Location key c4c0cdc9ae5d · pair key 6efc708a395a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Oligomorphic groups ✕ Not formalized
The group G is said to be oligomorphic if the action on Sn has only finitely many orbits for every positive integer n. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 4 candidates examined (receipt bcb81f115275). Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗