Documentation

TauCeti.Topology.Algebra.Group.Profinite.Free.ExponentSumKernel

The kernel of an exponent sum of a free pro-p group and its graded pieces #

Let F = freeProP p X be the free pro-p group on a finite type X with generators x_i, and fix i ∈ X. The kernel of the i-th exponent sum X_i := ker (F → ℤ_p, y ↦ (exponentSum y)_i) (TauCeti.freeProP.exponentSumKer) is the closed normal subgroup of F topologically generated, as a normal subgroup, by the generators x_j with j ≠ i; it contains the closed commutator subgroup. When a continuous character χ : F → ℤ_pˣ is trivial on the x_j with j ≠ i and takes x_i to an element of infinite order, its kernel is exactly X_i: this is the kernel X = ker χ of the orientation of a Demushkin group in Labute's normal form, on whose graded Lie algebra his classification of the dyadic even-rank Demushkin groups runs (Labute, §4).

The graded pieces gr_m(X_i) ≤ gr_m(F) of X_i along the lower p-series (TauCeti.gradedPieceOf) are computed by three statements, which are Labute's Lemmas 1–3 in our 0-based indexing:

Main definitions #

Main results #

References #

The kernel of an exponent sum #

noncomputable def TauCeti.freeProP.exponentSumKer (p : ℕ) [Fact (Nat.Prime p)] (X : Type u) (i : X) :

The kernel of the i-th exponent sum of the free pro-p group on X: the closed normal subgroup of the elements whose exponent sum at the generator x_i vanishes (TauCeti.freeProP.mem_exponentSumKer_iff). It contains the closed commutator subgroup and the generators x_j for j ≠ i, and it is their closed normal closure (TauCeti.freeProP.exponentSumKer_eq_topologicalClosure_normalClosure).

Equations
Instances For
    @[simp]
    theorem TauCeti.freeProP.mem_exponentSumKer_iff {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} {i : X} {y : freeProP p X} :
    theorem TauCeti.freeProP.of_mem_exponentSumKer_iff {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} {i j : X} :

    The generator x_j lies in the kernel of the i-th exponent sum exactly when j ≠ i. Not a simp lemma: simp rewrites the left-hand side with TauCeti.freeProP.mem_exponentSumKer_iff first (and, given DecidableEq X, evaluates the resulting exponent sum itself).

    theorem TauCeti.freeProP.of_mem_exponentSumKer {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} {i j : X} (h : j ≠ i) :

    The generator x_i together with the other generators x_j, j ≠ i, topologically generates F: this is the generating family of TauCeti.freeProP.topologicalClosure_closure_range_of_eq_top split at i.

    The kernel of the i-th exponent sum is the closed normal closure of the other generators.

    theorem ContinuousMonoidHom.exponentSumKer_le_ker {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} {H : Type u_1} [Group H] [TopologicalSpace H] [T1Space H] (φ : TauCeti.freeProP p X →ₜ* H) {i : X} (h : ∀ (j : X), j ≠ i → φ (TauCeti.freeProP.of j) = 1) :

    A continuous homomorphism trivial on the generators x_j, j ≠ i, is trivial on the kernel of the i-th exponent sum, for a T1 target: its kernel is a closed normal subgroup containing those generators, and X is their closed normal closure.

    Endomorphisms preserving the kernel of an exponent sum #

    An endomorphism moving each generator inside X preserves the i-th exponent sum, for X the kernel of that exponent sum: the exponent vector is linear, exponentSum (φ y) = ∑ x, (exponentSum y)_x • exponentSum (φ x_x) (TauCeti.freeProP.toAdd_exponentSum_apply_eq_sum_smul), and the i-th coordinate of each column exponentSum (φ x_x) is δ_{xi}, so the i-th coordinate of exponentSum (φ y) is (exponentSum y)_i.

    An endomorphism moving each generator inside X preserves X, for X the kernel of an exponent sum.

    theorem ContinuousMonoidHom.exponentSumKer_eq_ker {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} {H : Type u_1} [Group H] [TopologicalSpace H] [T1Space H] (φ : TauCeti.freeProP p X →ₜ* H) {i : X} (h : ∀ (j : X), j ≠ i → φ (TauCeti.freeProP.of j) = 1) (hi : ¬IsOfFinOrder (φ (TauCeti.freeProP.of i))) :

    The kernel of a character trivial on all generators but one is the kernel of the exponent sum at that generator, when the value at that generator has infinite order: both are the closed normal closure of the other generators (TauCeti.freeProP.exponentSumKer_eq_topologicalClosure_normalClosure and TauCeti.IsProP.ker_eq_topologicalClosure_normalClosure_of_not_isOfFinOrder).

    A dyadic character whose values at the generators x_j, j ≠ i, square to 1 is trivial on X_i ∩ λ_1(F): on X_i its values square to 1, since X_i is the closed normal closure of those generators, and on λ_1(F) they lie in 1 + 4ℤ_2, which contains no element of order two. This is how the kernel of the orientation χ(x₂) = -1, χ(x₄) = (1 - 2^f)⁻¹, χ(x_i) = 1 otherwise, of the dyadic even-rank normal form x₁² (x₁, x₂) x₃^{2^f} (x₃, x₄) ⋯ meets the lower 2-series: ker χ ∩ λ_1(F) = X_{x₄} ∩ λ_1(F).

    The graded pieces of the kernel of an exponent sum #

    @[simp]
    theorem TauCeti.freeProP.gradedMk_mem_gradedPieceOf_exponentSumKer_iff {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} (i : X) {m : ℕ} (y : ↥(pLowerCentralSeries p (freeProP p X) m)) :
    gradedMk p (freeProP p X) m y ∈ gradedPieceOf p (exponentSumKer p X i) m ↔ ↑p ^ (m + 1) ∣ Multiplicative.toAdd ((exponentSum p X) ↑y) i

    The graded pieces of the kernel of an exponent sum: the class in gr_m(F) of y ∈ λ_m(F) lies in gr_m(X), for X the kernel of the i-th exponent sum, exactly when p ^ (m + 1) divides the i-th exponent sum of y; the exponent sums of an element of λ_m(F) are always divisible by p ^ m.

    The p-power π^m ξ_i of the class of the generator x_i does not lie in gr_m(X), for X the kernel of the i-th exponent sum: its i-th exponent sum is p ^ m.

    gr_m(F) is spanned by gr_m(X) and π^m ξ_i, for X the kernel of the i-th exponent sum: the class of y ∈ λ_m(F) with i-th exponent sum p ^ m * a differs from ā • π^m ξ_i, where ā ∈ 𝔽_p is the residue of a, by a class in gr_m(X).

    gr_m(F) = gr_m(X) ⊕ 𝔽_p π^m ξ_i, for X the kernel of the i-th exponent sum (Labute, §4, Lemma 1).

    theorem TauCeti.freeProP.exists_mem_gradedPieceOf_exponentSumKer_add_smul_gradedPowIter_eq {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} (i : X) (m : ℕ) (z : gradedPiece p (freeProP p X) m) :
    ∃ h ∈ gradedPieceOf p (exponentSumKer p X i) m, ∃ (c : ZMod p), h + c • gradedPowIter p (freeProP p X) m (gradedMkZero p (freeProP p X) (of i)) = z

    Every class in gr_m(F) is a class in gr_m(X) plus a multiple of π^m ξ_i.

    A subspace of gr_m(X) which together with π^m ξ_i spans gr_m(X) is all of gr_m(X).

    The tail T_j spanned by the π^j ξ_a with a ≠ i lies in gr_j(X), for X the kernel of the i-th exponent sum.

    Generation of the graded pieces of the kernel #

    theorem TauCeti.freeProP.gradedPieceOf_exponentSumKer_succ_le {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} [Finite X] (i : X) {m : ℕ} (hm : 1 ≤ m) {W : Submodule (ZMod p) (gradedPiece p (freeProP p X) (m + 1))} (hpow : ∀ τ ∈ gradedPieceOf p (exponentSumKer p X i) m, gradedPow p (freeProP p X) m τ ∈ W) (hbr : ∀ τ ∈ gradedPieceOf p (exponentSumKer p X i) m, ∀ (j : X), ((gradedBracket p (freeProP p X) m 0) τ) (gradedMkZero p (freeProP p X) (of j)) ∈ W) :
    gradedPieceOf p (exponentSumKer p X i) (m + 1) ≤ W

    Generation of gr_{m+1}(X) from gr_m(X) (Labute, §4, Lemma 2): for m ≥ 1, a subspace of gr_{m+1}(F) containing the p-powers π τ and the brackets [τ, ξ_j] with the generator classes, for every τ ∈ gr_m(X), contains gr_{m+1}(X); here X is the kernel of the i-th exponent sum. The proof writes a class of gr_m(F) as h + c • π^m ξ_i with h ∈ gr_m(X), so that π and the brackets carry gr_m(F) into the subspace enlarged by 𝔽_p π^{m+1} ξ_i, which is then all of gr_{m+1}(F), and the component along π^{m+1} ξ_i of a class of gr_{m+1}(X) vanishes.

    The constrained span statement #

    The image of δ_ρ on families of classes of gr_m(X) lies in gr_{m+1}(X), for X the kernel of the i₁-th exponent sum.

    theorem TauCeti.freeProP.gradedPieceOf_exponentSumKer_eq_map_basisModificationDelta_sup_gradedPowIterBracket {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} [LinearOrder X] {m : ℕ} {ρ : gradedPiece p (freeProP p X) 1} {i₀ i₁ : X} [Fintype X] {i₂ : X} (hm : 1 ≤ m) (hρ : Submodule.span (ZMod p) (Set.range fun (j : X) => (degreeOneDeriv p X j) ρ) = ⊤) (hc : ∀ (j : X), j ≠ i₀ → ((degreeOneBasis p X).repr ρ) (Sum.inl j) = 0) (hd : ∀ (j : X), j ≠ i₁ → j ≠ i₂ → ∃ (b : X → ZMod p), b i₀ = 0 ∧ ∑ k : X, b k • (degreeOneDeriv p X k) ρ = gradedMkZero p (freeProP p X) (of j)) :
    gradedPieceOf p (exponentSumKer p X i₁) (m + 1) = Submodule.map ((basisModificationDelta p X hm) ρ) (Submodule.pi Set.univ fun (x : X) => gradedPieceOf p (exponentSumKer p X i₁) m) ⊔ Submodule.span (ZMod p) (Set.range fun (a : { a : X // a ≠ i₁ }) => gradedPowIter p (freeProP p X) (m + 1) (gradedMkZero p (freeProP p X) (of ↑a))) ⊔ ZMod p ∙ gradedPowIterBracket p (freeProP p X) m (of i₂) (of i₁)

    The constrained span statement with an exceptional generator (Labute, §4, Lemma 3 in both its forms). Let F be the free pro-p group on a finite linearly ordered type X, let ρ ∈ gr_1(F) have partial derivatives spanning gr_0(F), let x_{i₀} be the only generator whose coefficient of π ξ_i in ρ may be nonzero, and let every generator class ξ_j with j ≠ i₁, i₂ be a combination of the derivatives ∂_k ρ with k ≠ i₀. Let X = ker be the kernel of the i₁-th exponent sum. Then for every m ≥ 1

    gr_{m+1}(X) = δ_ρ(gr_m(X)^X) + T_{m+1} + 𝔽_p π^m [ξ_{i₂}, ξ_{i₁}],

    where the tail T_{m+1} is spanned by the p-powers π^{m+1} ξ_a with a ≠ i₁. The exceptional generator x_{i₂}, whose class needs the derivative ∂_{i₀} ρ, contributes the extra spanning vector π^m [ξ_{i₂}, ξ_{i₁}], which for p = 2 need not lie in the other two terms; with i₂ = i₁ it vanishes and the statement is gradedPieceOf_exponentSumKer_eq_map_basisModificationDelta_sup_span_gradedPowIter. The two even-rank dyadic Demushkin relators x₁^{2+2^f} (x₁, x₂)(x₃, x₄) ⋯ and x₁² (x₁, x₂) x₃^{2^f} (x₃, x₄) ⋯ have i₀ = x₁, and respectively i₂ = i₁ = x₂ and i₁ = x₄, i₂ = x₂.

    theorem TauCeti.freeProP.gradedPieceOf_exponentSumKer_eq_map_basisModificationDelta_sup_span_gradedPowIter {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} [LinearOrder X] {m : ℕ} {ρ : gradedPiece p (freeProP p X) 1} {i₀ i₁ : X} [Fintype X] (hm : 1 ≤ m) (hρ : Submodule.span (ZMod p) (Set.range fun (j : X) => (degreeOneDeriv p X j) ρ) = ⊤) (hc : ∀ (j : X), j ≠ i₀ → ((degreeOneBasis p X).repr ρ) (Sum.inl j) = 0) (hd : ∀ (j : X), j ≠ i₁ → ∃ (b : X → ZMod p), b i₀ = 0 ∧ ∑ k : X, b k • (degreeOneDeriv p X k) ρ = gradedMkZero p (freeProP p X) (of j)) :
    gradedPieceOf p (exponentSumKer p X i₁) (m + 1) = Submodule.map ((basisModificationDelta p X hm) ρ) (Submodule.pi Set.univ fun (x : X) => gradedPieceOf p (exponentSumKer p X i₁) m) ⊔ Submodule.span (ZMod p) (Set.range fun (a : { a : X // a ≠ i₁ }) => gradedPowIter p (freeProP p X) (m + 1) (gradedMkZero p (freeProP p X) (of ↑a)))

    The constrained span statement (Labute, §4, Lemma 3). Let F be the free pro-p group on a finite linearly ordered type X, let ρ ∈ gr_1(F) have partial derivatives spanning gr_0(F), let x_{i₀} be the only generator whose coefficient of π ξ_i in ρ may be nonzero, and let every generator class ξ_j with j ≠ i₁ be a combination of the derivatives ∂_k ρ with k ≠ i₀. Let X = ker be the kernel of the i₁-th exponent sum. Then for every m ≥ 1

    gr_{m+1}(X) = δ_ρ(gr_m(X)^X) + T_{m+1},

    where the tail T_{m+1} is spanned by the p-powers π^{m+1} ξ_a with a ≠ i₁. This is the form of the span statement in which the basis corrections are constrained to lie in the kernel of the orientation, as the uniqueness half of the dyadic even-rank classification requires; for the relator x₁^q (x₁, x₂)(x₃, x₄) ⋯ the generators are i₀ = x₁ and i₁ = x₂.

    theorem TauCeti.freeProP.gradedPowIter_gradedMkZero_mem_map_basisModificationDelta_pi {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} [LinearOrder X] {m : ℕ} {ρ : gradedPiece p (freeProP p X) 1} {i₀ i₁ : X} [Fintype X] {i₂ : X} (hm : 1 ≤ m) (hc : ∀ (j : X), j ≠ i₀ → ((degreeOneBasis p X).repr ρ) (Sum.inl j) = 0) (hb : ∃ (b : X → ZMod p), ∑ k : X, b k • (degreeOneDeriv p X k) ρ = gradedMkZero p (freeProP p X) (of i₂) ∧ b i₀ * ((degreeOneBasis p X).repr ρ) (Sum.inl i₀) ≠ 0) (hi : i₂ ≠ i₁) :
    gradedPowIter p (freeProP p X) (m + 1) (gradedMkZero p (freeProP p X) (of i₂)) ∈ Submodule.map ((basisModificationDelta p X hm) ρ) (Submodule.pi Set.univ fun (x : X) => gradedPieceOf p (exponentSumKer p X i₁) m)

    The p-power tail at the exceptional generator lies in the image of δ_ρ: if ξ_{i₂} is a combination Σ_k b_k ∂_k ρ of the derivatives in which the coefficient b_{i₀} c_{i₀} of the p-power term π is nonzero, then π^{m+1} ξ_{i₂} ∈ δ_ρ(gr_m(X)^X) for m ≥ 1 and i₂ ≠ i₁, since δ_ρ(b • π^m ξ_{i₂}) = (b_{i₀} c_{i₀}) • π^{m+1} ξ_{i₂} + [π^m ξ_{i₂}, ξ_{i₂}] and the bracket vanishes.

    theorem TauCeti.freeProP.gradedPieceOf_exponentSumKer_eq_map_basisModificationDelta_sup_gradedPowIterBracket_of_ne {p : ℕ} [Fact (Nat.Prime p)] {X : Type u} [LinearOrder X] {m : ℕ} {ρ : gradedPiece p (freeProP p X) 1} {i₀ i₁ : X} [Fintype X] {i₂ : X} (hm : 1 ≤ m) (hρ : Submodule.span (ZMod p) (Set.range fun (j : X) => (degreeOneDeriv p X j) ρ) = ⊤) (hc : ∀ (j : X), j ≠ i₀ → ((degreeOneBasis p X).repr ρ) (Sum.inl j) = 0) (hd : ∀ (j : X), j ≠ i₁ → j ≠ i₂ → ∃ (b : X → ZMod p), b i₀ = 0 ∧ ∑ k : X, b k • (degreeOneDeriv p X k) ρ = gradedMkZero p (freeProP p X) (of j)) (hb : ∃ (b : X → ZMod p), ∑ k : X, b k • (degreeOneDeriv p X k) ρ = gradedMkZero p (freeProP p X) (of i₂) ∧ b i₀ * ((degreeOneBasis p X).repr ρ) (Sum.inl i₀) ≠ 0) (hi : i₂ ≠ i₁) :
    gradedPieceOf p (exponentSumKer p X i₁) (m + 1) = Submodule.map ((basisModificationDelta p X hm) ρ) (Submodule.pi Set.univ fun (x : X) => gradedPieceOf p (exponentSumKer p X i₁) m) ⊔ Submodule.span (ZMod p) (Set.range fun (a : { a : X // a ≠ i₁ ∧ a ≠ i₂ }) => gradedPowIter p (freeProP p X) (m + 1) (gradedMkZero p (freeProP p X) (of ↑a))) ⊔ ZMod p ∙ gradedPowIterBracket p (freeProP p X) m (of i₂) (of i₁)

    The constrained span statement with an exceptional generator, sharp form (Labute, §4.2, Lemma 3). Under the hypotheses of gradedPieceOf_exponentSumKer_eq_map_basisModificationDelta_sup_gradedPowIterBracket, if moreover ξ_{i₂} is a combination of the derivatives with nonzero coefficient b_{i₀} c_{i₀} at the p-power generator and i₂ ≠ i₁, then the tail at x_{i₂} is absorbed by the image of δ_ρ:

    gr_{m+1}(X) = δ_ρ(gr_m(X)^X) + T'_{m+1} + 𝔽_p π^m [ξ_{i₂}, ξ_{i₁}],

    with T'_{m+1} spanned by the π^{m+1} ξ_a for a ≠ i₁, i₂. For the relator x₁² (x₁, x₂) x₃^{2^f} (x₃, x₄) ⋯ these are Labute's spanning vectors π^{m+1} ξ_a (a ≠ x₂, x₄) and π^m [ξ₂, ξ₄].