Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 2.1

Proved
LocalConjugacy.proposition_2_1

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

group-theorylocal-conjugacynonabelian-cohomologyprofinite-groups

For a profinite group JJJ and a locally finite, discrete JJJ-group NNN that is also a ppp-group, suppose Q≤JQ\leq JQ≤J is a procyclic p0p_0p0​-group for some prime p0≠pp_0\neq pp0​=p and that J0⊴JJ_0\trianglelefteq JJ0​⊴J. If φ∈Z1(J0,N)\varphi\in Z^1(J_0,N)φ∈Z1(J0​,N) is QQQ-invariant, then there exists ψ∈Z1(J0,N)\psi\in Z^1(J_0,N)ψ∈Z1(J0​,N) with ψ∼φ\psi\sim\varphiψ∼φ such that ψq=ψ\psi^q=\psiψq=ψ for all q∈Qq\in Qq∈Q. Furthermore, ψ(q)=1\psi(q)=1ψ(q)=1 for all q∈J0∩Qq\in J_0\cap Qq∈J0​∩Q.

As stipulated in §1.2, subgroup notation includes closedness, and a discrete JJJ-group has a continuous action by automorphisms.

Preamble
import Definitions.Def_LocalConjugacy_Cohomology

/-
Proposition 2.1: discrete coefficients may be infinite but are locally finite.
The new cocycle is fixed literally by Q and is trivial on J₀ ∩ Q.

This is an open draft target. The deliberate `sorry` is the target proof hole;
all definitions and the structural proofs on which the statement rests compile
without admitted proofs.
-/
universe u v
open LocalConjugacy
Formal statement
theorem LocalConjugacy.proposition_2_1 {J : ProfiniteGrp.{u}} {N : Type v} [Group N]
    [TopologicalSpace N] [MulDistribMulAction J N] [IsTopologicalGroup N] [DiscreteTopology N]
    [ContinuousSMul J N] (hfinite : LocallyFiniteGroup N) (p p₀ : ℕ) (hp : p.Prime) (hp₀ : p₀.Prime) (hne : p₀ ≠ p)
    (hN : IsPGroup p N) (J₀ Q : Subgroup J) [J₀.Normal]
    (hJ₀ : IsClosed (J₀ : Set J)) (hQ : IsClosed (Q : Set J))
    (hcyclic : Procyclic Q) (hpro : IsProP p₀ Q)
    (f : Cocycle (N := N) J₀) (hinv : InvariantUnder Q J₀ f) :
    ∃ g : Cocycle (N := N) J₀, Cohomologous f g ∧
      (∀ (q : J) (hq : q ∈ Q) (x : J) (hx : x ∈ J₀)
        (hqx : q⁻¹ * x * q ∈ J₀),
        q • g.toFun ⟨q⁻¹ * x * q, hqx⟩ = g.toFun ⟨x, hx⟩) ∧
      ∀ (q : J) (hq : q ∈ Q) (hq₀ : q ∈ J₀), g.toFun ⟨q, hq₀⟩ = 1 := by sorry
Source
Michael C. Burkhart, Local conjugacy in prosolvable groups, arXiv:2609.37678v1 (29 September 2026), https://arxiv.org/pdf/2609.37678v1, p. 3, Proposition 2.1; standing conventions in §1.2, pp. 2–3.
Read-back

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

For every profinite group JJJ in universe uuu and discrete topological group NNN in universe vvv equipped with a jointly continuous action of JJJ by group automorphisms, suppose every finite subset of NNN generates a finite subgroup. Let p,p0p,p_0p,p0​ be distinct natural primes, suppose that for every n∈Nn\in Nn∈N there exists k∈Nk\in\mathbb Nk∈N with npk=1n^{p^k}=1npk=1, and let J0,Q≤JJ_0,Q\le JJ0​,Q≤J be closed subgroups with J0J_0J0​ normal in JJJ. Assume that some q0∈Qq_0\in Qq0​∈Q has its integer powers dense in QQQ, and that every quotient Q/UQ/UQ/U by an open normal subgroup UUU of QQQ has every element killed by some power of p0p_0p0​. Let f:J0→Nf:J_0\to Nf:J0​→N be a continuous map satisfying f(xy)=f(x)(x⋅f(y))f(xy)=f(x)(x\cdot f(y))f(xy)=f(x)(x⋅f(y)) for all x,y∈J0x,y\in J_0x,y∈J0​. Suppose that for every q∈Qq\in Qq∈Q there exists nq∈Nn_q\in Nnq​∈N such that q⋅f(q−1xq)=nq−1f(x)(x⋅nq)q\cdot f(q^{-1}xq)=n_q^{-1}f(x)(x\cdot n_q)q⋅f(q−1xq)=nq−1​f(x)(x⋅nq​) for every x∈J0x\in J_0x∈J0​ with q−1xq∈J0q^{-1}xq\in J_0q−1xq∈J0​. Then there exists a continuous map g:J0→Ng:J_0\to Ng:J0​→N satisfying g(xy)=g(x)(x⋅g(y))g(xy)=g(x)(x\cdot g(y))g(xy)=g(x)(x⋅g(y)) and all three following conditions: there is one n∈Nn\in Nn∈N with g(x)=n−1f(x)(x⋅n)g(x)=n^{-1}f(x)(x\cdot n)g(x)=n−1f(x)(x⋅n) for every x∈J0x\in J_0x∈J0​; for every q∈Qq\in Qq∈Q and x∈J0x\in J_0x∈J0​ with q−1xq∈J0q^{-1}xq\in J_0q−1xq∈J0​, one has q⋅g(q−1xq)=g(x)q\cdot g(q^{-1}xq)=g(x)q⋅g(q−1xq)=g(x); and g(q)=1g(q)=1g(q)=1 for every q∈Q∩J0q\in Q\cap J_0q∈Q∩J0​. Normality of J0J_0J0​ ensures that the conjugate-membership condition in these identities always holds for x∈J0x\in J_0x∈J0​. The finite-generation hypothesis permits NNN to be infinite and includes the empty generating set; no uniform bound on the exponents kkk is required. Trivial NNN, J0J_0J0​, or QQQ are permitted, a dense cyclic subgroup may be trivial, and the assumptions that p,p0p,p_0p,p0​ are prime exclude 000 and 111.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me