A mathematical preprint claims to turn selected resolution tasks in characteristic p — a setting where the underlying field has positive characteristic — into finite sequences of ordinary blowups, formal operations that replace a complicated local structure with a more organized one. At the global level, its result is explicitly limited to one frozen generation: a scheduler is claimed to assemble a finite blowup word whose centres are regular, boundary-clean and permissible.
That does not amount to a proof that the entire process always ends. The supplied Part V text says its finite global word for one generation does not imply termination of successive macroblocks, and leaves strict replacement and terminal reconstruction to Part VI.
A formal evaluator, not an experiment
The formal input is a perfect field of characteristic p greater than zero, a smooth differential–integral state, and an ordered simple-normal-crossings boundary. This is a theoretical construction; no empirical sample is studied.
At its centre is a finite typed evaluator — in effect, a rule-based program — built from controlled transforms, Hasse and differential–integral operations, face restrictions, monic division, source and torsor changes, and ordinary blowups. For the fixed primitive evaluator, the manuscript claims every failure complex can be given a finite filtration by named constructor families, with no additional defect constructor.
After a generic-properness gate and local shrinking at a chosen generic point, the manuscript claims a finite canonical block of literal regular, boundary-clean, permissible centres. Its possible endpoints produce a strict-model result, move to a lower-support child, or hand the case to another typed branch.
Different backends, narrower promises
For a pre-hosted packet in the stated low-dimensional surface case or a surface-product tag, the surface backend is claimed to end after finitely many permissible blowups in regular hosted support, with portfolios tracking boundary monomials and Fitting data. Residual nonflat classes become lower-support children.
A separate binomial backend covers certified binomial lattice packets. It is claimed to use finite subwords of ordinary regular, boundary-clean, permissible blowups and to produce specified terminal or emitted packet types; the text also says that cover-based centres are not used to define those blowups.
The manuscript also treats rank-one additive torsors — algebraic objects whose full structure is not captured by an ideal or a rank count. It claims the ideal portfolio can detect evaluator-relevant failures, but that the full torsor class and its coaction data are needed to distinguish packets with identical ideal and rank profiles.
On a valid prepared algebraic branch, the additive backend is claimed to retain the displayed torsor data and comparison cone through a finite literal-downstairs word. Other branch types keep their existing constructor and do not receive torsor data that is absent from them.
From local pieces to a global block
Under a finite local atlas and the stated certification gates, the global theorem claims that each stage of the resulting macroblock is the blowup of a literal coherent ideal whose zero scheme is a regular, boundary-clean, permissible centre and whose activity certificate passes.
A related principalization claim concerns a certified finite clean portfolio. After a finite word of ordinary blowups at literal regular, boundary-clean, permissible and activity-certified centres, every occurrence ideal in that portfolio is said to have an invertible boundary-monomial total transform.
With the complete master record held fixed, the finite serialized stages are claimed not to depend on which finite smooth or étale cover is used to present the data. The qualification matters: the claim does not cover independently rebuilt atlases with different tokens.
Part V's abstract also describes an ancestry-tracking device that contracts same-type persistence components, charges active reappearances through comparison factors, and blocks fresh sponsorship during the current macroblock. The supplied review notes that detailed proof sections for this claim were not present in the available text.
The boundaries are part of the result
The appendix restricts its chart identities to packets with pre-existing regular-coordinate, transversality, monicity or binomial certificates. It excludes a general theorem for arbitrary Fitting supports, graph closures, conductor loci, filtered complexes or semilinear packets.
The extracted material moves from Part IV to a separately titled Part V on global serialization, principalization and descent. Within the supplied material, strict replacement and terminal reconstruction remain assigned to Part VI.
The work should therefore be read as a conditional formal construction, not as a completed universal resolution theorem. Its one-generation serializer does not establish termination of later macroblocks, and the stated scope does not extend to the excluded classes of supports and packets.
Paper data and sources
Original title: Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Authors: Chenxiao Tian
Journal/Repository: arXiv
Status: Preprint, not yet peer-reviewed
First online: 2026-08-20
DOI: Not available
Original paper · Full text