Conjectural logarithmic group-matrix rank for nonabelian totally real fields
OpenLeopoldt.card_sub_one_le_log_group_matrix_rank_of_nonabelianOpen analytic assertion. Let be an odd prime, let be a totally real Galois number field with nonabelian Galois group , and let be a Minkowski unit. Assume that every conjugate of satisfies
For each prime , the conjectured lower bound over the local field is
This is the remaining analytic input in the reduction of Leopoldt.exists_independent_log_conj_of_galois_not_exponent_two. It is not asserted to follow from Baker--Brumer, and publishing the statement does not prove Leopoldt's conjecture. The finite-index and small-ball preparation, and the implication from this rank bound to semilocal independence, are separate proved steps; the abelian case is handled by the existing Baker--Brumer deduction.
The norm relation kills the trivial representation. Frobenius's group-determinant decomposition explains the obstacle: nontrivial irreducible representations of dimension greater than one give matrix blocks whose invertibility requires polynomial nonvanishing in logarithms, whereas Baker--Brumer establishes linear independence over algebraic coefficients. The rank bound is deliberately left open.
import Definitions.Def_PadicLog open NumberField
theorem Leopoldt.card_sub_one_le_log_group_matrix_rank_of_nonabelian
(p : ℕ) [Fact p.Prime] (hp : Odd p)
(K : Type*) [Field K] [NumberField K] [IsTotallyReal K] [IsGalois ℚ K]
(hG : ¬ IsMulCommutative (K ≃ₐ[ℚ] K)) (ε : (𝓞 K)ˣ)
(hε : (Subgroup.closure (Set.range fun σ : K ≃ₐ[ℚ] K ↦
_root_.Units.map (RingOfIntegers.mapRingEquiv σ.toRingEquiv).toMonoidHom ε)).FiniteIndex)
(hball : ∀ (σ : K ≃ₐ[ℚ] K) (v : Leopoldt.PrimesOver p K),
‖((Leopoldt.diagonalUnits p K
(_root_.Units.map (RingOfIntegers.mapRingEquiv σ.toRingEquiv).toMonoidHom ε) v :
v.1.adicCompletionIntegers K) : v.1.adicCompletion K) - 1‖ ≤
‖((p : ℕ) : v.1.adicCompletion K)‖ ^ 2)
(v₀ : Leopoldt.PrimesOver p K) :
Fintype.card (K ≃ₐ[ℚ] K) - 1 ≤
(Matrix.of fun σ τ : K ≃ₐ[ℚ] K ↦ PadicLog.log (p := p)
((Leopoldt.diagonalUnits p K
(_root_.Units.map (RingOfIntegers.mapRingEquiv (τ⁻¹ * σ).toRingEquiv).toMonoidHom ε) v₀ :
v₀.1.adicCompletionIntegers K) : v₀.1.adicCompletion K)).rank := by sorry