At sufficiently deep bad 2-adic places, both inverse branches contract and every binary word occurs as a rational periodic orbit. Global adelic, semiabelian, or moving-S-unit methods remain viable because they can couple valuation data across places.
Route status · Narrowed routeArithmetic dynamics and Diophantine geometry
Morton–Silverman Uniform Boundedness Conjecture
Collaboration betaFor fixed dimension, map degree, and number-field degree, should one bound control every rational preperiodic point of every such dynamical system? The conjecture remains open, including the exact-period obstruction for quadratic polynomials.
Known results and sources
Research problem
Exact mathematical statement
For fixed integers , , and , does there exist a constant such that every degree- morphism over every number field with satisfies
Here denotes the -rational points with finite forward orbit under .
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Morton–Silverman Uniform Boundedness Conjecture stands
Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.
For every fixed quadratic exact period, the source reports a uniform tail bound only subject to its stated transversality and audit dependencies.
Evidence posture · Source-reported route statement · dependencies incompleteWork mapped so far
Morton–Silverman Uniform Boundedness Conjecture in numbers
- Argument development
- 2,371 · 88%
- Explored or eliminated routes
- 30 · 1%
- Computational analysis
- 13 · 0%
- Open obligations
- 69 · 3%
- Definitions and setup
- 208 · 8%
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 moving-cusp adelic rigidity for bounded-degree exact quadratic cycles outside explicitly classified special loci.
Suggested move: Construct the full exact cusp boundary and compute the image of general exact-word cusps in the augmentation quotient.
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 sufficiently deep bad 2-adic places, both inverse branches contract and every binary word occurs as a rational periodic orbit. Global adelic, semiabelian, or moving-S-unit methods remain viable because they can couple valuation data across places.
Route status · Narrowed routeDifferent binary cusps provide balancing rays, so a proof must also use nonlinear cycle equations, arithmetic quotients, or classification. A combined logarithmic and ordinary formal-immersion argument remains a candidate after the cusp-difference subgroup is controlled.
Route status · Narrowed routeMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
The conjecture quantifies over every number field of degree at most D and every degree-d morphism of projective N-space.
Suggested move: Resolve the exact source-reported obligation without treating it as an established negative result.The source audit lists uniform exact periods, uniform quadratic preperiodic counts, cuspidal-difference control, and the full Morton–Silverman statement as open.
Suggested move: Resolve the exact source-reported obligation without treating it as an established negative result.Sourced mathematical context
The known mathematical landscape
What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Peer reviewedRajagopal and Zhang publish an explicit periodic-point bound for a restricted good-reduction polynomial class, including certain unicritical maps.[3] Peer reviewedA broad Bulletin of the AMS survey states the full projective-space uniform boundedness conjecture and reviews limited progress.[2] Historical sourceMorton and Silverman formulated the uniform boundedness problem for rational periodic and preperiodic dynamics over number fields.[1]
Mathematical neighborhood
Related results and reusable starting points
For a restricted good-reduction polynomial class, the number of K-rational periodic points is at most d^[K:Q]; this does not bound all preperiodic points for every morphism.
[3]Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetFormal arithmetic dynamics of morphisms on projective space over number fields.
- Formalization targetFormal height, good-reduction, local-period, and rational preperiodic-point finiteness theorems.
- Formalization targetA formal uniform exact-period theorem or another route controlling all cycles and tails.
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
2 of 7 2 - negative result
2 of 7 2
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.22 displayed rows · 2 routes included
- retained route statementIs #PrePer(f,K) uniformly bounded by N, d, and D alone?
- retained route statementCurrent reductionintermediate
- retained route statementClosing targetintermediate
- retained route statementConditional low-period tail boundsintermediate
- retained route statementConditional fixed-period tail reductionintermediate
- retained route statementLocal full shift blocks local-only proofsintermediate
- retained route statementCusp labels move with the primeintermediate
- 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 failurePurely local period boundreported failure
- Useful failureBoundary convexity alonereported failure
- Research targetProve moving-cusp adelic rigidity for bounded-degree exact quadratic cycles outside explicitly classified special loci.open
- Research targetFind a label-independent quotient that controls all moving cuspidal differences while retaining at least 2D cotangent directions.open
- Research targetControl both moving cuspidal differences and the arithmetic kernel of a primitive semiabelian quotient uniformly in the period.open
- Research targetExact global boundedness targetopen
- Research targetExact periods remain the primary open moduleopen
- Narrowed routePurely local period boundAt sufficiently deep bad 2-adic places, both inverse branches contract and every binary word occurs as a rational periodic orbit. Global adelic, semiabelian, or moving-S-unit methods remain viable because they can couple valuation data across places.
- Narrowed routeBoundary convexity aloneDifferent binary cusps provide balancing rays, so a proof must also use nonlinear cycle equations, arithmetic quotients, or classification. A combined logarithmic and ordinary formal-immersion argument remains a candidate after the cusp-difference subgroup is controlled.
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.
Morton–Silverman Uniform Boundedness Conjecture · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
For fixed dimension, map degree, and number-field degree, should one bound control every rational preperiodic point of every such dynamical system? The conjecture remains open, including the exact-period obstruction for quadratic polynomials.
- 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 Nov 15, 2026
The mathematical context was checked on Aug 15, 2026. Status can be refreshed sooner after a material result or claim.
- 1Rational periodic points of rational functionsoriginal source · Patrick Morton, Joseph H. Silverman · International Mathematics Research Notices · 1994 · DOI 10.1155/S1073792894000127 · accessed Aug 15, 2026
- 2Current trends and open problems in arithmetic dynamicssurvey or monograph · Robert Benedetto, Patrick Ingram, Rafe Jones, Michelle Manes, Joseph H. Silverman, Thomas J. Tucker · Bulletin of the American Mathematical Society · 2019 · DOI 10.1090/bull/1665 · MR MR4007163 · accessed Aug 15, 2026
- 3Uniform bounds on periodic points of polynomials with good reductionpeer reviewed result · Isaac Rajagopal, Robin Zhang · Monatshefte für Mathematik (Springer Nature) · 2026-07-22 · ARXIV 2510.26119 · DOI 10.1007/s00605-026-02196-0 · accessed Aug 15, 2026
Important qualifications
- The review focuses on the full conjecture, a major survey, and one recent special-class theorem; it is not an exhaustive arithmetic-dynamics bibliography.
- The recent good-reduction theorem treats periodic points for a restricted polynomial class, not all preperiodic points of arbitrary projective morphisms.
- The bounded review did not establish an end-to-end formalization or a checked general proof certificate.
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