Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Profinite groups and local subgroup conditions

Definition
LocalConjugacy_Groups

by burkh4rt · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

group-theorylocal-conjugacyprofinite-groups

Shared group-theoretic definitions for the paper: pronilpotence, prosupersolvability, prosolvability, pro-ppp groups, profinite Hall and Sylow subgroups, conjugacy, local conjugacy, local containment, supplements, internal semidirect products, normal intersections, and fixed points. Mathlib supplies the underlying groups, topology, subgroups, quotients, complements, normality, and actions.

Definition code
import Mathlib

/-!
# Profinite local conjugacy: the common language

This module reuses Mathlib's `ProfiniteGrp`, `Subgroup`, quotient groups,
`OpenNormalSubgroup`, `Group.IsNilpotent`, `Group.IsSolvable`, `IsPGroup`,
`MulAut.conj`, `Subgroup.IsComplement'`, `Subgroup.Normal`, and action fixed points.
Only concepts without an appropriate interface at the pinned revision are added.
All subgroups inherit their topology. Every source occurrence of a closed subgroup
is accompanied by a closedness hypothesis in the theorem using it.

Conjugation is on the left: `conjugate g H = g H g⁻¹`; the paper writes this as
`H^(g⁻¹)`. Existential conjugacy and local inclusion do not depend on this choice.
The finite cyclic-factor series below is equivalent to finite supersolvability:
normality is required in the whole group, and repeated terms are harmless.
-/

namespace LocalConjugacy

/-- Every finite set generates a finite subgroup. This is an algebraic
condition, separate from the topology on the group. -/
def LocallyFiniteGroup (G : Type*) [Group G] : Prop :=
  ∀ s : Set G, s.Finite → (Subgroup.closure s : Set G).Finite

/-- A finite invariant series with cyclic factors (supersolvability). -/
def Supersolvable (G : Type*) [Group G] : Prop :=
  ∃ (n : ℕ) (s : ℕ → Subgroup G), s 0 = ⊥ ∧ s n = ⊤ ∧ Monotone s ∧
    (∀ i, (s i).Normal) ∧ ∀ i < n, ∃ g : G, s (i + 1) = s i ⊔ Subgroup.zpowers g

/-- Every continuous finite quotient is nilpotent. For profinite groups this
is the standard definition of pronilpotence. -/
def Pronilpotent (G : Type*) [Group G] [TopologicalSpace G] : Prop :=
  ∀ U : OpenNormalSubgroup G, Group.IsNilpotent (G ⧸ U.toSubgroup)

/-- Every open-normal quotient is supersolvable. This is used only for profinite
groups, where these quotients are finite. -/
def Prosupersolvable (G : Type*) [Group G] [TopologicalSpace G] : Prop :=
  ∀ U : OpenNormalSubgroup G, Supersolvable (G ⧸ U.toSubgroup)

/-- Every continuous finite quotient is solvable. -/
def Prosolvable (G : Type*) [Group G] [TopologicalSpace G] : Prop :=
  ∀ U : OpenNormalSubgroup G, Group.IsSolvable (G ⧸ U.toSubgroup)

/-- A pro-`p` group; this does not assert that elements have finite order. -/
def IsProP (p : ℕ) (G : Type*) [Group G] [TopologicalSpace G] : Prop :=
  ∀ U : OpenNormalSubgroup G, IsPGroup p (G ⧸ U.toSubgroup)

/-- The prime divisors of a finite group's order belong to `π`. -/
def HasPrimes (π : Set ℕ) (G : Type*) [Group G] : Prop :=
  ∀ p : ℕ, p.Prime → p ∣ Nat.card G → p ∈ π

/-- A finite Hall subgroup: its order has primes in `π`, its index outside `π`. -/
def IsHall {G : Type*} [Group G] (π : Set ℕ) (H : Subgroup G) : Prop :=
  HasPrimes π H ∧ ∀ p : ℕ, p.Prime → p ∣ H.index → p ∉ π

/-- A closed Hall subgroup of a profinite group, tested in every finite quotient. -/
def IsHallPro {G : Type*} [Group G] [TopologicalSpace G]
    (π : Set ℕ) (H : Subgroup G) : Prop :=
  IsClosed (H : Set G) ∧ ∀ U : OpenNormalSubgroup G,
    IsHall π (H.map (QuotientGroup.mk' U.toSubgroup))

/-- A closed subgroup of `H` that is maximal among its closed pro-`p`
subgroups. `P` and `H` are both represented as subgroups of the ambient group. -/
def IsSylowPro (p : ℕ) {G : Type*} [Group G] [TopologicalSpace G]
    (H P : Subgroup G) : Prop :=
  P ≤ H ∧ IsClosed (P : Set G) ∧ IsProP p P ∧
    ∀ Q : Subgroup G, Q ≤ H → IsClosed (Q : Set G) → IsProP p Q → P ≤ Q → Q = P

/-- Left conjugation of a subgroup. -/
def conjugate {G : Type*} [Group G] (g : G) (H : Subgroup G) : Subgroup G :=
  H.map (MulAut.conj g)

/-- Conjugacy in the ambient group. -/
def Conjugate {G : Type*} [Group G] (H K : Subgroup G) : Prop :=
  ∃ g : G, conjugate g H = K

/-- For each prime, a Sylow subgroup of `H` is conjugate to one of `K`. -/
def LocallyConjugate {G : Type*} [Group G] [TopologicalSpace G]
    (H K : Subgroup G) : Prop :=
  ∀ p : ℕ, p.Prime → ∃ P Q : Subgroup G,
    IsSylowPro p H P ∧ IsSylowPro p K Q ∧ Conjugate P Q

/-- `H` contains a conjugate of a Sylow subgroup of `J` for every prime. -/
def LocallyContains {G : Type*} [Group G] [TopologicalSpace G]
    (H J : Subgroup G) : Prop :=
  ∀ p : ℕ, p.Prime → ∃ P : Subgroup G, IsSylowPro p J P ∧
    ∃ g : G, conjugate g P ≤ H

/-- Setwise supplement; with `N` normal this is equivalent to `N ⊔ H = ⊤`. -/
def Supplements {G : Type*} [Group G] (N H : Subgroup G) : Prop :=
  ∀ g : G, ∃ n ∈ N, ∃ h ∈ H, n * h = g

/-- Internal semidirect product, with `N` the normal factor. -/
def Splits {G : Type*} [Group G] (N J : Subgroup G) : Prop :=
  N.Normal ∧ N.IsComplement' J

/-- `N ∩ H` is normal in `N`, not just normal in `H`. -/
def IntersectionNormal {G : Type*} [Group G] (N H : Subgroup G) : Prop :=
  ((N ⊓ H).subgroupOf N).Normal

/-- A subgroup fixes at least one common point. -/
def HasFixedPoint {G Ω : Type*} [Group G] [MulAction G Ω] (H : Subgroup G) : Prop :=
  (MulAction.fixedPoints H Ω).Nonempty

/-- Local fixed points, allowing a different point for each prime. -/
def SylowFixedPoints {G Ω : Type*} [Group G] [TopologicalSpace G]
    [MulAction G Ω] (H : Subgroup G) : Prop :=
  ∀ p : ℕ, p.Prime → ∃ P : Subgroup G,
    IsSylowPro p H P ∧ HasFixedPoint (Ω := Ω) P

/-- The finite quotients have cyclic image of a single topological generator. -/
def Procyclic (G : Type*) [Group G] [TopologicalSpace G] : Prop :=
  ∃ g : G, Dense (Subgroup.zpowers g : Set G)


end LocalConjugacy
Source
Michael C. Burkhart, Local conjugacy in prosolvable groups, arXiv:2609.37678v1, https://arxiv.org/pdf/2609.37678v1, §§1–4, pp. 1–8. Adapted in part from the author’s local Apache-2.0 Lean development.
Read-back

What the Lean code literally says, in plain math · GPT-6 family (exact model variant not exposed)

LocallyFiniteGroup. For any group GGG, this property says that for every finite subset s⊆Gs\subseteq Gs⊆G, the underlying set of the subgroup generated algebraically by sss is finite. The empty subset is included, and there is no topology or finiteness assumption on GGG.

Supersolvable. For any group GGG, this property says that there exist n∈Nn\in\mathbb Nn∈N and a sequence (Si)i∈N(S_i)_{i\in\mathbb N}(Si​)i∈N​ of subgroups of GGG such that S0={1}S_0=\{1\}S0​={1}, Sn=GS_n=GSn​=G, Si≤SjS_i\le S_jSi​≤Sj​ whenever i≤ji\le ji≤j, every SiS_iSi​ is normal in GGG, and for every i<ni<ni<n there exists g∈Gg\in Gg∈G with Si+1=Si∨⟨g⟩S_{i+1}=S_i\vee\langle g\rangleSi+1​=Si​∨⟨g⟩, where the join is the subgroup generated by the two subgroups and ⟨g⟩={gz:z∈Z}\langle g\rangle=\{g^z:z\in\mathbb Z\}⟨g⟩={gz:z∈Z}. The normality and monotonicity conditions apply to the whole infinite sequence, so all terms from nnn onward equal GGG. The value n=0n=0n=0 is allowed and then forces GGG to be trivial; equal consecutive terms and infinite cyclic factors are allowed, and GGG is not assumed finite.

Pronilpotent. For a group GGG equipped with an arbitrary topology, this property says that for every subgroup U≤GU\le GU≤G whose underlying set is open and which is normal in GGG, the abstract quotient group G/UG/UG/U is nilpotent: its upper central series reaches the whole quotient at some natural-number stage, which may depend on UUU and may be zero. Neither finiteness of the quotients nor compactness, separation, or continuity of the group operations is assumed.

Prosupersolvable. For a group GGG equipped with an arbitrary topology, this property says that for every open normal subgroup U≤GU\le GU≤G, there exist n∈Nn\in\mathbb Nn∈N and subgroups SiS_iSi​ of G/UG/UG/U, indexed by all i∈Ni\in\mathbb Ni∈N, such that S0={1}S_0=\{1\}S0​={1}, Sn=G/US_n=G/USn​=G/U, the sequence is increasing, every SiS_iSi​ is normal in G/UG/UG/U, and for each i<ni<ni<n there is g∈G/Ug\in G/Ug∈G/U with Si+1=Si∨⟨g⟩S_{i+1}=S_i\vee\langle g\rangleSi+1​=Si​∨⟨g⟩. The witnesses may depend on UUU; n=0n=0n=0 and repeated terms are permitted. Neither the quotients nor their cyclic factors are required to be finite, and no compactness, separation, or continuity of group operations is assumed.

Prosolvable. For a group GGG equipped with an arbitrary topology, this property says that every quotient G/UG/UG/U by an open normal subgroup U≤GU\le GU≤G is solvable: its derived series equals the trivial subgroup at some natural-number stage, which may depend on UUU and may be zero. No finiteness of quotients, compactness, separation, or continuity of group operations is assumed.

IsProP. For any natural number ppp and any group GGG equipped with an arbitrary topology, this property says that for every open normal subgroup U≤GU\le GU≤G and every x∈G/Ux\in G/Ux∈G/U, there exists k∈Nk\in\mathbb Nk∈N such that xpk=1x^{p^k}=1xpk=1. The integer kkk may depend on UUU and xxx. The definition does not assume ppp is prime, does not require finite quotients, and assumes no continuity of group operations, compactness, or separation. In particular, p=0p=0p=0 makes the condition automatic by choosing k=1k=1k=1, while p=1p=1p=1 requires every such quotient to be trivial.

HasPrimes. For a set π⊆N\pi\subseteq\mathbb Nπ⊆N and a group GGG, this property says that every prime natural number dividing card⁡N(G)\operatorname{card}_{\mathbb N}(G)cardN​(G) belongs to π\piπ, where card⁡N\operatorname{card}_{\mathbb N}cardN​ is the ordinary cardinality for a finite type and is zero for an infinite type. Thus an infinite GGG requires π\piπ to contain every prime, since every prime divides zero; for a trivial GGG the condition is vacuous. The set π\piπ may also contain nonprime natural numbers, which this definition does not test.

IsHall. For any group GGG, any set π⊆N\pi\subseteq\mathbb Nπ⊆N, and any subgroup H≤GH\le GH≤G, this property says both that every prime dividing card⁡N(H)\operatorname{card}_{\mathbb N}(H)cardN​(H) lies in π\piπ and that every prime dividing the natural-number index [G:H]N[G:H]_{\mathbb N}[G:H]N​ lies outside π\piπ. Here infinite cardinality and infinite index are represented by zero. Consequently an infinite HHH requires all primes to belong to π\piπ, an infinite index requires all primes to lie outside π\piπ, and these two kinds of infinitude cannot occur together under this property. No finiteness, normality, or topology is otherwise assumed, and nonprime members of π\piπ have no effect.

IsHallPro. For any group GGG equipped with an arbitrary topology, any set π⊆N\pi\subseteq\mathbb Nπ⊆N, and any subgroup H≤GH\le GH≤G, this property says that HHH is closed in GGG and, for every open normal subgroup U≤GU\le GU≤G, its image H‾U={hU:h∈H}≤G/U\overline H_U=\{hU:h\in H\}\le G/UHU​={hU:h∈H}≤G/U satisfies the following two conditions: every prime dividing card⁡N(H‾U)\operatorname{card}_{\mathbb N}(\overline H_U)cardN​(HU​) belongs to π\piπ, and every prime dividing [G/U:H‾U]N[G/U:\overline H_U]_{\mathbb N}[G/U:HU​]N​ lies outside π\piπ. Infinite cardinality or index is encoded as zero, so an infinite image requires every prime in π\piπ, an infinite index requires every prime outside π\piπ, and both cannot occur for the same image. There is no finiteness, compactness, separation, or continuity assumption on GGG, and HHH is not required to be normal.

IsSylowPro. For any natural number ppp, any group GGG equipped with an arbitrary topology, and subgroups H,P≤GH,P\le GH,P≤G, this property says that P≤HP\le HP≤H, PPP is closed in GGG, every quotient P/VP/VP/V by an open normal subgroup VVV of PPP has the property that each element xxx satisfies xpk=1x^{p^k}=1xpk=1 for some k∈Nk\in\mathbb Nk∈N, and PPP is maximal under inclusion among the closed subgroups of GGG contained in HHH with that quotient property: if Q≤HQ\le HQ≤H is closed in GGG, every quotient of QQQ by an open normal subgroup has that property, and P≤QP\le QP≤Q, then Q=PQ=PQ=P. The topologies on PPP and QQQ are inherited from GGG. The subgroup HHH need not be closed, ppp need not be prime, and no compatible topological-group structure or finite quotients are assumed. For p=0p=0p=0 the quotient property is automatic; for p=1p=1p=1 it means all open-normal quotients are trivial. Maximality is only against containing subgroups and does not assert that PPP contains every subgroup with the property.

conjugate. For any group GGG, element g∈Gg\in Gg∈G, and subgroup H≤GH\le GH≤G, this definition returns the subgroup gHg−1={ghg−1:h∈H}gHg^{-1}=\{ghg^{-1}:h\in H\}gHg−1={ghg−1:h∈H}, the image of HHH under conjugation by ggg. There are no topological assumptions.

Conjugate. For any group GGG and subgroups H,K≤GH,K\le GH,K≤G, this property says that there exists g∈Gg\in Gg∈G with {ghg−1:h∈H}=K\{ghg^{-1}:h\in H\}=K{ghg−1:h∈H}=K. The conjugating element is taken from the ambient group GGG and is not required to belong to either subgroup; there are no topological assumptions.

LocallyConjugate. For a group GGG equipped with an arbitrary topology and subgroups H,K≤GH,K\le GH,K≤G, this property says that for every prime natural number ppp there exist subgroups P≤HP\le HP≤H and Q≤KQ\le KQ≤K, both closed in GGG, and g∈Gg\in Gg∈G with gPg−1=QgPg^{-1}=QgPg−1=Q. Each of PPP and QQQ, with its topology inherited from GGG, must have the property that every element xxx of each quotient by an open normal subgroup satisfies xpk=1x^{p^k}=1xpk=1 for some k∈Nk\in\mathbb Nk∈N; moreover, PPP is maximal by inclusion among closed subgroups of GGG contained in HHH with that property, and QQQ is maximal by inclusion among such subgroups contained in KKK. All witnesses may depend on ppp, and the quantifier includes every prime without a divisibility restriction. Neither HHH nor KKK must be closed, and no finiteness, compactness, separation, or continuity of group operations is assumed.

LocallyContains. For a group GGG equipped with an arbitrary topology and subgroups H,J≤GH,J\le GH,J≤G, this property says that for every prime natural number ppp there exist a subgroup P≤JP\le JP≤J, closed in GGG, and an element g∈Gg\in Gg∈G such that gPg−1≤HgPg^{-1}\le HgPg−1≤H. For the inherited topology on PPP, every element xxx in every quotient of PPP by an open normal subgroup must satisfy xpk=1x^{p^k}=1xpk=1 for some k∈Nk\in\mathbb Nk∈N, and PPP must be maximal by inclusion among the closed subgroups of GGG contained in JJJ with that property. Witnesses may depend on ppp, and every prime is included without a divisibility restriction. The definition does not require J≤HJ\le HJ≤H, closedness of HHH or JJJ, finite quotients, or compatibility of the topology with the group operations.

Supplements. For any group GGG and subgroups N,H≤GN,H\le GN,H≤G, this property says that every g∈Gg\in Gg∈G can be expressed as g=nhg=nhg=nh for some n∈Nn\in Nn∈N and h∈Hh\in Hh∈H, in that order. No uniqueness, normality, trivial intersection, or topology is required.

Splits. For any group GGG and subgroups N,J≤GN,J\le GN,J≤G, this property says that NNN is normal in GGG and that the multiplication map N×J→GN\times J\to GN×J→G, (n,j)↦nj(n,j)\mapsto nj(n,j)↦nj, is bijective; equivalently, every element of GGG has exactly one such ordered factorization. There are no topological or finiteness assumptions, and normality of JJJ is not required.

IntersectionNormal. For any group GGG and subgroups N,H≤GN,H\le GN,H≤G, this property says that the subgroup N∩HN\cap HN∩H, viewed as a subgroup of NNN, is normal in NNN. Equivalently, for every n∈Nn\in Nn∈N and x∈N∩Hx\in N\cap Hx∈N∩H, the element nxn−1nxn^{-1}nxn−1 belongs to N∩HN\cap HN∩H. Neither NNN nor HHH is required to be normal in GGG, and there are no topological assumptions.

HasFixedPoint. For any group GGG, any type Ω\OmegaΩ with a left action of GGG, and any subgroup H≤GH\le GH≤G, this property says that there exists ω∈Ω\omega\in\Omegaω∈Ω such that h⋅ω=ωh\cdot\omega=\omegah⋅ω=ω for every h∈Hh\in Hh∈H. No topology or continuity of the action is assumed. The type Ω\OmegaΩ is allowed to be empty, in which case the property is false; when HHH is trivial, the property is exactly nonemptiness of Ω\OmegaΩ.

SylowFixedPoints. For a group GGG equipped with an arbitrary topology, a type Ω\OmegaΩ with a left action of GGG, and a subgroup H≤GH\le GH≤G, this property says that for every prime natural number ppp there exist a subgroup P≤HP\le HP≤H, closed in GGG, and a point ω∈Ω\omega\in\Omegaω∈Ω fixed by every element of PPP. With its inherited topology, PPP must have the property that every element xxx in each quotient by an open normal subgroup satisfies xpk=1x^{p^k}=1xpk=1 for some k∈Nk\in\mathbb Nk∈N, and PPP must be maximal by inclusion among closed subgroups of GGG contained in HHH with that property. Both PPP and ω\omegaω may depend on ppp; no common fixed point for the different primes is required. Every prime is quantified over, so the property is false for empty Ω\OmegaΩ. There is no topology on Ω\OmegaΩ, continuity assumption on the action or group operations, closedness assumption on HHH, or finiteness assumption.

Procyclic. For any group GGG equipped with an arbitrary topology, this property says that there exists g∈Gg\in Gg∈G for which the set {gz:z∈Z}\{g^z:z\in\mathbb Z\}{gz:z∈Z} is dense in GGG, meaning that its topological closure is all of GGG. No finiteness, compactness, separation, or continuity of group operations is assumed; in particular, with the indiscrete topology every group satisfies the property.

Human review
  • Endorsed by Shuze Chen · Sep 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by burkh4rt · Sep 30, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me