At the actual triple (13,34,1325), the source reports that the marked prime above 5 has narrow and ordinary order 40, whereas a collision through the block 25 would require order 8. Abstract C₈×C₄ is nevertheless present, and only the empty/full marked zero subsets occur. Use exact marked classes from the given triple. The source’s fourth-rank upper bound can prove uniqueness when r₄=1, but larger torsion still requires the marked zero-subset analysis.
Route status · Narrowed routeDiophantine equations and marked quadratic ideal classes
Markov uniqueness conjecture
Collaboration betaCan two different positive Markov triples have the same largest number? The packet translates a possible collision into conditions on specifically marked quadratic ideals and into exact integer reconstruction tests. Those reductions do not yet exclude a first proper split for every maximum.
Known results and sources
Research problem
Exact mathematical statement
A normalized Markov triple is a positive integral solution of with . Prove that the largest entry determines the normalized triple:
The repeated-coordinate triples , , and maximum 5 are elementary cases. the source does not prove the universal implication; a nontrivial collision can be oriented as .
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Markov uniqueness conjecture stands
Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.
Fix an actual normalized triple with maximum M beyond the elementary cases, put η=1 for odd M and η=2 for even M, and write m₀=M/η=∏ℓ_i^{E_i}. In the source’s specified quadratic order, mark 𝔭_i by β_M≡ab⁻¹ mod ℓ_i and let g_i=[𝔭_i^{E_i}]⁺, x_I=∑_{i∈I}g_i. The source gives N(M)=½#{I:4x_I=0}. Hence uniqueness is equivalent to excluding every proper nonempty marked subset with 4x_I=0, retaining the legitimate empty/full boundary.
Evidence posture · Source-reported route statement · dependencies incompleteWork mapped so far
Markov uniqueness conjecture in numbers
- Argument development
- 805 · 68%
- Explored or eliminated routes
- 59 · 5%
- Computational analysis
- 51 · 4%
- Open obligations
- 160 · 14%
- Definitions and setup
- 106 · 9%
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
Exclude every proper nonempty zero subsum of the actual marked sequence 4g_i.
Suggested move: Fix the exact order and marking from an actual triple, partition the complete prime-power blocks, and prove 4∑_{i∈I}g_i≠0 for every proper nonempty I. Preserve the empty/full boundary and address mixed proper subsums, which first become a separate issue with four blocks.
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
At the actual triple (13,34,1325), the source reports that the marked prime above 5 has narrow and ordinary order 40, whereas a collision through the block 25 would require order 8. Abstract C₈×C₄ is nevertheless present, and only the empty/full marked zero subsets occur. Use exact marked classes from the given triple. The source’s fourth-rank upper bound can prove uniqueness when r₄=1, but larger torsion still requires the marked zero-subset analysis.
Route status · Narrowed routeFor the source’s fixed collision data, the denominator formula allows integral orbit members only at t=0 with s=−1 or 0. This closes that particular descent route; it does not exclude the initial collision, changes of M, or transformations outside the group. A new transformation must change the marked or parent data, or leave the fixed group with a justified arithmetic lift. Distinct-field square and divisibility conditions remain separate requirements.
Route status · Narrowed routeMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
Sourced mathematical context
The known mathematical landscape
Uniqueness of a positive integral solution of x²+y²+z²=3xyz from its largest entry, up to coordinate permutation, remains open in general. Prime-power cases and alternative formulations are established or reported separately; the 2025 necklace reformulation does not close the full uniqueness conjecture.
[1][2]What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Peer reviewedFisac expresses the uniqueness question as injectivity of a function on primitive integral necklaces with small variation.[1] Authoritative summaryAigner's monograph brings together the number-theoretic, geometric, word, and matching perspectives on the Markov theme.[3] PreprintZhang's revised preprint gives an elementary argument for uniqueness when a Markoff number is a prime power or twice a prime power.[2] Authoritative summaryFisac's historical account attributes the uniqueness conjecture to Frobenius and cites his 1913 paper. That original paper was not inspected in this collection.[1]
Mathematical neighborhood
Related results and reusable starting points
Zhang reports uniqueness under these arithmetic restrictions on the largest Markoff number.
[2]Fisac's Theorem 1.1 gives a precise necklace formulation of the uniqueness conjecture; its domain and exceptional trivial necklace must be retained.
[1]Fisac recalls the equivalent statement that such geodesics differ by an isometry. This relies on the specified modular torus and simple geodesics.
[1]Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetA proposed formal entry point is the exact positive-integral Markov equation with normalization and permutation equivalence.
- Formalization targetAny use of necklace or geodesic reformulations requires a statement-level bridge to the normalized largest-entry target; no such bridge was checked here.
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 9 1 - reduction
1 of 9 1 - lemma
3 of 9 3 - equivalence
2 of 9 2 - negative result
1 of 9 1 - computational claim
1 of 9 1
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.25 displayed rows · 2 routes included
- retained route statementThe largest entry M determines the normalized Markov triple (x,y,M).
- retained route statementCurrent reductionintermediate
- retained route statementClosing targetintermediate
- retained route statementMarked subsets count normalized triplesintermediate
- retained route statementOne square remains after the canonical residueintermediate
- retained route statementPartial powers and whole prime-power blocks differintermediate
- retained route statementCommon-field collision bounds are incompatibleintermediate
- retained route statementA fixed reflection group yields no new normalized pairintermediate
- retained route statementMarked order 40 defeats an abstract-group shortcutintermediate
- 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
- 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 failureReplace marked ideal orders by the presence of an abstract torsion subgroup.reported failure
- Useful failureSeek a new collision by iterating only the fixed reflection group of an existing collision candidate.reported failure
- Research targetExclude every proper nonempty zero subsum of the actual marked sequence 4g_i.open
- Research targetExclude all admissible distinct-field two-square points in the collision chamber.open
- Research targetRule out the positive single-square reconstruction for every proper unitary factor.open
- ComputationThe source’s order-40 example uses (a,b,M)=(13,34,1325), m₀=25·53, and the prime above 5 marked by β_M≡2 mod 5. The second-audit report separately lists ten exact identities, 384 conic inverses, 205 ideal-product checks, and other bounded controls.The order-40 certificate is a bounded norm-search result for the marked class, not a computation of every class group or a universal uniqueness proof. The earlier 152,209,774-case scan was not rerun in the second audit. · reported unreproduced
- Narrowed routeReplace marked ideal orders by the presence of an abstract torsion subgroup.At the actual triple (13,34,1325), the source reports that the marked prime above 5 has narrow and ordinary order 40, whereas a collision through the block 25 would require order 8. Abstract C₈×C₄ is nevertheless present, and only the empty/full marked zero subsets occur. Use exact marked classes from the given triple. The source’s fourth-rank upper bound can prove uniqueness when r₄=1, but larger torsion still requires the marked zero-subset analysis.
- Narrowed routeSeek a new collision by iterating only the fixed reflection group of an existing collision candidate.For the source’s fixed collision data, the denominator formula allows integral orbit members only at t=0 with s=−1 or 0. This closes that particular descent route; it does not exclude the initial collision, changes of M, or transformations outside the group. A new transformation must change the marked or parent data, or leave the fixed group with a justified arithmetic lift. Distinct-field square and divisibility conditions remain separate requirements.
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
2 approaches have 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.
Markov uniqueness conjecture · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
Can two different positive Markov triples have the same largest number? The current work translates a possible collision into conditions on specifically marked quadratic ideals and into exact integer reconstruction tests. Those reductions do not yet exclude a first proper split for every maximum.
- 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 references3 cited works · next context review by Dec 7, 2026
The mathematical context was checked on Sep 7, 2026. Status can be refreshed sooner after a material result or claim.
- 1Markov’s conjecture on integral necklacespeer reviewed result · David Fisac · Bulletin of the London Mathematical Society 57, 4122–4131 · 2025-08-22 · DOI 10.1112/blms.70178 · accessed Sep 7, 2026
- 2An elementary proof of uniqueness of Markoff numbers which are prime powerspreprint · Ying Zhang · arXiv · 2007-02-01 · ARXIV math/0606283 · accessed Sep 7, 2026
- 3Markov's Theorem and 100 Years of the Uniqueness Conjecturesurvey or monograph · Martin Aigner · Springer · 2013 · DOI 10.1007/978-3-319-00888-2 · accessed Sep 7, 2026
Important qualifications
- This is a bounded external-context collection, not proof checking, an independent mathematical review, legal clearance, or publication authority.
- No source programs, datasets, or certificates were executed. A linked resource does not imply reproduction.
- No exact checked formalization was confirmed in the scoped search; an empty list does not establish nonexistence.
- Unassigned history and recognition fields mean this collection did not establish them. Proposed formal prerequisites are planning tasks, not an exhaustive library inventory.
- The 1913 attribution is supported by Fisac's historical account; it does not identify a packet author, priority claim, or a directly inspected original source.
- MSC 11D45 appears on the cited Zhang preprint. No exact checked formalization or computational certificate was confirmed.
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