Let k be a perfect field of characteristic p > 0. This project constructs a canonical resolution of singularities in arbitrary dimension by finite sequences of ordinary blowups with regular permissible centres. More precisely, for a smooth k-scheme W equipped with an ordered simple-normal-crossings boundary E, it constructs strong principalizations of coherent ideals and strong embedded resolutions of reduced closed subschemes X ⊂ W. The construction preserves the boundary condition at every stage, is an isomorphism over the initially resolved locus, is independent of local presentations and ambient embeddings, and is functorial under open, smooth, and étale morphisms and extensions of the perfect ground field.
The local theory replaces a marked Rees algebra by its differential–integral saturation. Total Hasse operators and boundary coefficient cubes recover exact order, tangency, and multiple-incidence information without factorial denominators. Filtered Rees complexes retain the higher syzygies discarded by order functions, while semilinear Frobenius–Hasse sources, primitive–cobar complexes, and actual torsor–action data record the inseparable and additive phenomena that arise in the wild locus. Explicit transformation identities transport this complete semantic packet through permissible blowups and separate every failure of strict transport into a supported defect, a controlled change of type, or a genuinely new semilinear occurrence.
The central innovation is a termination principle that does not require any classical resolution invariant to decrease after every blowup. Positive-characteristic singularities may return, and residual order may increase, but every return is assigned a canonical address in a finite exceptional ancestry. Owner, parent, quotient, trace, and reopening data are transported across successive resolution blocks, and a no-reset theorem shows that a discharged address cannot be recreated by recomputation, change of presentation, or passage between local models. Thus each completed block replaces a nonempty multiset of active occurrences by strict descendants in a single well-founded dependent order. Canonical incidence portfolios then serialize the local resolution words and descend them to a global sequence of ordinary blowups.
This yields finite termination, terminal regularity and normal crossings, strong principalization, reduced embedded resolution, and—by stable re-embedding and descent—an intrinsic functorial resolution. Conceptually, the construction replaces numerical descent by historical descent: the singularity may return, but the mathematical obligation responsible for its return cannot.
Resolution of Singularities in Positive Characteristic:
Frobenius–Hasse Towers and Exceptional-History Descent
Collected Edition, Parts I–IX · August 2026 · 798 pp.
Note I
A Three-Centre Clearing Block along a Narasimhan-Type Equimultiple Curve in Characteristic Two
9 pp.
A three-centre normal-flat clearing block in characteristic two: two point blowups followed by the transformed equimultiple curve clear multiplicity two above Γ \ {0}.
Note II
Trace–Conormal Preparation of a Regular Curve against a Finite Packet of Regular Subschemes
12 pp.
Introduces a rootwise trace–conormal profile and gives a canonical finite point-preparation of a regular curve relative to a finite packet of regular subschemes and an SNC boundary.
The author gratefully acknowledges the intellectual environment and research resources at Princeton University, and sincerely thanks the Princeton CIS Lab for access to computational-assisted resources used in this project. All explicit examples, counterexamples, and accompanying code are available upon request.
Chenxiao Tian
ct3471@alumni.princeton.edu
ct3471@princeton.edu
The nine parts form a single proof in four layers: Parts I–III construct and transport the local semantic packet; Parts IV–V close the defect calculus and globalize the local words; Part VI isolates termination and reconstruction; Parts VII–IX realize and assemble the canonical certificate.
Constructs the saturated marked Rees algebra, total-Hasse activity tests, boundary coefficient cubes, and the filtered transform interface.
Develops primitive semilinear sources, intrinsic height filtrations, gauge descent, and the prepared generic-entry packet.
Establishes all-chart transformation, derived source transport, finite-word heredity, endpoint comparison, and exceptional ancestry.
Strictifies the defect calculus and routes certified branches to surface, monomial, binomial, and additive-torsor backends.
Constructs clean portfolios, canonical refinements, descent centres, the global scheduler, and owner no-reset.
Introduces the dependent occurrence order, renewal forest, strict endpoint replacement, multiset termination, and terminal reconstruction.
Realizes the certificate fields through obstruction calculus, address and quotient criteria, reopening data, and verified chamber assembly.
Builds one-step cleavage systems, hereditary prefixes, fresh-run comparison, cross-generation addressing, and complete wild packets.
Discharges Targets A–F by rigid generation, structured cofibres, wild classification, universal progress, terminal truth, and final assembly.