Existing in Mathlib · Algebra
Sylow Conjugacy and Counting Theorems
Let p be prime. If a group G has only finitely many Sylow p-subgroups, Mathlib separately proves that any two of them are conjugate and that their number is congruent to 1 modulo p.
- Sylow subgroups
- group conjugation
- pretransitive actions
- fixed points
- orbit counting
- modular cardinality
Exact theorem
Exact Mathlib statement
theorem card_sylow_modEq_one (p : ℕ) (G : Type*) [Group G] [Fact p.Prime] [Finite (Sylow p G)] : Nat.card (Sylow p G) ≡ 1 [MOD p]The theorem at a glance
Sylow conjugacy and counting at a glance
A visual guide to the theorem's hypotheses, structure, and conclusion; the exact statement gives the formal detail.
Sylow conjugacy and counting at a glance

Detailed visual description
The upper theorem spine states the shared prime and finiteness hypotheses. A conjugacy section places several distinct subgroup emblems on one circular G-action orbit, while a separate counting section isolates one fixed subgroup and groups the remaining action orbits into p-divisible packets before the congruence endpoint. A scope footer excludes uniqueness, exact enumeration, and Sylow I.
Statement structure
Statement and scope
Read the exact Mathlib declaration
This map summarizes the statement's structure; the exact Mathlib declaration remains authoritative.
One conjugacy orbit and an open-ended modular count

Detailed visual description
The left system places six visually identical subgroup tokens directly on one closed directional track, with no center, root, or preferred token. The separate right system uses one token of the same design as a fixed contribution under a self-returning action path. Four nonfixed action rails expose different-sized partial windows of identical tokens and disappear cleanly behind solid portals at both ends, so the pixels do not choose a numerical value of p or display a complete p-element packet. The two systems encode conjugacy and modular counting without asserting a unique Sylow subgroup, an exact enumeration formula, finiteness of G, a Sylow-I construction, or the usual index-divisibility clause.
Why it matters
A mathematical landmark
The second and third Sylow theorems organize maximal p-subgroups both geometrically and arithmetically. These Mathlib generalizations isolate two enduring ideas: conjugation makes the finite Sylow family homogeneous, and a fixed-point count forces its cardinality into the residue class one modulo p.
ProofAtlas record
What has been checked
Mathlib is the source of the theorem; the local Lean replay and page review are separate.
Claim boundary
No new theorem is claimed
This checked artifact is bound only to Mathlib's counting declaration card_sylow_modEq_one: for prime p and a group G with finitely many Sylow p-subgroups, Nat.card (Sylow p G) is congruent to 1 modulo p. The overview mentions the separate upstream instance Sylow.isPretransitive_of_finite only as mathematical context; that conjugacy declaration is not part of this artifact's recorded declaration set. The checked endpoint does not make a Sylow subgroup unique or canonical, give an exact enumeration formula, include the divisibility-by-index clause sometimes grouped into Sylow III, establish existence or containment from Sylow I, or require G itself to be finite.
- This artifact checks only card_sylow_modEq_one; the separate conjugacy instance Sylow.isPretransitive_of_finite appears only as contextual background.
- Pretransitivity says any two Sylow p-subgroups are related by conjugation; it does not say there is a unique Sylow p-subgroup.
- The modular declaration says the finite cardinality is congruent to 1 modulo p; it gives neither an exact enumeration formula nor the separate divisibility-by-index conclusion.
- Neither selected declaration is Sylow's first theorem, and neither asserts existence of Sylow subgroups of a prescribed order.
- The formal hypotheses require [Finite (Sylow p G)], not [Finite G].
- ProofAtlas is indexing existing Mathlib declarations, and generated explanations and visuals are not proof evidence.
Source and local evidence
Where the theorem comes from
- Existing declaration
card_sylow_modEq_onein mathlib- Relationship
- The checked artifact is the upstream declaration itself
- Local Lean evidence
artifact.library.mathlib.sylow-second-third-theorems.v001