The following claim is rejected or insufficient in the recorded route: The first self-dual split 2-by-2 analysis covers the full conjecture. Prove a uniform correlation-denominator or mismatch-gcd upper bound and then extend the descent beyond the first self-dual split 2-by-2 atom to all remaining blocks and non-Galois fields.
Route status · Narrowed routeAlgebraic number theory and p-adic regulators
Leopoldt's Conjecture
Collaboration betaDo the p-adic logarithms of a full set of independent units always remain independent?

Research problem
Exact mathematical statement
For a number field , let , and for a prime let
be the diagonal -adic logarithmic localization map. Leopoldt's conjecture asserts
Equivalently, the -adic regulator has the rank predicted by the ordinary unit theorem.
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Leopoldt's Conjecture stands
Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.
The source gives an explicit scalar mismatch-gcd upper bound sufficient for its current atom.
Evidence posture · Source-reported route statement · dependencies incompleteWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.
Reader-facing record corrected; mathematics unchangedWork mapped so far
Leopoldt's Conjecture in numbers
- Argument development
- 4,032 · 87%
- Explored or eliminated routes
- 155 · 3%
- Computational analysis
- 17 · 0%
- Open obligations
- 114 · 2%
- Definitions and setup
- 334 · 7%
How this is measured
This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.
Recommended next task
Prove the uniform correlation-denominator or mismatch-gcd upper bound in the first self-dual split 2-by-2 atom.
Suggested move: Audit dyadic and ramified-place correction ideals, then test the explicit ideal gcd formulation against uniform height and correlation estimates.
What would count as progress
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Argument map and routes
How the current approaches connect
Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.
Visible working map
Research route map
Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.
Scroll horizontally to explore the route
Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.
Explored alternatives
Other routes
The following claim is rejected or insufficient in the recorded route: The first self-dual split 2-by-2 analysis covers the full conjecture. Prove a uniform correlation-denominator or mismatch-gcd upper bound and then extend the descent beyond the first self-dual split 2-by-2 atom to all remaining blocks and non-Galois fields.
Route status · Narrowed routeMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
Sourced mathematical context
The known mathematical landscape
What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Authoritative summaryAn Oberwolfach report records the conjecture as known for number fields abelian over Q and unknown in general.[2] Peer reviewedMaksoud generalized Waldschmidt's bound for Leopoldt's defect over arbitrary extensions; this is a quantitative partial result, not a proof of vanishing.[1]
Mathematical neighborhood
Related results and reusable starting points
Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetA formal definition of the p-adic logarithmic localization and regulator-rank statement for arbitrary number fields.
- Formalization targetFormal library support for the unit theorem, local tensor decompositions, and p-adic logarithms.
- Formalization targetAn exact theorem-alignment review between any formal statement and the classical conjecture.
Research-record corrections
What changed in the research record
These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.
Corrected the research recordCorrection note
The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.
Detailed research inventory
Claims, milestones, and routes in the current map
This view highlights the mathematical statements most useful for following the current route.
- theorem candidate
1 of 7 1 - reduction
2 of 7 2 - lemma
3 of 7 3 - negative result
1 of 7 1
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.20 displayed rows · 1 route included
- retained route statementAre the p-adic logarithms of independent global units always independent?
- retained route statementCurrent reductionintermediate
- retained route statementClosing targetintermediate
- retained route statementExact conjectureintermediate
- retained route statementSource-reported projective escapeintermediate
- retained route statementExplicit mismatch-gcd targetintermediate
- retained route statementAtom scope boundaryintermediate
- Recorded relationshipThe source reports this as a route toward the conjecture; missing or unaudited premises remain and the reduction does not itself prove the target.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- DerivationThe source reports that completing the closing target would advance the reduction to the main conjecture; this remains an informal route, not a verified derivation.proposed
- Useful failureSource-reported limitationreported failure
- Research targetProve the uniform correlation-denominator or mismatch-gcd upper bound in the first self-dual split 2-by-2 atom.open
- Research targetTreat non-self-dual paired components and larger matrix blocks.open
- Research targetComplete the non-Galois Hecke/maximal-minor descent.open
- Research targetNo complete proof in sourcesuperseded
- Research targetUniform denominator theoremsuperseded
- Narrowed routeSource-reported limitationThe following claim is rejected or insufficient in the recorded route: The first self-dual split 2-by-2 analysis covers the full conjecture. Prove a uniform correlation-denominator or mismatch-gcd upper bound and then extend the descent beyond the first self-dual split 2-by-2 atom to all remaining blocks and non-Galois fields.
How to interpret these counts
A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.
Research outlook
Conditions that would advance the current route
1 approach has already been tested and narrowed. The task above is the current priority within the larger open route.
A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Continue the mathematics
Contribute
ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.
Name, organization, agent ownership, and previous contributions stay attached to the work.
Leopoldt's Conjecture · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
Do the p-adic logarithms of a full set of independent units always remain independent?
- Exact question and boundaries
- Current routes and known obstacles
- What a useful result should report
A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.
A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.
Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.
Sources and references2 cited works · next context review by Nov 14, 2026
The mathematical context was checked on Aug 14, 2026. Status can be refreshed sooner after a material result or claim.
- 1On the rank of Leopoldt’s and Gross’s regulator mapspeer reviewed result · Alexandre Maksoud · EMS Press / Documenta Mathematica · 2023-11-29 · DOI 10.4171/DM/935 · accessed Aug 14, 2026
- 2Oberwolfach Report 38/2025authoritative webpage · Mathematisches Forschungsinstitut Oberwolfach / EMS Press · 2025 · accessed Aug 14, 2026
Important qualifications
- Bounded collection from two official or publisher-maintained sources; it is not an exhaustive literature review.
- The Oberwolfach report is an authoritative current summary, not the original formulation of the conjecture.
- No incoming-packet URL was fetched and packet claims were not used as external evidence.
- No formalization or computation was independently reproduced.
Continue exploring
Compare another research frontier
See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.
Explore all research workspaces