Random polynomials on local surfaces: rationality and reciprocity in every residue characteristic
HTML edition with the Lean 4 formalization woven in. Statements carry a Lean badge: hover or tap it to see the corresponding Lean declarations; Compare with Lean (top right) shows them beside the text. What is and is not formalized is summarized on the Formalization page.
The problem, standards and verification were set and directed by Asvin G; Claude (Anthropic) and GPT-6-Astra (OpenAI) produced the text and proofs, with the Lean formalization cited in [Lean].
Abstract
A monic polynomial over a complete discrete valuation ring defines a horizontal curve on an arithmetic surface. Fixing its initial homogeneous form turns one point blowup into independent branch problems with an exact change of volume. The resulting finite recursion computes the joint law of ramification indices and residue degrees as rational functions of the residue-field size, the same over every complete DVR with finite residue field. Arbitrary vertical units remain in the geometry, so the recursion applies in every characteristic and at every prime. Hensel lifting assembles these local computations into polynomial probabilities. The quadratic exponents in the transition weights form a product in noncommuting variables; inverting the residue-size variable reverses that product and proves the two factorization symmetries conjectured by Bhargava–Cremona–Fisher–Gajović. Extracting coefficients gives a totally ramified divisor recursion and the root-moment, split and unramified-field formulas of Bhargava–Cremona–Fisher–Gajović, Buhler–Goldstein–Moews–Rosenberg and Shmueli.
1. A polynomial, a curve, and its branches
The probability question
Are a random polynomial's factorization probabilities determined by the residue-field size, or do they retain finer information about the local field?
Let be a complete discrete valuation ring with finite residue field. Choose a uniformizer and put , , , . The valuation has ; set , . Normalize additive Haar measure on by , as in local densities for global counting [BCFJK16, BCF21]. For with finite field extensions , let be their residue fields and their valuations with value group . Put , . Its type is the multiset , with degree [Ne99, Se79].
For , put and let forget unit scalars. The three sampling measures are
With coefficient vectors , the first two sample and the algebra . The third samples and the coordinate ring of its zero scheme , of degree when the discriminant is nonzero. These algebras are almost surely étale: the discriminant-zero locus is Haar-null. Dividing unrestricted coefficients by their common power of gives the same projective law.
For , give commuting indeterminates weight and put ; multiplication records products of fields. For , define
From root counts to a type conjecture
For the ramified quadratic type, the monic and cluster models give
Substituting for exchanges the answers. The other two quadratic types have the same exchange, while each projective probability is fixed. This symmetry persists far beyond quadratics. For rational roots and , the th binomial moment is ; these moments determine the root-count distribution. Bhargava–Cremona–Fisher–Gajović proved that every such moment is rational, with monic/cluster exchange and projective invariance, in every degree and at every prime [BCFG22, Theorem 1(a)].
Root counts distinguish only the factors of type . Classifying extensions and measuring their polynomial generators are different counting problems [Kr62, Se78, Bh07, Ke07, Ya25]. Caruso calls the root symmetry “mysterious”; his Theorem C shows why individual fields are too fine a refinement: a ramified quadratic field's root density (the expected number of roots generating that field) need not be invariant under , but summing over the fields restores the symmetry [Ca22].
The intermediate refinement is the type. Regard also as an indeterminate; for a rational function in and the type variables , set , fixing generating variables as well. In our notation, [BCFG22, Conjecture 1.2] asserts that the probabilities over are rational functions , evaluated at , with
The assertion includes primes dividing the degree.
What the tame methods explain
When every ramification index is prime to , extensions admit descriptions using roots of unity and roots of a uniformizer [Yi22, Theorem 3.6]. Del Corso–Dvornicich proved effective rationality for tame monic types [DCD00]. Yin treated all three models by integrating root counts over extensions and recursively computing discriminant valuations from Teichmüller digits (over , the residue lifts satisfying ): equal leading digits group conjugates, unequal digits contribute to the discriminant, and subtracting a common digit reduces the problem [Yi22, Section 1.1]. Fixing the base's absolute ramification index and residue degree gives rationality in and projective-density asymptotics [Yi22, Theorems 3.1–3.2]. The auxiliary densities (the other terms of the recursion) need not be symmetric [GWY, Introduction].
For a Galois cover with group , G, Wei and Yin assume an equivariant resolution hypothesis (for relevant , a -equivariant resolution with normal-crossings ramification divisor). Poincaré duality makes paired densities (sums for Frobenius and inverse Frobenius at fixed inertia) palindromic forms of weight (functions satisfying ), where is residue-extension degree; individual densities need not be palindromic [GWY, Theorem 3.10].
A polynomial type sums densities over admissible pairs (subgroups with cosets ), up to conjugacy [GWY, Lemma 4.4]. These are inversion-closed: inverting Frobenius preserves the inertia and decomposition orbits. Pairing therefore gives palindromy for each type. Normalization by and tame rationality give projective reciprocity [GWY, Theorem 4.5]; the monic/cluster identity remains open there [GWY, p. 18].
Yin's root-of-uniformizer parameterization requires tameness [Yi22, Theorem 3.6]; its conjugate-difference valuations change at wild primes. Write for a primitive th root of unity and normalize . His example has ramification index two and inertia degree three. For a nonzero Teichmüller digit with , the valuation step is , equal to only when [Yi22, Section 1.1].
GWY's duality requires an equivariant resolution over the integer ring [GWY, Hypothesis 3.3]. The arXiv versions of [GWY] stated the projective result at every prime (Theorem 5.10) by resolving the resultant locus, whose equivariant splitting of formal neighbourhoods into “tangential and normal formal discs” needs the residue characteristic prime to the isotropy groups, hence . The corrected version [GWY2] withdraws the wild claim and proves the tame case only; the wild statement remains unproven, not known to be false.
At wild primes, direct computation still settles small degrees: BCFG prove the conjecture in degrees two and three [BCFG22, p. 8], including the primes excluded in Weiss's formulas [We13, Theorems 4.1 and 4.3]. In arbitrary degree, restricting the type can simplify the recursion: Shmueli's single unramified field is governed by a divisor recurrence over [Sh22, Theorem 2]. Complete splitting instead separates by residue classes; BGMR's recursion uses Gaussian weights for degrees , over every complete DVR with finite residue field [BGMR06, Theorem 1.1, Remark 1.2, Lemma 5.1(4)], the weights in (1.7).
These recursions handle restricted types at every prime; general uniformity treats broader problems but leaves finitely many primes aside [DL01, Theorem 0.2; CL08, Remark 16.4.2], and BCFG suggest a connection to Denef–Loeser and Pas [Pa89] only for sufficiently large primes. A computation for every type must continue through wild ramification without changing its rules.
Universal laws and reciprocity
Theorem 1.1 (universal type laws). For every and every type of degree , there are rational functions , regular at every prime power, equal respectively to the monic, cluster and projective probabilities over every complete discrete valuation ring with residue field of size . There is no restriction on the residue characteristic, on the ramification of over , or on the characteristic of ; in particular the same function serves , every ramified extension of it, and . The finite state recursion in Section 6 and the assembly formula in Section 7 compute and ; the recursion alone computes (Theorem 6.2 and the identification (7.1)). Write their complete laws as
Theorem 1.2 (reciprocity). In every degree,
One cluster computation therefore also supplies the monic law by rational-function substitution, without assigning a probability meaning to a residue size below one.
Contributions
- Exact blowup volumes give one finite recursion over every complete DVR with finite residue field (Theorems 1.1 and 6.2).
- Comparing assembly and blowup equations proves both BCFG symmetries (Theorems 1.2 and 9.3).
- Selecting types consisting of one field gives a divisor recursion governed by the Euclidean algorithm (Theorem 10.2).
- Specializing type variables recovers the root-count, split and unramified-field recursions (Section 11).
- Lean 4 kernel checking certifies rationality and reciprocity using only the three axioms listed in Remark 1.3.
How the proof works
Hensel factorization separates residue roots. A root of multiplicity , translated to zero, gives a monic Weierstrass factor . Work on a complete regular local -algebra of dimension two with ; initially , . A curve is a principal ideal ; its field factors give the type. The boundary is , the union of vertical components. For a component , contact means .
For finite free over , put and choose as an integral basis. On the ideals lifting , intrinsic measure means the pushforward of product Haar measure on by . Write for this measure; Proposition 3.2 proves independence of the choices.
Blowing up replaces the closed point by , the line of directions. Put and . Let the tangent divisor be , with multiplicities and . A cell fixes and the boundary contacts. At , put . For a local exceptional equation , the child ideal is with . Write , . Gluing these independent child ideals recovers one parent ideal, with unnormalized measure
The parent curve ring has index of -length in , the product child ring, contributing to the Jacobian. Exceptional division to power contributes . Thus
Its reciprocal gives the parent measure.
For with , the event has probability : the order is one and Eisenstein's criterion gives . Otherwise the order is two. Return at requires , , a cell of volume . Substitution gives a child cluster of volume . The index of is ; division by on rank two contributes , giving Jacobian .
Thus (1.7) reads ; dividing by parent cluster volume gives probability . A degree- cluster over residue size has volume , so every order-two divisor has child-volume product and the same probability. Among the divisors, double rational points return to , with total probability ; distinct rational pairs give ; irreducible quadratics give . Hence
The irreducible tangent point becomes rational over the unramified quadratic extension, where its child is linear. Viewed over , that child has residue degree two. In general, a degree- point replaces by and multiplies residue degrees by .
The cluster law also computes monic quadratics. Their double-root reductions among residue polynomials leave a cluster; split and irreducible squarefree reductions each have probability . Hensel lifting gives
Conversely, the order-two part of the blowup calculation is this same monic assembly. The all-degree assembly and blowup identities specialize to (1.10) and
Off the boundary (the vertical components through the point), directions form . Its degree- divisors are the monic residue polynomials, with monic conditional laws. Thus has contributions of states earlier in the contact order of (1.13), plus . The reciprocal exchange must preserve these linked assembly and blowup equations.
On each subsequent surface choose regular parameters . For vertical multiplicities and , the state records
Here ; in particular on is the cluster model. Absorbing into requires an th root, which simple-root Hensel lifting cannot provide when the residue characteristic divides . We keep arbitrary and induct over every surface realizing the same data.
Order states by contact size: or , with crossings first at ties. Since gives , one has and . Writing for the boundary-point multiplicity, its child has size , explaining the tie rule; crossing children have sizes at most or . Only at one of rational directions returns a single-boundary state. Its return probability is
The return probability and the weighted sum of laws upon leaving stay unchanged on successive surfaces, so a geometric series sums the returns. Contact one is terminal because the curve ring is a DVR. Termination is almost sure, without a resolution theorem.
The two series below must agree. Let mark degree and let , , be their first differing term. Assuming agreement in smaller degrees, (9.4) gives both the same blowup equation through degree . Inverse Hensel assembly multiplies this difference in by , while blowup multiplies it by :
For , solving (1.10) for gives multiplier on ; (1.11) gives . Since for , the first difference vanishes; degree one is terminal.
The algebra makes the blowup equation reciprocal-symmetric: its anti-involution extends by , , for words , reversing the products in (8.1)–(8.5) that enter (9.4).
Writing for , the unnormalized degree- projective law gains the reciprocal factor , so normalization preserves the law.
Remark 1.3 (formalization). Theorem 1.1 for the monic and projective laws, over every complete DVR with finite residue field, and Theorem 1.2 as the coefficientwise identities (1.6), are formalized in Lean 4 over Mathlib: they are the theorems and of [Lean]. The development is complete (no admitted statements), and each main theorem uses only propositional extensionality, classical choice and quotient soundness. It defines the type of a local algebra through finite integral closures — the reduced-algebra convention of Section 2 — rather than through separability; the two conventions agree off a Haar-null set.
Standard facts. Finite extensions of , including inseparable ones, have a unique extended valuation and a complete DVR integer ring, free over of rank [Ne99, II.(6.8) and the following remark, p. 151; Se79, II.§2, Proposition 3 and I.§4, Proposition 10]. Unramified extensions correspond to residue extensions, uniquely up to unique isomorphism compatible with a specified residue identification, and their automorphisms are the residue Galois group [Se79, III.§5, Theorems 2–3]. Analytic inversion and change of variables hold in either characteristic [Ig00, Theorem 2.1.1 and Proposition 7.4.1]. We also use noetherian local algebra, faithful completion, Cartier divisors, nilpotent Nakayama and Čech cohomology; Appendix A proves the inverse-limit assertion.
2. What a local state remembers
The blowup of a cluster need not leave another cluster. Writing , the chart puts a finite tangent direction on the single vertical component . The other chart has , hence : at the exceptional line meets the old vertical component. Following a branch therefore requires two kinds of state. Each retains the component multiplicities and the curve's contacts; the surface and its vertical unit remain arbitrary.
Let be a complete regular local ring of dimension two containing , with inducing an isomorphism , and with regular parameters . A single-boundary surface has ; a crossing surface has , where and . We call the vertical components (and ) the boundary; a state records contact with each component. After a blowup an existing component is the old boundary and the exceptional line is the new one. Multiplying an equation by a unit leaves its branches unchanged, so a curve means a principal ideal. Its state and the integer are
For and , the state consists of ideals with : the cluster model.
All contacts are positive and finite. The lengths are dimensions over , since a vertical parameter kills . Write for the quotient algebra of the curve. Lemma 2.1 shows that it is free of rank over , so it is an order in the generic algebra of dimension ; we call it the curve order and the degree of the state.
Lemma 2.1 (degree and flatness). The special fibre and the curve order satisfy
In particular is a nonzerodivisor on and has degree over .
Proof plan for Lemma 2.1.
- Present the special fibre and cancel prime parameters to compute its curve length.
- Lift a residue basis one -adic digit at a time; regularity cancels every putative relation.
Proof. The complete local ring is a -algebra, hence has characteristic . Hensel's lemma lifts each residue element uniquely to a root of : the derivative is congruent to modulo the maximal ideal (indeed it equals here). Characteristic makes these roots a field under addition and multiplication. They give a coefficient field. Sending to now gives the asserted surjection. Its associated graded map is an isomorphism: , and the initial ideal of is generated by the initial monomial of , since initial forms multiply in this domain. Successive approximation in the complete local rings makes the original map an isomorphism.
Lift to . Finite contact says that none of the axes in the vertical monomial divides . Repeated cancellation of those prime parameters shows that is a nonzerodivisor. In the auxiliary curve ring , whose quotients compute special-fibre lengths, the same parameters are nonzerodivisors. Filtering by their powers gives and, in the crossing case, the exact sequence
Consequently .
If in , reduction modulo forces , and cancellation gives . Thus is regular on . Choose lifting a basis modulo . Successive subtraction of residue coefficients writes any class in as , with : the errors lie in and tend to zero -adically. The quotient is complete because ideals in a complete noetherian local ring are closed. A relation among the has every coefficient divisible by ; regularity allows cancellation and repetition. Its coefficients lie in every , hence vanish. This proves freeness. ∎
Blowing up the closed point preserves this class of surfaces. On its two charts substitute or . The exceptional equation and a parameter on the exceptional line form regular parameters at each completed local ring. At a closed point of degree , let be the integer ring of the unramified extension of degree , with a specified identification of its residue field with . Such an extension is unique up to unique isomorphism respecting that identification [Se79]. A monic lift of the minimal polynomial of a generator of presents . Its simple residue root lifts by Hensel's lemma in the completed local ring at , giving an embedding of : the kernel is zero because is a DVR and its uniformizer remains nonzero. The substituted equation for is still a unit times a monomial. In the crossing case the two old components meet the exceptional line at distinct rational points, so at most two vertical components pass through any child point. Each child is treated from here on with as its base ring and residue size .
Write for the residue field of .
On a reduced generic fibre, the normalization of is the product of the integer rings of its field factors, whether or not those fields are separable over . A branch valuation is the normalized valuation of a field factor of , with . The vertical equation gives or . Its residue degree is the degree of its residue field over . These valuations read the type; measuring the curves realizing each branch gives its probability. For related valuation methods, see [FGMN15, GMN12, OW20].
For local states we use the reduced-algebra type convention: a reduced finite -algebra is a product of finite field extensions of , and its type is the multiset of their . The characteristic-free degree formula in Section 1 applies to every factor. Equivalently, once the blowup process terminates, one reads these pairs from the terminal DVRs, multiplying residue degrees along the points visited. For example, in characteristic , is a field of type although it is inseparable. Reducedness means distinct irreducible factors; it does not require coprimality with the derivative, which detects separability. The global polynomial models retain the étale convention because their discriminant-zero set is null.
Let be the curve ideals with state data (2.1). Using the intrinsic chart measure of Proposition 3.2, put and . Theorem 6.2 proves total mass one and independence of the surface.
Lemma 2.2 (contact one). The laws in the following states are deterministic:
Proof. Contact one with says that generate . Thus is a complete discrete valuation ring with uniformizer and residue field . In a crossing state its -valuation is , since the length of its quotient by is . The valuation of is therefore ; on a single-boundary surface it is . Interchanging the parameters proves the last assertion. These statements apply to every ideal in the state, so do not depend on the measure. ∎
Only is the base case of Theorem 6.2; the crossing contact-one laws are computed by (6.7) and agree with Lemma 2.2.
Fixing a residue ideal describes a measure chart; fixing a tangent divisor describes one blowup. An allowed residue ideal has a nonzerodivisor generator with finite positive contact along every boundary component. A cell consists of curves in one state with fixed maximal-ideal order and fixed tangent divisor on the exceptional line. An occupied point belongs to the support of , the divisor of the initial form.
Order states by contact size: for and for , with crossings before single-boundary states at ties, since a single-boundary parent can have a crossing child of equal size. Induction ranges over all vertical multiplicities simultaneously. Only finitely many states have , but each represents a space of curve ideals; probabilities require a measure on that space.
3. Hard input I: measure on curve ideals
Haar measure on equations would count unit multiples separately. Infinitesimally, multiples of do not change its ideal, leaving the quotient , free of rank , as the tangent lattice. An integral basis suggests coordinates. To give those coordinates a measure, every lift of a fixed residue ideal must have a unique representative , with , and changes of basis or generator must preserve Haar measure. In the quadratic cluster the proposed coordinates are just the two coefficients.
For , set and .
The ring is complete also for the -adic topology: a -adic Cauchy sequence converges -adically, and the closed ideals preserve its congruences in the limit. It is separated since . Thus , with norm given by divisibility by and unit ball , is a nonarchimedean Banach -algebra. Cauchy sequences have bounded denominators, reducing completeness to that of .
Lemma 3.1 (bounded division and normalization). Suppose is a nonzerodivisor on with quotient of dimension , and choose lifting a basis of that quotient. Write . There are integral, bounded linear division maps and characterized by
Every has a unique factorization
The coordinates are convergent series of bounded multilinear maps in ; in particular they are analytic on every finite-dimensional analytic family taking values in .
Proof. The freeness argument in Lemma 2.1 uses exactly the hypotheses on made here. Take to be the quotient coordinates in its basis . The difference in (3.1) is uniquely divisible by , defining . Both maps are -linear, preserve multiples, and extend with norm at most one after inverting . Consequently is an isometric isomorphism for the maximum norm. For , (3.2) is the fixed-point equation
Its right side preserves and has Lipschitz constant at most there. This proves existence and uniqueness.
To prove analyticity with an actual convergence neighborhood, set
Induction proves the bound, since every multilinear operation has norm at most one and the ultrametric inequality does not count summands. The sum converges uniformly on , and substitution in (3.3) identifies it with the fixed point. For an analytic family near with , shrink a parameter polydisc so that the Gauss norm of its convergent expansion is less than one. The bounded maps in (3.4) act on its coefficient series with the same estimates. The sum therefore converges in Gauss norm on this one polydisc. Its finite coordinate components are ordinary convergent power series, which proves the claimed analytic dependence rather than merely pointwise convergence. ∎
Uniqueness in (3.2) removes the unit freedom within a chart; comparing charts still requires control of their Jacobians.
Proposition 3.2 (intrinsic measure). For any fixed allowed ideal , its lifts as curve ideals are uniquely parametrized by
These charts have analytic transition maps with unit Jacobian. They define an intrinsic measure , in which each chart has mass . At its tangent lattice, after choosing the generator , is .
Proof. Any generator of a lifted ideal can first be multiplied by a unit so that it reduces to . Apply (3.2). If two normalized representatives generate the same ideal, their relating unit reduces to one, by cancellation of . Uniqueness in (3.2) makes their coordinates equal.
At an ideal common to two charts choose the fixed unit identifying their generators at that ideal. Multiply the first family by this unit and normalize near the second generator using Lemma 3.1. This gives an analytic change of coordinates; reversing the roles proves the inverse analytic. Infinitesimal generator changes modulo infinitesimal units are precisely classes in . The form an integral basis there, again by Lemma 2.1. If , differentiation modulo gives multiplication by the unit , followed by an integral change of basis. The derivative therefore preserves the tangent lattice and has unit determinant. The change-of-variables theorem for analytic maps over , valid in every characteristic as specified in Section 1, identifies the coordinate Haar measures. Finally has mass . ∎
Normalizing a whole state requires counting its residue ideals. A residue generator restricted to is a power series in of order , with zero coefficients followed by a nonzero one; dividing generator counts by unit orbits gives ideal counts.
Proposition 3.3 (state volumes). Each state is a finite disjoint union of these charts, and its total intrinsic volume is
The probability measure on a state is .
Proof. Set , ; write . An allowed quotient has length , so and . If , then for some . Thus changing a generator modulo preserves its ideal. Both the generator counts below and the unit-orbit counts take place in the finite ring .
Along a single axis, contact imposes zero coefficients and one nonzero coefficient. Along two axes, the zero lists share their constant coefficient: there are zero conditions and two nonzero conditions. These coefficients exist in , since . Thus the respective numbers of generators are
Multiplication by a generator on has cokernel dimension , hence kernel dimension . Its annihilator contains no unit. The stabilizer under is , of size , and every generator of the same ideal is a unit multiple: from , one gets , forcing to be a unit. Therefore each orbit has size . Dividing (3.7) by this size gives and residue ideals. Multiply by their chart mass to obtain (3.6). ∎
The child measures define a product measure. Identifying it with a parent event requires every allowed tuple of child ideals to come from exactly one parent ideal.
4. Hard input II: independent curves on the exceptional line
A tuple of child ideals supplies no choice of generators that could be glued into a parent equation. On each finite thickening of the exceptional line , their quotients have disjoint supports, so the kernel of the direct-sum quotient map glues the ideals. The glued divisor must still descend to one equation. Its restriction to has tangent degree , while restricts with degree ; hence adding gives degree zero. Trivializing this line bundle recovers a parent equation. The cohomology governing that trivialization also measures the index between parent and product child orders.
Let , with blowup morphism and exceptional curve , and let be its formal completion along . Put and for . The charts , identify with and give
The conormal line is generated by on one chart and on the other; gives its twist and the dual's sign.
Write for the charts , , and for the transition maps of any tower of complexes. For a tower , put , . Finite-level gluing can acquire an inverse-limit cokernel; eventual surjectivity on sections removes it.
Lemma 4.1 (passage to the formal limit). Let be a coherent sheaf on , and let be its Čech complex on the two blowup charts. The finite-thickening calculations pass to the formal completion: its transition maps are surjective in each degree, , and the termwise inverse limit computes . Writing for the difference map of a tower, one has
If the maps on are eventually surjective, the first cokernel is zero, so also commutes with the inverse limit. The proof, including acyclicity of the formal affine pieces, is in Appendix A.
Lemma 4.2 (formal functions and line bundles). On , every line bundle whose restriction to has degree zero is trivial, and for ,
In particular .
Proof. The Laurent-polynomial Čech calculation on gives , for , and , for . The latter quotient has basis . The sequences with kernel between and imply vanishing of and surjectivity on . Moreover is an isomorphism: it is so at , and its next graded map identifies the degree- monomials in with the basis of . Taking limits using (4.2) proves the assertions for .
A degree-zero line bundle on is trivial. Lift a generating section through all thickenings; the obstruction groups are . Each lift is still a generator by nilpotent Nakayama, so their compatible limit trivializes the line bundle on .
For the successive kernel is . Its vanishes for , so (4.2) applies by eventual surjectivity. Now the exact sequences
keep equal to via the natural maps : the quotient has no sections, so allowing these poles adds no global function. They add a quotient of -dimension to , since . Its -length is the same dimension. Summing these lengths gives , including . ∎
For a closed point , write , let be an exceptional equation, and put .
An invertible ideal locally generated by a nonzerodivisor is an effective Cartier divisor. Gluing these ideals therefore requires no choice of matching generators.
Lemma 4.3 (gluing with no compatibility condition). Prescribe finitely many ideals , where is a nonzerodivisor and is positive and finite. There is exactly one effective Cartier divisor on with these completed ideals and no other intersection with . Its restriction to is .
Proof plan for Lemma 4.3.
- At each thickening, form the quotient kernel and descend its rank-one freeness from completed stalks.
- Lift bases compatibly through successive thickenings, then recover the prescribed ideals by completion.
Proof. At level , the module has finite length, by filtering with powers of . It is therefore already a quotient of the uncompleted stalk: a stalk and its completion have the same quotients by powers of their maximal ideals. Define
The map is surjective at each stalk, because the supports are disjoint. After completion at , its kernel is generated by modulo . This generator is regular: is a prime parameter, it does not divide , and repeated cancellation shows that forces . Thus the completed kernel is free of rank one. Faithful flatness of completion descends this assertion. More explicitly, lift a basis of its one-dimensional space of generators modulo the maximal ideal; Nakayama gives a generator of the stalk, and the kernel of the resulting map from the local ring vanishes after completion, hence vanishes. Away from the prescribed support the ideal is the whole structure sheaf.
The reduction map is an isomorphism. This can again be checked after faithful completion, where it sends the generator to itself. Choose affine opens in the two charts trivializing . Affine exactness lifts each basis compatibly through all levels, and nilpotent Nakayama makes every lift a basis. Their inverse limits and compatible transition units give an invertible sheaf on . The inclusions into pass to an injective inclusion into , since each finite-level map is injective. Thus defines an effective Cartier divisor. On these opens the transition maps on sections of are surjective, so the same argument identifies its quotient with the inverse limit of the prescribed quotients.
Completing at recovers : is -adically complete by the closed-ideal argument used for in Section 3, and is complete for this topology because its quotient by has finite length. Any competing divisor has exactly the same finite-level quotients, which are determined by their completions at their finite support, hence the same ideal at every level and on . At level one, (4.5) gives the ideal of . This proves existence, uniqueness, and the stated restriction. ∎
For a parent curve put . Its initial form in defines its tangent divisor
The strict-transform equation is . A boundary of parent contact has a distinguished rational point on . In the chart , restricting to gives order . Thus , that point is occupied exactly when , and, when occupied, the child has old-boundary contact and exceptional contact . When the point is absent. Apply the same statement to the other boundary when present. At every point of , restricting to gives the dehomogenized initial form, of order at ; hence the exceptional contact is .
In every child label the exceptional component is listed first, so its first contact is the multiplicity on . For instance, at the boundary point of with , substitution gives : exceptional multiplicity and contact , old-boundary multiplicity and contact , hence the complete label .
Write . At a tangent point of degree , every child below is interpreted over the unramified coefficient extension of degree . For , choose . Its one boundary point has multiplicity exactly when . Its children are
For , choose . The two boundary multiplicities satisfy and . The children are
The order of contacts agrees with the order of multiplicities in each state. For instance, sends to , giving the first crossing child's multiplicities; the other chart exchanges the roles. An absent boundary contributes no child, including when or .
Proposition 4.4 (fixed-divisor bijection and index). Fix a parent state, an integer no greater than any of its boundary contacts, and a degree- tangent divisor satisfying the boundary conditions above. Strict transform is a bijection from its parent cell to the product of the child spaces with the stated contacts; their full state labels are those just listed. With , the natural map satisfies
In particular , without a reducedness assumption.
Proof. Given arbitrary allowed children, Lemma 4.3 glues their divisor . The degree of is , so (4.1) makes have degree zero. Lemma 4.2 trivializes it, and therefore also its dual ideal . Choose a global generating section of this ideal. Its inclusion in gives a global function with divisor exactly . Its exceptional order is exactly , because no child contains ; for a function of this equals its maximal-ideal order, as its first initial form shows. Its tangent divisor is , and the preceding chart calculation recovers exactly the parent contacts, including the equality cases. Two trivializations differ by a global unit; both the unit and its inverse belong to , so they define the same parent ideal. Gluing uniqueness gives the bijection.
The identity gives the multiplication isomorphism . Compose it with the inclusion into . Under the natural identifications of both spaces of global sections with from Lemma 4.2, the resulting map is multiplication by . Also : at finite level the quotient has disjoint finite supports and sections , whose limit is the stated product. Each factor is finite free over by Lemma 2.1, hence over . The cohomology sequence and Lemma 4.2 now give (4.9). Its final term is killed by a power of , proving the generic-algebra isomorphism. ∎
The quotient in (4.9) is the defect of the parent tangent lattice inside the product child lattice. Its length is therefore one factor in the Jacobian of strict transform.
5. Hard input III: the one-step measure identity
Strict transform also divides the equation by the th power of an exceptional equation. The lattice inclusion contributes determinant , while this division contributes because the residue-degree-weighted contacts sum to . Their product is ; pulling child volume back to the parent uses its reciprocal. To apply this determinant to measurable sets, the fixed-divisor bijection must be analytic in the intrinsic charts.
Theorem 5.1 (one-step measure identity). On the fixed-tangent-divisor bijection of Proposition 4.4,
Each child measure is defined over , with residue size . The identity holds for every Borel subset of the product of child states.
Dividing (5.1) by the parent state volume assigns a probability to each tangent divisor and gives the children their independent normalized laws.
Proof plan for Theorem 5.1.
- On a sufficiently small coefficient ball, exceptional division is integral and child normalization analytic, even with a positive old-boundary exponent at a crossing.
- The derivative combines the lattice index (4.9) with exceptional division, giving absolute determinant .
- The fixed-divisor bijection is locally analytically invertible; a countable Borel partition extends change of variables to every Borel set.
Proof. Fix a parent generator and integral tangent representatives . At write , where are regular parameters, cuts out the old boundary when is a boundary point, and otherwise; always and . Choose so that at all occupied points and . On the ball the parent tangent divisor stays fixed, and
This is an affine analytic family in when parametrized by . Its normalization is analytic by Lemma 3.1. Choosing an integral -basis of each makes it a finite-dimensional -analytic map. This argument also works at crossing points.
In the intrinsic tangent identifications its derivative is from to . It is well defined because a multiple of maps to a multiple of after division. Normalizing a generator just removes such multiples; other generator choices change tangent coordinates by integral automorphisms. At any generator in the cell, the derivative is the displayed map with in place of , conjugated by the integral lattice isomorphisms of Proposition 3.2 and by units. Proposition 4.4 applied to gives the same absolute determinant. The modulus of an invertible linear map is its determinant absolute value: write its matrix as with , which preserve normalized Haar measure; diagonal scaling has modulus . In particular the inclusion has absolute determinant . On the -factor multiplication by is injective, with cokernel of -length . Consequently
This derivative is invertible; the dimensions agree by (4.9). The inverse-function theorem makes the map a local analytic isomorphism. It is globally bijective on the cell by Proposition 4.4. Each state is a finite union of finite-dimensional balls and is second countable. A countable cover by these neighborhoods, refined into disjoint Borel pieces, therefore lets change of variables prove (5.1) for all Borel sets. Haar measure on is product Haar measure in any integral -basis, so a nonrational point introduces exactly the factor already counted in and no other normalization. ∎
Example 5.2 (a quadratic cluster chart). In take . To have order two at requires and . Modulo its initial form is . The tangent divisor twice the direction makes both latter coefficients zero, so and . The coefficient chart is the intrinsic chart (3.5): are an integral basis of by Lemma 2.1, so . Thus coefficient volume is . Substituting gives
whose nonleading coefficients range independently over . Thus
The parent-cell mass is unnormalized. Its conditional probability inside is . This calculation includes residue characteristic two and any ramification of .
A divisor's probability needs only its tangent degree, occupied boundary points and child state volumes. Divisors with the same degrees and multiplicities can be counted together.
6. A finite branching recursion
Grouping tangent divisors gives a finite equation for each state, but an equation need not yet be a finite computation: a child may repeat the parent state. The contact order isolates one such return, at a rational direction, with total probability . For its repetitions form a convergent geometric series. Because a return can change the surface, summing it requires the weighted law upon leaving to be the same on every surface realizing the state.
Use Iverson brackets , .
Proposition 6.1 (transition probabilities). A particular allowed degree- tangent divisor has probability
Here is when the enclosed condition holds and otherwise. Conditional on the divisor, the children are independent with their normalized state measures, and these probabilities sum to one.
Proof. The product of child volumes from (3.6) is in the single-boundary case. Indeed the exceptional contacts sum to , while the old-boundary contact contributes when present. In the crossing case the product is , where . Multiply by the factor in (5.1) and divide by the respective parent volume. The crossing exponent uses . The identity on all Borel sets proves conditional independence. Every parent has a unique finite multiplicity and tangent divisor, and the allowed multiplicities are bounded by its contacts. Thus these finitely many cells partition the state. In particular a degree-one divisor cannot occupy two different boundaries; impossible choices contribute nothing. ∎
Let if a prime square divides , and if is a product of distinct primes. (H) will denote the scaling and boundary-exchange identities (7.4). Divisors with fixed point degrees and multiplicities contribute the same child laws. Their number uses the degree- point count on the affine line:
The second identity follows by factoring the separable polynomial into all irreducibles of degrees dividing ; Möbius inversion gives the first. Away from rational boundary points on , put and for . After fixing the boundary multiplicities, a pattern uses distinct degree- points with multiplicity . Its constraint and count are
Choose distinct points, order them, and forget the orders within each prescribed multiplicity to obtain this count. If there are too few points, its value is zero. There are only finitely many patterns of a fixed total degree.
To record residue extensions, define the coefficient-and-type Adams operation by
It records viewing a field over the unramified extension as an extension of : . Each transition preserves the weighted degree of its law, since
Zero old-boundary contacts in these equalities mean absent children.
The contact order from Section 2 is triangular. In a crossing transition the boundary child sizes are at most and , both smaller than ; other contacts are at most . In a single-boundary transition a boundary child has size and comes earlier even at equality. An off-boundary contact is less than , unless the entire divisor is at one rational point and . This is the unique self-state transition. There are such points, so its total probability is . For it equals one, and we use the terminal law (2.4) instead of dividing by zero.
In each sum, ranges over finitely supported arrays of nonnegative integers with ; the displayed degree constraint makes the range finite. Let denote the array with its sole nonzero entry . For , define the exit contribution , an unnormalized law of total mass , by summing every transition of except its self-return:
The excluded array can occur only at ; its count is , precisely the rational-point self-return. For every positive , the crossing formula is
For , formula (6.7) reproduces (2.4): forces . If , then , there is no off-boundary point, the weight is , and the right side is by induction on . If , then ; the one rational point off both boundaries has count and weight , giving . Interchanging the boundaries proves the case , in agreement with (H) below.
Theorem 6.2 (universal local laws). (i) Every state has a law , homogeneous of weight and regular at every prime power.
(ii) On every surface realizing , a normalized random curve almost surely terminates after finitely many blowups; its generic algebra is then reduced, the product of the fraction fields of its terminal discrete valuation rings, each a finite extension of with the ramification index and residue degree of Lemma 2.2 over the residue field of the point reached, and the law of the resulting type is .
(iii) It is independent of the surface and of the unit in its vertical equation.
(iv) It is computed by (2.4), the finite sums (6.6)–(6.7), and
Proof plan for Theorem 6.2.
- Contact one is terminal; all surfaces and vertical multiplicities share the same contact order.
- Every crossing child and single-boundary exit is earlier, so its law is already universal.
- For , exactly returns then exit contribute ; the tail tends to zero independently of the surface.
- Finite child trees give almost-sure termination, degree is preserved, and the return denominator never vanishes at a prime power.
Proof of Theorem 6.2. For (iii)–(iv), induct in the contact order simultaneously over all vertical multiplicities and all surfaces realizing the data. Terminal single-boundary laws are Lemma 2.2. For a crossing, every child is earlier, so Proposition 6.1 and the inductive hypothesis give the asserted universal product law. The generic-algebra identity in Proposition 4.4 makes its generic fibre reduced almost surely.
For the single-boundary step with , all exit contributions are already universal. A self-state step may change the surface; we do not identify its unknown law with that of the initial surface. Instead Proposition 6.1 gives the same return probability on every new surface and the same already-known law on exit. Hence returns followed by exit contribute exactly . Because , the probability of never exiting is zero. Summation proves (6.8) as an identity of actual laws.
For (ii), at each exit there are finitely many earlier children. Their trees are finite almost surely by induction, and the number of preceding returns is almost surely finite. Thus the entire tree terminates almost surely. Its terminal algebras are fields; iterating Proposition 4.4 identifies the parent generic algebra with their product, which is reduced. Type events are measurable: tangent cells are open, their strict-transform maps are analytic, and finite itineraries form a countable collection. Their complement is the null nonterminating set.
For (i), all formulas are rational. Their new denominators are positive integers, powers of , possibly , and for . None vanishes at a prime power; previously obtained denominators remain nonzero after . Degree preservation is (6.5). A bound on bounds every state entry and every possible residue degree, so the computation in (iv) involves only finitely many states and patterns. ∎
For the global étale convention, a cluster chart consists exactly of monic polynomial coefficients, as (3.5) specializes in (7.1). Composing Proposition 4.4 along the entire itinerary identifies the original generic algebra with the product of all child algebras; an inseparable child therefore forces the original discriminant to vanish.
Remark 6.3 (inseparable terminal fields). In characteristic a terminal field may be inseparable: on with , every curve of has generic field over . Thus the uniform local assertion is reducedness. Let be the Haar-null set of monic polynomials with vanishing discriminant (Section 7). A finite itinerary is a sequence of tangent divisors. Along it the composite strict-transform map is a bijection of cells multiplying measure by the constants in (5.1), so it carries to a null subset of the product of the child states. Fix one child and let be the event that its terminal algebra has an inseparable field factor. The entire cylinder times the other child states lies in that null image: by Proposition 4.4, any such child makes the global algebra non-étale, whatever the other children are. Under the normalized product measure this cylinder has mass equal to the probability of , which is therefore zero. Taking the countable union over finite itineraries proves the assertion for every state reached from with positive probability. Thus the local reduced-algebra convention gives the usual global étale type probabilities.
Example 6.4 (solving the quadratic cluster). Set (identified with the cluster law of Section 1 at (7.1)). For , a tangent divisor of degree one occupies the boundary and gives the field variable . Degree two off the boundary gives either the self-return, two distinct rational points, or one degree-two point. Thus
and consequently
The two coefficients in the second term use respectively and tangent divisors, each of weight .
In a global polynomial, clusters occur at every residue root, including roots defined only over extensions of .
7. Hensel assembly and the four series identities
An irreducible residue factor need not have an -rational root to translate to zero. Passing to its unramified coefficient extension makes it split into distinct residue roots. Hensel factorization selects the block above one root, and multiplication of its Frobenius conjugates descends it. Equal finite-level counts make this correspondence preserve Haar measure. A degree- point therefore contributes a cluster law with replaced by and residue degrees multiplied by ; different points contribute independently.
First, really is the cluster law introduced in Section 1. In the state has just one residue ideal, . Its chart (3.5) is
with ordinary coefficient measure of total mass . The natural map from to takes the monomial basis of the first free rank- module to that of the second, hence is an isomorphism. Normalizing the chart measure proves the assertion.
Lemma 7.1 (Hensel assembly with measure). Let be a degree- divisor on or , respectively, with distinct points of degrees . Conditional on this residue divisor, the monic or projective type law is . A monic residue cell has mass , and a projective residue cell has mass , where is the -integer (its subscript distinguishes it from the Iverson bracket in (6.1)).
Proof plan for Lemma 7.1.
- Lift coprime factors one -adic digit at a time and compare finite-level counts.
- At a degree- point, select a block over and descend its Frobenius conjugates; equal counts give Haar preservation.
Proof. For coprime monic residue factors , including their multiplicities, fix every leading coefficient to be one. At an additional -adic digit, multiplication linearizes to
Reduction modulo proves injectivity, because and the other factors are units modulo . Source and target have dimension , so the map is bijective. For homogeneous factors normalize one nonzero residue coefficient in each factor and in the product. Take the target modulo the scalar direction of . A kernel element then has for every ; equal degrees make a scalar multiple of , and its zero normalization coordinate makes it zero. Again the dimensions are . Successive unique digit lifting proves the factorization bijection modulo every , then over by completeness. There are lifts in each factor cell and in the product cell. These bijections preserve uniform counting measure, so preserve Haar measure on cylinder sets and hence on Borel sets.
For one degree- residue polynomial , pass to . Its distinct residue roots separate the cell into coprime blocks. The Frobenius generator of permutes them transitively. Selecting the block above one fixed root is a bijection: the inverse multiplies that block's Frobenius conjugates. Frobenius-invariant coefficients lie in , also modulo ; this follows digit by digit from the -adic expansion with the unique representatives satisfying , which Frobenius raises to the th power while fixing . These representatives lift uniquely because the derivative is congruent to modulo . Both finite-level cells have elements, so the selected block is uniform. Translation by a fixed lift of its root has an integral triangular coefficient matrix with determinant one, and identifies it with (7.1) over . The point at infinity is rational and is treated by reversing the affine coordinate.
A root field of the original block contains this unramified extension: lift a root of the separable residue polynomial by Hensel inside its integer ring, a complete DVR [Ne99]. Relative to the extension its ramification index is unchanged and its residue degree is divided by . This proves precisely the operation and the conditional product law.
There are monic residue polynomials. Nonzero binary residue forms modulo scalars correspond to effective degree- divisors on , with classes. All these cells have equal measure. At every precision each normalized projective lift has the same number of unit-scalar preimages, so this assertion holds for the projective model specified in Section 1. ∎
The global discriminant locus is Haar-null. Indeed a nonzero polynomial on has a null zero set, by induction on : outside the null locus where all coefficients in the last variable vanish, each fibre has finitely many zeros; apply Fubini. The discriminant is nonzero in every characteristic: over the prime field there is a separable polynomial of each degree, and homogenizing one also supplies a binary form with nonzero discriminant. In positive characteristic one may take an irreducible polynomial over the finite prime field; in characteristic zero one may take a product of distinct linear factors. Thus the global models give finite étale algebras almost surely.
Write for the count (6.3) taken with : for the affine line and for the projective line. Lemma 7.1 gives the finite formulas
Theorem 6.2 and at prime powers prove Theorem 1.1, including its finite algorithm and regularity.
The sums (7.3) also assemble the off-boundary children in (6.6)–(6.7), whose vertical multiplicities need not be one. Let the substitution fix and send to . The homogeneity and exchange identities are
To prove them, induct in the contact order of Section 6. Scaling the vertical multiplicities preserves every divisor weight, contact, and return coefficient, scales all child multiplicities, and scales the terminal variable in (2.4). It commutes with and with products, proving the first two identities. Exchanging the boundaries interchanges their two child lists and preserves their weights and off-boundary multiplicity , proving the third. The solved return denominator is unchanged. This proves (H) in all degrees.
Use as the coefficient ring. For a monomial , denotes the coefficient of that monomial in . The symbols now mark series degrees, replacing their coordinate roles through (7.1). Constant terms and completion refer to these markers; . Type weight is a separate grading. The local laws give the series
The point counts in (7.3) determine an assembly operation on : a double rational point contributes , two rational points contribute , and a degree-two point contributes . Ordinary powering supplies only the first two terms. The Adams substitutions supply the missing residue extensions; the following exponential and logarithm organize them in every degree.
Extend Adams operations by and similarly for other generating markers. For a zero-constant series and a unit series put
We call in (7.6) the plethystic logarithm.
Lowercase are ordinary formal series. Every coefficient here uses finitely many terms. The relation shows that these two operations are inverse. They turn sums into products and products into sums, respectively, and commute with scale, reciprocal substitution, and dilations ; each of these substitutions commutes with every . This does not say that reciprocal substitution commutes with dilation: it changes into .
To compare first differences under assembly, set for . Then . If two unit series first differ by , their images under first differ by . Indeed ordinary logarithm preserves that first difference, every Adams term of index at least two moves it above degree , and the same observations apply to the exponential. These facts require no convergence beyond the formal degree filtration.
Truncating this formal calculation at degree two gives
Lemma 7.2 (Euler product). For and ,
Powers on the right mean ordinary formal binomial powers.
Proof. On taking ordinary logarithms, the coefficient of on the left is . This is the logarithm of the right side. Expanding its binomial powers gives exactly the falling-factorial counts (6.3), including the factorials for repeated multiplicities. ∎
The affine and projective Euler products give
Multiply boundary and off-boundary terms before weighting: their tangent degrees add, and the Gaussian weight depends on that sum. Write
By (G) and (H), is the scaled monic law with normalization removed. It sums divisors on , the exceptional line with one boundary point removed. The series sums divisors on , with both boundary points removed. The Gaussian operators act only on the indicated variable, so the combined tangent degree must be recorded before applying them:
For (S), a boundary term and an off-boundary term of degree give tangent degree and parent contact . Their factor is . The constant boundary term means , hence and no boundary child. Lemma 7.2 supplies the off-boundary pattern sum . These are exactly (4.7) and (6.1). The constant term is one. In degree , the unknown coefficient enters with multiplier , by the first-difference rule for . The absent-boundary Gaussian therefore contributes . Moving it to the left recovers (6.8). At degree one this is a tautology; (2.4) supplies the law separately.
For (T), use boundary pairs and , each either or both positive. With , the parent contacts are , . The displayed product contributes , where is the number of occupied boundaries. Dividing by the left factor gives precisely (6.1), while counts the remaining points. The subtraction removes the only constant term. Thus neither identity introduces a fictitious child with one zero contact; the equality cases are built into its constant factors.
| Type monomial | Cluster | Monic | Projective |
|---|---|---|---|
For example all three monic probabilities at are . Their sum is one, checking the affine normalization in (7.3).
The obstacle to reversing (S) and (T) is the Gaussian weight of the total tangent degree: weighting two child factors separately misses their cross term.
8. Gaussian weights as a multiplication rule
The identity identifies the missing factor as . The rule puts it into multiplication, making the two boundary contributions and the off-boundary contribution an ordered product. Reciprocal substitution with rescaling reverses that product. For it to be the inverse, boundary factors must invert at smaller contacts, while the middle factor uses a marker of degree two. For an integer , cluster reciprocity through degree can therefore control crossing contact degree .
Let be the -module of formal sums in symbols for , with multiplication
The basis symbol marks contacts ; vertical multiplicities belong to its coefficient . All truncations in this algebra refer to total contact degree , not type weight. There are only finitely many indices in each bounded degree, so the formulas can equally be read in every finite truncation. Assembly dilates to . For a term raising degree by , dilation before it and inverse dilation afterwards contribute on ; rescaling each contact marker by cancels that cost. The scalar below uniquely makes anti-multiplicative with , (Lemma 8.1). Adjoining permits absent boundaries; multiplying the crossing law by removes the denominator in (6.1). Define
For , write for its normal coefficient. The embeddings below insert each boundary child's contacts into the parent.
Lemma 8.1 (the bookkeeping algebra). Multiplication is associative, every series with constant term one has a two-sided inverse, and is a semilinear involution reversing product order. Moreover
Coefficients with respect to the basis are called normal coefficients. There are continuous algebra homomorphisms commuting with given by
Proof. Associativity on three basis factors is . The geometric series is both inverses of when has positive degree. Applying twice cancels its scalar. Anti-multiplicativity is the exponent identity . The remaining formulas in (8.3) follow from (8.1) by induction. The embeddings send to and , respectively. These pairs satisfy the same commutation relation; the binomial identity gives (8.4) and verifies multiplicativity directly. They do not lower degree. Their commutation with holds on and coefficients by (8.3), hence on products and on every truncation. ∎
Lemma 8.2 (ordered crossing factorization).
The middle factor uses ordinary powers of . Its position in the product is essential.
The boundary images have indices and , with the old-boundary contacts. Since pairs the left first index with the right second, placing the degree- off-boundary term between them excludes both old contacts from the cross terms in (8.6); moving it left would introduce .
Proof. Let and be the contacts of the two boundary children, each pair either both positive or . Let be the off-boundary tangent degree and . The parent contacts are , . The three factors on the right contribute normal indices , , and . Their Gaussian scalar is
The last factor uses by (H), which is exactly the first boundary child in (4.8). Each occupied boundary contributes , and sums the off-boundary laws by (7.8). Thus its coefficient is times the crossing recursion, as required by (8.2). The contact pairs enforce absence exactly when or . The constants are one. This proves (8.5) coefficient by coefficient. ∎
By (G), equality of and through degree means for . The degree-two marker makes this cluster information reach further in contact degree.
Lemma 8.3 (crossing reciprocity from smaller clusters). Suppose and through series degree . Then, simultaneously for every ,
Proof plan for Lemma 8.3.
- Use plethystic logarithms for the middle factor; substituting doubles the first omitted degree.
- Induct on contact degree for all multiplicities: the boundary embeddings use smaller degrees, so reversing the three factors gives their inverse.
Proof. Scaling carries the hypothesis to . Taking plethystic logarithms gives through degree , and therefore
Since and has contact degree two, this proves the inverse identity for through contact degree .
Now induct on the contact degree , for all multiplicities at once. Degrees zero and one are immediate. Every nonconstant term of has both indices positive; under its degree strictly increases, from to . Under it increases to . Their inverse series also have no nonconstant axis terms. Thus any embedded child coefficient affecting degree comes from degree at most . Apply to (8.5), use (8.8) for the middle factor and the inductive inverse identities for the two embedded factors. The result, through degree , is , the inverse of (8.5) in exactly the required order. Products do not lower contact degree, so this proves the induction. ∎
The bound includes the odd degree : the first unproved coefficient in (8.8) is degree , and its substitution first occurs at contact degree . This substitution bound is exact: a nonzero degree- error remains nonzero after multiplication by .
For exceptional contact one and off-boundary degree , the additional Gaussian factor is , supplied by and the shift . To recover the single-boundary equation, represent the contact algebra on by and . Write . Then
Indeed the two operators satisfy , and repetition of gives the displayed scalar. Each basis term raises series degree by , so the completed action is defined. For the second identity, a boundary term of contacts acting on degree has degree and Gaussian exponent . This is (S) with tangent degree . The constant term of gives the absent-boundary case, including the self-return hidden in . Thus (8.9) also respects the terminal degree-one equation.
In particular, put and . Since begins in contact degree two,
At cluster degree , crossing reciprocity through needs only cluster degrees through . It therefore controls the operator in (8.9) before the new cluster coefficient is known. The remaining issue is to make the reciprocal candidate satisfy that operator equation.
9. Reciprocity closes on the self-return denominator
Write . The reciprocal candidate must satisfy the same assembly and blowup equations as . Reciprocal substitution puts its crossing action at parameter , whereas crossing inversion belongs to the algebra at . For an operator , Gaussian conjugation means ; together with dilation it converts the actions. A first difference satisfying both equations would then obey : the inverse-assembly and blowup multipliers force for .
Let . Write for (8.9) with reciprocal parameter. For , reciprocal substitution means
This is distinct from , which is an element of the original algebra (8.1).
Lemma 9.1 (Gaussian conjugation). If , then
Proof. On , the exponent on the left for the basis element is . Thus
Sum the first equality with coefficients and exchange , using the hypothesis. The second equality combines with the dagger scalar to give the same result. All operators preserve the degree filtration, so the argument applies to infinite series and every truncation. ∎
Retain and , and put , . The series is the candidate to equal ; is its corresponding image under , just as is that image of . Without any reciprocity hypothesis we have
The first is (8.9), and the second follows from . Reciprocal substitution and dilation give the third. For the last, apply to (8.9), obtaining . The exchange identity (H) gives . Apply Lemma 9.1, multiply by and then by , which commutes with , to get the last equation. If through contact degree , it follows that through series degree . An error of contact degree greater than acts only above series degree , even on a series with constant term one; no truncation is lost.
Proof of monic/cluster reciprocity. We prove by induction on degree. The constants are one, and degree one is on both sides by the terminal law. Let and assume equality in all smaller degrees. Set . Then , so Lemma 8.3 applies using only the induction hypothesis. It gives through degree . Hence both and hold through degree .
Write . Equation (8.10), applied to and , implies one leading coefficient for . The first-difference rule for proved after (7.6) implies another:
Consequently
For this scalar is nonzero in , so . This closes the induction. The scalar vanishes for , explaining the separate terminal base case. Finally (G) identifies the degree- coefficients as , proving . ∎
For the projective law, the extra rational residue point changes the assembly factor from to . Taking logarithms separates that change from the cluster coefficients.
Lemma 9.2 (three equivalent forms). Recall . For the complete series, and for every prefix of degrees through a fixed bound, the following assertions are equivalent:
Proof. By (G), the first assertion is . Its plethystic logarithm is , exactly the middle assertion. For , reversal of the finite sum gives . Thus the last assertion is equivalent to . Its logarithm is . Cancel to obtain , again the middle assertion. Every operation used is invertible and preserves prefixes. ∎
The degree- argument used cluster reciprocity only through , and within Lemma 8.3 used strictly smaller crossing contact degrees simultaneously for all multiplicities. Its first possible omitted contact degree is . The dependency is therefore strictly triangular. All cluster degrees are consequently available to Lemma 8.3, removing the cutoff from its crossing inverse.
Theorem 9.3 (reciprocity for every crossing). For all positive ,
The inner sum is over ordered compositions of both contacts. In addition,
The product corrections use smaller-contact laws, so crossing reciprocity is not a scalar functional equation in general.
Proof plan for Theorem 9.3.
- Cluster reciprocity in all degrees removes the cutoff in Lemma 8.3, giving .
- Each nonconstant factor consumes both contacts, so the inverse coefficient uses at most factors, indexed by ordered compositions.
- Multiplication contributes ; division by the dagger scalar gives (9.8), and homogeneity (H) gives (9.9).
Proof. Theorem 1.2 supplies Lemma 8.3 for every , so in all contact degrees. Expand the inverse as . A product of basis terms contributes the scalar . Both contacts of every factor are positive, so only and the ordered compositions in (9.8) contribute. The coefficient in the dagger is . Dividing the coefficient equality by this nonzero scalar gives (9.8). Equation (9.9) follows from (H) and Theorem 1.2. ∎
Example 9.4 (the first random crossing). For contacts , tangent degree one would require two boundary points and is impossible. Degree two occupies neither boundary. The remaining patterns have a double rational point, two distinct rational points, or a degree-two point. Substitution of (6.10) gives
Here the double-point term is , and the other two pattern terms are and . Formula (9.8) consequently reads
In particular
10. Totally ramified fields and the Euclidean algorithm
A one-field monomial excludes products of nonconstant child laws; residue degree one also excludes nonrational tangent points. Only transitions supported at one rational point survive. Their crossing contacts follow the subtractive Euclidean algorithm, ending at a cluster indexed by their greatest common divisor. The totally ramified coefficient can therefore be computed from proper-divisor cluster data.
For a state of degree , let , and put . Write and for the corresponding one-field probabilities. Global assembly immediately gives
Indeed a single type variable to the first power cannot arise from two occupied points, since each child law has positive degree and every one of its monomials contains a type variable. A nonrational point cannot produce residue degree one. Only one rational point of multiplicity remains: there are affine choices or projective choices.
The same reasoning restricts a local transition to one rational child. For a crossing with , the tangent degree must be and the point must be the second boundary; if both boundaries would be occupied. If , neither boundary is occupied, and the rational choices cancel the denominator in (6.1). Thus
These identities include contact one. At each unequal step the contact sum decreases, the greatest common divisor is unchanged, and the degree is preserved.
Lemma 10.1 (Euclidean weight). The total exponent accumulated in (10.2), including its equal-contact exit, is
Consequently, for ,
Proof. The first expression in (10.3) equals at , is symmetric, and for equals , by direct subtraction and invariance of the gcd. Induction on therefore gives the accumulated exponent. To obtain the floor sum, pair with . The two floors sum to , except when , when they sum to . Exactly of the indices are exceptions. Doubling the sum gives , as asserted.
The Euclidean path ends at equal contacts and then at . By (H), the single-field coefficient of is , independently of . This proves (10.4). ∎
Theorem 10.2 (the full totally ramified recursion). For , with ,
Every displayed exponent is integral, and every argument is a proper divisor of .
The totally ramified family therefore needs only proper-divisor values, without traversing the full state recursion.
Proof. Apart from the self-return, a single-point divisor for is times its boundary point, with . Its probability is and its child is . Insert (10.4) into (6.8). The exponent simplifies by . Replace by and use to obtain (10.5). Integrality also follows from this sum of integer exponents; explicitly, when is odd, is even and is odd. When is even, and have the same parity, making even. Finally . ∎
Corollary 10.3 (totally ramified reciprocity). In every degree,
Proof. Extract from Theorem 1.2 and use (10.1). ∎
Grouping (10.5) by the greatest common divisor exposes the possible descendants as proper divisors. For , , put
For the empty chain contributes one. For larger , the first step of a chain gives , exactly (10.5). Induction proves the formula; there are finitely many strictly decreasing divisor chains.
Example 10.4 (the quartic uses the same crossing). The three terms in (10.5) give
The middle term follows the contact pair of Example 9.4: , and the remaining cluster is with one-field coefficient . Including the initial transition, its contribution is . Put . Simplification and (10.1) yield
One-field coefficients eliminate products; root statistics retain products while forgetting most type labels.
11. Root moments, splitting, and unramified fields
Root counts must retain products of fields while ignoring every factor except , so the one-field extraction cannot compute them. A type-variable substitution can retain each rational root without rejecting the other branches.
Let be an indeterminate. For a polynomial sequence , its series means .
For rational roots, specialize to and every other to one. Denote the resulting probability-generating polynomials by , and their series in degree by . The specialization must be taken after Adams descent: at a point of degree every type variable acquires residue degree at least two. Its root statistic is therefore zero, and its local series specializes to . The rational points retain . Setting all type variables to one in the affine and projective Euler products gives their zeta series and . Removing the rational-point contributions thus gives
These are ordinary formal powers, not plethystic powers of a prematurely specialized series.
Let be the expectations of in the monic, cluster, and projective models. Here is the moment order ([BCFG22] write ). Roots in the last model lie on ; the all-coefficients model has the same law by Section 1. Substituting makes these the coefficients of . Define
Equation (11.1) becomes
Over , hence at , these are equations (5)–(6) of [BCFG22, Theorem 1(b), p. 2], with their moment series exactly as in (11.2). [BCFG22, p. 2] notes that the results extend to any complete DVR with finite residue field, in agreement with Theorem 1.1.
A crossing branch has ramification index at least , since both its vertical parameters have positive valuation. Thus every specializes to one, and the entire crossing contribution becomes
Put . A term in (S) has tangent degree and, after , parent degree . Thus and ; the absent-boundary term has degree . Extracting coefficients gives
Take the difference at successive , then subtract times the preceding difference. The inner partial sums cancel. After taking coefficients at , this is
At coefficient before taking moments the resulting identity is . It holds for by the cancellation just described; the constants and follow directly from and , with negative subscripts zero. This proves (11.6), which is [BCFG22, equation (7), p. 2]; their operator is our , multiplying the coefficient by .
These identities determine all the moment series from the degree-zero and degree-one laws. Indeed, suppose two solutions first differ in degree , and let be the differences of their coefficients in and . Equation (11.3) gives , while (11.6) gives . The scalar difference is nonzero. This argument works coefficientwise in and inductively in . Thus we recover the root-count equations and their uniquely specified moments, as well as their reciprocal symmetries by Theorem 1.2.
For example, the first moments are
To prove these in every degree, the candidates , satisfy and (11.6) by direct substitution. Their initial coefficients are prescribed; the same scalar argument proves uniqueness. Equation (11.3) then gives . Dividing by the prefactors in (11.2) proves (11.7), agreeing with [BCFG22, Section 1.2.1, p. 4].
Completely split polynomials. The top binomial root moment selects complete splitting. Write for the scalar split probability (BGMR write ). Setting and every other in the monic law gives the probability that a random monic polynomial splits completely over . Put and , BGMR's series.
Under this specialization every crossing law and every positive-weight Adams term of index at least two vanish: a crossing branch has ramification index at least two, and multiplies residue degrees by . Adams operations still preserve the constant , so the specialized plethystic exponential and logarithm become the ordinary exponential and logarithm. The assembly identity (G) becomes the functional equation of Buhler–Goldstein–Moews–Rosenberg [BGMR06, equation (4)]; the single-boundary identity (S) becomes their rescaling lemma [BGMR06, Lemma 2.2(2)]. Eliminating gives their recursion
The first sum is read at an actual residue size ; grouping the nonzero by their multiplicities writes it as a rational-function identity using falling factorials, as in (6.3). It is [BGMR06, Theorem 1.1, equation (1)]. The terms with one have total coefficient , the self-return probability [BGMR06, Remark 1.2]. To check the generating-variable normalization, specialize (G) and then put ; the coefficient in is the unnormalized cluster mass. Thus the identification uses both (S) and (G).
Their Lemma 5.1(4), , is the split-type case of combined with the rescaling lemma. Their Theorem 4.4 for the non-monic model is the split specialization of the projective assembly (7.3): its all-coefficients model has the projective type law by Section 1. For instance and the non-monic split probability is , as in Example 7.3.
Complete splitting keeps many degree-one factors. Keeping one unramified factor instead allows a single residue point of higher degree.
For unramified fields, set and similarly , . A boundary child is a crossing and cannot supply ramification index one. A one-field monomial also requires exactly one occupied point. Hence a cluster contribution has tangent degree , one point of degree , and multiplicity . Its degree-one point term is the self-return. We obtain
Affine assembly includes the same sum before omitting its degree-one term, with normalization . Projective assembly has one additional rational point. Therefore
The formulas hold also at by the terminal law. Repeated irreducible residue factors are included: for instance , which is not just the probability of irreducible reduction.
Shmueli expresses these one-field probabilities through two-variable rational functions [Sh22, Theorem 2 and equations (6)–(7), p. 2]. Retaining his variables , they are
The recurrence for is for . The last substitution can initially be made in . Its rationality in follows directly from our identification, without the parity argument of [Sh22, p. 2].
Indeed put . Multiply (11.9) by , substitute (6.2), and then express every using . The resulting equation is . This is exactly the recurrence for : if , then , and the second argument remains in the smaller problem. The initial values agree, the denominators are nonzero rational functions for , and induction proves the identification. Equations (11.10) and Theorem 1.2 consequently give
Over these are precisely [Sh22, equations (3)–(5), p. 2], in the same three sampling models. Theorem 2 of [Sh22] is stated over ; the argument here supplies the same formulas over every complete DVR with residue field of size .
Summing selected type coefficients evaluates any prescribed combination of ramification indices and residue degrees, retaining as much of the joint law as the event requires.
Appendix A. Passing to the formal exceptional line
Independence on the formal exceptional line requires compatible finite-level gluings to survive completion. Degreewise surjectivity lets cochains lift, but cohomology can still acquire an inverse-limit cokernel. Eventual surjectivity on sections removes that obstruction and gives the formal-limit assertion of Lemma 4.1.
On the two affine charts and their affine intersection, sections of a coherent sheaf restrict surjectively from level to , by affine exactness for the quasi-coherent kernel. The completed Čech complex is their termwise inverse limit. The formal affine pieces are acyclic: lift a primitive (a cochain whose Čech differential is the given cocycle) of a finite-level cocycle successively, correcting each discrepancy by a primitive in the exact affine complex of the kernel sheaf. The level- correction lies in the kernel , hence lifts into ; these corrections therefore converge in the defining topology. Hence this two-chart complex computes formal cohomology and has no degree-two term.
For a tower of complexes with surjective transition maps in each degree, the map on is surjective: choose and solve successively for . Its kernel is the inverse limit. The resulting cohomology sequence gives (4.2). If the maps are eventually surjective, the first cokernel vanishes: solve on the surjective tail, then solve the finite initial segment backward. This removes the inverse-limit obstruction asserted in Lemma 4.1. ∎
References
Theorem and equation numbers for preprints, and for [BGMR06], refer to the arXiv versions specified below.
- [BCFG22] M. Bhargava, J. Cremona, T. Fisher and S. Gajović. The density of polynomials of degree over having exactly roots in . Proc. London Math. Soc. (3) 124 (2022), no. 5, 713–736. DOI: 10.1112/plms.12438. arXiv:2101.09590v4, 25 March 2022.
- [Sh22] R. Shmueli. The probability that a -adic random étale algebra is an unramified field. arXiv:2211.12995v1, 23 November 2022.
- [BGMR06] J. Buhler, D. Goldstein, D. Moews and J. Rosenberg. The probability that a random monic -adic polynomial splits. Experiment. Math. 15 (2006), no. 1, 21–32. DOI: 10.1080/10586458.2006.10128946. arXiv:math/0404057v1.
- [Ca22] X. Caruso. Where are the zeroes of a random -adic polynomial? Forum Math. Sigma 10 (2022), e55. arXiv:2110.03942.
- [DCD00] I. Del Corso and R. Dvornicich. Uniformity over primes of tamely ramified splittings. manuscripta math. 101 (2000), no. 2, 239–266. DOI: 10.1007/PL00005848.
- [We13] B. L. Weiss. Probabilistic Galois theory over -adic fields. J. Number Theory 133 (2013), no. 5, 1537–1563. arXiv:1409.0555.
- [Yi22] J. Yin. Density of -adic polynomials generating extensions with fixed splitting type. arXiv:2211.10425v2, 23 November 2022.
- [GWY] A. G, Y. Wei and J. Yin. A Chebotarev density theorem over local fields. arXiv:2212.00294v5, 7 July 2025. Theorem and section numbers cited as [GWY, …] refer to this version.
- [GWY2] A. G, Y. Wei and J. Yin. A Chebotarev density theorem over -adic fields, corrected version (tame case), October 2026, github.com/asving/Chebotarev-Density-Theorem-over-p-adic-Fields. The resolution section of [GWY] is removed and a uniformity lemma is inserted before its Theorem 4.5, which becomes Theorem 4.6 there.
- [DL01] J. Denef and F. Loeser. Definable sets, motives and -adic integrals. J. Amer. Math. Soc. 14 (2001), no. 2, 429–469. arXiv:math/9910107.
- [CL08] R. Cluckers and F. Loeser. Constructible motivic functions and motivic integration. Invent. Math. 173 (2008), 23–121. arXiv:math/0410203.
- [Pa89] J. Pas. Uniform -adic cell decomposition and local zeta functions. J. reine angew. Math. 399 (1989), 137–172.
- [Bh07] M. Bhargava. Mass formulae for extensions of local fields, and conjectures on the density of number field discriminants. Int. Math. Res. Not. IMRN 2007, article rnm052. DOI: 10.1093/imrn/rnm052.
- [Se78] J.-P. Serre. Une « formule de masse » pour les extensions totalement ramifiées de degré donné d'un corps local. C. R. Acad. Sci. Paris Sér. A-B 286 (1978), A1031–A1036.
- [Kr62] M. Krasner. Nombre des extensions d'un degré donné d'un corps -adique. C. R. Acad. Sci. Paris 254 (1962), 3470–3472; 255 (1962), 224–226, 2342–2344, 3095–3097; and Colloq. Int. CNRS 143 (Paris, 1966), 143–169.
- [Ke07] K. S. Kedlaya, with an appendix by D. Gulotta. Mass formulas for local Galois representations. Int. Math. Res. Not. IMRN 2007, article rnm021. arXiv:math/0511135.
- [Ya25] T. Yasuda. Motivic versions of mass formulas by Krasner, Serre and Bhargava. Forum Math. Sigma 13 (2025), e148. arXiv:2408.13481.
- [BCFJK16] M. Bhargava, J. E. Cremona, T. A. Fisher, N. G. Jones and J. P. Keating. What is the probability that a random integral quadratic form in variables has an integral zero? Int. Math. Res. Not. IMRN 2016, no. 12, 3828–3848. arXiv:1502.05992.
- [BCF21] M. Bhargava, J. Cremona and T. Fisher. The proportion of genus one curves over defined by a binary quartic that everywhere locally have a point. Int. J. Number Theory 17 (2021), no. 4, 903–923. arXiv:2004.12085.
- [FGMN15] J. Fernández, J. Guàrdia, J. Montes and E. Nart. Residual ideals of MacLane valuations. J. Algebra 427 (2015), 30–75. arXiv:1305.0775.
- [OW20] A. Obus and S. Wewers. Explicit resolution of weak wild quotient singularities on arithmetic surfaces. J. Algebraic Geom. 29 (2020), no. 4, 691–728. arXiv:1805.09709.
- [GMN12] J. Guàrdia, J. Montes and E. Nart. Newton polygons of higher order in algebraic number theory. Trans. Amer. Math. Soc. 364 (2012), no. 1, 361–416. arXiv:0807.2620.
- [Ne99] J. Neukirch. Algebraic Number Theory. Grundlehren der mathematischen Wissenschaften 322, Springer, 1999.
- [Se79] J.-P. Serre. Local Fields. Graduate Texts in Mathematics 67, Springer, 1979.
- [Ig00] J.-I. Igusa. An Introduction to the Theory of Local Zeta Functions. AMS/IP Studies in Advanced Mathematics 14, American Mathematical Society and International Press, 2000. Book text.
- [Lean] SurfaceBlowup: a Lean 4 formalization of universal type laws and reciprocity. Lean 4 (v4.33.1) with Mathlib (commit 0df444a). Main theorems (Theorem 1.1 for the monic and projective laws over every complete discrete valuation ring with finite residue field), (the rational-function form for the integers of finite unramified extensions of ) and (Theorem 1.2); each depends only on propositional extensionality, classical choice and quotient soundness. (The statements were also checked on Prove2Me under the names and .) Source: github.com/asving/splitting-density-rationality (release v1.0.0); browsable with the paper at asving.github.io/claude/splitting-type-density/lean/.