Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent

Abstract: Let k be a perfect field of characteristic p>0. We introduce an object-level construction for canonical strong embedded resolution and principalization over k. The construction program replaces monotonicity of pointwise numerical invariants by a well-founded history of addressed comparison factors. Starting from the differential-integral saturation of a marked Rees algebra, we construct total-Hasse activity packets, filtered coefficient cubes, semilinear Frobenius-Hasse sources, and literal transform data for ordinary permissible blowups. A six-row defect calculus routes local problems to certified surface, toroidal-monomial, binomial, and additive-type procedures, after which clean centre portfolios are serialized and descended on a global nerve. The central structure is a global replacement certificate transporting successor addresses, paid quotients, typed traces, displayed parents, reopening data, and terminal truth across macroblocks. We prove that a complete state equipped with this certificate admits a strict multiset replacement in a single dependent well-founded order; hence the iteration terminates and the exhausted state reconstructs a regular strict transform having normal crossings with the ordered boundary. We further formulate an object-level realization of the certificate through rigid generation, cross-generation no-reset, complete wild-capacity control, a centre-or-typed-exit alternative, structured cofibres, displayed-parent allocation, and literal terminal truth. The program page is also available at website https://sites.google.com/view/positive-char-resolution

• The paper proposes canonical strong embedded resolution over perfect fields of characteristic p>0 by combining differential–integral saturation, total Hasse operators, Frobenius data, and exceptional-divisor history.
• The framework replaces reliance on a single numerical invariant with dependent descent on historically addressed occurrences, supporting termination through well-founded multiset replacement across blowup blocks.
• The claimed construction preserves ordered normal-crossings boundaries and is functorial under open, smooth, and étale pullback, field extension, re-embedding, principalization, and intrinsic resolution, though the supplied overview does not verify the proofs.

Scope and principal claim

“Resolution of Singularities in Positive Characteristic: Frobenius–Hasse Towers and Exceptional-History Descent” presents a nine-part program for canonical strong embedded resolution over a perfect field $k$ of characteristic $p>0$ (2608.20066). The claimed output is a finite sequence of ordinary blowups with regular permissible centres such that an ordered simple-normal-crossings boundary is preserved throughout. The construction is asserted to be independent of auxiliary presentations, stable under re-embedding, functorial for open, smooth, and étale pullback, and compatible with extension of the perfect ground field.

The central methodological claim is that positive-characteristic resolution cannot be organized adequately around a single numerical order invariant. Instead, the paper retains differential, Frobenius, and exceptional-divisor data in a structured local object, and then proves termination by descending a well-founded order on historically addressed occurrences. The slogan “where numerical descent fails, historical descent begins” accurately describes the division of labor between the local and global parts of the construction: local algebra records the information needed to control singularities, while exceptional history supplies the descent mechanism needed to establish termination.

The asserted geometric consequences include strong principalization of coherent ideals, reduced embedded resolution, and intrinsic resolution obtained through standard embedding and descent procedures. These are substantial claims. However, the supplied text is an architectural and abstract-level account rather than the detailed mathematical body of the nine parts; consequently, the essay can assess the stated framework and its internal organization but cannot independently verify the individual theorems, hypotheses, or proofs.

Local replacement of numerical order

The local theory begins with a marked Rees algebra and replaces it by its differential–integral saturation. This operation is intended to make the local resolution datum invariant under the differential operations relevant to permissible blowup and to prevent information from being discarded merely because it is invisible to ordinary order. Total Hasse operators and coefficient cubes are used to retain higher-order and purely inseparable information, while filtered Rees complexes provide a transformation interface under blowup.

This is particularly important in characteristic $p$, where ordinary differential operators may fail to detect structure because of vanishing derivatives and where Frobenius phenomena produce inseparable behavior not reflected in characteristic-zero-style coefficient data. The use of total Hasse operators is therefore not an auxiliary refinement: it is the mechanism by which the construction attempts to make differential information robust under characteristic-$p$ pathologies.

The local packet comprises several interlocking components:

• a saturated marked Rees algebra;
• total-Hasse activity and coefficient cubes;
• filtered transformation data;
• semilinear Frobenius–Hasse sources;
• height filtrations and gauge-descent information;
• prepared generic-entry data.

The paper’s strong claim is that this packet is presentation-independent and survives re-embedding. If established, that result would address a central difficulty in embedded resolution: local invariants often depend on a chosen embedding or coefficient presentation, whereas a functorial resolution algorithm must transport canonically across different presentations. The supplied content states this invariance but does not provide the comparison theorem or its proof.

Frobenius–Hasse towers and semilinear height

Parts II and III organize the positive-characteristic contribution through semilinear sources and height filtrations. A primitive semilinear source appears to encode the interaction between Frobenius powers and Hasse derivatives in a form suitable for transformation under blowup. The associated height filtration is used for gauge descent and for identifying a prepared generic-entry packet.

The use of “semilinear” is mathematically consequential. A purely linear differential invariant generally cannot distinguish all characteristic-$p$ behaviors, since $p$-th powers can be annihilated by ordinary derivations. A Frobenius–Hasse source instead records the interaction of additive and inseparable structure with differential data. The claimed outcome is a finite hierarchy in which the relevant local defect can be exposed at an appropriate height rather than forced into a single scalar order.

Exceptional transformation is treated through an all-chart comparison and a literal derived source. This comparison is designed to track how the local packet transforms in every chart of a permissible blowup, including the interaction with the exceptional divisor. The paper further asserts finite-word heredity and an endpoint package. These terms indicate that the transformation process is not merely pointwise: it retains a finite history of transformations and proves that the resulting data remain within a controlled class.

The corresponding implication is that the construction can compare local states before and after blowup without resetting the invariant. Such “no-reset” behavior is essential for a resolution procedure in which exceptional divisors carry geometric information accumulated over previous stages. The paper explicitly develops an ancestry filtration for this purpose, treating exceptional components not merely as current boundary hypersurfaces but as objects with finite, structured provenance.

Exceptional history as a transformation invariant

The exceptional-history component is one of the paper’s most distinctive structural features. Under repeated blowups, exceptional divisors may participate in new singular configurations, and numerical invariants can decrease, remain constant, or become incomparable while the geometric history continues to constrain admissible centres. The paper addresses this by recording finite exceptional ancestry and transporting owner, parent, quotient, trace, and reopening data across macroblocks.

This data structure appears to support two tasks. First, it identifies which local defect or occurrence is responsible for a proposed centre. Second, it records how that occurrence changes when the construction passes through a block of blowups, including cases in which a previously resolved configuration reopens in a transformed form. The approach therefore treats exceptional history as part of the state of the algorithm rather than as metadata discarded after each blowup.

The paper claims “finite-word heredity”: the relevant historical information is represented by finite words and remains controlled under permissible transformation. If correct, this gives a mechanism for avoiding an uncontrolled accumulation of exceptional configurations. It also provides the basis for cross-generation unique addressing, later used in the global termination argument.

A notable conceptual consequence is that exceptional divisors are not handled solely through their current multiplicities or combinatorial incidence. Their ancestry affects the admissibility and interpretation of later centres. This is a stronger form of functorial state management than is present in algorithms whose invariants are recomputed from the current scheme alone.

Defect complexes and specialized backends

The local packet is converted into a defect complex, which is then strictified and routed to one of several specialized backends. The paper identifies surface, toroidal–monomial, binomial, and additive-type backends. A six-row defect ledger and “paid handoffs” are used to ensure that passage between backends does not lose the information required for termination or reconstruction.

This modular organization separates the general characteristic-$p$ control mechanism from classes of singularities for which more specialized resolution procedures are available. Surface and toroidal–monomial cases provide geometrically structured settings; binomial cases exploit explicit algebraic combinatorics; additive-type cases address phenomena associated with Artin–Schreier-like or Frobenius-controlled behavior. The additive torsor component is especially relevant to positive characteristic, where residual additive structures can persist after ordinary coefficient elimination.

The strictification step is important because a defect complex may contain overlapping, redundant, or noncanonical descriptions of the same obstruction. Strictification presumably selects a form in which each active defect has a well-defined owner and transformation behavior. The “paid handoff” terminology indicates that transferring an occurrence from one backend to another carries an explicitly tracked cost or certificate. This prevents modularity from undermining global termination: a backend change is not treated as a free reclassification that could evade descent.

The paper does not provide, in the supplied material, explicit complexity bounds for the backend routing, nor does it state quantitative bounds on the number of blowups. Thus, although the construction is finite in the asserted theorem, no numerical performance guarantee can be extracted from the abstract.

Global serialization and functoriality

Part V assembles local resolution words into a global procedure. The principal devices are clean portfolios, canonical refinements, descent centres, a global nerve, and a scheduler with owner no-reset. These structures address the passage from local charts and local histories to a globally defined sequence of centres.

A local resolution algorithm is insufficient for a global theorem unless local choices can be synchronized on overlaps. Canonical refinements and a global nerve appear to provide the combinatorial framework for making compatible local decisions. Descent centres then convert locally described centres into global permissible centres. The scheduler determines the order in which competing local defects are processed.

The owner no-reset condition is central. It asserts that, after a transformation or a change of local presentation, an active occurrence retains its identity or is transported through an explicitly defined successor relation rather than being treated as a newly created problem. This condition is what connects local transformation theory to the global termination proof.

The stated functoriality properties are extensive: open, smooth, and étale pullback, as well as extension of the perfect ground field. Such functoriality would imply that the construction is compatible with the standard descent procedures used to pass between embeddings and intrinsic schemes. It would also constrain the algorithm substantially, since centres cannot depend on noncanonical local coordinates or arbitrary choices of coefficients. The supplied abstract states these properties as conclusions, but does not expose the exact categorical formulation or the verification of compatibility with each class of morphism.

Termination through dependent occurrence descent

The paper rejects termination arguments based exclusively on a pointwise scalar invariant. Instead, it defines an order on addressed occurrences carrying dependent data, including their owner, parent, quotient, trace, and reopening information. A global replacement certificate then shows that each completed macroblock replaces a nonempty multiset of active parent occurrences by strict descendants in a well-founded dependent order.

This is the formal core of the proposed termination proof. Letting a resolution state be represented by a multiset of active occurrences, the replacement theorem supplies a strict multiset descent whenever a nonterminal block is completed. Since the underlying dependent order is well founded, infinitely many such replacements are impossible.

The claim is stronger than ordinary lexicographic descent in one respect: the identity of an occurrence and the data attached to it are part of the order itself. This allows the proof to handle reopening, backend handoffs, and exceptional ancestry without pretending that a single numerical invariant decreases monotonically at every elementary blowup. The renewal forest provides the corresponding combinatorial picture: descendants may branch, but the completed block must replace active parents by strictly lower objects.

The paper lists six realization components needed to make this abstract certificate effective:

1. rigid constructor generation;
2. cross-generation unique addressing;
3. complete wild-capacity control;
4. a centre-or-typed-exit alternative;
5. structured cofibres;
6. displayed-parent allocation and literal terminal truth.

These conditions are intended to close common gaps in descent arguments. In particular, unique addressing prevents two distinct occurrences from being conflated across generations; wild-capacity control handles uncontrolled characteristic-$p$ behavior; and the centre-or-typed-exit alternative ensures that failure to choose a centre is itself classified and incorporated into the descent mechanism.

The implication is that termination is not proved merely by asserting that a complexity decreases. It is proved by exhibiting a transportable certificate whose components survive every transition in the algorithm. This makes the termination theorem dependent on the successful realization of all six components, a point the paper itself emphasizes through Parts VII–IX.

Certificate realization and terminal reconstruction

Parts VII–IX instantiate the abstract replacement mechanism. They develop a realization site, obstruction calculus, address and quotient criteria, reopening calculus, chamber assembly, one-step cleavage, prefix heredity, fresh-run comparison, and complete wild packets. Part IX then assembles the canonical A–F certificate through saturated generation and simultaneous ancestral-carrier descent.

The organization indicates that the certificate is not a single lemma but a layered verification system. The obstruction calculus identifies why a proposed local transition cannot proceed directly. Reopening calculus specifies how previously processed configurations can re-enter the active state. Fresh-run comparison and prefix heredity establish that the behavior of a new generation is compatible with the behavior of its ancestors. Simultaneous ancestral-carrier descent appears to ensure that related occurrences are descended together rather than processed in mutually inconsistent orders.

The phrase “complete wild capacity” addresses the most delicate positive-characteristic cases. It suggests that the construction reserves sufficient capacity in its packet of Hasse, Frobenius, and exceptional data to represent all relevant wild phenomena, rather than proving only a generic or tame-case statement. This is a bold claim, but the supplied content gives no explicit definition of wild capacity or examples demonstrating its necessity.

Terminal reconstruction is expressed as a literal truth comparison: the exhausted state is identified with the required geometric normal form. This is stronger than termination alone. A procedure may terminate at a state where its internal defect ledger is empty without that state satisfying the desired geometric conclusion. The paper therefore separates exhaustion of the certificate from verification that the exhausted certificate is equivalent to principalization, normal crossings, or embedded smoothness as appropriate.

The final assembly claims strong embedded resolution, strong principalization, reduced embedded resolution, and intrinsic resolution. These outputs are logically related but not identical. Strong principalization concerns coherent ideals and controlled total transforms; reduced embedded resolution concerns the strict transform of a reduced subscheme and the boundary; intrinsic resolution requires independence from a chosen embedding. The architecture explicitly presents these as consequences of the same local packet, global scheduler, and descent formalism.

Limitations and open questions

The principal limitation of the supplied material is evidentiary rather than conceptual: it contains the global abstract, contents, and architecture of a nine-part treatise, but not the mathematical arguments themselves. The stated theorem therefore cannot be evaluated here at the level required for publication-grade verification. In particular, the following points remain open from the provided text.

• The exact definition of differential–integral saturation is not given, so its preservation properties and relation to integral closure, differential closure, and Rees-algebra equivalence cannot be assessed.
• The transformation law for the Frobenius–Hasse sources under every permissible blowup is asserted but not demonstrated.
• The construction of the specialized backends and the proof that every defect reaches a certified backend are not included.
• The precise dependent order on addressed occurrences and its well-foundedness are not stated formally.
• The six realization components are listed, but the supplied text does not show that they are simultaneously compatible.
• No explicit examples, counterexamples to simpler invariants, or numerical bounds on blowup length are provided.
• The claimed functoriality under smooth and étale pullback and under perfect-field extension requires detailed descent and base-change proofs that are absent from the supplied content.

The paper also depends essentially on the assumption that the ground field is perfect. The abstract does not indicate which parts fail over imperfect fields or whether the perfectness hypothesis is used only for descent and coefficient preparation or is intrinsic to the Frobenius–Hasse construction. Similarly, the scope is resolution of schemes admitting the stated embedded presentations; the precise finiteness, regularity, and boundary hypotheses on the input are not specified in the supplied excerpt.

A specific question left open is whether the historical descent framework can be reformulated in a way that separates the genuinely geometric ancestry data from the particular combinatorial encoding by finite words, addresses, and renewal forests. Another is whether the asserted strong functoriality forces a canonical choice of all backend transitions or whether some hidden choices remain inside the certificate realization.

Conclusion

The paper proposes a comprehensive positive-characteristic resolution architecture built from differential–integral saturation, total Hasse operators, Frobenius–Hasse semilinear sources, exceptional ancestry, defect backends, and a globally serialized replacement certificate (2608.20066). Its central claim is that resolution can be made canonical and terminating without relying on a single decreasing numerical invariant: local singularity data are enriched, exceptional history is preserved, and termination is obtained from well-founded descent on addressed occurrences.

The framework is ambitious in both scope and internal organization. Its mathematical significance depends on the detailed realization of the transformation laws, backend completeness, functorial descent, and the six-component replacement certificate. The supplied content establishes the intended proof architecture and the claimed consequences, while leaving verification of those components to the full nine-part treatise.