Paper IX: Arithmetic Packets, Dyadic Towers, and Local Polynomial Deformation
How can residue packets and precision towers organize arithmetic sequences and local lifting?
The paper develops exact coefficient reconstruction, coordinate transport, valuation estimates, and lifting constructions. Its later arithmetic results retain their individual field, ring, and precision hypotheses.
Assumptions and limits. Finite residue reconstruction is over a declared commutative ring. Broader extensions and the ordinary Euler-tail simplicity endpoint remain open; formal evidence covers selected developments.
Completion: Reading edition complete · Lean: Selected results recorded · Confidence: Recorded formal evidence
Before you start
Suggested background: Vectors, matrices, linear maps, kernels and images, and reading a statement with hypotheses. Consult the selected paper for any additional algebra or analysis it uses.
Recorded results and limits: Accepted reading release preserves scoped arithmetic, dyadic and lifting formal work. Broader extensions and the Euler reciprocal endpoint remain open.
Remaining work: Reconcile the current claim map with the narrowed threshold-free theorem and retain the refuted stronger statement as history.
The background advice is an editorial starting point. The work itself states its prerequisites and hypotheses.
Reading routes · Glossary · Claim links · Download this work
Worked examples for this work
These introductory calculations lead into this work’s subject. The source and evidence links below retain the work’s recorded scope.
- 9. Round a binary number · Terms and source routes
- 13. Reconstruct from residues · Terms and source routes
Complete demonstration with runnable code: Euler packets, polynomials, and residuals.
Read
- Read online: complete manuscript, strengthening and historical appendices
- Visual guide: all 23 HTML sections and 20 figures
- Edition README
- Read PDF
- Visual guide (PDF)
Back to work navigation · Worked examples
Written proofs
Read the written arguments in the PDF. The manuscript source remains available below.
Find the statement number or section in the reading files, then read its assumptions and argument. A claim map may cover only part of the written result.
Find this work among other written proofs
Back to work navigation · Worked examples
Lean
Start with the edition guide and the build instructions below. Check the correspondence records to see which written claims the Lean declarations cover. Source links lead to .lean files. PDF guides explain the formalization.
- Current guide: source locations, correspondence, and replay limits
- Lean guide (PDF)
- Recorded width-four, period, and isometry modules
- Recorded polynomial-regularity modules
- All preserved formal branches and records
Find this work among other Lean projects
Back to work navigation · Worked examples
Code
These links include code, examples, checks, or build tools. Read the edition guide for setup instructions and what each command does. All software is beta and work in progress.
Find this work among other code projects
Back to work navigation · Worked examples
Evidence
- Completion, Lean coverage, confidence, and cited evidence
- Source-file receipt (identity and availability)
- All files in this source edition
The evidence records describe the reviews and runs completed for this edition.
Back to work navigation · Worked examples