Random polynomials on local surfaces: rationality and reciprocity in every residue characteristic

Claude (Anthropic) · GPT-6-Astra (OpenAI) · directed by Asvin G

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 OO be a complete discrete valuation ring with finite residue field. Choose a uniformizer π\pi and put K=Frac⁡OK=\operatorname{Frac}O, k=O/πOk=O/\pi O, q=∣k∣q=|k|, p=char⁡kp=\operatorname{char}k. The valuation vπ:K×→Zv_\pi:K^\times\to\mathbb Z has vπ(π)=1v_\pi(\pi)=1; set ∣x∣=q−vπ(x)|x|=q^{-v_\pi(x)}, ∣0∣=0|0|=0. Normalize additive Haar measure vol⁡\operatorname{vol} on KK by vol⁡(O)=1\operatorname{vol}(O)=1, as in local densities for global counting [BCFJK16, BCF21]. For L=∏iLiL=\prod_i L_i with finite field extensions Li/KL_i/K, let kik_i be their residue fields and vLiv_{L_i} their valuations with value group Z\mathbb Z. Put ei=vLi(π)e_i=v_{L_i}(\pi), fi=[ki:k]f_i=[k_i:k]. Its type is the multiset σ(L)={(ei,fi)}i\sigma(L)=\{(e_i,f_i)\}_i, with degree deg⁡σ=∑ieifi=[L:K]\deg\sigma=\sum_i e_if_i=[L:K] [Ne99, Se79].

For n≥1n\ge1, put Pn=On+1∖(πO)n+1P_n=O^{n+1}\setminus(\pi O)^{n+1} and let pr⁡:Pn→Pn/O×\operatorname{pr}:P_n\to P_n/O^\times forget unit scalars. The three sampling measures are

μmonic:=vol⁡⊗n∣On,μcluster:=qnvol⁡⊗n∣(πO)n,μprojective:=pr⁡∗(vol⁡⊗(n+1)∣Pn1−q−(n+1)). \begin{aligned} \mu_{\mathrm{monic}}&:=\operatorname{vol}^{\otimes n}|_{O^n},\\ \mu_{\mathrm{cluster}}&:=q^n\operatorname{vol}^{\otimes n}|_{(\pi O)^n},\\ \mu_{\mathrm{projective}}&:=\operatorname{pr}_*\left( \frac{\operatorname{vol}^{\otimes(n+1)}|_{P_n}}{1-q^{-(n+1)}}\right). \end{aligned}
(1.1)

With coefficient vectors a=(ai)\mathbf a=(a_i), the first two sample fa(X)=Xn+∑i<naiXif_{\mathbf a}(X)=X^n+\sum_{i<n}a_iX^i and the algebra K[X]/(fa)K[X]/(f_{\mathbf a}). The third samples Fa(X,Y):=∑i=0naiXiYn−iF_{\mathbf a}(X,Y):=\sum_{i=0}^n a_iX^iY^{n-i} and the coordinate ring Γ(V(Fa),O)\Gamma(V(F_{\mathbf a}),\mathcal O) of its zero scheme V(Fa)⊂PK1V(F_{\mathbf a})\subset\mathbb P^1_K, of degree nn 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 π\pi gives the same projective law.

For e,f≥1e,f\ge1, give commuting indeterminates Ze,fZ_{e,f} weight efef and put Zσ=∏iZei,fiZ^\sigma=\prod_i Z_{e_i,f_i}; multiplication records products of fields. For deg⁡σ=n\deg\sigma=n, define

Aσ:=Pr⁡μmonic(type=σ),Bσ:=Pr⁡μcluster(type=σ),Rσ:=Pr⁡μprojective(type=σ),(An,Bn,Rn):=∑deg⁡σ=n(Aσ,Bσ,Rσ)Zσ,A0=B0=R0=1. \begin{gathered} A_\sigma:=\Pr_{\mu_{\mathrm{monic}}}(\text{type}=\sigma),\quad B_\sigma:=\Pr_{\mu_{\mathrm{cluster}}}(\text{type}=\sigma),\quad R_\sigma:=\Pr_{\mu_{\mathrm{projective}}}(\text{type}=\sigma),\\ (A_n,B_n,R_n):=\sum_{\deg\sigma=n}(A_\sigma,B_\sigma,R_\sigma)Z^\sigma, \qquad A_0=B_0=R_0=1. \end{gathered}
(1.2)

From root counts to a type conjecture

For the ramified quadratic type, the monic and cluster models give

Pr⁡monic(ramified quadratic field)=1q+1,Pr⁡cluster(ramified quadratic field)=qq+1. \Pr_{\text{monic}}\bigl(\text{ramified quadratic field}\bigr)=\frac1{q+1},\qquad \Pr_{\text{cluster}}\bigl(\text{ramified quadratic field}\bigr)=\frac q{q+1}.
(1.3)

Substituting q−1q^{-1} for qq 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 rr rational roots and j≥0j\ge0, the jjth binomial moment is E(rj)\mathbb E\binom rj; 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 (1,1)(1,1). 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 q↦q−1q\mapsto q^{-1}, but summing over the fields restores the symmetry [Ca22].

The intermediate refinement is the type. Regard qq also as an indeterminate; for a rational function in qq and the type variables Z=(Ze,f)e,f≥1\mathbf Z=(Z_{e,f})_{e,f\ge1}, set F∨(q,Z):=F(q−1,Z)F^\vee(q,\mathbf Z):=F(q^{-1},\mathbf Z), fixing generating variables as well. In our notation, [BCFG22, Conjecture 1.2] asserts that the probabilities over Zp\mathbb Z_p are rational functions Aσ,Bσ,Rσ∈Q(q)A_\sigma,B_\sigma,R_\sigma\in\mathbb Q(q), evaluated at q=pq=p, with

Aσ=Bσ∨,Rσ∨=Rσ. A_\sigma=B_\sigma^\vee,\qquad R_\sigma^\vee=R_\sigma.
(1.4)

The assertion includes primes dividing the degree.

What the tame methods explain

When every ramification index is prime to pp, 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 FQ\mathbb F_Q, the residue lifts satisfying aQ=aa^Q=a): 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 qq 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 GG, G, Wei and Yin assume an equivariant resolution hypothesis (for relevant g∈Gg\in G, a gg-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 ww (functions ν\nu satisfying ν(−m)=q−wmν(m)\nu(-m)=q^{-wm}\nu(m)), where mm is residue-extension degree; individual densities need not be palindromic [GWY, Theorem 3.10].

A polynomial type sums densities over admissible pairs (subgroups H⊂GH\subset G with cosets gH=HggH=Hg), 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 ∣Pn(Fq)∣|\mathbb P^n(\mathbb F_q)| 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 ζm\zeta_m for a primitive mmth root of unity and normalize vp(p)=1v_p(p)=1. His example L=Qp(ζp3−1,p1/2)L=\mathbb Q_p(\zeta_{p^3-1},p^{1/2}) has ramification index two and inertia degree three. For a nonzero Teichmüller digit a1a_1 with a1p3=a1a_1^{p^3}=a_1, the valuation step is vp(2a1p1/2)=vp(2)+1/2v_p(2a_1p^{1/2})=v_p(2)+1/2, equal to 1/21/2 only when p≠2p\ne2 [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 p>np>n. 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 Zp\mathbb Z_p [Sh22, Theorem 2]. Complete splitting instead separates by residue classes; BGMR's recursion uses Gaussian weights q−(d+12)q^{-\binom{d+1}{2}} for degrees d≥0d\ge0, 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 n≥1n\geq1 and every type σ\sigma of degree nn, there are rational functions Aσ(q),Bσ(q),Rσ(q)∈Q(q)A_\sigma(q),B_\sigma(q),R_\sigma(q)\in\mathbb Q(q), regular at every prime power, equal respectively to the monic, cluster and projective probabilities over every complete discrete valuation ring OO with residue field of size qq. There is no restriction on the residue characteristic, on the ramification of OO over Zp\mathbb Z_p, or on the characteristic of KK; in particular the same function serves Zp\mathbb Z_p, every ramified extension of it, and Fp[[t]]\mathbb F_p[[t]]. The finite state recursion in Section 6 and the assembly formula in Section 7 compute AσA_\sigma and RσR_\sigma; the recursion alone computes BσB_\sigma (Theorem 6.2 and the identification (7.1)). Write their complete laws as

An=∑deg⁡σ=nAσZσ,Bn=∑deg⁡σ=nBσZσ,Rn=∑deg⁡σ=nRσZσ,A0=B0=R0=1. A_n=\sum_{\deg\sigma=n}A_\sigma Z^\sigma,\qquad B_n=\sum_{\deg\sigma=n}B_\sigma Z^\sigma,\qquad R_n=\sum_{\deg\sigma=n}R_\sigma Z^\sigma,\qquad A_0=B_0=R_0=1.
(1.5)

Theorem 1.2 (reciprocity). In every degree,

An=Bn∨,Rn∨=Rn. A_n=B_n^\vee,\qquad R_n^\vee=R_n.
(1.6)

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

  1. Exact blowup volumes give one finite recursion over every complete DVR with finite residue field (Theorems 1.1 and 6.2).
  2. Comparing assembly and blowup equations proves both BCFG symmetries (Theorems 1.2 and 9.3).
  3. Selecting types consisting of one field gives a divisor recursion governed by the Euclidean algorithm (Theorem 10.2).
  4. Specializing type variables recovers the root-count, split and unramified-field recursions (Section 11).
  5. 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 cc, translated to zero, gives a monic Weierstrass factor f≡xc(modπ)f\equiv x^c\pmod\pi. Work on a complete regular local OO-algebra (R,m,k)(R,\mathfrak m,k) of dimension two with O/πO≃R/mO/\pi O\simeq R/\mathfrak m; initially R=O[[x]]R=O[[x]], m=(π,x)\mathfrak m=(\pi,x). A curve is a principal ideal (f)⊂R(f)\subset R; its field factors give the type. The boundary is V(π)V(\pi), the union of vertical components. For a component t=0t=0, contact means length⁡R/(f,t)\operatorname{length}R/(f,t).

For R/(f)R/(f) finite free over OO, put N=rank⁡OR/(f)N=\operatorname{rank}_O R/(f) and choose bi mod fb_i\bmod f as an integral basis. On the ideals lifting (f mod π)(f\bmod\pi), intrinsic measure means the pushforward of product Haar measure on (πO)N(\pi O)^N by z↦(f+∑izibi)z\mapsto(f+\sum_i z_i b_i). Write μR\mu_R for this measure; Proposition 3.2 proves independence of the choices.

Blowing up replaces the closed point by E=P(m/m2)E=\mathbb P(\mathfrak m/\mathfrak m^2), the line of directions. Put d=ord⁡mf=max⁡{j:f∈mj}d=\operatorname{ord}_{\mathfrak m}f=\max\{j:f\in\mathfrak m^j\} and in⁡df=f mod md+1∈md/md+1\operatorname{in}_d f=f\bmod\mathfrak m^{d+1}\in\mathfrak m^d/\mathfrak m^{d+1}. Let the tangent divisor be D=div⁡E(in⁡df)=∑PrPPD=\operatorname{div}_E(\operatorname{in}_d f)=\sum_P r_PP, with multiplicities rP=mult⁡P(D)r_P=\operatorname{mult}_P(D) and δP=[k(P):k]\delta_P=[k(P):k]. A cell fixes d,Dd,D and the boundary contacts. At PP, put RP:=O^Bl⁡m(Spec⁡R),PR_P:=\widehat{\mathcal O}_{\operatorname{Bl}_{\mathfrak m}(\operatorname{Spec}R),P}. For a local exceptional equation ePe_P, the child ideal is (fP′)(f'_P) with fP′:=f/ePdf'_P:=f/e_P^d. Write μparent:=μR\mu_{\mathrm{parent}}:=\mu_R, μP:=μRP\mu_P:=\mu_{R_P}. Gluing these independent child ideals recovers one parent ideal, with unnormalized measure

dμparent=q−(d+12)∏PdμP. d\mu_{\mathrm{parent}} =q^{-\binom{d+1}{2}}\prod_P d\mu_P.
(1.7)

The parent curve ring has index of OO-length (d2)\binom d2 in ∏PRP/(fP′)\prod_P R_P/(f'_P), the product child ring, contributing q−(d2)q^{-\binom d2} to the Jacobian. Exceptional division to power dd contributes qd2q^{d^2}. Thus

q−(d2) qd2=q(d+12). q^{-\binom d2}\,q^{d^2}=q^{\binom{d+1}{2}}.
(1.8)

Its reciprocal gives the parent measure.

For f=x2+a1x+a0f=x^2+a_1x+a_0 with a1,a0∈πOa_1,a_0\in\pi O, the event a0∉π2Oa_0\notin\pi^2O has probability (q−1)/q(q-1)/q: the order is one and Eisenstein's criterion gives Z2,1Z_{2,1}. Otherwise the order is two. Return at x/π=0x/\pi=0 requires a1∈π2Oa_1\in\pi^2O, a0∈π3Oa_0\in\pi^3O, a cell of volume q−5q^{-5}. Substitution x=πzx=\pi z gives a child cluster of volume q−2q^{-2}. The index of O⊕Ox⊂O⊕OzO\oplus Ox\subset O\oplus Oz is qq; division by π2\pi^2 on rank two contributes q4q^4, giving Jacobian q3q^3.

Thus (1.7) reads q−5=q−3q−2q^{-5}=q^{-3}q^{-2}; dividing by parent cluster volume q−2q^{-2} gives probability q−3q^{-3}. A degree-rr cluster over residue size qδq^\delta has volume q−δrq^{-\delta r}, so every order-two divisor has child-volume product q−2q^{-2} and the same probability. Among the q2q^2 divisors, qq double rational points return to B2B_2, with total probability q−2q^{-2}; q(q−1)/2q(q-1)/2 distinct rational pairs give Z1,12Z_{1,1}^2; (q2−q)/2(q^2-q)/2 irreducible quadratics give Z1,2Z_{1,2}. Hence

(1−q−2)B2=q−1qZ2,1+q−12q2(Z1,12+Z1,2),B2=qq+1Z2,1+Z1,12+Z1,22(q+1). \begin{aligned} (1-q^{-2})B_2&=\frac{q-1}{q}Z_{2,1} +\frac{q-1}{2q^2}(Z_{1,1}^2+Z_{1,2}),\\ B_2&=\frac q{q+1}Z_{2,1} +\frac{Z_{1,1}^2+Z_{1,2}}{2(q+1)}. \end{aligned}
(1.9)

The irreducible tangent point becomes rational over the unramified quadratic extension, where its child is linear. Viewed over OO, that child has residue degree two. In general, a degree-δ\delta point replaces qq by qδq^\delta and multiplies residue degrees by δ\delta.

The cluster law also computes monic quadratics. Their qq double-root reductions among q2q^2 residue polynomials leave a cluster; split and irreducible squarefree reductions each have probability (q−1)/(2q)(q-1)/(2q). Hensel lifting gives

A2=B2q+q−12q(Z1,12+Z1,2)=1q+1Z2,1+q2(q+1)(Z1,12+Z1,2)=B2∨. \begin{aligned} A_2&=\frac{B_2}{q}+\frac{q-1}{2q}(Z_{1,1}^2+Z_{1,2})\\ &=\frac1{q+1}Z_{2,1} +\frac q{2(q+1)}(Z_{1,1}^2+Z_{1,2})=B_2^\vee. \end{aligned}
(1.10)

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

B2=q−1qZ2,1+A2q. B_2=\frac{q-1}{q}Z_{2,1}+\frac{A_2}{q}.
(1.11)

Off the boundary (the vertical components through the point), directions form Ak1\mathbb A^1_k. Its degree-nn divisors are the qnq^n monic residue polynomials, with monic conditional laws. Thus BnB_n has contributions of states earlier in the contact order of (1.13), plus qn−(n+12)Anq^{n-\binom{n+1}{2}}A_n. The reciprocal exchange must preserve these linked assembly and blowup equations.

On each subsequent surface choose regular parameters t,xt,x. For vertical multiplicities a,b≥1a,b\ge1 and u∈R×u\in R^\times, the state records

statevertical equationcontactsS(a;c)π=utalength⁡R/(f,t)=cT(a,b;c,h)π=utaxblength⁡R/(f,t)=c,length⁡R/(f,x)=h. \begin{array}{c|c|c} \text{state}&\text{vertical equation}&\text{contacts}\\ \hline S(a;c)&\pi=ut^a&\operatorname{length}R/(f,t)=c\\ T(a,b;c,h)&\pi=ut^ax^b&\operatorname{length}R/(f,t)=c,\quad \operatorname{length}R/(f,x)=h. \end{array}
(1.12)

Here c,h≥1c,h\ge1; in particular S(1;n)S(1;n) on O[[x]]O[[x]] is the cluster model. Absorbing uu into tt requires an aath root, which simple-root Hensel lifting cannot provide when the residue characteristic divides aa. We keep uu arbitrary and induct over every surface realizing the same data.

Order states by contact size: cc or c+hc+h, with crossings first at ties. Since f∈mdf\in\mathfrak m^d gives f(0,x)∈(x)df(0,x)\in(x)^d, one has c≥dc\ge d and rP≤dr_P\le d. Writing r0r_0 for the boundary-point multiplicity, its child has size r0+c−d≤cr_0+c-d\le c, explaining the tie rule; crossing children have sizes at most cc or hh. Only cPcP at one of qq rational directions returns a single-boundary state. Its return probability is

λc=q1−(c+12)<1(c≥2). \lambda_c=q^{1-\binom{c+1}{2}}<1\qquad(c\ge2).
(1.13)

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 zz mark degree and let ηzn\eta z^n, n≥2n\ge2, be their first differing term. Assuming agreement in smaller degrees, (9.4) gives both the same blowup equation through degree nn. Inverse Hensel assembly multiplies this difference in qnAnq^nA_n by q−1q^{-1}, while blowup multiplies it by q−(n+12)q^{-\binom{n+1}{2}}:

G(z):=∑m≥0qmAmzm,W(z):=∑m≥0qmBm∨zm,(q−1−q−(n+12))η=0⟺(1−λn)η=0. \begin{gathered} \mathcal G(z):=\sum_{m\ge0}q^mA_mz^m,\qquad \mathcal W(z):=\sum_{m\ge0}q^mB_m^\vee z^m,\\ (q^{-1}-q^{-\binom{n+1}{2}})\eta=0 \quad\Longleftrightarrow\quad (1-\lambda_n)\eta=0. \end{gathered}
(1.14)

For n=2n=2, solving (1.10) for B2B_2 gives multiplier q−1q^{-1} on q2A2q^2A_2; (1.11) gives q−3q^{-3}. Since 1−λn≠01-\lambda_n\ne0 for n≥2n\ge2, the first difference vanishes; degree one is terminal.

The algebra XY=q−1YXXY=q^{-1}YX makes the blowup equation reciprocal-symmetric: its anti-involution †\dagger extends ∨\vee by X†=qXX^\dagger=qX, Y†=qYY^\dagger=qY, (UV)†=V†U†(UV)^\dagger=V^\dagger U^\dagger for words U,VU,V, reversing the products in (8.1)–(8.5) that enter (9.4).

Writing [m+1]q:=1+q+⋯+qm[m+1]_q:=1+q+\cdots+q^m for m≥0m\ge0, the unnormalized degree-mm projective law [m+1]qRm[m+1]_qR_m gains the reciprocal factor q−m=[m+1]q∨/[m+1]qq^{-m}=[m+1]_q^\vee/[m+1]_q, 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 SurfaceBlowup.main_dvr\texttt{SurfaceBlowup.main\_dvr} and SurfaceBlowup.recip_main\texttt{SurfaceBlowup.recip\_main} 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 KK, including inseparable ones, have a unique extended valuation and a complete DVR integer ring, free over OO of rank [L:K]=ef[L:K]=ef [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 t=πt=\pi, the chart x=tzx=tz puts a finite tangent direction on the single vertical component t=0t=0. The other chart has t=xwt=xw, hence π=xw\pi=xw: at x=w=0x=w=0 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 (R,m,k)(R,\mathfrak m,k) be a complete regular local ring of dimension two containing OO, with O→RO\to R inducing an isomorphism k=O/πO→R/mk=O/\pi O\to R/\mathfrak m, and with regular parameters t,xt,x. A single-boundary surface has π=uta\pi=ut^a; a crossing surface has π=utaxb\pi=ut^ax^b, where u∈R×u\in R^\times and a,b≥1a,b\geq1. We call the vertical components t=0t=0 (and x=0x=0) 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 NN are

statecontact conditions on (f)NS(a;c)length⁡R/(f,t)=cacT(a,b;c,h)length⁡R/(f,t)=c,length⁡R/(f,x)=hac+bh.\begin{array}{c|c|c} \text{state}&\text{contact conditions on }(f)&N\rule{0pt}{2.4ex}\\ \hline S(a;c)&\operatorname{length}R/(f,t)=c&ac\\ T(a,b;c,h)&\operatorname{length}R/(f,t)=c,\quad \operatorname{length}R/(f,x)=h&ac+bh. \end{array}
(2.1)

For R=O[[x]]R=O[[x]] and π=t\pi=t, the state S(1;n)S(1;n) consists of ideals (xn+∑i<naixi)(x^n+\sum_{i<n}a_ix^i) with ai∈πOa_i\in\pi O: the cluster model.

All contacts are positive and finite. The lengths are dimensions over kk, since a vertical parameter kills π\pi. Write Af=R/(f)A_f=R/(f) for the quotient algebra of the curve. Lemma 2.1 shows that it is free of rank NN over OO, so it is an order in the generic algebra Af[1/π]A_f[1/\pi] of dimension NN; we call it the curve order and NN the degree of the state.

Lemma 2.1 (degree and flatness). The special fibre and the curve order satisfy

R/πR≃{k[[T,X]]/(Ta)if π=uta,k[[T,X]]/(TaXb)if π=utaxb,Af≃ONas an O-module. R/\pi R\simeq \begin{cases}k[[T,X]]/(T^a)&\text{if }\pi=ut^a,\\ k[[T,X]]/(T^aX^b)&\text{if }\pi=ut^ax^b,\end{cases} \qquad A_f\simeq O^N\quad\text{as an }O\text{-module}.
(2.2)

In particular fˉ\bar f is a nonzerodivisor on R/πRR/\pi R and Af[1/π]A_f[1/\pi] has degree NN over KK.

Proof plan for Lemma 2.1.

  1. Present the special fibre and cancel prime parameters to compute its curve length.
  2. Lift a residue basis one π\pi-adic digit at a time; regularity cancels every putative relation.

Proof. The complete local ring R/πRR/\pi R is a kk-algebra, hence has characteristic pp. Hensel's lemma lifts each residue element uniquely to a root of zq−zz^q-z: the derivative is congruent to −1-1 modulo the maximal ideal (indeed it equals −1-1 here). Characteristic pp makes these roots a field under addition and multiplication. They give a coefficient field. Sending T,XT,X to t,xt,x now gives the asserted surjection. Its associated graded map is an isomorphism: gr⁡mR=k[T,X]\operatorname{gr}_{\mathfrak m}R=k[T,X], and the initial ideal of (π)(\pi) is generated by the initial monomial of π\pi, since initial forms multiply in this domain. Successive approximation in the complete local rings makes the original map an isomorphism.

Lift fˉ\bar f to F∈k[[T,X]]F\in k[[T,X]]. Finite contact says that none of the axes in the vertical monomial divides FF. Repeated cancellation of those prime parameters shows that fˉ\bar f is a nonzerodivisor. In the auxiliary curve ring AF=k[[T,X]]/(F)A_F=k[[T,X]]/(F), whose quotients AF/(TaXb)A_F/(T^aX^b) compute special-fibre lengths, the same parameters are nonzerodivisors. Filtering by their powers gives length⁡AF/(Ta)=ac\operatorname{length}A_F/(T^a)=ac and, in the crossing case, the exact sequence

0⟶AF/(Ta)→ Xb AF/(TaXb)⟶AF/(Xb)⟶0. 0\longrightarrow A_F/(T^a)\xrightarrow{\,X^b\,} A_F/(T^aX^b)\longrightarrow A_F/(X^b)\longrightarrow0.
(2.3)

Consequently dim⁡kR/(π,f)=N\dim_k R/(\pi,f)=N.

If πv=fw\pi v=fw in RR, reduction modulo π\pi forces w=πw1w=\pi w_1, and cancellation gives v=fw1v=fw_1. Thus π\pi is regular on AfA_f. Choose b1,…,bN∈Rb_1,\ldots,b_N\in R lifting a basis modulo (π,f)(\pi,f). Successive subtraction of residue coefficients writes any class in AfA_f as ∑izibi\sum_i z_i b_i, with zi∈Oz_i\in O: the errors lie in πjAf\pi^jA_f and tend to zero m\mathfrak m-adically. The quotient is complete because ideals in a complete noetherian local ring are closed. A relation among the bib_i has every coefficient divisible by π\pi; regularity allows cancellation and repetition. Its coefficients lie in every πjO\pi^jO, hence vanish. This proves freeness. ∎

Blowing up the closed point preserves this class of surfaces. On its two charts substitute x=tzx=tz or t=xwt=xw. The exceptional equation and a parameter on the exceptional line form regular parameters at each completed local ring. At a closed point PP of degree δ\delta, let OδO_\delta be the integer ring of the unramified extension Kδ/KK_\delta/K of degree δ\delta, with a specified identification of its residue field with k(P)k(P). Such an extension is unique up to unique isomorphism respecting that identification [Se79]. A monic lift g~\widetilde g of the minimal polynomial of a generator of k(P)/kk(P)/k presents Oδ=O[X]/(g~)O_\delta=O[X]/(\widetilde g). Its simple residue root lifts by Hensel's lemma in the completed local ring at PP, giving an embedding of OδO_\delta: the kernel is zero because OδO_\delta is a DVR and its uniformizer π\pi remains nonzero. The substituted equation for π\pi 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 OδO_\delta as its base ring and residue size qδq^\delta.

Write kδ=Oδ/πOδk_\delta=O_\delta/\pi O_\delta for the residue field of OδO_\delta.

On a reduced generic fibre, the normalization of AfA_f is the product of the integer rings of its field factors, whether or not those fields are separable over KK. A branch valuation is the normalized valuation v:L×→Zv:L^\times\to\mathbb Z of a field factor LL of Af[1/π]A_f[1/\pi], with v(L×)=Zv(L^\times)=\mathbb Z. The vertical equation gives v(π)=av(t)v(\pi)=a v(t) or av(t)+bv(x)a v(t)+b v(x). Its residue degree is the degree of its residue field over kk. 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 KK-algebra is a product of finite field extensions of KK, and its type is the multiset of their (e,f)(e,f). 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 pp, K[X]/(Xp−π)K[X]/(X^p-\pi) is a field of type {(p,1)}\{(p,1)\} 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 Cs(R)\mathscr C_s(R) be the curve ideals with state data (2.1). Using the intrinsic chart measure μR\mu_R of Proposition 3.2, put Vs:=μR(Cs(R))V_s:=\mu_R(\mathscr C_s(R)) and Fs:=∑σμR{(f)∈Cs(R):reduced type=σ}Zσ/VsF_s:=\sum_\sigma\mu_R\{(f)\in\mathscr C_s(R):\text{reduced type}=\sigma\}Z^\sigma/V_s. 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:

FS(a;1)=Za,1,FT(a,b;1,h)=Za+bh,1,FT(a,b;c,1)=Zac+b,1. F_{S(a;1)}=Z_{a,1},\qquad F_{T(a,b;1,h)}=Z_{a+bh,1},\qquad F_{T(a,b;c,1)}=Z_{ac+b,1}.
(2.4)

Proof. Contact one with t=0t=0 says that f,tf,t generate m\mathfrak m. Thus R/(f)R/(f) is a complete discrete valuation ring with uniformizer tt and residue field kk. In a crossing state its xx-valuation is hh, since the length of its quotient by xx is hh. The valuation of π\pi is therefore a+bha+bh; on a single-boundary surface it is aa. Interchanging the parameters proves the last assertion. These statements apply to every ideal in the state, so do not depend on the measure. ∎

Only S(a;1)S(a;1) 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 (fˉ)⊂R/πR(\bar f)\subset R/\pi R 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 dd and fixed tangent divisor DD on the exceptional line. An occupied point belongs to the support of DD, the divisor of the initial form.

Order states by contact size: cc for S(a;c)S(a;c) and c+hc+h for T(a,b;c,h)T(a,b;c,h), 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 N≤nN\le n, 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 ff do not change its ideal, leaving the quotient R/(f)R/(f), free of rank NN, as the tangent lattice. An integral basis suggests NN coordinates. To give those coordinates a measure, every lift of a fixed residue ideal must have a unique representative f+∑izibif+\sum_i z_i b_i, with zi∈πOz_i\in\pi O, and changes of basis or generator must preserve Haar measure. In the quadratic cluster the proposed coordinates are just the two coefficients.

For 0≠h∈R[1/π]0\ne h\in R[1/\pi], set ∣h∣:=q−max⁡{j∈Z:h∈πjR}|h|:=q^{-\max\{j\in\mathbb Z:h\in\pi^jR\}} and ∣0∣=0|0|=0.

The ring RR is complete also for the π\pi-adic topology: a π\pi-adic Cauchy sequence converges m\mathfrak m-adically, and the closed ideals πjR\pi^jR preserve its congruences in the limit. It is separated since πjR⊆mj\pi^jR\subseteq\mathfrak m^j. Thus R=R[1/π]\mathscr R=R[1/\pi], with norm given by divisibility by π\pi and unit ball RR, is a nonarchimedean Banach KK-algebra. Cauchy sequences have bounded denominators, reducing completeness to that of RR.

Lemma 3.1 (bounded division and normalization). Suppose fˉ\bar f is a nonzerodivisor on R/πRR/\pi R with quotient of dimension NN, and choose bi∈Rb_i\in R lifting a basis of that quotient. Write b(z)=∑izibib(z)=\sum_i z_i b_i. There are integral, bounded linear division maps rem⁡:R→ON\operatorname{rem}:R\to O^N and quo⁡:R→R\operatorname{quo}:R\to R characterized by

h=b(rem⁡(h))+fquo⁡(h). h=b(\operatorname{rem}(h))+f\operatorname{quo}(h).
(3.1)

Every g∈f+πRg\in f+\pi R has a unique factorization

g=(1+v)(f+b(z)),z∈(πO)N,v∈πR. g=(1+v)(f+b(z)),\qquad z\in(\pi O)^N,\quad v\in \pi R.
(3.2)

The coordinates z,vz,v are convergent series of bounded multilinear maps in g−fg-f; in particular they are analytic on every finite-dimensional analytic family taking values in f+πRf+\pi R.

Proof. The freeness argument in Lemma 2.1 uses exactly the hypotheses on fˉ\bar f made here. Take rem⁡\operatorname{rem} to be the quotient coordinates in its basis bib_i. The difference in (3.1) is uniquely divisible by ff, defining quo⁡\operatorname{quo}. Both maps are OO-linear, preserve πj\pi^j multiples, and extend with norm at most one after inverting π\pi. Consequently Λ(z,v)=b(z)+fv\Lambda(z,v)=b(z)+fv is an isometric isomorphism KN⊕R→RK^N\oplus\mathscr R\to\mathscr R for the maximum norm. For h=g−fh=g-f, (3.2) is the fixed-point equation

s=Λ−1h−Λ−1(vb(z)),s=(z,v). s=\Lambda^{-1}h-\Lambda^{-1}(v b(z)),\qquad s=(z,v).
(3.3)

Its right side preserves π(ON⊕R)\pi(O^N\oplus R) and has Lipschitz constant at most ∣π∣<1|\pi|<1 there. This proves existence and uniqueness.

To prove analyticity with an actual convergence neighborhood, set

s1=Λ−1h,sm=−Λ−1∑i+j=mvib(zj) (m≥2),si=(zi,vi),∥sm(h)∥≤∥h∥m. s_1=\Lambda^{-1}h,\qquad s_m=-\Lambda^{-1}\sum_{i+j=m}v_i b(z_j)\ (m\geq2),\qquad s_i=(z_i,v_i),\qquad \|s_m(h)\|\leq\|h\|^m.
(3.4)

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 πR\pi R, and substitution in (3.3) identifies it with the fixed point. For an analytic family h(y)h(y) near y0y_0 with h(y0)∈πRh(y_0)\in \pi R, 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 (fˉ)⊂R/πR(\bar f)\subset R/\pi R, its lifts as curve ideals are uniquely parametrized by

z∈(πO)N⟼(f+b(z)). z\in(\pi O)^N\longmapsto(f+b(z)).
(3.5)

These charts have analytic transition maps with unit Jacobian. They define an intrinsic measure μR\mu_R, in which each chart has mass q−Nq^{-N}. At (g)(g) its tangent lattice, after choosing the generator gg, is R/(g)R/(g).

Proof. Any generator of a lifted ideal can first be multiplied by a unit so that it reduces to fˉ\bar f. Apply (3.2). If two normalized representatives generate the same ideal, their relating unit reduces to one, by cancellation of fˉ\bar f. Uniqueness in (3.2) makes their zz 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 R/(g)R/(g). The bib_i form an integral basis there, again by Lemma 2.1. If g′=ugg'=ug, differentiation modulo (g)(g) gives multiplication by the unit uu, 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 KK, valid in every characteristic as specified in Section 1, identifies the coordinate Haar measures. Finally (πO)N(\pi O)^N has mass q−Nq^{-N}. ∎

Normalizing a whole state requires counting its residue ideals. A residue generator restricted to T=0T=0 is a power series in XX of order cc, with cc 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

VS(a;c)=q−c,VT(a,b;c,h)=(q−1)q−c−h. V_{S(a;c)}=q^{-c},\qquad V_{T(a,b;c,h)}=(q-1)q^{-c-h}.
(3.6)

The probability measure on a state is μR/Vs\mu_R/V_s.

Proof. Set B=R/πRB=R/\pi R, BN+1=B/mN+1B_{N+1}=B/\mathfrak m^{N+1}; write ℓ=dim⁡kBN+1\ell=\dim_k B_{N+1}. An allowed quotient B/(fˉ)B/(\bar f) has length NN, so mN⊆(fˉ)\mathfrak m^N\subseteq(\bar f) and mN+1⊆m(fˉ)\mathfrak m^{N+1}\subseteq\mathfrak m(\bar f). If h∈mN+1⊆m(fˉ)h\in\mathfrak m^{N+1}\subseteq\mathfrak m(\bar f), then fˉ+h=fˉ(1+a)\bar f+h=\bar f(1+a) for some a∈ma\in\mathfrak m. Thus changing a generator modulo mN+1\mathfrak m^{N+1} preserves its ideal. Both the generator counts below and the unit-orbit counts take place in the finite ring BN+1B_{N+1}.

Along a single axis, contact cc imposes cc zero coefficients and one nonzero coefficient. Along two axes, the zero lists share their constant coefficient: there are c+h−1c+h-1 zero conditions and two nonzero conditions. These coefficients exist in BN+1B_{N+1}, since N+1>N≥c,hN+1>N\geq c,h. Thus the respective numbers of generators are

(q−1)qℓ−c−1,(q−1)2qℓ−c−h−1. (q-1)q^{\ell-c-1},\qquad (q-1)^2q^{\ell-c-h-1}.
(3.7)

Multiplication by a generator on BN+1B_{N+1} has cokernel dimension NN, hence kernel dimension NN. Its annihilator contains no unit. The stabilizer under BN+1×B_{N+1}^\times is 1+Ann⁡(fˉ)1+\operatorname{Ann}(\bar f), of size qNq^N, and every generator of the same ideal is a unit multiple: from g=afg=af, f=bgf=bg one gets (1−ba)f=0(1-ba)f=0, forcing aa to be a unit. Therefore each orbit has size (q−1)qℓ−1−N(q-1)q^{\ell-1-N}. Dividing (3.7) by this size gives qN−cq^{N-c} and (q−1)qN−c−h(q-1)q^{N-c-h} residue ideals. Multiply by their chart mass q−Nq^{-N} 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 EE, 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 EE has tangent degree dd, while EE restricts with degree −1-1; hence adding dEdE 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 X~=Bl⁡m(Spec⁡R)\widetilde X=\operatorname{Bl}_{\mathfrak m}(\operatorname{Spec}R), with blowup morphism βbl ⁣:X~→Spec⁡R\beta_{\mathrm{bl}}\colon\widetilde X\to\operatorname{Spec}R and exceptional curve EE, and let X\mathfrak X be its formal completion along EE. Put I=OX~(−E)\mathcal I=\mathcal O_{\widetilde X}(-E) and Xj=(E,OX~/Ij)\mathfrak X_j=(E,\mathcal O_{\widetilde X}/\mathcal I^j) for j≥1j\geq1. The charts x=tzx=tz, t=xwt=xw identify EE with Pk1\mathbb P^1_k and give

Ij/Ij+1≃OE(j),OX(E)∣E≃OE(−1). \mathcal I^j/\mathcal I^{j+1}\simeq\mathcal O_E(j),\qquad \mathcal O_{\mathfrak X}(E)|_E\simeq\mathcal O_E(-1).
(4.1)

The conormal line I/I2\mathcal I/\mathcal I^2 is generated by tt on one chart and xx on the other; x=ztx=zt gives its OE(1)\mathcal O_E(1) twist and the dual's sign.

Write U1,U2U_1,U_2 for the charts x=tzx=tz, t=xwt=xw, and rj:Cj+1∙→Cj∙r_j:C_{j+1}^\bullet\to C_j^\bullet for the transition maps of any tower of complexes. For a tower rj:Vj+1→Vjr_j:V_{j+1}\to V_j, put ΔV:∏jVj→∏jVj\Delta_V:\prod_jV_j\to\prod_jV_j, ΔV(c)j=cj−rj(cj+1)\Delta_V(c)_j=c_j-r_j(c_{j+1}). Finite-level gluing can acquire an inverse-limit cokernel; eventual surjectivity on sections removes it.

Lemma 4.1 (passage to the formal limit). Let F\mathcal F be a coherent sheaf on X\mathfrak X, and let Cj∙=Cˇ∙({U1,U2},F⊗OXj)C_j^\bullet=\check C^\bullet(\{U_1,U_2\},\mathcal F\otimes\mathcal O_{\mathfrak X_j}) 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, H2(X,F)=0H^2(\mathfrak X,\mathcal F)=0, and the termwise inverse limit computes H∙(X,F)H^\bullet(\mathfrak X,\mathcal F). Writing Δ(c)j=cj−rj(cj+1)\Delta(c)_j=c_j-r_j(c_{j+1}) for the difference map of a tower, one has

H0(lim←⁡Cj∙)=lim←⁡H0(Cj∙),0⟶coker⁡ΔH0⟶H1(lim←⁡Cj∙)⟶lim←⁡H1(Cj∙)⟶0. H^0(\varprojlim C_j^\bullet)=\varprojlim H^0(C_j^\bullet),\qquad 0\longrightarrow\operatorname{coker}\Delta_{H^0} \longrightarrow H^1(\varprojlim C_j^\bullet) \longrightarrow\varprojlim H^1(C_j^\bullet)\longrightarrow0.
(4.2)

If the maps on H0(Cj∙)H^0(C_j^\bullet) are eventually surjective, the first cokernel is zero, so H1H^1 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 X\mathfrak X, every line bundle whose restriction to EE has degree zero is trivial, and for d≥0d\geq0,

H0(X,OX(dE))=R,length⁡OH1(X,OX(dE))=(d2). H^0(\mathfrak X,\mathcal O_{\mathfrak X}(dE))=R,\qquad \operatorname{length}_O H^1(\mathfrak X,\mathcal O_{\mathfrak X}(dE))=\binom d2.
(4.3)

In particular H1(X,OX)=0H^1(\mathfrak X,\mathcal O_{\mathfrak X})=0.

Proof. The Laurent-polynomial Čech calculation on P1\mathbb P^1 gives h0(OE(j))=j+1h^0(\mathcal O_E(j))=j+1, h1(OE(j))=0h^1(\mathcal O_E(j))=0 for j≥0j\geq0, and h0(OE(−j))=0h^0(\mathcal O_E(-j))=0, h1(OE(−j))=j−1h^1(\mathcal O_E(-j))=j-1 for j≥1j\geq1. The latter quotient has basis z−1,…,z−(j−1)z^{-1},\ldots,z^{-(j-1)}. The sequences with kernel OE(j)\mathcal O_E(j) between Xj+1\mathfrak X_{j+1} and Xj\mathfrak X_j imply vanishing of H1(OXj)H^1(\mathcal O_{\mathfrak X_j}) and surjectivity on H0H^0. Moreover R/mj→H0(OXj)R/\mathfrak m^j\to H^0(\mathcal O_{\mathfrak X_j}) is an isomorphism: it is so at j=1j=1, and its next graded map identifies the degree-jj monomials in t,xt,x with the basis of H0(OE(j))H^0(\mathcal O_E(j)). Taking limits using (4.2) proves the assertions for d=0d=0.

A degree-zero line bundle on EE is trivial. Lift a generating section through all thickenings; the obstruction groups are H1(OE(j))=0H^1(\mathcal O_E(j))=0. Each lift is still a generator by nilpotent Nakayama, so their compatible limit trivializes the line bundle on X\mathfrak X.

For OX(dE)\mathcal O_{\mathfrak X}(dE) the successive kernel is OE(j−d)\mathcal O_E(j-d). Its H1H^1 vanishes for j≥d−1j\geq d-1, so (4.2) applies by eventual surjectivity. Now the exact sequences

0⟶OX((d−1)E)⟶OX(dE)⟶OE(−d)⟶0 0\longrightarrow\mathcal O_{\mathfrak X}((d-1)E)\longrightarrow \mathcal O_{\mathfrak X}(dE)\longrightarrow\mathcal O_E(-d)\longrightarrow0
(4.4)

keep H0H^0 equal to RR via the natural maps R→H0(X,OX)→H0(X,OX(dE))R\to H^0(\mathfrak X,\mathcal O_{\mathfrak X})\to H^0(\mathfrak X,\mathcal O_{\mathfrak X}(dE)): the quotient OE(−d)\mathcal O_E(-d) has no sections, so allowing these poles adds no global function. They add a quotient of kk-dimension d−1d-1 to H1H^1, since H2=0H^2=0. Its OO-length is the same dimension. Summing these lengths gives ∑i=1d(i−1)=(d2)\sum_{i=1}^d(i-1)=\binom d2, including d=0,1d=0,1. ∎

For a closed point P∈EP\in E, write RP=O^X~,PR_P=\widehat{\mathcal O}_{\widetilde X,P}, let ePe_P be an exceptional equation, and put δP=[k(P):k]\delta_P=[k(P):k].

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 (gP)⊂RP(g_P)\subset R_P, where gPg_P is a nonzerodivisor and rP=length⁡RPRP/(gP,eP)r_P=\operatorname{length}_{R_P}R_P/(g_P,e_P) is positive and finite. There is exactly one effective Cartier divisor D′D' on X\mathfrak X with these completed ideals and no other intersection with EE. Its restriction to EE is ∑PrPP\sum_P r_PP.

Proof plan for Lemma 4.3.

  1. At each thickening, form the quotient kernel and descend its rank-one freeness from completed stalks.
  2. Lift bases compatibly through successive thickenings, then recover the prescribed ideals by completion.

Proof. At level jj, the module MP,j=RP/(gP,ePj)M_{P,j}=R_P/(g_P,e_P^j) has finite length, by filtering with powers of ePe_P. 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

0⟶Jj⟶OXj⟶⨁PMP,j⟶0. 0\longrightarrow\mathcal J_j\longrightarrow\mathcal O_{\mathfrak X_j} \longrightarrow\bigoplus_P M_{P,j}\longrightarrow0.
(4.5)

The map is surjective at each stalk, because the supports are disjoint. After completion at PP, its kernel is generated by gPg_P modulo ePje_P^j. This generator is regular: ePe_P is a prime parameter, it does not divide gPg_P, and repeated cancellation shows that gPh∈(ePj)g_Ph\in(e_P^j) forces h∈(ePj)h\in(e_P^j). 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 Jj+1⊗OXj→Jj\mathcal J_{j+1}\otimes\mathcal O_{\mathfrak X_j}\to\mathcal J_j is an isomorphism. This can again be checked after faithful completion, where it sends the generator gPg_P to itself. Choose affine opens in the two charts trivializing J1\mathcal J_1. 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 J\mathcal J on X\mathfrak X. The inclusions into OXj\mathcal O_{\mathfrak X_j} pass to an injective inclusion into OX\mathcal O_{\mathfrak X}, since each finite-level map is injective. Thus J\mathcal J defines an effective Cartier divisor. On these opens the transition maps on sections of Jj\mathcal J_j are surjective, so the same Δ\Delta argument identifies its quotient with the inverse limit of the prescribed quotients.

Completing at PP recovers (gP)(g_P): RPR_P is ePe_P-adically complete by the closed-ideal argument used for π\pi in Section 3, and RP/(gP)R_P/(g_P) is complete for this topology because its quotient by ePe_P 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 X\mathfrak X. At level one, (4.5) gives the ideal of ∑PrPP\sum_P r_PP. This proves existence, uniqueness, and the stated restriction. ∎

For a parent curve put d=ord⁡mfd=\operatorname{ord}_{\mathfrak m}f. Its initial form in k[T,X]k[T,X] defines its tangent divisor

D=∑PrPPon E,∑PδPrP=d. D=\sum_P r_PP\quad\text{on }E,\qquad \sum_P\delta_Pr_P=d.
(4.6)

The strict-transform equation is fP′=eP−dβbl∗ff'_P=e_P^{-d}\beta_{\mathrm{bl}}^*f. A boundary of parent contact cc has a distinguished rational point on EE. In the chart t=xwt=xw, restricting x−df(xw,x)x^{-d}f(xw,x) to w=0w=0 gives order c−dc-d. Thus d≤cd\leq c, that point is occupied exactly when d<cd<c, and, when occupied, the child has old-boundary contact c−dc-d and exceptional contact rPr_P. When d=cd=c the point is absent. Apply the same statement to the other boundary when present. At every point PP of DD, restricting fP′f'_P to EE gives the dehomogenized initial form, of order rPr_P at PP; hence the exceptional contact is length⁡RP/(fP′,eP)=rP\operatorname{length}R_P/(f'_P,e_P)=r_P.

In every child label the exceptional component is listed first, so its first contact is the multiplicity rPr_P on EE. For instance, at the boundary point of S(a;c)S(a;c) with d<cd<c, substitution t=xwt=xw gives π=uxawa\pi=u x^a w^a: exceptional multiplicity aa and contact r0r_0, old-boundary multiplicity aa and contact c−dc-d, hence the complete label T(a,a;r0,c−d)T(a,a;r_0,c-d).

Write Ca,b;c,h=FT(a,b;c,h)C_{a,b;c,h}=F_{T(a,b;c,h)}. At a tangent point of degree δ\delta, every child below is interpreted over the unramified coefficient extension of degree δ\delta. For S(a;c)S(a;c), choose 1≤d≤c1\leq d\leq c. Its one boundary point has multiplicity r0>0r_0>0 exactly when d<cd<c. Its children are

parent and tangent degreeoccupied pointchildS(a;c), 1≤d≤cboundary (d<c)T(a,a;r0,c−d)P off the boundaryS(a;rP). \begin{array}{c|c|c} \text{parent and tangent degree}&\text{occupied point}&\text{child}\\ \hline S(a;c),\ 1\leq d\leq c&\text{boundary }(d<c)&T(a,a;r_0,c-d)\\ &P\text{ off the boundary}&S(a;r_P). \end{array}
(4.7)

For T(a,b;c,h)T(a,b;c,h), choose 1≤d≤min⁡(c,h)1\leq d\leq\min(c,h). The two boundary multiplicities satisfy rt>0  ⟺  d<cr_t>0\iff d<c and rx>0  ⟺  d<hr_x>0\iff d<h. The children are

parent and tangent degreeoccupied pointchildT(a,b;c,h), 1≤d≤min⁡(c,h)first boundary (d<c)T(a+b,a;rt,c−d)second boundary (d<h)T(a+b,b;rx,h−d)P off both boundariesS(a+b;rP). \begin{array}{c|c|c} \text{parent and tangent degree}&\text{occupied point}&\text{child}\\ \hline T(a,b;c,h),\ 1\leq d\leq\min(c,h)&\text{first boundary }(d<c)&T(a+b,a;r_t,c-d)\\ &\text{second boundary }(d<h)&T(a+b,b;r_x,h-d)\\ &P\text{ off both boundaries}&S(a+b;r_P). \end{array}
(4.8)

The order of contacts agrees with the order of multiplicities in each state. For instance, t=xwt=xw sends π=utaxb\pi=ut^ax^b to uxa+bwau x^{a+b}w^a, giving the first crossing child's multiplicities; the other chart exchanges the roles. An absent boundary contributes no child, including when d=cd=c or d=hd=h.

Proposition 4.4 (fixed-divisor bijection and index). Fix a parent state, an integer d≥1d\geq1 no greater than any of its boundary contacts, and a degree-dd 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 Bf=∏PRP/(fP′)B_f=\prod_P R_P/(f'_P), the natural map satisfies

0⟶Af⟶Bf⟶H1(X,OX(dE))⟶0,length⁡O(Bf/Af)=(d2). 0\longrightarrow A_f\longrightarrow B_f\longrightarrow H^1(\mathfrak X,\mathcal O_{\mathfrak X}(dE))\longrightarrow0, \qquad \operatorname{length}_O(B_f/A_f)=\binom d2.
(4.9)

In particular Af[1/π]≃Bf[1/π]A_f[1/\pi]\simeq B_f[1/\pi], without a reducedness assumption.

Proof. Given arbitrary allowed children, Lemma 4.3 glues their divisor D′D'. The degree of OX(D′)∣E\mathcal O_{\mathfrak X}(D')|_E is dd, so (4.1) makes OX(D′+dE)∣E\mathcal O_{\mathfrak X}(D'+dE)|_E have degree zero. Lemma 4.2 trivializes it, and therefore also its dual ideal OX(−D′−dE)\mathcal O_{\mathfrak X}(-D'-dE). Choose a global generating section of this ideal. Its inclusion in OX\mathcal O_{\mathfrak X} gives a global function f∈H0(X,OX)=Rf\in H^0(\mathfrak X,\mathcal O_{\mathfrak X})=R with divisor exactly D′+dED'+dE. Its exceptional order is exactly dd, because no child contains EE; for a function of RR this equals its maximal-ideal order, as its first initial form shows. Its tangent divisor is DD, 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 RR, so they define the same parent ideal. Gluing uniqueness gives the bijection.

The identity div⁡(f)=D′+dE\operatorname{div}(f)=D'+dE gives the multiplication isomorphism OX(dE)→ ⋅f OX(−D′)\mathcal O_{\mathfrak X}(dE)\xrightarrow{\,\cdot f\,}\mathcal O_{\mathfrak X}(-D'). Compose it with the inclusion into OX\mathcal O_{\mathfrak X}. Under the natural identifications of both spaces of global sections with RR from Lemma 4.2, the resulting map is multiplication by ff. Also H0(X,OD′)=BfH^0(\mathfrak X,\mathcal O_{D'})=B_f: at finite level the quotient has disjoint finite supports and sections ∏PRP/(fP′,ePj)\prod_P R_P/(f'_P,e_P^j), whose limit is the stated product. Each factor is finite free over OδPO_{\delta_P} by Lemma 2.1, hence over OO. The cohomology sequence and Lemma 4.2 now give (4.9). Its final term is killed by a power of π\pi, 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 ddth power of an exceptional equation. The lattice inclusion contributes determinant q−(d2)q^{-\binom d2}, while this division contributes qd2q^{d^2} because the residue-degree-weighted contacts sum to dd. Their product is q(d+12)q^{\binom{d+1}{2}}; 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,

dμR=q−(d+12)∏PdμRP. d\mu_R=q^{-\binom{d+1}{2}}\prod_P d\mu_{R_P}.
(5.1)

Each child measure is defined over OδPO_{\delta_P}, with residue size qδPq^{\delta_P}. 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.

  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.
  2. The derivative combines the lattice index (4.9) with exceptional division, giving absolute determinant q(d+12)q^{\binom{d+1}{2}}.
  3. 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 ff and integral tangent representatives bib_i. At PP write π=uPePvPyPwP\pi=u_Pe_P^{v_P}y_P^{w_P}, where eP,yPe_P,y_P are regular parameters, yPy_P cuts out the old boundary when PP is a boundary point, and wP=0w_P=0 otherwise; always vP≥1v_P\geq1 and wP≥0w_P\geq0. Choose MM so that (M−1)vP≥d(M-1)v_P\geq d at all occupied points and πMR⊆md+1\pi^MR\subseteq\mathfrak m^{d+1}. On the ball z∈(πMO)Nz\in(\pi^MO)^N the parent tangent divisor stays fixed, and

πMePd∈πRP,f+∑izibi⟼fP′+∑izieP−dβbl∗bi. \frac{\pi^M}{e_P^d}\in \pi R_P,\qquad f+\sum_i z_i b_i\longmapsto f'_P+\sum_i z_i e_P^{-d}\beta_{\mathrm{bl}}^*b_i.
(5.2)

This is an affine analytic family in fP′+πRPf'_P+\pi R_P when parametrized by z=πMyz=\pi^My. Its normalization is analytic by Lemma 3.1. Choosing an integral OO-basis of each OδPO_{\delta_P} makes it a finite-dimensional KK-analytic map. This argument also works at crossing points.

In the intrinsic tangent identifications its derivative is h↦(eP−dβbl∗h mod fP′)Ph\mapsto(e_P^{-d}\beta_{\mathrm{bl}}^*h\bmod f'_P)_P from Af[1/π]A_f[1/\pi] to Bf[1/π]B_f[1/\pi]. It is well defined because a multiple of ff maps to a multiple of fP′f'_P after division. Normalizing a generator just removes such multiples; other generator choices change tangent coordinates by integral automorphisms. At any generator g=f+b(z0)g=f+b(z_0) in the cell, the derivative is the displayed map with gg in place of ff, conjugated by the integral lattice isomorphisms of Proposition 3.2 and by units. Proposition 4.4 applied to gg gives the same absolute determinant. The modulus of an invertible linear map is its determinant absolute value: write its matrix as Udiag⁡(πmi)VU\operatorname{diag}(\pi^{m_i})V with U,V∈GLN(O)U,V\in\mathrm{GL}_N(O), which preserve normalized Haar measure; diagonal scaling has modulus q−∑imiq^{-\sum_i m_i}. In particular the inclusion Af↪BfA_f\hookrightarrow B_f has absolute determinant q−(d2)q^{-\binom d2}. On the PP-factor multiplication by ePe_P is injective, with cokernel RP/(fP′,eP)R_P/(f'_P,e_P) of OO-length δPrP\delta_Pr_P. Consequently

∣det⁡D(strict transform)∣=q−(d2)∏PqdδPrP=qd2−(d2)=q(d+12). |\det D(\text{strict transform})| =q^{-\binom d2}\prod_P q^{d\delta_Pr_P} =q^{d^2-\binom d2}=q^{\binom{d+1}{2}}.
(5.3)

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 OδPO_{\delta_P} is product Haar measure in any integral OO-basis, so a nonrational point introduces exactly the factor already counted in δPrP\delta_Pr_P and no other normalization. ∎

Example 5.2 (a quadratic cluster chart). In R=O[[x]]R=O[[x]] take f=x2+a1x+a0f=x^2+a_1x+a_0. To have order two at (π,x)(\pi,x) requires a1∈πOa_1\in\pi O and a0∈π2Oa_0\in\pi^2O. Modulo (π,x)3(\pi,x)^3 its initial form is X2+a1/π‾ TX+a0/π2‾ T2X^2+\overline{a_1/\pi}\,TX+\overline{a_0/\pi^2}\,T^2. The tangent divisor twice the direction x/π=0x/\pi=0 makes both latter coefficients zero, so a1∈π2Oa_1\in\pi^2O and a0∈π3Oa_0\in\pi^3O. The coefficient chart is the intrinsic chart (3.5): 1,x1,x are an integral basis of O[[x]]/(f)O[[x]]/(f) by Lemma 2.1, so b(z)=z0+z1xb(z)=z_0+z_1x. Thus coefficient volume is μR\mu_R. Substituting x=πzx=\pi z gives

π−2f(πz)=z2+(a1/π)z+a0/π2, \pi^{-2}f(\pi z)=z^2+(a_1/\pi)z+a_0/\pi^2,
(5.4)

whose nonleading coefficients range independently over πO\pi O. Thus

vol⁡(parent cell)=q−5,vol⁡(child state)=q−2,q−5/q−2=q−3=q−(32). \operatorname{vol}(\text{parent cell})=q^{-5},\qquad \operatorname{vol}(\text{child state})=q^{-2},\qquad q^{-5}/q^{-2}=q^{-3}=q^{-\binom32}.
(5.5)

The parent-cell mass q−5q^{-5} is unnormalized. Its conditional probability inside S(1;2)S(1;2) is q−5/VS(1;2)=q−5/q−2=q−3q^{-5}/V_{S(1;2)}=q^{-5}/q^{-2}=q^{-3}. This calculation includes residue characteristic two and any ramification of OO.

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, S(a;c)S(a;c) at a rational direction, with total probability λc=q1−(c+12)\lambda_c=q^{1-\binom{c+1}{2}}. For c≥2c\ge2 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 [true]=1[\mathrm{true}]=1, [false]=0[\mathrm{false}]=0.

Proposition 6.1 (transition probabilities). A particular allowed degree-dd tangent divisor has probability

pS(D)=q−(d+12)(q−1)[d<c],pT(D)=q−(d2)(q−1)[d<c]+[d<h]−1. p_S(D)=q^{-\binom{d+1}{2}}(q-1)^{[d<c]},\qquad p_T(D)=q^{-\binom d2}(q-1)^{[d<c]+[d<h]-1}.
(6.1)

Here [ cond ][\,\text{cond}\,] is 11 when the enclosed condition holds and 00 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 (q−1)[d<c]q−c(q-1)^{[d<c]}q^{-c} in the single-boundary case. Indeed the exceptional contacts sum to dd, while the old-boundary contact contributes c−dc-d when present. In the crossing case the product is (q−1)jq−(c+h−d)(q-1)^j q^{-(c+h-d)}, where j=[d<c]+[d<h]j=[d<c]+[d<h]. Multiply by the factor in (5.1) and divide by the respective parent volume. The crossing exponent uses (d+12)−d=(d2)\binom{d+1}{2}-d=\binom d2. 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 μ(j)=0\mu(j)=0 if a prime square divides jj, and μ(j)=(−1)r\mu(j)=(-1)^r if jj is a product of rr 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-δ\delta point count on the affine line:

Nδ(q)=1δ∑j∣δμ(j)qδ/j,qm=∑δ∣mδNδ(q). N_\delta(q)=\frac1\delta\sum_{j\mid\delta}\mu(j)q^{\delta/j},\qquad q^m=\sum_{\delta\mid m}\delta N_\delta(q).
(6.2)

The second identity follows by factoring the separable polynomial Xqm−XX^{q^m}-X into all irreducibles of degrees dividing mm; Möbius inversion gives the first. Away from b0b_0 rational boundary points on EE, put C1=q+1−b0C_1=q+1-b_0 and Cδ=Nδ(q)C_\delta=N_\delta(q) for δ>1\delta>1. After fixing the boundary multiplicities, a pattern m=(mδ,r)\mathbf m=(m_{\delta,r}) uses mδ,rm_{\delta,r} distinct degree-δ\delta points with multiplicity rr. Its constraint and count are

∑boundaryr+∑δ,rδrmδ,r=d,Cm(q;b0)=∏δ(Cδ)∑rmδ,r∏rmδ,r!,(u)j=∏i=0j−1(u−i). \sum_{\text{boundary}}r+\sum_{\delta,r}\delta r m_{\delta,r}=d, \qquad \mathcal C_{\mathbf m}(q;b_0)=\prod_\delta \frac{(C_\delta)_{\sum_r m_{\delta,r}}}{\prod_r m_{\delta,r}!}, \quad (u)_j=\prod_{i=0}^{j-1}(u-i).
(6.3)

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

ψδ(q)=qδ,ψδ(Ze,f)=Ze,δf. \psi_\delta(q)=q^\delta,\qquad \psi_\delta(Z_{e,f})=Z_{e,\delta f}.
(6.4)

It records viewing a field over the unramified extension KδK_\delta as an extension of KK: (e,f)↦(e,δf)(e,f)\mapsto(e,\delta f). Each transition preserves the weighted degree of its law, since

∑PδPN(childP)=N(parent):ad+a(c−d)=ac,(a+b)d+a(c−d)+b(h−d)=ac+bh. \sum_P\delta_P N(\text{child}_P)=N(\text{parent}): \quad ad+a(c-d)=ac,\quad (a+b)d+a(c-d)+b(h-d)=ac+bh.
(6.5)

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 cc and hh, both smaller than c+hc+h; other contacts are at most d≤min⁡(c,h)d\leq\min(c,h). In a single-boundary transition a boundary child has size r0+c−d≤cr_0+c-d\leq c and comes earlier even at equality. An off-boundary contact is less than cc, unless the entire divisor is cPcP at one rational point and d=cd=c. This is the unique self-state transition. There are qq such points, so its total probability is λc=q1−(c+12)\lambda_c=q^{1-\binom{c+1}{2}}. For c=1c=1 it equals one, and we use the terminal law (2.4) instead of dividing by zero.

In each sum, m\mathbf m ranges over finitely supported arrays of nonnegative integers mδ,rm_{\delta,r} with δ,r≥1\delta,r\geq1; the displayed degree constraint makes the range finite. Let e1,c\mathbf e_{1,c} denote the array with its sole nonzero entry m1,c=1m_{1,c}=1. For c≥2c\geq2, define the exit contribution Γa;c\Gamma_{a;c}, an unnormalized law of total mass 1−λc1-\lambda_c, by summing every transition of S(a;c)S(a;c) except its self-return:

Γa;c=∑1≤d≤c, 0≤r0≤dr0=0 ⟺ d=cr0+∑δ,rδrmδ,r=dm≠e1,cq−(d+12)(q−1)[d<c]Cm(q;1){1,d=c,Ca,a;r0,c−d,d<c∏δ,r(ψδFS(a;r))mδ,r. \Gamma_{a;c}= \sum_{\substack{1\leq d\leq c,\ 0\leq r_0\leq d\\ r_0=0\ \Longleftrightarrow\ d=c\\ r_0+\sum_{\delta,r}\delta r m_{\delta,r}=d\\ \mathbf m\ne\mathbf e_{1,c}}} q^{-\binom{d+1}{2}}(q-1)^{[d<c]} \mathcal C_{\mathbf m}(q;1) \begin{cases}1,&d=c,\\ C_{a,a;r_0,c-d},&d<c\end{cases} \prod_{\delta,r}(\psi_\delta F_{S(a;r)})^{m_{\delta,r}}.
(6.6)

The excluded array can occur only at d=c,r0=0d=c,r_0=0; its count is qq, precisely the rational-point self-return. For every positive c,hc,h, the crossing formula is

Ca,b;c,h=∑1≤d≤min⁡(c,h), 0≤rt,rx≤drt=0 ⟺ d=c,rx=0 ⟺ d=hrt+rx+∑δ,rδrmδ,r=dq−(d2)(q−1)[d<c]+[d<h]−1Cm(q;2)⋅{1,d=c,Ca+b,a;rt,c−d,d<c{1,d=h,Ca+b,b;rx,h−d,d<h∏δ,r(ψδFS(a+b;r))mδ,r. \begin{aligned} C_{a,b;c,h}={}& \sum_{\substack{1\leq d\leq\min(c,h),\ 0\leq r_t,r_x\leq d\\ r_t=0\ \Longleftrightarrow\ d=c,\quad r_x=0\ \Longleftrightarrow\ d=h\\ r_t+r_x+\sum_{\delta,r}\delta r m_{\delta,r}=d}} q^{-\binom d2}(q-1)^{[d<c]+[d<h]-1} \mathcal C_{\mathbf m}(q;2)\\ &\quad\cdot \begin{cases}1,&d=c,\\C_{a+b,a;r_t,c-d},&d<c\end{cases} \begin{cases}1,&d=h,\\C_{a+b,b;r_x,h-d},&d<h\end{cases} \prod_{\delta,r}(\psi_\delta F_{S(a+b;r)})^{m_{\delta,r}}. \end{aligned}
(6.7)

For c=1c=1, formula (6.7) reproduces (2.4): d=1d=1 forces rt=0r_t=0. If h>1h>1, then rx=1r_x=1, there is no off-boundary point, the weight is q0(q−1)0=1q^0(q-1)^0=1, and the right side is Ca+b,b;1,h−1=Za+b+b(h−1),1=Za+bh,1C_{a+b,b;1,h-1}=Z_{a+b+b(h-1),1}=Z_{a+bh,1} by induction on hh. If h=1h=1, then rt=rx=0r_t=r_x=0; the one rational point off both boundaries has count C1=q−1C_1=q-1 and weight (q−1)−1(q-1)^{-1}, giving FS(a+b;1)=Za+b,1F_{S(a+b;1)}=Z_{a+b,1}. Interchanging the boundaries proves the case h=1h=1, in agreement with (H) below.

The case factors assign 11 to absent boundaries; all children in (6.6)–(6.7) are earlier in the contact order.

Theorem 6.2 (universal local laws). (i) Every state ss has a law Fs∈Q(q)[Z]F_s\in\mathbb Q(q)[\mathbf Z], homogeneous of weight N(s)N(s) and regular at every prime power.
(ii) On every surface realizing ss, a normalized random curve almost surely terminates after finitely many blowups; its generic algebra Af[1/π]A_f[1/\pi] is then reduced, the product of the fraction fields of its terminal discrete valuation rings, each a finite extension of KK 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 FsF_s.
(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

FS(a;c)=Γa;c1−q1−(c+12)(c≥2). F_{S(a;c)}=\frac{\Gamma_{a;c}}{1-q^{1-\binom{c+1}{2}}}\qquad(c\geq2).
(6.8)

Proof plan for Theorem 6.2.

  1. Contact one is terminal; all surfaces and vertical multiplicities share the same contact order.
  2. Every crossing child and single-boundary exit is earlier, so its law is already universal.
  3. For c≥2c\ge2, exactly jj returns then exit contribute λcjΓa;c\lambda_c^j\Gamma_{a;c}; the tail λcj\lambda_c^j tends to zero independently of the surface.
  4. 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 S(a;c)S(a;c) with c≥2c\geq2, all exit contributions Γa;c\Gamma_{a;c} 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 jj returns followed by exit contribute exactly λcjΓa;c\lambda_c^j\Gamma_{a;c}. Because λc≤q−2<1\lambda_c\leq q^{-2}<1, 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 qq, possibly q−1q-1, and 1−q1−(c+12)1-q^{1-\binom{c+1}{2}} for c≥2c\geq2. None vanishes at a prime power; previously obtained denominators remain nonzero after q↦qδq\mapsto q^\delta. Degree preservation is (6.5). A bound on NN 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 pp a terminal field may be inseparable: on k[[t,x]]k[[t,x]] with π=tp\pi=t^p, every curve of S(p;1)S(p;1) has generic field k((t))k((t)) over k((tp))k((t^p)). Thus the uniform local assertion is reducedness. Let ZZ 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 Z∩(cell)Z\cap(\text{cell}) to a null subset of the product of the child states. Fix one child and let II be the event that its terminal algebra has an inseparable field factor. The entire cylinder II 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 II, which is therefore zero. Taking the countable union over finite itineraries proves the assertion for every state reached from O[[x]]O[[x]] with positive probability. Thus the local reduced-algebra convention gives the usual global étale type probabilities.

Example 6.4 (solving the quadratic cluster). Set Bc=FS(1;c)B_c=F_{S(1;c)} (identified with the cluster law of Section 1 at (7.1)). For c=2c=2, a tangent divisor of degree one occupies the boundary and gives the field variable Z2,1Z_{2,1}. Degree two off the boundary gives either the self-return, two distinct rational points, or one degree-two point. Thus

(1−q−2)B2=q−1qZ2,1+q−12q2(Z1,12+Z1,2), (1-q^{-2})B_2=\frac{q-1}{q}Z_{2,1} +\frac{q-1}{2q^2}(Z_{1,1}^2+Z_{1,2}),
(6.9)

and consequently

B2=qq+1Z2,1+Z1,12+Z1,22(q+1). B_2=\frac{q}{q+1}Z_{2,1} +\frac{Z_{1,1}^2+Z_{1,2}}{2(q+1)}.
(6.10)

The two coefficients in the second term use respectively (q2)\binom q2 and N2(q)=(q2−q)/2N_2(q)=(q^2-q)/2 tangent divisors, each of weight q−3q^{-3}.

In a global polynomial, clusters occur at every residue root, including roots defined only over extensions of kk.

7. Hensel assembly and the four series identities

An irreducible residue factor need not have an OO-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-δ\delta point therefore contributes a cluster law with qq replaced by qδq^\delta and residue degrees multiplied by δ\delta; different points contribute independently.

First, BrB_r really is the cluster law introduced in Section 1. In O[[x]]O[[x]] the state S(1;r)S(1;r) has just one residue ideal, (xr)(x^r). Its chart (3.5) is

xr+∑i=0r−1aixi,ai∈πO, x^r+\sum_{i=0}^{r-1}a_i x^i,\qquad a_i\in \pi O,
(7.1)

with ordinary coefficient measure of total mass q−rq^{-r}. The natural map from O[x]/(f)O[x]/(f) to O[[x]]/(f)O[[x]]/(f) takes the monomial basis of the first free rank-rr 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 D=∑jrjPjD=\sum_j r_jP_j be a degree-nn divisor on Ak1\mathbb A^1_k or Pk1\mathbb P^1_k, respectively, with distinct points of degrees δj\delta_j. Conditional on this residue divisor, the monic or projective type law is ∏jψδjBrj\prod_j\psi_{\delta_j}B_{r_j}. A monic residue cell has mass q−nq^{-n}, and a projective residue cell has mass [n+1]q−1[n+1]_q^{-1}, where [n+1]q=1+q+⋯+qn[n+1]_q=1+q+\cdots+q^n is the qq-integer (its subscript distinguishes it from the Iverson bracket in (6.1)).

Proof plan for Lemma 7.1.

  1. Lift coprime factors one π\pi-adic digit at a time and compare finite-level counts.
  2. At a degree-δ\delta point, select a block over OδO_\delta and descend its Frobenius conjugates; equal counts give Haar preservation.

Proof. For coprime monic residue factors GjG_j, including their multiplicities, fix every leading coefficient to be one. At an additional π\pi-adic digit, multiplication linearizes to

(hj)j⟼∑jhj∏i≠jGi. (h_j)_j\longmapsto\sum_j h_j\prod_{i\ne j}G_i.
(7.2)

Reduction modulo GjG_j proves injectivity, because deg⁡hj<deg⁡Gj\deg h_j<\deg G_j and the other factors are units modulo GjG_j. Source and target have dimension nn, 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 ∏Gj\prod G_j. A kernel element then has Gj∣hjG_j\mid h_j for every jj; equal degrees make hjh_j a scalar multiple of GjG_j, and its zero normalization coordinate makes it zero. Again the dimensions are nn. Successive unique digit lifting proves the factorization bijection modulo every πν\pi^\nu, then over OO by completeness. There are qδjrj(ν−1)q^{\delta_jr_j(\nu-1)} lifts in each factor cell and qn(ν−1)q^{n(\nu-1)} 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-δ\delta residue polynomial gg, pass to OδO_\delta. Its distinct residue roots separate the grg^r cell into coprime blocks. The Frobenius generator of Gal⁡(Kδ/K)≃Gal⁡(kδ/k)\operatorname{Gal}(K_\delta/K)\simeq\operatorname{Gal}(k_\delta/k) 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 OO, also modulo πν\pi^\nu; this follows digit by digit from the π\pi-adic expansion with the unique representatives satisfying aqδ=aa^{q^\delta}=a, which Frobenius raises to the qqth power while fixing π\pi. These representatives lift uniquely because the derivative is congruent to −1-1 modulo π\pi. Both finite-level cells have qδr(ν−1)q^{\delta r(\nu-1)} 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 OδO_\delta. 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 δ\delta. This proves precisely the operation ψδ\psi_\delta and the conditional product law.

There are qnq^n monic residue polynomials. Nonzero binary residue forms modulo scalars correspond to effective degree-nn divisors on Pk1\mathbb P^1_k, with (qn+1−1)/(q−1)=[n+1]q(q^{n+1}-1)/(q-1)=[n+1]_q 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 OmO^m has a null zero set, by induction on mm: 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 Cm(ε)\mathcal C_{\mathbf m}^{(\varepsilon)} for the count (6.3) taken with C1=q+εC_1=q+\varepsilon: ε=0\varepsilon=0 for the affine line and ε=1\varepsilon=1 for the projective line. Lemma 7.1 gives the finite formulas

An=q−n∑m: ∑δrmδ,r=nCm(0)∏δ,r(ψδBr)mδ,r,Rn=[n+1]q−1∑m: ∑δrmδ,r=nCm(1)∏δ,r(ψδBr)mδ,r. A_n=q^{-n}\sum_{\mathbf m:\,\sum\delta r m_{\delta,r}=n} \mathcal C_{\mathbf m}^{(0)}\prod_{\delta,r}(\psi_\delta B_r)^{m_{\delta,r}}, \qquad R_n=[n+1]_q^{-1}\sum_{\mathbf m:\,\sum\delta r m_{\delta,r}=n} \mathcal C_{\mathbf m}^{(1)}\prod_{\delta,r}(\psi_\delta B_r)^{m_{\delta,r}}.
(7.3)

Theorem 6.2 and [n+1]q>0[n+1]_q>0 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 Scale⁡a\operatorname{Scale}_a fix qq and send Ze,fZ_{e,f} to Zae,fZ_{ae,f}. The homogeneity and exchange identities are

FS(ga;c)=Scale⁡gFS(a;c),Cga,gb;c,h=Scale⁡gCa,b;c,h,Ca,b;c,h=Cb,a;h,c. \begin{aligned} F_{S(ga;c)}&=\operatorname{Scale}_g F_{S(a;c)},& C_{ga,gb;c,h}&=\operatorname{Scale}_g C_{a,b;c,h},& C_{a,b;c,h}&=C_{b,a;h,c}. \end{aligned}
(7.4) (H)

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 ψδ\psi_\delta and with products, proving the first two identities. Exchanging the boundaries interchanges their two child lists and preserves their weights and off-boundary multiplicity a+ba+b, proving the third. The solved return denominator is unchanged. This proves (H) in all degrees.

Use Z=Q(q)[Z]\mathcal Z=\mathbb Q(q)[\mathbf Z] as the coefficient ring. For a monomial MM, [M]F[M]F denotes the coefficient of that monomial in FF. The symbols z,w,ξz,w,\xi now mark series degrees, replacing their coordinate roles through (7.1). Constant terms and completion refer to these markers; O(zj)=zjZ[[z]]O(z^j)=z^j\mathcal Z[[z]]. Type weight is a separate grading. The local laws give the series

Ba(z)=1+∑c≥1FS(a;c)zc=Scale⁡aB(z),B=B1,Ta,b(z,w)=∑c,h≥1Ca,b;c,hzcwh. \mathcal B_a(z)=1+\sum_{c\geq1}F_{S(a;c)}z^c =\operatorname{Scale}_a\mathcal B(z),\quad \mathcal B=\mathcal B_1, \qquad \mathcal T_{a,b}(z,w)=\sum_{c,h\geq1}C_{a,b;c,h}z^cw^h.
(7.5)

The point counts in (7.3) determine an assembly operation on H=1+b1z+b2z2+O(z3)H=1+b_1z+b_2z^2+O(z^3): a double rational point contributes qb2qb_2, two rational points contribute (q2)b12\binom q2b_1^2, and a degree-two point contributes N2(q)ψ2(b1)N_2(q)\psi_2(b_1). Ordinary powering HqH^q 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 ψk(z)=zk\psi_k(z)=z^k and similarly for other generating markers. For a zero-constant series ff and a unit series H=1+O(z)H=1+O(z) put

Exp⁡(f)=exp⁡ ⁣(∑k≥1ψk(f)k),Log⁡(H)=∑k≥1μ(k)kψk(log⁡H). \operatorname{Exp}(f)=\exp\!\left(\sum_{k\geq1}\frac{\psi_k(f)}k\right), \qquad \operatorname{Log}(H)=\sum_{k\geq1}\frac{\mu(k)}k\psi_k(\log H).
(7.6)

We call Log⁡\operatorname{Log} in (7.6) the plethystic logarithm.

Lowercase exp⁡,log⁡\exp,\log are ordinary formal series. Every coefficient here uses finitely many terms. The relation ∑d∣mμ(d)=[m=1]\sum_{d\mid m}\mu(d)=[m=1] 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 z↦q±1zz\mapsto q^{\pm1}z; each of these substitutions commutes with every ψk\psi_k. This does not say that reciprocal substitution commutes with dilation: it changes qzqz into z/qz/q.

To compare first differences under assembly, set Pow⁡v(H)=Exp⁡(vLog⁡H)\operatorname{Pow}_v(H)=\operatorname{Exp}(v\operatorname{Log}H) for v∈Q(q)v\in\mathbb Q(q). Then Pow⁡vPow⁡w=Pow⁡vw\operatorname{Pow}_v\operatorname{Pow}_w=\operatorname{Pow}_{vw}. If two unit series first differ by ηzn\eta z^n, their images under Pow⁡v\operatorname{Pow}_v first differ by vηznv\eta z^n. Indeed ordinary logarithm preserves that first difference, every Adams term of index at least two moves it above degree nn, 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

Pow⁡q(H)=1+qb1z+(qb2+(q2)b12+N2(q)ψ2(b1))z2+O(z3). \operatorname{Pow}_q(H) =1+qb_1z+ \left(qb_2+\binom q2b_1^2+N_2(q)\psi_2(b_1)\right)z^2+O(z^3).
(7.7)

Lemma 7.2 (Euler product). For ε=−1,0,1\varepsilon=-1,0,1 and H=1+O(z)H=1+O(z),

Exp⁡((q+ε)Log⁡H)=∏δ≥1(ψδH)Cδ(ε),C1(ε)=q+ε,Cδ(ε)=Nδ(q) (δ>1). \operatorname{Exp}((q+\varepsilon)\operatorname{Log}H) =\prod_{\delta\geq1}(\psi_\delta H)^{C_\delta^{(\varepsilon)}}, \quad C_1^{(\varepsilon)}=q+\varepsilon,\quad C_\delta^{(\varepsilon)}=N_\delta(q)\ (\delta>1).
(7.8)

Powers on the right mean ordinary formal binomial powers.

Proof. On taking ordinary logarithms, the coefficient of ψm(log⁡H)\psi_m(\log H) on the left is m−1∑j∣mμ(j)(qm/j+ε)=Nm(q)+ε[m=1]m^{-1}\sum_{j\mid m}\mu(j)(q^{m/j}+\varepsilon) =N_m(q)+\varepsilon[m=1]. 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

∑n≥0qnAnzn=Exp⁡(qLog⁡B),∑n≥0[n+1]qRnzn=Exp⁡((q+1)Log⁡B). \sum_{n\geq0}q^n A_nz^n=\operatorname{Exp}(q\operatorname{Log}\mathcal B), \qquad \sum_{n\geq0}[n+1]_qR_nz^n =\operatorname{Exp}((q+1)\operatorname{Log}\mathcal B).
(7.9) (G)

Multiply boundary and off-boundary terms before weighting: their tangent degrees add, and the Gaussian weight depends on that sum. Write

La=Log⁡Ba,Ga=Exp⁡(qLa),Pa=Exp⁡((q−1)La),Φξ(ξd)=q−(d+12)ξd,Φξ′(ξd)=q−(d2)ξd. L_a=\operatorname{Log}\mathcal B_a,\qquad \mathcal G_a=\operatorname{Exp}(qL_a),\qquad \mathcal P_a=\operatorname{Exp}((q-1)L_a),\qquad \Phi_\xi(\xi^d)=q^{-\binom{d+1}{2}}\xi^d,\quad \Phi'_\xi(\xi^d)=q^{-\binom d2}\xi^d.
(7.10)

By (G) and (H), Ga=∑n≥0qnScale⁡a(An)zn\mathcal G_a=\sum_{n\geq0}q^n\operatorname{Scale}_a(A_n)z^n is the scaled monic law with normalization removed. It sums divisors on A1\mathbb A^1, the exceptional line with one boundary point removed. The series Pa\mathcal P_a sums divisors on Gm\mathbb G_m, 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:

Ba(z)=Φξ ⁣[(1+(q−1)Ta,a(ξ,z))Ga(ξ)]∣ξ=z, \mathcal B_a(z)= \left.\Phi_\xi\!\left[ (1+(q-1)\mathcal T_{a,a}(\xi,z))\mathcal G_a(\xi) \right]\right|_{\xi=z},
(7.11) (S)
(q−1)Ta,b(z,w)=Φξ′ ⁣[(1+(q−1)Ta+b,a(ξ,z))(1+(q−1)Ta+b,b(ξ,w))Pa+b(ξ)]∣ξ=zw−1. (q-1)\mathcal T_{a,b}(z,w)= \left.\Phi'_\xi\!\left[ (1+(q-1)\mathcal T_{a+b,a}(\xi,z)) (1+(q-1)\mathcal T_{a+b,b}(\xi,w)) \mathcal P_{a+b}(\xi) \right]\right|_{\xi=zw}-1.
(7.12) (T)

For (S), a boundary term Ca,a;r,kξrzkC_{a,a;r,k}\xi^r z^k and an off-boundary term of degree mm give tangent degree d=r+md=r+m and parent contact c=d+kc=d+k. Their factor is (q−1)q−(d+12)(q-1)q^{-\binom{d+1}{2}}. The constant boundary term means r=k=0r=k=0, hence d=cd=c and no boundary child. Lemma 7.2 supplies the off-boundary pattern sum Ga\mathcal G_a. These are exactly (4.7) and (6.1). The constant term is one. In degree cc, the unknown coefficient FS(a;c)F_{S(a;c)} enters Ga\mathcal G_a with multiplier qq, by the first-difference rule for Pow⁡q\operatorname{Pow}_q. The absent-boundary Gaussian therefore contributes q−(c+12)qFS(a;c)=λcFS(a;c)q^{-\binom{c+1}{2}}qF_{S(a;c)}=\lambda_cF_{S(a;c)}. 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 (rt,kt)(r_t,k_t) and (rx,kx)(r_x,k_x), each either (0,0)(0,0) or both positive. With d=rt+rx+md=r_t+r_x+m, the parent contacts are c=d+ktc=d+k_t, h=d+kxh=d+k_x. The displayed product contributes (q−1)jq−(d2)(q-1)^j q^{-\binom d2}, where jj is the number of occupied boundaries. Dividing by the left factor q−1q-1 gives precisely (6.1), while Pa+b\mathcal P_{a+b} 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.

Example 7.3 (the same quadratic in all three models). There are three residue-divisor shapes: a double rational point, two distinct rational points, and one degree-two point. Formula (7.3) gives

q2A2=qB2+(q2)Z1,12+N2(q)Z1,2,[3]qR2=(q+1)B2+(q+12)Z1,12+N2(q)Z1,2. \begin{aligned} q^2A_2&=qB_2+\binom q2 Z_{1,1}^2+N_2(q)Z_{1,2},\\ [3]_qR_2&=(q+1)B_2+\binom{q+1}2Z_{1,1}^2+N_2(q)Z_{1,2}. \end{aligned}
(7.13)

Substituting (6.10) gives the complete table

Type monomialCluster B2B_2Monic A2A_2Projective R2R_2
Z2,1Z_{2,1}qq+1\dfrac q{q+1}1q+1\dfrac1{q+1}qq2+q+1\dfrac q{q^2+q+1}
Z1,12Z_{1,1}^212(q+1)\dfrac1{2(q+1)}q2(q+1)\dfrac q{2(q+1)}12\dfrac12
Z1,2Z_{1,2}12(q+1)\dfrac1{2(q+1)}q2(q+1)\dfrac q{2(q+1)}q2−q+12(q2+q+1)\dfrac{q^2-q+1}{2(q^2+q+1)}

For example all three monic probabilities at q=2q=2 are 1/31/3. 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 (r+s2)=(r2)+(s2)+rs\binom{r+s}2=\binom r2+\binom s2+rs identifies the missing factor as q−rsq^{-rs}. The rule XY=q−1YXXY=q^{-1}YX 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 M≥1M\ge1, cluster reciprocity through degree MM can therefore control crossing contact degree 2M+12M+1.

Let Q\mathcal Q be the Z\mathcal Z-module of formal sums in symbols Ec,h\mathcal E_{c,h} for c,h≥0c,h\geq0, with multiplication

Ec,hEd,k=q−ckEc+d,h+k,X=E1,0,Y=E0,1,J=YX=E1,1. \mathcal E_{c,h}\mathcal E_{d,k}=q^{-ck}\mathcal E_{c+d,h+k},\qquad X=\mathcal E_{1,0},\quad Y=\mathcal E_{0,1},\quad J=YX=\mathcal E_{1,1}.
(8.1)

The basis symbol Ec,h\mathcal E_{c,h} marks contacts c,hc,h; vertical multiplicities a,ba,b belong to its coefficient Ca,b;c,hC_{a,b;c,h}. All truncations in this algebra refer to total contact degree c+hc+h, 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 zz to qzqz. For a term raising degree by c+hc+h, dilation before it and inverse dilation afterwards contribute qmq−(m+c+h)=q−c−hq^m q^{-(m+c+h)}=q^{-c-h} on zmz^m; rescaling each contact marker by qq cancels that cost. The scalar qc+h−chq^{c+h-ch} below uniquely makes †\dagger anti-multiplicative with X†=qXX^\dagger=qX, Y†=qYY^\dagger=qY (Lemma 8.1). Adjoining 11 permits absent boundaries; multiplying the crossing law by q−1q-1 removes the denominator in (6.1). Define

Ua,b=1+(q−1)∑c,h≥1Ca,b;c,hEc,h,(fEc,h)†=f∨qc+h−chEc,h. U_{a,b}=1+(q-1)\sum_{c,h\geq1}C_{a,b;c,h}\mathcal E_{c,h},\qquad (f\mathcal E_{c,h})^\dagger=f^\vee q^{c+h-ch}\mathcal E_{c,h}.
(8.2)

For U=∑c,huc,hEc,hU=\sum_{c,h}u_{c,h}\mathcal E_{c,h}, write U[c,h]:=uc,hU[c,h]:=u_{c,h} 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 †\dagger is a semilinear involution reversing product order. Moreover

XY=q−1YX,Ec,h=YhXc,X†=qX,Y†=qY,J†=qJ,Jm=q−(m2)Em,m. XY=q^{-1}YX,\quad \mathcal E_{c,h}=Y^hX^c,\quad X^\dagger=qX,\quad Y^\dagger=qY,\quad J^\dagger=qJ,\quad J^m=q^{-\binom m2}\mathcal E_{m,m}.
(8.3)

Coefficients with respect to the basis Ec,h=YhXc\mathcal E_{c,h}=Y^hX^c are called normal coefficients. There are continuous algebra homomorphisms commuting with †\dagger given by

ι+(Ec,h)=q−(c2)Ec,c+h,ι−(Ec,h)=q−(h2)Ec+h,h. \iota_+(\mathcal E_{c,h})=q^{-\binom c2}\mathcal E_{c,c+h},\qquad \iota_-(\mathcal E_{c,h})=q^{-\binom h2}\mathcal E_{c+h,h}.
(8.4)

Proof. Associativity on three basis factors is −ck−(c+d)ℓ=−dℓ−c(k+ℓ)-ck-(c+d)\ell=-d\ell-c(k+\ell). The geometric series ∑j≥0(−V)j\sum_{j\geq0}(-V)^j is both inverses of 1+V1+V when VV has positive degree. Applying †\dagger twice cancels its scalar. Anti-multiplicativity is the exponent identity ck+c+d+h+k−(c+d)(h+k)=(c+h−ch)+(d+k−dk)−dhck+c+d+h+k-(c+d)(h+k)=(c+h-ch)+(d+k-dk)-dh. The remaining formulas in (8.3) follow from (8.1) by induction. The embeddings send (X,Y)(X,Y) to (J,Y)(J,Y) and (X,J)(X,J), respectively. These pairs satisfy the same commutation relation; the binomial identity (r+s2)=(r2)+(s2)+rs\binom{r+s}{2}=\binom r2+\binom s2+rs gives (8.4) and verifies multiplicativity directly. They do not lower degree. Their commutation with †\dagger holds on X,YX,Y and coefficients by (8.3), hence on products and on every truncation. ∎

Lemma 8.2 (ordered crossing factorization).

Ua,b=ι+(Ua+b,b) Pa+b(J) ι−(Ua,a+b). U_{a,b}=\iota_+(U_{a+b,b})\,\mathcal P_{a+b}(J)\,\iota_-(U_{a,a+b}).
(8.5)

The middle factor uses ordinary powers of JJ. Its position in the product is essential.

The boundary images have indices (rx,rx+kx)(r_x,r_x+k_x) and (kt+rt,rt)(k_t+r_t,r_t), with kx,ktk_x,k_t the old-boundary contacts. Since q−ckq^{-ck} pairs the left first index with the right second, placing the degree-mm off-boundary term (m,m)(m,m) between them excludes both old contacts from the cross terms in (8.6); moving it left would introduce −mkx-mk_x.

Proof. Let (rt,kt)(r_t,k_t) and (rx,kx)(r_x,k_x) be the contacts of the two boundary children, each pair either both positive or (0,0)(0,0). Let mm be the off-boundary tangent degree and d=rt+rx+md=r_t+r_x+m. The parent contacts are c=d+ktc=d+k_t, h=d+kxh=d+k_x. The three factors on the right contribute normal indices (rx,rx+kx)(r_x,r_x+k_x), (m,m)(m,m), and (kt+rt,rt)(k_t+r_t,r_t). Their Gaussian scalar is

q−(rx2)−(m2)−(rt2)−rxm−rxrt−mrt=q−(d2). q^{-\binom{r_x}{2}-\binom m2-\binom{r_t}{2} -r_xm-r_xr_t-mr_t}=q^{-\binom d2}.
(8.6)

The last factor uses Ca,a+b;kt,rt=Ca+b,a;rt,ktC_{a,a+b;k_t,r_t}=C_{a+b,a;r_t,k_t} by (H), which is exactly the first boundary child in (4.8). Each occupied boundary contributes q−1q-1, and Pa+b\mathcal P_{a+b} sums the off-boundary laws by (7.8). Thus its coefficient is q−1q-1 times the crossing recursion, as required by (8.2). The contact pairs enforce absence exactly when d=cd=c or d=hd=h. The constants are one. This proves (8.5) coefficient by coefficient. ∎

By (G), equality of G1(z)\mathcal G_1(z) and B∨(qz)\mathcal B^\vee(qz) through degree MM means An=Bn∨A_n=B_n^\vee for n≤Mn\le M. The degree-two marker JJ makes this cluster information reach further in contact degree.

Lemma 8.3 (crossing reciprocity from smaller clusters). Suppose M≥1M\geq1 and G1(z)=B∨(qz)\mathcal G_1(z)=\mathcal B^\vee(qz) through series degree MM. Then, simultaneously for every a,ba,b,

Ua,b†=Ua,b−1through total contact degree 2M+1. U_{a,b}^\dagger=U_{a,b}^{-1} \quad\text{through total contact degree }2M+1.
(8.7)

Proof plan for Lemma 8.3.

  1. Use plethystic logarithms for the middle factor; substituting JJ doubles the first omitted degree.
  2. 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 Ba\mathcal B_a. Taking plethystic logarithms gives La∨(qz)=qLa(z)L_a^\vee(qz)=qL_a(z) through degree MM, and therefore

Pa∨(qz)=Exp⁡((q−1−1)La∨(qz))=Exp⁡((1−q)La(z))=Pa(z)−1(modzM+1). \mathcal P_a^\vee(qz) =\operatorname{Exp}((q^{-1}-1)L_a^\vee(qz)) =\operatorname{Exp}((1-q)L_a(z)) =\mathcal P_a(z)^{-1}\pmod{z^{M+1}}.
(8.8)

Since J†=qJJ^\dagger=qJ and JJ has contact degree two, this proves the inverse identity for Pa(J)\mathcal P_a(J) through contact degree 2M+12M+1.

Now induct on the contact degree j≤2M+1j\leq2M+1, for all multiplicities a,ba,b at once. Degrees zero and one are immediate. Every nonconstant term of Ua+b,bU_{a+b,b} has both indices positive; under ι+\iota_+ its degree strictly increases, from c+hc+h to 2c+h2c+h. Under ι−\iota_- it increases to c+2hc+2h. Their inverse series also have no nonconstant axis terms. Thus any embedded child coefficient affecting degree jj comes from degree at most j−1j-1. Apply †\dagger to (8.5), use (8.8) for the middle factor and the inductive inverse identities for the two embedded factors. The result, through degree jj, is ι−(Ua,a+b−1)Pa+b(J)−1ι+(Ua+b,b−1)\iota_-(U_{a,a+b}^{-1})\mathcal P_{a+b}(J)^{-1}\iota_+(U_{a+b,b}^{-1}), 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 2M+12M+1: the first unproved coefficient in (8.8) is degree M+1M+1, and its substitution first occurs at contact degree 2M+22M+2. This substitution bound is exact: a nonzero degree-M+1M+1 error remains nonzero after multiplication by JM+1=q−(M+12)EM+1,M+1J^{M+1}=q^{-\binom{M+1}{2}}\mathcal E_{M+1,M+1}.

For exceptional contact one and off-boundary degree mm, the additional Gaussian factor is q−1−mq^{-1-m}, supplied by q−1zq^{-1}z and the shift z↦z/qz\mapsto z/q. To recover the single-boundary equation, represent the contact algebra on Z[[z]]\mathcal Z[[z]] by ϱ(X)f=q−1zf(z/q)\varrho(X)f=q^{-1}z f(z/q) and ϱ(Y)f=zf\varrho(Y)f=zf. Write Φ=Φz\Phi=\Phi_z. Then

ϱ(Ec,h)f(z)=q−(c+12)zc+hf(z/qc),Ba=ϱ(Ua,a)ΦGa. \varrho(\mathcal E_{c,h})f(z)=q^{-\binom{c+1}{2}}z^{c+h}f(z/q^c), \qquad \mathcal B_a=\varrho(U_{a,a})\Phi\mathcal G_a.
(8.9)

Indeed the two operators satisfy ϱ(X)ϱ(Y)=q−1ϱ(Y)ϱ(X)\varrho(X)\varrho(Y)=q^{-1}\varrho(Y)\varrho(X), and repetition of ϱ(X)\varrho(X) gives the displayed scalar. Each basis term raises series degree by c+hc+h, so the completed action is defined. For the second identity, a boundary term of contacts (r,k)(r,k) acting on degree mm has degree r+k+mr+k+m and Gaussian exponent −(r+12)−rm−(m+12)=−(r+m+12)-\binom{r+1}{2}-rm-\binom{m+1}{2}=-\binom{r+m+1}{2}. This is (S) with tangent degree d=r+md=r+m. The constant term of UU gives the absent-boundary case, including the self-return hidden in Ga\mathcal G_a. Thus (8.9) also respects the terminal degree-one equation.

In particular, put U=U1,1U=U_{1,1} and H=ϱ(U)Φ\mathcal H=\varrho(U)\Phi. Since U−1U-1 begins in contact degree two,

f=ηzn+O(zn+1)⟹Hf=q−(n+12)ηzn+O(zn+1). f=\eta z^n+O(z^{n+1})\quad\Longrightarrow\quad \mathcal H f=q^{-\binom{n+1}{2}}\eta z^n+O(z^{n+1}).
(8.10)

At cluster degree n≥2n\ge2, crossing reciprocity through nn needs only cluster degrees through ⌊n/2⌋<n\lfloor n/2\rfloor<n. 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 G=G1\mathcal G=\mathcal G_1. The reciprocal candidate B∨(qz)\mathcal B^\vee(qz) must satisfy the same assembly and blowup equations as G\mathcal G. Reciprocal substitution puts its crossing action at parameter q−1q^{-1}, whereas crossing inversion belongs to the algebra at qq. For an operator TT, Gaussian conjugation means T↦ΦTΦ−1T\mapsto\Phi T\Phi^{-1}; together with dilation it converts the actions. A first difference ηzn\eta z^n satisfying both equations would then obey q−1η=q−(n+12)ηq^{-1}\eta=q^{-\binom{n+1}{2}}\eta: the inverse-assembly and blowup multipliers force η=0\eta=0 for n≥2n\ge2.

Let Sf(z)=f(qz)\mathscr S f(z)=f(qz). Write ϱ1/q\varrho_{1/q} for (8.9) with reciprocal parameter. For Q0=∑vc,hEc,hQ_0=\sum v_{c,h}\mathcal E_{c,h}, reciprocal substitution means

Q0∨=∑c,hvc,h∨Ec,h,Ec,hEd,k=qckEc+d,h+kin the algebra at parameter q−1. Q_0^\vee=\sum_{c,h}v_{c,h}^\vee \mathcal E_{c,h},\qquad \mathcal E_{c,h}\mathcal E_{d,k}=q^{ck}\mathcal E_{c+d,h+k} \quad\text{in the algebra at parameter }q^{-1}.
(9.1)

This is distinct from Q0†Q_0^\dagger, which is an element of the original algebra (8.1).

Lemma 9.1 (Gaussian conjugation). If vc,h=vh,cv_{c,h}=v_{h,c}, then

Φϱ1/q(Q0∨)Φ−1=S−1ϱ(Q0†)S. \Phi\varrho_{1/q}(Q_0^\vee)\Phi^{-1} =\mathscr S^{-1}\varrho(Q_0^\dagger)\mathscr S.
(9.2)

Proof. On zmz^m, the exponent on the left for the basis element Ec,h\mathcal E_{c,h} is (m+12)+(c+12)+cm−(m+c+h+12)=−ch−(h+12)−hm\binom{m+1}{2}+\binom{c+1}{2}+cm-\binom{m+c+h+1}{2} =-ch-\binom{h+1}{2}-hm. Thus

Φϱ1/q(Ec,h)Φ−1=q−chϱ(Eh,c),S−1ϱ(Ec,h)S=q−c−hϱ(Ec,h). \Phi\varrho_{1/q}(\mathcal E_{c,h})\Phi^{-1} =q^{-ch}\varrho(\mathcal E_{h,c}),\qquad \mathscr S^{-1}\varrho(\mathcal E_{c,h})\mathscr S =q^{-c-h}\varrho(\mathcal E_{c,h}).
(9.3)

Sum the first equality with coefficients vc,h∨v_{c,h}^\vee and exchange c,hc,h, using the hypothesis. The second equality combines with the dagger scalar qc+h−chq^{c+h-ch} to give the same result. All operators preserve the degree filtration, so the argument applies to infinite series and every truncation. ∎

Retain U=U1,1U=U_{1,1} and H=ϱ(U)Φ\mathcal H=\varrho(U)\Phi, and put W=SB∨\mathcal W=\mathscr S\mathcal B^\vee, V=SG∨\mathcal V=\mathscr S\mathcal G^\vee. The series W\mathcal W is the candidate to equal G\mathcal G; V\mathcal V is its corresponding image under Pow⁡q−1\operatorname{Pow}_{q^{-1}}, just as B\mathcal B is that image of G\mathcal G. Without any reciprocity hypothesis we have

B=HG,B=Pow⁡q−1(G),V=Pow⁡q−1(W),ΦW=ϱ(U†)V. \mathcal B=\mathcal H\mathcal G,\qquad \mathcal B=\operatorname{Pow}_{q^{-1}}(\mathcal G),\qquad \mathcal V=\operatorname{Pow}_{q^{-1}}(\mathcal W),\qquad \Phi\mathcal W=\varrho(U^\dagger)\mathcal V.
(9.4)

The first is (8.9), and the second follows from G=Pow⁡q(B)\mathcal G=\operatorname{Pow}_q(\mathcal B). Reciprocal substitution and dilation give the third. For the last, apply ∨\vee to (8.9), obtaining B∨=ϱ1/q(U∨)Φ−1G∨\mathcal B^\vee=\varrho_{1/q}(U^\vee)\Phi^{-1}\mathcal G^\vee. The exchange identity (H) gives U[c,h]=U[h,c]U[c,h]=U[h,c]. Apply Lemma 9.1, multiply by Φ\Phi and then by S\mathscr S, which commutes with Φ\Phi, to get the last equation. If U†=U−1U^\dagger=U^{-1} through contact degree nn, it follows that HW=V\mathcal H\mathcal W=\mathcal V through series degree nn. An error of contact degree greater than nn acts only above series degree nn, even on a series with constant term one; no truncation is lost.

Proof of monic/cluster reciprocity. We prove G=W\mathcal G=\mathcal W by induction on degree. The constants are one, and degree one is qZ1,1qZ_{1,1} on both sides by the terminal law. Let n≥2n\geq2 and assume equality in all smaller degrees. Set M=⌊n/2⌋M=\lfloor n/2\rfloor. Then 1≤M<n1\leq M<n, so Lemma 8.3 applies using only the induction hypothesis. It gives U†=U−1U^\dagger=U^{-1} through degree 2M+1≥n2M+1\geq n. Hence both HG=B\mathcal H\mathcal G=\mathcal B and HW=V\mathcal H\mathcal W=\mathcal V hold through degree nn.

Write G−W=ηzn+O(zn+1)\mathcal G-\mathcal W=\eta z^n+O(z^{n+1}). Equation (8.10), applied to B=HG\mathcal B=\mathcal H\mathcal G and HW=V\mathcal H\mathcal W=\mathcal V, implies one leading coefficient for B−V\mathcal B-\mathcal V. The first-difference rule for Pow⁡q−1\operatorname{Pow}_{q^{-1}} proved after (7.6) implies another:

B−V=q−(n+12)ηzn+O(zn+1)=q−1ηzn+O(zn+1). \mathcal B-\mathcal V =q^{-\binom{n+1}{2}}\eta z^n+O(z^{n+1}) =q^{-1}\eta z^n+O(z^{n+1}).
(9.5)

Consequently

(q−1−q−(n+12))η=0,q(q−1−q−(n+12))=1−λn. (q^{-1}-q^{-\binom{n+1}{2}})\eta=0,\qquad q(q^{-1}-q^{-\binom{n+1}{2}})=1-\lambda_n.
(9.6)

For n≥2n\geq2 this scalar is nonzero in Q(q)\mathbb Q(q), so η=0\eta=0. This closes the induction. The scalar vanishes for n=1n=1, explaining the separate terminal base case. Finally (G) identifies the degree-nn coefficients as qnAn=qnBn∨q^nA_n=q^nB_n^\vee, proving An=Bn∨A_n=B_n^\vee. ∎

For the projective law, the extra rational residue point changes the assembly factor from qq to q+1q+1. Taking logarithms separates that change from the cluster coefficients.

Lemma 9.2 (three equivalent forms). Recall L1=Log⁡BL_1=\operatorname{Log}\mathcal B. For the complete series, and for every prefix of degrees through a fixed bound, the following assertions are equivalent:

An=Bn∨ in that prefix;([zm]L1)∨=q1−m[zm]L1 in that prefix;Rn∨=Rn in that prefix. A_n=B_n^\vee\ \text{in that prefix};\qquad ([z^m]L_1)^\vee=q^{1-m}[z^m]L_1\ \text{in that prefix};\qquad R_n^\vee=R_n\ \text{in that prefix}.
(9.7)

Proof. By (G), the first assertion is Exp⁡(qL1)=B∨(qz)\operatorname{Exp}(qL_1)=\mathcal B^\vee(qz). Its plethystic logarithm is qL1(z)=L1∨(qz)qL_1(z)=L_1^\vee(qz), exactly the middle assertion. For R=Exp⁡((q+1)L1)=∑n[n+1]qRnzn\mathcal R=\operatorname{Exp}((q+1)L_1)=\sum_n[n+1]_qR_nz^n, reversal of the finite sum gives [n+1]q∨=q−n[n+1]q[n+1]_q^\vee=q^{-n}[n+1]_q. Thus the last assertion is equivalent to R∨(z)=R(z/q)\mathcal R^\vee(z)=\mathcal R(z/q). Its logarithm is (q−1+1)L1∨(z)=(q+1)L1(z/q)(q^{-1}+1)L_1^\vee(z)=(q+1)L_1(z/q). Cancel q+1q+1 to obtain L1∨(z)=qL1(z/q)L_1^\vee(z)=qL_1(z/q), again the middle assertion. Every operation used is invertible and preserves prefixes. ∎

The degree-nn argument used cluster reciprocity only through ⌊n/2⌋\lfloor n/2\rfloor, and within Lemma 8.3 used strictly smaller crossing contact degrees simultaneously for all multiplicities. Its first possible omitted contact degree is 2⌊n/2⌋+2>n2\lfloor n/2\rfloor+2>n. 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 a,b,c,ha,b,c,h,

Ca,b;c,h∨=q(c−1)(h−1)∑k=1min⁡(c,h)(1−q)k−1∑c1+⋯+ck=c, h1+⋯+hk=hci,hi≥1q−∑i<jcihj∏i=1kCa,b;ci,hi. C_{a,b;c,h}^{\vee} =q^{(c-1)(h-1)} \sum_{k=1}^{\min(c,h)}(1-q)^{k-1} \sum_{\substack{c_1+\cdots+c_k=c,\ h_1+\cdots+h_k=h\\c_i,h_i\geq1}} q^{-\sum_{i<j}c_i h_j}\prod_{i=1}^k C_{a,b;c_i,h_i}.
(9.8)

The inner sum is over ordered compositions of both contacts. In addition,

FS(a;c)∨=Scale⁡aAc. F_{S(a;c)}^\vee=\operatorname{Scale}_a A_c.
(9.9)

The product corrections use smaller-contact laws, so crossing reciprocity is not a scalar functional equation in general.

Proof plan for Theorem 9.3.

  1. Cluster reciprocity in all degrees removes the cutoff in Lemma 8.3, giving Ua,b†=Ua,b−1U_{a,b}^\dagger=U_{a,b}^{-1}.
  2. Each nonconstant factor consumes both contacts, so the inverse coefficient uses at most min⁡(c,h)\min(c,h) factors, indexed by ordered compositions.
  3. Multiplication contributes q−∑i<jcihjq^{-\sum_{i<j}c_i h_j}; division by the dagger scalar gives (9.8), and homogeneity (H) gives (9.9).

Proof. Theorem 1.2 supplies Lemma 8.3 for every MM, so Ua,b†=Ua,b−1U_{a,b}^\dagger=U_{a,b}^{-1} in all contact degrees. Expand the inverse as ∑k≥0(−1)k(Ua,b−1)k\sum_{k\geq0}(-1)^k(U_{a,b}-1)^k. A product of kk basis terms contributes the scalar q−∑i<jcihjq^{-\sum_{i<j}c_i h_j}. Both contacts of every factor are positive, so only 1≤k≤min⁡(c,h)1\leq k\leq\min(c,h) and the ordered compositions in (9.8) contribute. The coefficient in the dagger is (q−1−1)qc+h−chCa,b;c,h∨=−(q−1)qc+h−ch−1Ca,b;c,h∨(q^{-1}-1)q^{c+h-ch}C_{a,b;c,h}^\vee =-(q-1)q^{c+h-ch-1}C_{a,b;c,h}^\vee. 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 (2,2)(2,2), 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

Ca,b;2,2=Z2(a+b),1q+1+q2−q−12q(q+1)Za+b,12+q2+q+12q(q+1)Za+b,2. C_{a,b;2,2}= \frac{Z_{2(a+b),1}}{q+1} +\frac{q^2-q-1}{2q(q+1)}Z_{a+b,1}^2 +\frac{q^2+q+1}{2q(q+1)}Z_{a+b,2}.
(9.10)

Here the double-point term is q−1Scale⁡a+bB2q^{-1}\operatorname{Scale}_{a+b}B_2, and the other two pattern terms are (q−2)Za+b,12/(2q)(q-2)Z_{a+b,1}^2/(2q) and Za+b,2/2Z_{a+b,2}/2. Formula (9.8) consequently reads

Ca,b;2,2∨=qCa,b;2,2−(q−1)Za+b,12. C_{a,b;2,2}^\vee=qC_{a,b;2,2}-(q-1)Z_{a+b,1}^2.
(9.11)

In particular

C1,1;2,2∣q=2=13Z4,1+112Z2,12+712Z2,2. C_{1,1;2,2}\big|_{q=2} =\frac13Z_{4,1}+\frac1{12}Z_{2,1}^2+\frac7{12}Z_{2,2}.
(9.12)

When either contact is one, (9.8) has only its k=1k=1 term and agrees with (2.4). Selecting a one-field coefficient removes all the product corrections: every factor in a term with k≥2k\ge2 has positive degree.

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 ss of degree NN, let τs=[ZN,1]Fs\tau_s=[Z_{N,1}]F_s, and put τ(n)=[Zn,1]Bn\tau(n)=[Z_{n,1}]B_n. Write A(n,1)A_{(n,1)} and R(n,1)R_{(n,1)} for the corresponding one-field probabilities. Global assembly immediately gives

τ(1)=1,A(n,1)=q1−nτ(n),R(n,1)=q+1[n+1]qτ(n). \tau(1)=1,\qquad A_{(n,1)}=q^{1-n}\tau(n),\qquad R_{(n,1)}=\frac{q+1}{[n+1]_q}\tau(n).
(10.1)

Indeed a single type variable Zn,1Z_{n,1} 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 nn remains: there are qq affine choices or q+1q+1 projective choices.

The same reasoning restricts a local transition to one rational child. For a crossing with c<hc<h, the tangent degree must be cc and the point must be the second boundary; if d<cd<c both boundaries would be occupied. If c=hc=h, neither boundary is occupied, and the q−1q-1 rational choices cancel the denominator in (6.1). Thus

τT(a,b;c,h)={q−(c2)τT(a+b,b;c,h−c),c<h,q−(h2)τT(a+b,a;h,c−h),h<c,q−(c2)τS(a+b;c),c=h. \tau_{T(a,b;c,h)}= \begin{cases} q^{-\binom c2}\tau_{T(a+b,b;c,h-c)},&c<h,\\ q^{-\binom h2}\tau_{T(a+b,a;h,c-h)},&h<c,\\ q^{-\binom c2}\tau_{S(a+b;c)},&c=h. \end{cases}
(10.2)

These identities include contact one. At each unequal step the contact sum decreases, the greatest common divisor is unchanged, and the degree ac+bhac+bh is preserved.

Lemma 10.1 (Euclidean weight). The total exponent accumulated in (10.2), including its equal-contact exit, is

κ(c,h)=ch−c−h+gcd⁡(c,h)2=∑i=1h−1⌊cih⌋. \kappa(c,h)=\frac{ch-c-h+\gcd(c,h)}2 =\sum_{i=1}^{h-1}\left\lfloor\frac{ci}{h}\right\rfloor.
(10.3)

Consequently, for g=gcd⁡(c,h)g=\gcd(c,h),

τS(a;c)=τ(c),τT(a,b;c,h)=q−κ(c,h)τ(g). \tau_{S(a;c)}=\tau(c),\qquad \tau_{T(a,b;c,h)}=q^{-\kappa(c,h)}\tau(g).
(10.4)

Proof. The first expression in (10.3) equals (c2)\binom c2 at c=hc=h, is symmetric, and for c<hc<h equals (c2)+κ(c,h−c)\binom c2+\kappa(c,h-c), by direct subtraction and invariance of the gcd. Induction on c+hc+h therefore gives the accumulated exponent. To obtain the floor sum, pair ii with h−ih-i. The two floors sum to c−1c-1, except when h∣cih\mid ci, when they sum to cc. Exactly g−1g-1 of the indices 1,…,h−11,\ldots,h-1 are exceptions. Doubling the sum gives (h−1)(c−1)+(g−1)(h-1)(c-1)+(g-1), as asserted.

The Euclidean path ends at equal contacts g,gg,g and then at S((ac+bh)/g;g)S((ac+bh)/g;g). By (H), the single-field coefficient of FS(a;c)=Scale⁡aBcF_{S(a;c)}=\operatorname{Scale}_aB_c is τ(c)\tau(c), independently of aa. This proves (10.4). ∎

Theorem 10.2 (the full totally ramified recursion). For n≥2n\geq2, with gd=gcd⁡(d,n)g_d=\gcd(d,n),

τ(n)=(1−q−1)∑d=1n−1q−((d−1)(n+1)+gd−1)/2τ(gd)1−q−(n−1)(n+2)/2. \boxed{\displaystyle \tau(n)= \frac{(1-q^{-1})\sum_{d=1}^{n-1} q^{-((d-1)(n+1)+g_d-1)/2}\tau(g_d)} {1-q^{-(n-1)(n+2)/2}}.}
(10.5)

Every displayed exponent is integral, and every argument gdg_d is a proper divisor of nn.

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 S(1;n)S(1;n) is dd times its boundary point, with 1≤d<n1\leq d<n. Its probability is (q−1)q−(d+12)(q-1)q^{-\binom{d+1}{2}} and its child is T(1,1;d,n−d)T(1,1;d,n-d). Insert (10.4) into (6.8). The exponent simplifies by (d+12)+κ(d,n−d)=((d−1)(n+1)+gd+1)/2\binom{d+1}{2}+\kappa(d,n-d)=((d-1)(n+1)+g_d+1)/2. Replace q−1q-1 by q(1−q−1)q(1-q^{-1}) and use λn=q−(n−1)(n+2)/2\lambda_n=q^{-(n-1)(n+2)/2} to obtain (10.5). Integrality also follows from this sum of integer exponents; explicitly, when nn is odd, n+1n+1 is even and gdg_d is odd. When nn is even, dd and gdg_d have the same parity, making (d−1)(n+1)+gd−1(d-1)(n+1)+g_d-1 even. Finally gd≤d<ng_d\leq d<n. ∎

Corollary 10.3 (totally ramified reciprocity). In every degree,

τ(n)∨=q1−nτ(n)=A(n,1),R(n,1)∨=R(n,1). \tau(n)^\vee=q^{1-n}\tau(n)=A_{(n,1)},\qquad R_{(n,1)}^\vee=R_{(n,1)}.
(10.6)

Proof. Extract Zn,1Z_{n,1} from Theorem 1.2 and use (10.1). ∎

Grouping (10.5) by the greatest common divisor exposes the possible descendants as proper divisors. For g∣Ng\mid N, g<Ng<N, put

W(N,g)=1−q−11−q−(N−1)(N+2)/2∑1≤d<Ngcd⁡(d,N)=gq−((d−1)(N+1)+g−1)/2,τ(n)=∑n=n0>n1>⋯>nk=1nj+1∣nj∏j=0k−1W(nj,nj+1). \begin{aligned} W(N,g)&= \frac{1-q^{-1}}{1-q^{-(N-1)(N+2)/2}} \sum_{\substack{1\leq d<N\\\gcd(d,N)=g}} q^{-((d-1)(N+1)+g-1)/2},\\ \tau(n)&=\sum_{\substack{n=n_0>n_1>\cdots>n_k=1\\n_{j+1}\mid n_j}} \prod_{j=0}^{k-1}W(n_j,n_{j+1}). \end{aligned}
(10.7)

For n=1n=1 the empty chain contributes one. For larger nn, the first step of a chain gives ∑g∣n, g<nW(n,g)τ(g)\sum_{g\mid n,\ g<n}W(n,g)\tau(g), exactly (10.5). Induction proves the formula; there are finitely many strictly decreasing divisor chains.

For an odd prime degree ℓ\ell, every gd=1g_d=1, so the sum in (10.5) is geometric with ratio q−(ℓ+1)/2q^{-(\ell+1)/2}. Multiplying by q1−ℓq^{1-\ell} from (10.1) and clearing negative exponents gives

A(ℓ,1)=(q−1)(q(ℓ2−1)/2−1)(q(ℓ+1)/2−1)(q(ℓ−1)(ℓ+2)/2−1)(ℓ odd prime),A(2,1)=1q+1. A_{(\ell,1)}= \frac{(q-1)(q^{(\ell^2-1)/2}-1)} {(q^{(\ell+1)/2}-1)(q^{(\ell-1)(\ell+2)/2}-1)} \quad(\ell\text{ odd prime}),\qquad A_{(2,1)}=\frac1{q+1}.
(10.8)

The prime degree ℓ\ell here is unrelated to the residue characteristic, so the formula includes wild prime degree.

Example 10.4 (the quartic uses the same crossing). The three terms d=1,2,3d=1,2,3 in (10.5) give

τ(4)=(1−q−1)(1+q−3 q/(q+1)+q−5)1−q−9. \tau(4)= \frac{(1-q^{-1})(1+q^{-3}\,q/(q+1)+q^{-5})}{1-q^{-9}}.
(10.9)

The middle term follows the contact pair (2,2)(2,2) of Example 9.4: κ(2,2)=1\kappa(2,2)=1, and the remaining cluster is S(2;2)S(2;2) with one-field coefficient τ(2)=q/(q+1)\tau(2)=q/(q+1). Including the initial transition, its contribution is (q−1)q−(32)q−κ(2,2)τ(2)=(q−1)q−3q−1τ(2)=(1−q−1)q−3τ(2)(q-1)q^{-\binom32}q^{-\kappa(2,2)}\tau(2)=(q-1)q^{-3}q^{-1}\tau(2)=(1-q^{-1})q^{-3}\tau(2). Put P4(q)=q6+q5+q3+q+1P_4(q)=q^6+q^5+q^3+q+1. Simplification and (10.1) yield

A(4,1)=P4(q)(q+1)(q2+q+1)(q6+q3+1),R(4,1)=q3P4(q)[5]q(q2+q+1)(q6+q3+1). A_{(4,1)}=\frac{P_4(q)}{(q+1)(q^2+q+1)(q^6+q^3+1)},\qquad R_{(4,1)}=\frac{q^3P_4(q)}{[5]_q(q^2+q+1)(q^6+q^3+1)}.
(10.10)

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 (1,1)(1,1), so the one-field extraction cannot compute them. A type-variable substitution can retain each rational root without rejecting the other branches.

Let θ\theta be an indeterminate. For a polynomial sequence h=(hn(θ))n≥0h=(h_n(\theta))_{n\ge0}, its series means h(z,θ):=∑n≥0hn(θ)zn\mathsf h(z,\theta):=\sum_{n\ge0}h_n(\theta)z^n.

For rational roots, specialize Z1,1Z_{1,1} to θ\theta and every other Ze,fZ_{e,f} to one. Denote the resulting probability-generating polynomials by an(θ),bn(θ),rn(θ)a_n(\theta),b_n(\theta),r_n(\theta), and their series in degree by a(z,θ),b(z,θ),r(z,θ)\mathsf a(z,\theta),\mathsf b(z,\theta),\mathsf r(z,\theta). The specialization must be taken after Adams descent: at a point of degree δ≥2\delta\geq2 every type variable acquires residue degree at least two. Its root statistic is therefore zero, and its local series specializes to (1−zδ)−1(1-z^\delta)^{-1}. The rational points retain b\mathsf b. Setting all type variables to one in the affine and projective Euler products gives their zeta series (1−qz)−1(1-qz)^{-1} and ((1−z)(1−qz))−1((1-z)(1-qz))^{-1}. Removing the rational-point contributions thus gives

(1−qz)a(qz,θ)=((1−z)b(z,θ))q,(1−z)(1−qz)∑n≥0[n+1]qrn(θ)zn=((1−z)b(z,θ))q+1. (1-qz)\mathsf a(qz,\theta)=((1-z)\mathsf b(z,\theta))^q,\qquad (1-z)(1-qz)\sum_{n\geq0}[n+1]_qr_n(\theta)z^n =((1-z)\mathsf b(z,\theta))^{q+1}.
(11.1)

These are ordinary formal powers, not plethystic powers of a prematurely specialized series.

Let α(n,k),β(n,k),ρ(n,k)\alpha(n,k),\beta(n,k),\rho(n,k) be the expectations of (#K-rootsk)\binom{\#K\text{-roots}}k in the monic, cluster, and projective models. Here kk is the moment order ([BCFG22] write dd). Roots in the last model lie on P1(K)\mathbb P^1(K); the all-coefficients model has the same law by Section 1. Substituting θ=1+y\theta=1+y makes these the coefficients of yky^k. Define

Ak(z)=(1−z)∑n≥0α(n,k)zn,Bk(z)=(1−z)∑n≥0β(n,k)zn,Rk(z)=(1−z)(1−qz)∑n≥0[n+1]qρ(n,k)zn. \mathsf A_k(z)=(1-z)\sum_{n\geq0}\alpha(n,k)z^n,\quad \mathsf B_k(z)=(1-z)\sum_{n\geq0}\beta(n,k)z^n,\quad \mathsf R_k(z)=(1-z)(1-qz)\sum_{n\geq0}[n+1]_q\rho(n,k)z^n.
(11.2)

Equation (11.1) becomes

∑k≥0Ak(qz)yk=(∑k≥0Bk(z)yk)q,∑k≥0Rk(z)yk=(∑k≥0Bk(z)yk)q+1. \sum_{k\geq0}\mathsf A_k(qz)y^k =\left(\sum_{k\geq0}\mathsf B_k(z)y^k\right)^q,\qquad \sum_{k\geq0}\mathsf R_k(z)y^k =\left(\sum_{k\geq0}\mathsf B_k(z)y^k\right)^{q+1}.
(11.3)

Over O=ZpO=\mathbb Z_p, hence at q=pq=p, 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 a+b≥2a+b\geq2, since both its vertical parameters have positive valuation. Thus every Ca,b;c,hC_{a,b;c,h} specializes to one, and the entire crossing contribution becomes

(q−1)T1,1(ξ,z)⟼(q−1)∑c,h≥1ξczh=(q−1)ξz(1−ξ)(1−z). (q-1)\mathcal T_{1,1}(\xi,z)\longmapsto (q-1)\sum_{c,h\geq1}\xi^cz^h =\frac{(q-1)\xi z}{(1-\xi)(1-z)}.
(11.4)

Put gm(θ)=qmam(θ)g_m(\theta)=q^m a_m(\theta). A term ξczhξm\xi^c z^h\xi^m in (S) has tangent degree i=c+mi=c+m and, after ξ=z\xi=z, parent degree n=i+hn=i+h. Thus 1≤i<n1\leq i<n and 0≤m<i0\leq m<i; the absent-boundary term has degree nn. Extracting coefficients gives

bn(θ)=q−(n+12)gn(θ)+(q−1)∑i=1n−1q−(i+12)∑m=0i−1gm(θ)(n≥1). b_n(\theta)=q^{-\binom{n+1}{2}}g_n(\theta) +(q-1)\sum_{i=1}^{n-1}q^{-\binom{i+1}{2}} \sum_{m=0}^{i-1}g_m(\theta)\qquad(n\geq1).
(11.5)

Take the difference at successive nn, then subtract q−(n−1)q^{-(n-1)} times the preceding difference. The inner partial sums cancel. After taking yky^k coefficients at θ=1+y\theta=1+y, this is

Bk(z)−zBk(z/q)=Φz′(Ak(z)−zAk(qz)). \mathsf B_k(z)-z\mathsf B_k(z/q) =\Phi'_z\bigl(\mathsf A_k(z)-z\mathsf A_k(qz)\bigr).
(11.6)

At coefficient znz^n before taking moments the resulting identity is (bn−bn−1)−q−(n−1)(bn−1−bn−2)=q−(n2)(an−(1+qn−1)an−1+qn−1an−2)(b_n-b_{n-1})-q^{-(n-1)}(b_{n-1}-b_{n-2}) =q^{-\binom n2}(a_n-(1+q^{n-1})a_{n-1}+q^{n-1}a_{n-2}). It holds for n≥2n\geq2 by the cancellation just described; the constants and n=1n=1 follow directly from a0=b0=1a_0=b_0=1 and a1=b1=θa_1=b_1=\theta, with negative subscripts zero. This proves (11.6), which is [BCFG22, equation (7), p. 2]; their operator is our Φ′\Phi', multiplying the znz^n coefficient by q−(n2)q^{-\binom n2}.

These identities determine all the moment series from the degree-zero and degree-one laws. Indeed, suppose two solutions first differ in degree n≥2n\geq2, and let ΔA(y),ΔB(y)\Delta_A(y),\Delta_B(y) be the differences of their znz^n coefficients in ∑kAk(z)yk\sum_k\mathsf A_k(z)y^k and ∑kBk(z)yk\sum_k\mathsf B_k(z)y^k. Equation (11.3) gives ΔB=qn−1ΔA\Delta_B=q^{n-1}\Delta_A, while (11.6) gives ΔB=q−(n2)ΔA\Delta_B=q^{-\binom n2}\Delta_A. The scalar difference is nonzero. This argument works coefficientwise in yy and inductively in zz. 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

α(1,1)=β(1,1)=ρ(1,1)=1,α(n,1)=qq+1,β(n,1)=1q+1,ρ(n,1)=1(n≥2). \alpha(1,1)=\beta(1,1)=\rho(1,1)=1,\qquad \alpha(n,1)=\frac q{q+1},\quad \beta(n,1)=\frac1{q+1},\quad \rho(n,1)=1\quad(n\geq2).
(11.7)

To prove these in every degree, the candidates A1=z−z2/(q+1)\mathsf A_1=z-z^2/(q+1), B1=z−qz2/(q+1)\mathsf B_1=z-qz^2/(q+1) satisfy A1(qz)=qB1(z)\mathsf A_1(qz)=q\mathsf B_1(z) and (11.6) by direct substitution. Their initial coefficients are prescribed; the same scalar argument proves uniqueness. Equation (11.3) then gives R1=(q+1)z−qz2\mathsf R_1=(q+1)z-qz^2. 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 sns_n for the scalar split probability (BGMR write rnr_n). Setting Z1,1=1Z_{1,1}=1 and every other Ze,f=0Z_{e,f}=0 in the monic law AnA_n gives the probability sns_n that a random monic polynomial splits completely over KK. Put F(t):=∑n≥0sntnF(t):=\sum_{n\ge0}s_nt^n and G(t):=∑n≥0q−(n+12)sntnG(t):=\sum_{n\ge0}q^{-\binom{n+1}{2}}s_nt^n, 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 ψδ\psi_\delta multiplies residue degrees by δ\delta. Adams operations still preserve the constant 11, so the specialized plethystic exponential and logarithm become the ordinary exponential and logarithm. The assembly identity (G) becomes the functional equation F=GqF=G^q of Buhler–Goldstein–Moews–Rosenberg [BGMR06, equation (4)]; the single-boundary identity (S) becomes their rescaling lemma [Z1,1n]Bn=q−(n2)sn[Z_{1,1}^n]B_n=q^{-\binom n2}s_n [BGMR06, Lemma 2.2(2)]. Eliminating BnB_n gives their recursion

sn=∑d0+⋯+dq−1=ndi≥0∏i=0q−1q−(di+12)sdi,s0=1,F(t)=∑n≥0sntn,G(t)=∑n≥0q−n[Z1,1n]Bn tn=∑n≥0q−(n+12)sntn,F=Gq. \begin{gathered} s_n=\sum_{\substack{d_0+\cdots+d_{q-1}=n\\d_i\geq0}} \prod_{i=0}^{q-1}q^{-\binom{d_i+1}{2}}s_{d_i},\qquad s_0=1,\\ F(t)=\sum_{n\geq0}s_nt^n,\qquad G(t)=\sum_{n\geq0}q^{-n}[Z_{1,1}^n]B_n\,t^n =\sum_{n\geq0}q^{-\binom{n+1}{2}}s_nt^n,\qquad F=G^q. \end{gathered}
(11.8)

The first sum is read at an actual residue size qq; grouping the nonzero did_i 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 qq terms with one di=nd_i=n have total coefficient q⋅q−(n+12)q\cdot q^{-\binom{n+1}{2}}, the self-return probability λn\lambda_n [BGMR06, Remark 1.2]. To check the generating-variable normalization, specialize (G) and then put z=t/qz=t/q; the coefficient in GG is the unnormalized cluster mass. Thus the identification uses both (S) and (G).

Their Lemma 5.1(4), sn(1/q)=q−(n2)sn(q)s_n(1/q)=q^{-\binom n2}s_n(q), is the split-type case of An=Bn∨A_n=B_n^\vee 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 s2=q/(2(q+1))s_2=q/(2(q+1)) and the non-monic split probability is 1/21/2, 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 βnur=[Z1,n]Bn\beta_n^{\mathrm{ur}}=[Z_{1,n}]B_n and similarly αnur=[Z1,n]An\alpha_n^{\mathrm{ur}}=[Z_{1,n}]A_n, ρnur=[Z1,n]Rn\rho_n^{\mathrm{ur}}=[Z_{1,n}]R_n. 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 nn, one point of degree δ∣n\delta\mid n, and multiplicity n/δn/\delta. Its degree-one point term is the self-return. We obtain

β1ur=1,(q(n+12)−q)βnur=∑δ∣nδ>1Nδ(q)βn/δur(qδ)(n≥2). \beta_1^{\mathrm{ur}}=1,\qquad (q^{\binom{n+1}{2}}-q)\beta_n^{\mathrm{ur}} =\sum_{\substack{\delta\mid n\\\delta>1}} N_\delta(q)\beta_{n/\delta}^{\mathrm{ur}}(q^\delta) \quad(n\geq2).
(11.9)

Affine assembly includes the same sum before omitting its degree-one term, with normalization q−nq^{-n}. Projective assembly has one additional rational point. Therefore

αnur=q(n2)βnur,ρnur=qnαnur+βnur[n+1]q. \alpha_n^{\mathrm{ur}}=q^{\binom n2}\beta_n^{\mathrm{ur}},\qquad \rho_n^{\mathrm{ur}}=\frac{q^n\alpha_n^{\mathrm{ur}}+\beta_n^{\mathrm{ur}}}{[n+1]_q}.
(11.10)

The formulas hold also at n=1n=1 by the terminal law. Repeated irreducible residue factors are included: for instance α2ur=q/(2(q+1))\alpha_2^{\mathrm{ur}}=q/(2(q+1)), 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 u,vu,v, they are

J1(u,v)=1,Jn(u,v)=∑δ∣nδ>1vn/δ−1(∑e∣δμ(δ/e)ue−1)Jn/δ(uδ,v)un−1−vn−1,Jn∗(q)=1nJn(q,q−n/2). \begin{aligned} J_1(u,v)&=1,\\ J_n(u,v)&= \frac{\displaystyle\sum_{\substack{\delta\mid n\\\delta>1}} v^{n/\delta-1} \left(\sum_{e\mid\delta}\mu(\delta/e)u^{e-1}\right) J_{n/\delta}(u^\delta,v)} {u^{n-1}-v^{n-1}},\\ J_n^*(q)&=\frac1n J_n(q,q^{-n/2}). \end{aligned}
(11.11)

The recurrence for JnJ_n is for n≥2n\geq2. The last substitution can initially be made in Q(q1/2)\mathbb Q(q^{1/2}). Its rationality in qq follows directly from our identification, without the parity argument of [Sh22, p. 2].

Indeed put jn(q)=nq(n2)βnur(q)j_n(q)=nq^{\binom n2}\beta_n^{\mathrm{ur}}(q). Multiply (11.9) by n/qn/q, substitute (6.2), and then express every β\beta using jj. The resulting equation is (qn−1−q−(n2))jn=∑δ∣n, δ>1q−δ(n/δ2)(∑e∣δμ(δ/e)qe−1)jn/δ(qδ)(q^{n-1}-q^{-\binom n2})j_n =\sum_{\delta\mid n,\ \delta>1} q^{-\delta\binom{n/\delta}{2}} (\sum_{e\mid\delta}\mu(\delta/e)q^{e-1})j_{n/\delta}(q^\delta). This is exactly the recurrence for Jn(q,q−n/2)J_n(q,q^{-n/2}): if m=n/δm=n/\delta, then (q−n/2)m−1=q−δ(m2)(q^{-n/2})^{m-1}=q^{-\delta\binom m2}, and the second argument remains q−n/2=(qδ)−m/2q^{-n/2}=(q^\delta)^{-m/2} in the smaller problem. The initial values agree, the denominators are nonzero rational functions for n>1n>1, and induction proves the identification. Equations (11.10) and Theorem 1.2 consequently give

αnur=Jn∗(q),βnur=Jn∗(q−1),ρnur=q−1qn+1−1(qnJn∗(q)+Jn∗(q−1)). \alpha_n^{\mathrm{ur}}=J_n^*(q),\qquad \beta_n^{\mathrm{ur}}=J_n^*(q^{-1}),\qquad \rho_n^{\mathrm{ur}} =\frac{q-1}{q^{n+1}-1} \left(q^nJ_n^*(q)+J_n^*(q^{-1})\right).
(11.12)

Over Zp\mathbb Z_p these are precisely [Sh22, equations (3)–(5), p. 2], in the same three sampling models. Theorem 2 of [Sh22] is stated over Zp\mathbb Z_p; the argument here supplies the same formulas over every complete DVR with residue field of size qq.

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 j+1j+1 to jj, 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-jj correction lies in the kernel IjF/Ij+1F\mathcal I^j\mathcal F/\mathcal I^{j+1}\mathcal F, hence lifts into IjF\mathcal I^j\mathcal F; 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 Cj∙C_j^\bullet with surjective transition maps rjr_j in each degree, the map Δ(c)j=cj−rj(cj+1)\Delta(c)_j=c_j-r_j(c_{j+1}) on ∏jCj∙\prod_j C_j^\bullet is surjective: choose c1c_1 and solve successively for cj+1c_{j+1}. Its kernel is the inverse limit. The resulting cohomology sequence gives (4.2). If the H0H^0 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 nn over Zp\mathbb Z_p having exactly rr roots in Qp\mathbb Q_p. 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 pp-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 pp-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 pp-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 pp-adic fields. J. Number Theory 133 (2013), no. 5, 1537–1563. arXiv:1409.0555.
  • [Yi22] J. Yin. Density of pp-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 pp-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 pp-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 pp-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 pp-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 nn 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 Q\mathbb Q 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 SurfaceBlowup.main_dvr\texttt{SurfaceBlowup.main\_dvr} (Theorem 1.1 for the monic and projective laws over every complete discrete valuation ring with finite residue field), SurfaceBlowup.main_field_form\texttt{SurfaceBlowup.main\_field\_form} (the rational-function form for the integers of finite unramified extensions of Qp\mathbb Q_p) and SurfaceBlowup.recip_main\texttt{SurfaceBlowup.recip\_main} (Theorem 1.2); each depends only on propositional extensionality, classical choice and quotient soundness. (The statements were also checked on Prove2Me under the names SurfaceBlowupV2.main_field_form\texttt{SurfaceBlowupV2.main\_field\_form} and SurfaceBlowupV2.recip_main\texttt{SurfaceBlowupV2.recip\_main}.) Source: github.com/asving/splitting-density-rationality (release v1.0.0); browsable with the paper at asving.github.io/claude/splitting-type-density/lean/.