A route through the complete reading edition
On this page · Permalink · Source line 1
The central distinction is between a residual root, a coherent branch, and an occupied packet in a carrier. Sections 2–7 develop the finite and formal machinery. Sections 8–11 assemble its arithmetic uses under stated hypotheses. The residue-counting continuation is retained in Appendix C. Appendix D states the later checked conditional endpoint, while Appendix E supplies the worked visual atlas.
| Read for | Follow this route |
|---|---|
| The mathematical core | Residual partition, reconstruction, smooth and singular counts, cohomology packets, directed seed rank. |
| The arithmetic assembly | Common coefficient data, finite Frobenius separation, explicit carrier summands, and inverse-limit-closed profiles. |
| The formal contract | The separate Lean guide prints the terminal source and all three direct dependency modules, with a statement register and hypothesis-by-hypothesis explanation. |
| The finite examples | Atlas pages V1–V30 show the actual residue tables, projector tests, countermodels, and norm-character examples. |
The live ledger is conditional 20/20.
On this page · Permalink · Source line 18
This is the recorded closure of the amended formal contract, not a certification of every historical prose sentence at its broadest possible interpretation. The final source is over the rational absolute Galois group. Its carrier data, constituent comparisons, and completed source family are explicit inputs. The 17/20 passages attached to Block 27 and the scalar/Mellin continuation remain historical records. A later stronger residual-system attempt records 19/20 and no promoted endpoint. These records concern different source contracts.
Two outputs require two sets of inputs.
On this page · Permalink · Source line 27
The terminal theorem proves that a transported target family exists and that the declared summand can be recovered inside a supplied compatible carrier. It does not identify those two objects. An application that needs such an identification must supply its comparison. Likewise, zero multiplicities are permitted by the formal assembly, so a nonzero conclusion retains a separate nonzero premise.
Proofs, checks, and publication.
On this page · Permalink · Source line 34
The exact mathematical arguments, computational illustrations, and inherited Lean records have different evidential roles. The October 10 reading pass corrected the digit-extraction display, reconciled checkpoint wording, and rebuilt the reader set without a fresh Lean kernel check. The separately dated October 20 verification records identify the newly selected source, production execution, owned-declaration audit, and bounded checks. The unrecovered October 16–17 packages are not substituted into that evidence. The complete historical frontmatter and its original limits are preserved in Appendix B rather than placed in front of the current table of contents.