# Mixed divided-Frobenius jets and closed Charlier determinant bounds Mira Cairn ## 1. Results and relation to earlier work A polynomial jet matrix over an imaginary quadratic order can lose most of its rank when reduced modulo an inert prime. We retain successive divided Frobenius layers before reducing, and normalize the higher Hasse columns so that the retained information remains integral. A coefficient determinant for an explicit differential connection then proves full row rank. The criterion permits derivative orders larger than the auxiliary prime and approaches the necessary column count. Let $\mathcal O$ be the maximal order of an imaginary quadratic field and write $\overline z$ for conjugation. For positive integers $K,S$, put $R=KS$ and $$ \Lambda=\{(r,s)\in\mathbb Z_{\ge0}^2:r+KsB_e$ for every $0\le e\le d$, then (1.1) has full row rank over the quadratic field. No generic-position assumption is used. In particular, $J\le p$ is not required. A simpler sufficient condition, proved in Section 3, is $$ n\ge2S,\qquad n\left[J-\frac{RJ}{p^2}-\frac Rp\right]>\frac{(R+p)^2}{2K}. \tag{1.3} $$ With fixed $K$, $J/R\to\epsilon\in(0,1/4)$, $p/R\to0$ and $R/p^2\to0$, its least prescribed node count satisfies $nJ/M\to1$, subject to the inertness and distinct-residue hypotheses. **Theorem 2 (an explicit quadratic-node family).** For every negative fundamental discriminant $-D$ with $h(-D)=1$ and $D\ge10000$, define $$ \begin{aligned} K&=43,& S&=\left\lfloor\frac{29(D-3)}{172}\right\rfloor,& R&=43S,\\ J&=\left\lfloor\frac{13R}{200}\right\rfloor,& A_0&=\left\lceil\frac{11}{10}D^{3/4}\right\rceil,& H&=J-\frac{RJ}{A_0^2}-\frac R{A_0},\\ n&=\max\left(2S,1+\left\lfloor\frac{(R+2A_0)^2}{86H}\right\rfloor\right). \end{aligned} \tag{1.4} $$ Then $H>0$, $n\le\lceil3D/2\rceil$, and (1.1) has full row rank at the $n$ nearest quadratic integers to the origin. The parameter rule has $nJ/M=1+O(D^{-1/4})$. This asymptotic concerns the explicit rule, not the existence of infinitely many class-number-one fields. **Theorem 3 (complete discriminant application).** The rank theorem, published local determinant and disk-Sobolev lemmas, and the directed certificates described in Sections 5–7 prove $$ h(-D)=1\quad\Longrightarrow\quad D<9500. \tag{1.5} $$ Thus one tenth-discriminant bound is $B=9499$, with $\log B=9.158941808890182446528155948973\ldots$. The proof uses neither a global discriminant bound nor a census, known classification or finite elimination. Its local inputs remain explicitly imported. The endpoint is weaker than the reviewed $D\le499$ in Severi Jet [1]; the contribution is the rank mechanism and its complete application. Section 8.1 additionally compares the new and published node rules at the same large support. Its positive comparison at $D=499$, combined separately with [1]’s global bound, gives the qualified corollary $D\le498$. **Theorem 6 (closed Charlier application).** The rank theorem, the local arithmetic lemmas and the closed complement estimate in Section 8 prove $$ h(-D)=1\quad\Longrightarrow\quad D<7000, \qquad B=6999,\quad\log B=8.853522560689539660215591928953\ldots. \tag{1.6} $$ A closed scalar tail for $D\ge10000$ meets four finite interval certificates. This route uses no global discriminant theorem, census, finite class-number elimination, spectral grid or optimized price table. Its mathematical ingredients are the same rank and local arithmetic mechanisms as above, together with exact Charlier inverse diagonals and elementary radial integration. The stronger $D\le498$ corollary remains conditional on the explicitly imported global $D\le499$ theorem. The local divisibility tower and nearest-node covering estimate originate in Severi Jet's framework [1]. Earlier lower-support Wronskians [2] prove independence by a coefficient determinant in characteristic zero, with an overhead depending on the conjugate degree. The complementary-rank argument [3] combines independent subspaces when full ambient rank is unavailable. Our theorem instead proves the entire triangular row space independent. The complete disk-Sobolev estimates and exact degree counting used in Sections 5–7 are imported from [4], using the classical disk-polynomial identities of Figueroa [5]. Section 8.2 gives a closed Charlier complement estimate. Section 8.3 uses it to prove the stronger complete bound $D<7000$ from local inputs, with no spectral or row grids. The earlier disk-Sobolev route remains as a separate comparison. The inert Frobenius congruence and its use in determinant nonvanishing are classical. Van Dijk [6] uses an auxiliary inert prime and a polynomial root count; twinheterodox [7, Section 5] uses the confluent version in explicit discriminant comparisons. Our additional step retains the divided layers of the evaluated matrix and the higher derivative columns, producing a mixed local interpolation problem. Positive-characteristic connections, $p$-curvature and cyclicity are classical as well; Bostan–Caruso–Schost [8] provide relevant background. We give the elementary connection argument in full. Bertrand's postulate [9] supplies the uniform auxiliary prime. None of these classical tools is claimed as new. The general proof and exact finite controls were developed by the author. The controls use separately assembled algebraic expressions but are not independent implementations by another researcher. The claimed numerical inequalities are directed certificates, not floating optimization results. ## 2. Proof of the mixed rank theorem ### 2.1 Integral triangular layers Put $g=z^p-w$. The polynomials $$ g^m z^a w^s,\qquad 0\le a0$. Each original monomial occurs exactly once as a leading monomial, by Euclidean division of its $z$ degree by $p$. Since $p$ is inert, $\mathcal O/p\mathcal O=k=\mathbb F_{p^2}$ and $\overline\lambda\equiv\lambda^p\pmod p$. At a fixed node write $$ g(\lambda+t,\overline\lambda)=pU(t)+t^p,\qquad\deg Um$. All scalings are invertible in characteristic zero. They will be used only for rank, not as changes to the later metric or determinant valuation normalization. ### 2.2 A row relation gives mixed local jets Suppose the scaled matrix has a nonzero row relation over $k$. Collect the coefficients in layer $m$ into $$ H_m(z)=\sum_{a,s}c_{m,a,s}z^{a+ps},\qquad F(z,u)=\sum_{m=0}^dH_m(z)u^m. \tag{2.4} $$ The exponents $a+ps$ in each layer are distinct because $0\le aK$, the maximum has $s=\lfloor(R-mp-1)/K\rfloor$ and $a=(R-mp-1)\bmod K$. Write $u_i(z)$ for the reduced local polynomial expressed in the coordinate $z-\xi_i$ at node $i$. Formula (2.3) is equivalent to $$ (\partial_u^{[\ell]}F)(z,u_i(z)) =O((z-\xi_i)^{L_\ell}), \qquad L_\ell>0. \tag{2.5} $$ Here $\partial_u^{[\ell]}$ denotes the Hasse derivative. The replacement of the fixed factor $\xi_i^{ps}$ by $z^{ps}$ is legitimate because $(\xi_i+t)^{ps}\equiv\xi_i^{ps}\pmod{t^p}$ and every $L_\ell\le p$. Differentiating (2.2) in characteristic zero and reducing gives the exact local identity $$ u_i'(z)=z^{p-1}-(z-\xi_i)^{p-1}. \tag{2.6} $$ Thus the error in replacing the derivative along the local curve by the connection below begins at order $p-1$. ### 2.3 The cyclic differential connection Set $E=k(z)$ and $$ \Delta=\partial_z+z^{p-1}\partial_u \quad\text{on }E[u]. $$ Its $p$th iterate is a derivation, since all intermediate binomial coefficients in the iterated Leibniz rule vanish. It sends $z$ to zero, sends $u$ to $(p-1)!=-1$, and kills $k$. Consequently $$ \Delta^p=-\partial_u. \tag{2.7} $$ Let $e=\deg_uF\le dK$. The recurrence $$ [u^m]\Delta F=H_m'+(m+1)z^{p-1}H_{m+1} $$ then gives $\deg([u^m]\Delta^jF)\le D_m-j$ by induction. Thus $$ \deg W_F\le\sum_{m=0}^eD_m-\frac{e(e+1)}2=B_e. \tag{2.9} $$ At node $i$, translate the coefficient matrix in (2.8) by $u\mapsto u+u_i(z)$. This has determinant one. Its row-$j$, column-$\ell$ entry is $$ (\partial_u^{[\ell]}\Delta^jF)(z,u_i(z)). $$ The two operators commute. Equations (2.5)–(2.6) imply that this entry has vanishing order at least $\max(0,L_\ell-j)$. To justify the truncation, one differentiation of a polynomial along $u_i$ differs from its $\Delta$ derivative by a multiple of $(z-\xi_i)^{p-1}$. After $j$ differentiations the cumulative error starts at order at least $p-j$. Since $L_\ell\le p$, it cannot affect the claimed order $L_\ell-j$. This also covers $L_\ell=p$. The capacities $L_\ell$ are nonincreasing. For $a\ge b$ and $x\ge y$, $$ (a-x)_++(b-y)_+\le(a-y)_++(b-x)_+. $$ Exchanging out-of-order pairs shows that the minimum determinant-term order pairs $L_0,L_1,\ldots,L_e$ with row indices $e,e-1,\ldots,0$. Therefore $$ \operatorname{ord}_{\xi_i}W_F\ge \sum_{\ell=0}^e\max(0,L_\ell-e+\ell)=\mu_e. \tag{2.10} $$ The $n$ residues are distinct, so (2.9)–(2.10) require $n\mu_e\le B_e$, contrary to the hypothesis for the actual degree $e$. The reduced scaled matrix has full row rank, and so does the original matrix. This proves Theorem 1. When $J\le p$ and $ep$; replacing it by a first-channel count would discard those conditions. Checking only $e=d$ is not part of the general theorem. ### 2.5 Colliding first residues and unequal capacities The retained Fermat quotient also allows first residues to collide. Let the nodes be distinct modulo $p^2$, and allow node $i$ to have a capacity $1\le J_i\le R$. Group nodes by their first residue $\xi_i\in k$. Within each group their local series have the form $$ u_i(z)=c_i+v_\xi(z),\qquad v_\xi(\xi)=0, $$ since every nonconstant coefficient in (2.2) depends only on $\xi$. The constants $c_i$ in a group are distinct. Indeed, if $\lambda_i=\lambda_0+p\eta$, then $$ \frac{\lambda_i^p-\overline\lambda_i}{p} \equiv\frac{\lambda_0^p-\overline\lambda_0}{p}-\overline\eta \pmod p. \tag{2.11} $$ Thus equality of both coordinates is equivalent to equality modulo $p^2$. The coordinate interpretation is classical [10]; we use it in the following extension of the coefficient-determinant proof. For each actual degree $e\le d$ and first residue $\xi$, form the multiset $$ \left\{L_{i,\ell}:=\min(p,\max(0,J_i-\ell p)): \xi_i=\xi,\ 0\le\ell\le e\right\}. $$ Let $a_{\xi,0}\ge\cdots\ge a_{\xi,e}$ be its largest $e+1$ members. Set $$ \mu_{e,\xi}=\sum_{k=0}^e\max(0,a_{\xi,k}-e+k). \tag{2.12} $$ **Corollary 4 (grouped mixed jets).** Under $KB_e\qquad(0\le e\le d). \tag{2.13} $$ To prove it, choose the largest-capacity columns as prefixes of Hasse orders at each center $c_i$. This is possible because $L_{i,\ell}$ decreases with $\ell$; break ties in favor of lower orders. Let the chosen lengths be $t_i$, with $\sum t_i=e+1$. Evaluation of polynomials of $u$ degree at most $e$ in these Hasse prefixes has confluent Vandermonde determinant $$ \prod_{iB_e$. If $e\ge Q$, all nonzero capacities occur among $L_0,\ldots,L_e$, whence $$ \mu_e\ge J-(Q+1)e\ge J-\frac{RJ}{p^2}-\frac Rp. \tag{3.1} $$ Also $D_m\le p(R-mp)/K$. Writing $R=dp+s_0$, $02$. Using $M=R(R/K+1)/2$ gives $$ \frac{nJ}{M}=1+O\left(\frac pR+\frac R{p^2}+\frac1p+\frac1R\right). \tag{3.3} $$ This is a conditional rank consequence; it does not by itself supply inert primes, distinct residues or a discriminant bound. At $p\asymp R^{3/4}$ its overhead is $O(R^{-1/4})$; the next section makes that scale available explicitly for the quadratic nodes. If distinct residues are available at $p\asymp R^{2/3}$, (3.3) instead gives $O(R^{-1/3})$. That smaller-prime geometry is not assumed in our application. ## 4. The explicit nearest-node family ### 4.1 Inertness and a prime below the norm threshold Use the parameters (1.4). Bertrand's postulate [9] supplies $A_0\frac{377D}{800}-\frac{4167}{800}. $$ Consequently $$ \frac HD\ge h_-(D):= \left(\frac{377}{800}-\frac{4167}{800D}\right) \left(1-\frac{725}{121\sqrt D}\right) -\frac{145}{22D^{3/4}}, \tag{4.4} $$ where $h_-$ is positive and increasing for $D\ge10000$. Moreover, $$ \frac{(R+2A_0)^2}{86D^2}\le b_+(D):= \frac1{86}\left(\frac{29}{4}+\frac{11}{5D^{1/4}}+\frac2D\right)^2, \tag{4.5} $$ which decreases. Directed evaluation proves $$ \frac32h_-(10000)-b_+(10000)>0.0050176383940755. \tag{4.6} $$ Thus $NH>(R+2A_0)^2/86$. Since $N$ is integral, the second term in the maximum defining $n$ is at most $N$. The first also is, because $2S\le29D/86<3D/2$. This proves $n\le N$ without presupposing the node geometry. By (4.3), $2\rho_n\le2\rho_NR$, only the primary credit $\lfloor r/q\rfloor$ is lost. Under class number one, the principal-norm overcount in [3, (2.8)] gives $$ \ell_D(r)=\log R \sum_{\substack{t,y\ge1\\ty^2D\le4r}} \left(1+\sqrt{r/t-Dy^2/4}\right). \tag{5.3} $$ For fixed $r$, it decreases with $D$, including the removal of boundary terms. It counts composite norms and repeated representations as well as primes, so it is an upper bound rather than a prime census. Replacing the inert sum in (5.2) by the sum over all primes and subtracting $\ell_D(r)$ is valid whenever the displayed non-inert-prime conditions hold. ### 5.2 Physical disk-Sobolev upper bound Let $\rho$ contain the nodes, let $T>1+1/(2\rho)$, and put $\mathcal R=\rho T$. Distinct integral nodes are separated by at least one, so disjoint sampling disks of radius $1/2$ are available. Set $$ \sigma_Q=\sum_{\substack{q^\ell\le1000\\q\ \mathrm{prime},\ \ell\ge2}} \frac{\log q}{q^\ell},\qquad H_Q=\sum_{\substack{q^\ell\le1000\\q\ \mathrm{prime},\ \ell\ge2}}\log q. $$ Legendre's formula implies $C_j/j!\le e^{H_Q-\sigma_Qj}$. The monic continuous disk basis and weighted sampling theorem [4, (3.7)–(3.9)], scaled to physical monomials as in [3, (2.5)], give $$ \log\Gamma\le P+\sum_{(r,s)\in\Lambda}\log h_{r,s}, \tag{5.4} $$ where $$ \begin{aligned} h_{r,s}&=4S^2e^{2H_Q}\kappa\mathcal R^{2r+2s+2} \widetilde h_{r,s}^{\alpha} \sum_{j=0}^{\min(J-1,r)}e^{-a_j} \left(\frac{e^{-\sigma_Q}}{\mathcal R}\right)^{2j} (r)_{\underline j}(s+\alpha+1)_{\overline j},\\ \widetilde h_{r,s}^{\alpha} &=\frac{r!s!\Gamma(r+\alpha+1)\Gamma(s+\alpha+1)} {(r+s+\alpha+1)\Gamma(r+s+\alpha+1)^2},\\ \kappa&=\left(\frac{T^2-1}{T^2-(1+1/(2\rho))^2}\right)^{\alpha+J-1},\\ P&=\sum_i\sum_{0\le jB_e$ of Theorem 1. For each candidate interval, $J\le p$ and the node count satisfies the special-case inequality for every candidate; all smaller actual-degree inequalities follow or are checked. This pays the largest required node count over the candidate set. ### 6.2 A single geometry for the entire interval Put $$ b_+=\sqrt{\frac{n\sqrt{D_+}}{2\pi}},\qquad \delta_+=\frac{\sqrt{D_++4}}4, \qquad\eta_+=\delta_+/b_+. $$ Choose the rational $\rho$ by rounding $b_++\delta_+$ upward to a multiple of $2^{-40}$. For every $D\in[D_-,D_+]$, (4.2) implies $$ |\lambda_i|\le\rho,\qquad \left|\frac{\lambda_i}{\rho}\right|^2 \le q_{\eta_+}(i/n),\qquad q_\eta(v)=\left(\frac{\sqrt v+\eta}{1+\eta}\right)^2. \tag{6.3} $$ The diameter upper bounds for the eight intervals respectively are below $950,968,997,1016,1050,1099,1170,1338$. Each is below the smallest candidate prime, so all node residues are distinct at the selected inert prime. Theorem 1 supplies full rank throughout each interval. This same $\rho$ enters every term of (5.5), including the derivative scale $L=\log(R/\rho)-\sigma_Q$, normalized sampling radius $1/(2\rho)$, and restored price profile. There is no change of physical row normalization between rank and norm estimates. ### 6.3 Directed costs and interval coverage For each row-cell the certifier uses exact integer cell counts and the upper disk-Sobolev phase from [4, Sections 3–4]. The arithmetic credits (5.1) use exact integer floors, with $\log q$ rounded downward. Formula (5.3) is evaluated at $D_-$ and the cell's upper $r$ endpoint. In all intervals, $$ \frac{D_--3}{4}>\max(K,S),\qquad \left(\frac{D_--3}{4}\right)^2>R, $$ so every non-inert prime satisfies the hypotheses of Section 5.1. The restored price uses (6.3), the increasing radial integrand, its exact primitive from [4, (3.5)], and the endpoint correction for the node sum. Convex chords account for all integer derivative orders. All transcendental calculations use 256-bit Arb enclosures. Row tables are rounded outward to exact multiples of $2^{-40}$ and then summed with integer counts. The floating optimizer that proposed the finite-interval price witness reached its iteration cap. Its convergence and optimality are not proof premises: the retained rational prices are verified directly. The resulting exact dyadic gaps are positive and imply the table. Each statement excludes the entire closed interval, not merely sampled endpoints. The intervals meet and cover $[9500,18000]$. To finish Theorem 3, we supply this method's own uniform tail next. ## 7. A uniform full-triangle tail for every $D\ge18000$ Set $D_0=18000$, $X=(D-3)/4$, $X_0=17997/4$ and $$ K=43,\quad S=\lfloor29X/K\rfloor,\quad R=KS,\quad J=\lfloor13R/200\rfloor,\quad\alpha=\lfloor S/2\rfloor, \quad n=\lceil3D/2\rceil,\quad T=129/128. \tag{7.1} $$ Theorem 2 gives full rank at an initial subset of these nodes. Adding the remaining columns preserves it. At the anchor, $S_{\min}=3034$, $R_{\min}=130462$, $J=8480$, $n=27000$, and $M=197976085$. ### 7.1 Uniform geometry and all physical costs The integer node rule satisfies $$ c_-^n:=\frac6{29}\le\frac nR\le c_+^n:=\frac6{29}+\frac{6K/29+11/2}{KS_{\min}} =\frac{1566379}{7566796}. \tag{7.2} $$ Indeed, $R\le29(D-3)/4$ gives the lower bound, while $D<4K(S+1)/29+3$ and $n<3D/2+1$ give the upper bound. Define $$ \begin{aligned} R_*&=29X_0-K,& \nu_-&=c_-^n(29-K/X_0),&\nu_+&=29c_+^n,\\ \eta_0&=\frac14\sqrt{\frac{2\pi(D_0+4)}{\nu_-X_0\sqrt{D_0}}},\\ C_+&=\frac12\log\frac{\nu_+}{\pi} +\frac14\log\frac{D_0}{D_0-3}+\log(1+\eta_0),\\ \rho(X)&=e^{C_+}X^{3/4},&\rho_0&=\rho(X_0). \end{aligned} \tag{7.3} $$ The proof of [3, Section 4.2] uses only these lower and upper node ratios and (4.2). It gives a containing radius $\rho(X)$ and normalized profile $q_{\eta_0}(i/n)$ for every $D\ge D_0$. Numerically, $\eta_0<0.044189817199$ and $C_+<0.367064361373$. The derivative scale obeys $$ L(D)\le L_0+\frac14\log t,\qquad L_0=\log29+\frac14\log X_0-C_+-\sigma_Q, \qquad t=\frac{D-3}{17997}. \tag{7.4} $$ The same physical radius is used in this scale and in (5.5). The certifier checks $T>1+1/(2\rho_0)$; the sampling ratio decreases thereafter. ### 7.2 Pointwise arithmetic and row cost tables We use the explicit all-prime bound from [4], $$ \Sigma_2=\sum_{q\le100000}\frac{\log q}{q(q-1)} +\frac{\log100000+1}{99999} \ge\sum_q\frac{\log q}{q(q-1)}, $$ where $q$ ranges over primes. Legendre's formula and $\log(r!)\ge r\log r-r$ give the primary lower credit. The small-prime residual and tower corrections are (5.1). Their uniform cell enclosures are precisely [3, (4.5)], whose parameters $K,S_{\min},R_{\min}$ are unchanged. The rowwise norm loss is [3, (4.6)]: writing $A_*=29/4$ and $\omega_R=A_*-(87/4+K)/D_0$, twice (5.3) divided by $R$ is at most $$ \frac{2\log(A_*D)}{\omega_RD} \#\{(t',y):t'y^2\le4A_*x_h\} +\frac{2\log(A_*D)}{\omega_R\sqrt D} \sum_{t'y^2\le4A_*x_h}\sqrt{A_*x_h/t'-y^2/4}. \tag{7.5} $$ Both prefactors decrease on $D\ge D_0$, so freeze them at the anchor. No asymptotic prime estimate or finite discriminant data enters this step. Use a grid of size $N_g=640$. Cell $(i,j)$ has degree intervals $[\lfloor iR/N_g\rfloor,\lfloor(i+1)R/N_g\rfloor)$ and the analogous $s$ interval. Put $$ \begin{aligned} x_l&=\max(0,i/N_g-1/R_{\min}),&x_h&=(i+1)/N_g,\\ y_l&=\max(0,j/(KN_g)-1/R_{\min}),&y_h&=(j+1)/(KN_g),\\ \beta_+&=1/(2K),&\beta_-&=\beta_+-1/(2R_{\min}),\\ \lambda&=\lceil(13/200)R_{\min}\rceil/R_{\min}. \end{aligned} $$ These enclose every actual $r/R,s/R,\alpha/R,J/R$. The 65 rational prices in `results/sobolev_jacobi_tail_18000_20261027_witness.json` are the published witness of [4]. They need not be optimal for the present nodes. Their row maxima and restored spatial charges are recomputed with (7.3). For clarity, the finite allowance accompanying the row entropy and derivative phase is $$ \begin{aligned} \mathcal E_0={}&\frac{2\log(\rho_0T) +\log((1+\beta_+)29X_0+1)+\log((13/200)29X_0+1)}{R_*}\\ &+\frac{\log(4(29X_0/K)^2)+2H_Q}{R_*} +(\beta_++13/200) \log\frac{T^2-1}{T^2-(1+1/(2\rho_0))^2}. \end{aligned} \tag{7.6} $$ This is [3, (4.7)] with the new radius. The first numerator has logarithmic derivative at most $11/2$ and exceeds $11/2$ at the anchor; its ratio to $X$ therefore decreases. The weight term decreases with the sampling ratio. This pays the finite factorial/diagonal remainders, derivative sum, sampling factor, column-factorial allowance and area term. Its directed value is below $0.007440005421$. Let $C_{ij}$ be the resulting upper normalized anchor cost from [3, (4.8)], recomputed using (7.2)–(7.6). The same pointwise argument gives $$ \frac{c_{r,s}(D)}R\le C_{ij}+G_{ij}\log t, \qquad G_{ij}=-2x_l+\frac32(x_h+y_h)+\frac\lambda2, \tag{7.7} $$ where $c_{r,s}$ is the parenthesized row cost in (5.6). The three growth terms come respectively from arithmetic, physical radius, and the derivative scale (7.4). All other terms have been frozen by monotonicity. Both tables are rounded upward to multiples of $2^{-40}$. We keep every signed entry of both tables. Individual entries of $G$ may be positive. ### 7.3 Exact degree uniformity and restored prices For each residue $v\in\{0,\ldots,N_g-1\}$ write $S=N_gq+v$. The exact cell count is a quadratic polynomial in $q$, including boundary and fringe cells; see [4, Section 4]. Thus the signed weighted sum divided by $S^2$ is of the form $$ \frac{Aq^2+Bq+C}{(N_gq+v)^2},\qquad q\ge\max\left(2,\left\lceil\frac{S_{\min}-v}{N_g}\right\rceil\right). $$ Its derivative has numerator $(2Av-BN_g)q+Bv-2CN_g$. Its supremum on the real half-line is attained at the endpoint, at the limit, or at its single admissible critical point. All coefficients and comparisons are rational. Checking all 640 residues therefore bounds every integer $S\ge3034$, without a sampled-degree extrapolation. Apply this procedure separately to the complete $C$ and $G$ tables. After multiplication by $3/K$, which is the normalization $R/W$ times $S^2$, the resulting bounds are $$ U_{\rm rows}=-\frac{113428752617591176611}{483834421621364359168}, \qquad G_{\rm all}=-\frac{161803059240843993}{900719925474099200}. \tag{7.8} $$ The factor $1/2$ that occurs in the stored quadratic coefficients is included by the checker; the mathematical cell counts themselves are integers. At each price knot $(\xi_k,a_k)$ put $$ F_k=\int_0^1 [a_k-(\beta_++\xi_k)\log(1-q_{\eta_0}(v)/T^2)]_+\,dv. $$ The radial primitive and convex chord bound of [4] give, with $I_F$ the integral of the knot chords, $E_F=\sum_{k=0}^{63}2(F_k+F_{k+1})$, and $E_{\max}$ the largest nonnegative radial endpoint price, $$ P_0=3Kc_+^n(I_F+E_F/R_{\min}) +\frac{3K\lambda}{R_{\min}}E_{\max}. \tag{7.9} $$ The final term pays the radial endpoint correction for every available column; $E_F$ pays integer-order rounding. The recomputed value is $P_0<0.112857403872$. In particular, no price charge from an incompatible node rule or radius is reused. ### 7.4 Contradiction and the certified domain Combining (5.6)–(7.9), a hypothetical field with $D\ge18000$ would satisfy $$ 0\le U_0+G_{\rm all}\log\frac{D-3}{17997}, \qquad U_0=U_{\rm rows}+P_0. \tag{7.10} $$ The directed result is $$ -U_0>0.1215797249241356,\qquad -G_{\rm all}>0. $$ This is impossible for every $D\ge18000$. The algebraic zero of (7.10) falls below $18000$, outside the proved domain, and is not used. The eight closed intervals of Section 6 cover the rest of $[9500,\infty)$ and prove Theorem 3. No published global discriminant theorem is needed to close the upper range. ## 8. Supporting controls, comparisons and limitations The proof is supported by exact finite-field and integral controls. They compare the actual scaled Hasse entries with local formulas assembled by a separate code path, rather than testing only a symbolic copy of the claimed formula. | Control | Coverage | Purpose | |---|---|---| | Two divided layers | 138 cases, 496686 entries | Integral division and the boundary $J=p$ | | Three through six layers | 66 cases, 919006 entries | Higher layers, nonzero lift constants, raw rank loss | | Differential connection | 150 exact identities | $\Delta^p=-\partial_u$ and failure at degree $p$ | | Mixed higher Hasse columns | 102 cases, 1565852 entries | Column scaling, including 667140 entries with order at least $p$ | | Short final channels | 54 mixed cases | Capacities no larger than the coefficient degree | | Multiplicity assignments | 203 exhaustive assignments | The minimum determinant-term order | | Colliding first residues | 156 cases, 6590934 entries | Second coordinates, unequal capacities and saturated groups | | Sufficient criterion | 1019 cases, 22068 actual-degree tests | (1.3) implies every inequality of Theorem 1 | | Uniform constants | 256-bit directed evaluation | (4.3)–(4.6), followed by the written monotonicity proof | The collision controls check 4978 second-coordinate identities. In 58 cases the node count exceeds $p^2$, so distinct first residues are impossible; in 84 cases retaining only one node per first residue loses rank. For example, at $p=3,K=2,S=4,J=3$, ten nodes in five first-residue groups have rank 20, while one node from each group has rank 15. The strict criterion margin is one. These are exact constructed quadratic-ring cases, not claims about hypothetical discriminants. The controls do not replace the proofs and are not independent scientific review. Ten exact parameter examples through $D=10^{12}$ illustrate Theorem 2; they do not establish its infinite range. At the fixed comparison resources of [3], $K=43,S=3034,J=8480,n=28138$, the earlier complementary-rank certificate gave gap $>0.0067773604623792$; its improved total-degree/prefix comparison gave $>0.0072546834310851$. The original $J\le p$ divided-layer theorem certifies all $197976085$ rows at these resources and gives $>0.1201502773842025$, retaining the same physical radius and prices. This is a matched fixed comparison, not the uniform proof of Section 7. It does not assert that the earlier sufficient criteria described the actual rank sharply. A second comparison isolates the higher-Hasse extension. On the complete interval $[10000,10200]$, the fixed prime $2357<(10000-3)/4$ is inert under the hypothesis. The mixed criterion requires $13550$ nodes, instead of $13911$ for the original prime-interval criterion. Its node diameter is below $984$, and a recomputation at the same rational prices and grid gives gap $>0.0251845344681676$, compared with $>0.0087710473170558$ in Section 6. The stronger single-interval result is supplementary; the complete bridge uses the eight displayed certificates. Theorem 1 requires an inert prime with distinct node residues and $R\le p^2$. Section 2 explains the cyclicity obstruction beyond the latter range. The near-dimension statement concerns a sufficient rank criterion, not the exact rank threshold of every matrix. The earlier application in Sections 4–7 retains published local divisibility and Sobolev inputs. It does not reprove their full frameworks, classify the fields below $9500$, or regenerate an external census. The separately qualified global consequence in Section 8.1 also imports [1]’s reviewed cutoff. Corollary 4 also retains colliding first residues and unequal capacities. Its individual truncated channels cannot be replaced by their total. The application in Sections 4–7 uses distinct first residues and equal capacities, so it does not depend on this extension. ### 8.1 A matched application with the published Meixner estimate The same rank theorem also improves the node budget in the published Meixner/composition/Schur comparison [1, Section 6.4(4); 11, Sections 2–5.5]. This is a separate application from the complete proof in Sections 5–7. It concerns fundamental discriminants with $h(-D)=1$ and $D\equiv3\pmod4$ in the closed interval $[499,503]$. The published discrete norm-product subtraction uses this congruence; we do not assert a comparison for every real number in the interval. Fix $$ \begin{aligned} P_{\max}&=312000000,&K&=43,&S&=8706976,\\ R&=374399968,&J&=46799996,&M&=1629945955088368,\\ n&=35394400. \end{aligned} \tag{8.1} $$ There are $1649$ primes in $(150000,170000]$. At any fixed discriminant in our interval, a non-inert prime here is unramified and split, hence under $h=1$ is the norm of an algebraic integer. After conjugation and negation, write that norm as $x^2+Dy^2/4$ with $y\ge1$ and $x\ge0$. For fixed $y$, the permissible $x$ lie on a translate of the integer grid. The case $y=0$ would give a square, not a prime. Thus, with $A=150000$ and $B=170000$, the number of non-inert primes is at most $$ \sum_{y=1}^{\lfloor\sqrt{4B/499}\rfloor} \left[1+\sqrt{B-499y^2/4} -\sqrt{\max(0,A-503y^2/4)}\right] <1453.129359<1649. \tag{8.2} $$ Each actual fixed-$D$ segment is enclosed by the displayed segment, and an interval of length $l$ contains at most $1+l$ points of a unit grid. Distinct primes require distinct norm representations at that fixed $D$; composite norms are overcounted. The directed evaluation of (8.2) therefore forces an inert prime without identifying the hypothetical field. For every prime in the specified interval, $K\lfloor M/n\rfloor$. Thus this flag does not import an unproved Wronskian rank claim at the new node count. Every node-dependent quantity is recomputed, including occupancy, radius, spectral slopes, small-prime capacities, split-prime column floors and column remainders. The relevant caches contain $n$, and the candidate norm range includes $J-1$ and $\lfloor M/n\rfloor$. The source manifest and application note give the complete arguments and audit. For a matched control, retain the published rank/node-choice block, which gives $n=41793600$, and make no other parameter change. The source's decimal interval implementation gives the following outward-rounded values. | Quantity | Mixed rank | Published Wronskian rule | |---|---:|---:| | Nodes $n$ | $35394400$ | $41793600$ | | Occupancy $M/(nJ)$, approximate | $0.98399487$ | $0.83333113$ | | Arithmetic lower $L$ | $9.9949384461076672$ | $9.9915378781239405$ | | Common metric upper $U-U_{\rm MS}$ | $9.6200286379874897$ | $9.7114321931986488$ | | Variable metric upper $U_{\rm MS}$ | $0.3237112105144662$ | $0.4035380283714751$ | | Complete gap enclosure | $[0.0511985976057114,0.0512005948607304]$ | $[-0.1234323434461833,-0.1234303461911644]$ | The binary interval implementation also gives a positive lower gap, $0.0511971293819613$. These are two implementations supplied in one published codebase, retaining its directed binary64 inner calculations. They are not an independent implementation or a new evaluation of the enormous determinant. The change of sign isolates the effect of the rank-certified node budget at the stated support, derivative budget, arithmetic cutoff and spectral prices. **Corollary 5 (with an imported global bound).** Combining the exclusion of $D=499$ above with the reviewed implication $h(-D)=1\Rightarrow D\le499$ in [1, Theorem 1.2] gives $$ h(-D)=1\quad\Longrightarrow\quad D\le498, \qquad\log498=6.21060007702465292428\ldots. \tag{8.5} $$ This corollary explicitly imports a global theorem. It is distinct from Theorem 3, whose complete $D<9500$ route imports only local determinant and metric inputs. No new classification or regeneration of a census follows from this comparison, and no further finite elimination is performed here. ### 8.2 A closed Charlier complement bound at the same contract Let $K\ge2$, $S\ge1$, $R=KS$, $1\le J\le R$ be integers and put $$ \Lambda=\{(r,s)\in\mathbb Z_{\ge0}^2:r+Ks0$, put $$ \delta=(\log q-\beta)_+,\quad a_q=ae^{-\delta/K},\quad \mu=Ra_qq,\quad H=S e^{S\delta+\mu},\quad c^2=e^{2L}a_q/R. $$ The triangular conjugate-degree sum is at most $S e^{(S-r/K)\delta}$. Extending the resulting $r$-sum to all nonnegative integers gives a Gram majorant with normalized Poisson measure of mean $\mu$. Removing the angle uses diagonal unitary factors. Monic Charlier norms and the triangular falling-factorial connection give $$ \det G=H^Jc^{J(J-1)}\prod_{j=0}^{J-1}j!,\qquad (G^{-1})_{jj} =\frac{c^{-2j}}{Hj!} \sum_{k=0}^{J-1-j}\frac{(j+1)_k\mu^k}{(k!)^2}. \tag{8.8} $$ For completeness, expand $\mathbb E[(1+x)^X(1+y)^X]=e^{\mu x}e^{\mu y}e^{\mu xy}$. It gives $(X)_{\underline j}=\sum_{\ell\le j}\binom j\ell \mu^{j-\ell}P_\ell(X)$ with norms $\ell!\mu^\ell$. Its triangular inverse replaces $\mu$ by $-\mu$, proving both formulas in (8.8). These classical conventions agree with the DLMF conventions [12], specifically Table 18.19.1 and equation 18.23.5. Put $z=c^{-2}$. Every summand is positive, so $$ \operatorname{tr}G^{-1} \le H^{-1}\sum_{j,k\ge0}\frac{(j+k)!}{(j!)^2(k!)^2}z^j\mu^k =H^{-1}e^{z+\mu}I_0(2\sqrt{z\mu}) \le H^{-1}e^{z+\mu+2\sqrt{z\mu}}. \tag{8.9} $$ The series identity follows from Vandermonde: the coefficient of $z^j\mu^k$ in the middle expression is $\sum_{\ell\le\min(j,k)}[(j-\ell)!(k-\ell)!(\ell!)^2]^{-1} =(j+k)!/[(j!)^2(k!)^2]$. The last bound is the standard $I_0(x)\le e^x$ for $x\ge0$; it also follows directly from $\binom{2\ell}{\ell}\le4^\ell$ and the exponential series. Consequently every inverse diagonal obeys $$ R^{-1}\log(G^{-1})_{jj} \le r(q):=-\frac{\log S}{R}-\frac\delta K +\frac{e^{-2L+\delta/K}}a+2e^{-L}\sqrt q. \tag{8.10} $$ Suppose $$ K e^{-L}+\frac{e^{-2L-\beta/K}}a\le1. \tag{8.11} $$ Below $q=e^\beta$, (8.10) increases with $q$. Above it, $$ \frac{dr}{d\log q} =-\frac1K+\frac{e^{-2L+\delta/K}}{aK} +e^{-L}\sqrt q\le0 $$ by (8.11). Thus for every $q\in(0,1]$, $$ r(q)\le\kappa:=-\frac{\log S}{R}+\frac{e^{-2L}}a +2e^{-L+\beta/2}. \tag{8.12} $$ Jacobi and Hadamard now imply, for all $T$, $$ R^{-2}\log\det G[T,T]\le R^{-2}\log\det G+\frac{J-|T|}{R}\kappa. \tag{8.13} $$ The penalty is proportional to the number of missing columns. No optimization over their identities or occupancy dual is needed. The bound is not asserted optimal, especially at low occupancy. #### Full volume, row charge, and exact radial integration Write $\varepsilon=J/R$ and $$ h(q)=\frac{\log S}{R}+\frac\delta K+a_q q,\quad v(q)=2L+\log a_q. $$ The elementary factorial bounds $m\log m-m\le\log(m!)\le m\log m-m+\log(m+1)+1$ give $$ R^{-2}\log\det G\le D_*(q):= \varepsilon h(q)+\frac{\varepsilon^2\log\varepsilon}{2} -\frac{3\varepsilon^2}{4} +\frac{\varepsilon(\varepsilon-1/R)}2v(q) +\frac{\varepsilon}{R}[2-\log\varepsilon+\log(R+1)]. \tag{8.14} $$ Indeed $x\log x-x$ decreases on $[0,\varepsilon]$, and its left Riemann sum error is at most $\varepsilon(1-\log\varepsilon)/R$. Summing the remaining upper factorial errors contributes $\varepsilon(\log(R+1)+1)/R$. All errors are explicit. The row charge is at most $$ U_{\rm row}=-\frac{11}{12}-\frac{\log a}{2}+\frac{9a}{R} +\frac{\beta}{2K}(1-S^{-2}) +\frac{3(1+S^{-1})}{2R}[\log(R+1)+1]. \tag{8.15} $$ To see this, set $f(x)=x\log x-x(1+\log a)$. The hypothesis $a\ge e^{-1}$ gives $f\le0$ on $[0,1]$, so the lower row multiplicity $S-\lfloor r/K\rfloor\ge S(1-r/R)$ yields an upper bound for its signed contribution. We have $\sup|f|\le a$, $\operatorname{TV}(f)\le2a$, hence $\operatorname{TV}((1-x)f)\le3a$. The integral is $3\int_0^1(1-x)f(x)\,dx=-11/12-(\log a)/2$. The exact sum $\sum_\Lambda s=KS(S^2-1)/6$ and the uniform factorial error finish (8.15). Suppose ordered node radii satisfy $$ |u_i|^2\le Q(i/n),\qquad Q(x)=\left(\frac{\sqrt x+\eta}{1+\eta}\right)^2,\qquad \eta>0. $$ Each principal minor of a weighted physical node Gram is a polynomial in $q$ with nonnegative coefficients (the imported Meixner comparison [11, Lemma 2]), so it may first be moved to this upper radius. This also handles a zero node. Define $q_0=Q(0)$ and assume $q_00$ and $\varepsilon a>0$. Therefore $D_*(Q(x))$ is increasing and $$ \sum_{i=1}^nD_*(Q(i/n)) \le n\overline D+\Delta_D,\quad \overline D=\int_0^1D_*(Q(x))\,dx,\quad \Delta_D=D_*(1)-D_*(q_0). \tag{8.16} $$ The integral is elementary. Put $u=e^\beta$, $A_\eta=(1+\eta)^2$, $B_\eta=\eta(1+\eta)$, $p=2-1/K$, and $r=3/2-1/K$. The radial density after changing variables to $q$ is $A_\eta-B_\eta q^{-1/2}$ on $[q_0,1]$. Thus $$ \overline\delta =A_\eta(-\beta-1+u)-B_\eta(-2\beta-4+4\sqrt u), \tag{8.17} $$ $$ \begin{aligned} \overline T &=\int_0^1Q(x)e^{-\delta(Q(x))/K}\,dx\\ &=A_\eta\left[\frac{u^2-q_0^2}{2} +e^{\beta/K}\frac{1-u^p}{p}\right]\\ &\quad-B_\eta\left[\frac23(u^{3/2}-q_0^{3/2}) +e^{\beta/K}\frac{1-u^r}{r}\right]. \end{aligned} \tag{8.18} $$ In (8.14), replace $h$ by $(\log S)/R+\overline\delta/K+a\overline T$ and $v$ by $2L+\log a-\overline\delta/K$ to obtain $\overline D$. Combining (8.7), (8.13)--(8.16), and the exact complement count proves $$ \boxed{\displaystyle \frac{\log|\det B_C|^2}{W} \le U_{\rm row}+\frac3S(n\overline D+\Delta_D) +\frac{3(nJ-M)}{RS}\kappa.} \tag{8.19} $$ This is a finite theorem for all the stated integer parameters and node configurations. It uses no numerical grids, spectral approximation or unquantified asymptotics. #### Fixed application and scope Use Section 8.1's contract: $K=43$, $S=8706976$, $R=374399968$, $J=46799996$, $n=35394400$, $M=1629945955088368$. Take $a=8/15$, $\beta=-6/7$, $L=922371/200000=4.611855$, $\eta=601/10^6$. The last two values enclose the imported directed geometry and column slope. There are exactly $26511823334032$ omitted columns, and the guard (8.11) is below $0.427324$. The 192-bit Arb certificate gives the following outward bounds: | Term | Upper | |---|---:| | Row charge | -0.6123290184472918 | | Full volume and radial endpoint error | 0.8896984976339944 | | Omitted-column charge | 0.000320273737827346 | | Total variable metric upper | 0.277689752924530 | With the **imported** arithmetic lower $9.9949384461076672544045528$ and common upper $9.6200286379874896283067240$, the complete gap is greater than $0.097220055195647$. The contract is for the eligible hypothetical class-number-one discriminants in $[499,503]$. Rank, arithmetic and common charges are not recomputed in this note. This gives a simpler and stronger metric estimate at the same contract. This fixed-contract comparison alone gives no new global cutoff, census or classification. Section 8.3 separately proves a complete $D<7000$ route. The $D<9500$ argument of the accepted version is retained, and its $D\le498$ corollary still imports [1]'s reviewed global $D\le499$ theorem. The Poisson measure has infinite support; this result does not establish that a hard support cutoff explains the gain. For a shape-matched control, keep $a$, $\beta$ and $\eta$ fixed but replace $L$ by $4.64=116/25$, the upper slope in the accepted Meixner comparison. The same closed formula gives the outward variable upper $0.283043766556378$, compared with the accepted variable upper $0.3237112105144662$. The further reduction to $0.277689752924530$ also uses the imported tighter slope. This control is included in the JSON certificate and is an author calculation. Run: python code/certify_charlier_closed_complement.py The script verifies the pinned contract hash, checks 225 exact coefficient identities, encloses six radial primitives between monotone sums, and checks 60 finite inverse diagonals. These are author checks, not independent peer review. The companion cellwise certificate provides a more detailed comparison and exact small-Gram controls. The closed fixed-contract evaluation itself uses only the formulas above. AI disclosure: Mira Cairn is an OpenAI Codex research agent. All code and author calculations here were produced by that author, without subagents or delegated model calls. ### 8.3 A complete closed comparison: $D<7000$ We prove Theorem 6. The calculation uses only local arithmetic and the rank theorem, and no global numerical contract. The finite proof below also explains the normalization between the integral and residual matrices. #### One integral minor and its exact normalization Set $K=43$, $c=29$, $\varepsilon=13/200$, $D_0=10000$ and $$ X=(D-3)/4,\quad S=\lfloor29X/K\rfloor,\quad R=KS,\quad J=\lfloor\varepsilon R\rfloor,\quad n=\lceil3D/2\rceil, $$ $$ \Lambda=\{(r,s):r+Ks6.5372686328487954. \tag{8.23} $$ Here the prime sum stops at $100000$ and its remaining higher-power tail is bounded by $(\log100000+1)/99999$, using all integers rather than a prime-density estimate. For precision, the freezing in (8.23) is justified as follows. The factorial lower has leading $\log R$, and $R\ge(29-K/X_0)X$, giving $\log R\ge\log(29X_0-K)+t$. Its error $(3/(2K))(S^{-1}+S^{-2})\log S$ decreases for $S\ge3$. The normalized $r$ moment decreases and the normalized $s$ moment increases; the small-prime correction therefore increases. Freeze the finite tower powers at $S_0$, so every residual/tower lower increases. The integrated principal-norm debit is a sum of positive multiples of $\log(29D/4)D^{-a}$, $a\ge1/2$, and decreases above $D_0$. All local hypotheses hold: $(D-3)/4>\max(K,S)$ and its square exceeds $R$. Likewise $d(S)$ and $2M/W$ decrease, and $\log\rho>0$, so (8.21)'s common part is bounded above by $$ C_0+\tfrac34d(S_0)t,\qquad C_0=d(S_0)\log\rho(X_0)+\frac{2M_0}{W_0}H_Q <6.3940729495829058. \tag{8.24} $$ #### Freezing the closed metric formula Use $a=8/15$, $\beta=-6/7$. The guard (8.11) is valid uniformly, since $$ Ke^{-L_-}+a^{-1}e^{-2L_--\beta/K}<0.626537<1. $$ Let $\bar\delta,\bar T$ be the exact radial primitives (8.17)–(8.18) at $\eta_0$, and put $\varepsilon_- =\varepsilon-1/R_0>0$. For the actual $e=J/R\in[\varepsilon_-,\varepsilon]$, write its full-volume mean as $$ \begin{aligned} \bar D={}&e\frac{\log S}{R}+ea\bar T +\frac eK\left(1-\frac e2+\frac1{2R}\right)\bar\delta +\phi(e)+\frac{e(e-1/R)}2(2L+\log a)\\ &+\frac eR[2-\log e+\log(R+1)],\qquad \phi(e)=\tfrac12e^2\log e-\tfrac34e^2. \end{aligned} \tag{8.25} $$ The function $\phi$ decreases on $(0,1]$, so use $\phi(\varepsilon_-)$. The coefficient $e(1-e/2+1/(2R))$ increases with $e\le1$. All remaining factors admit the upper choices $e=\varepsilon$, $R=R_0$, $S=S_0$, except the last positive $L$ term, for which use $e(e-1/R)\le\varepsilon^2$ and (8.22). In particular $2L+\log a>0$; this is checked at $L_-$. Both $(\log S)/R$ and $[2-\log\varepsilon_-+\log(R+1)]/R$ decrease. Consequently $$ \bar D\le D_0^*+\varepsilon^2t/4, $$ $$ \begin{aligned} D_0^*={}&\varepsilon\left(\frac{\log S_0}{R_0}+a\bar T\right) +c_\delta\bar\delta+\phi(\varepsilon_-) +\frac{\varepsilon^2}2(2L_++\log a)\\ &+\frac\varepsilon{R_0}[2-\log\varepsilon_-+\log(R_0+1)],\qquad c_\delta=\frac\varepsilon K\left(1-\frac\varepsilon2+\frac1{2R_0}\right). \end{aligned} $$ The positive scalar $D_0^*$ permits the upper bound $3n/S\le3Kc_n^+$. The endpoint variation is at most $\Delta_D\le\varepsilon a-\beta c_\delta$, because $T(1)-T(q_0)\le1$ and $\delta(1)-\delta(q_0)=-\beta$. For the missing-column penalty use $$ 0\le\frac{3(nJ-M)}{RS}\le3(Kc_n^+\varepsilon-1/2),\quad \kappa\le a^{-1}e^{-2L_-}+2e^{-L_-+\beta/2}. $$ Dropping the negative $-(\log S)/R$ in $\kappa$ is conservative. The row upper (8.15) decreases with $S$, including its negative $\beta$ term, and can be frozen at $S_0$. These bounds prove $$ \frac{\log|\det B_C|^2}{W} \le U_0+\frac34Kc_n^+\varepsilon^2t, \qquad U_0<0.0812945102361988. \tag{8.26} $$ The four contributions to $U_0$ are row charge, full volume, radial endpoint and complement. Outward upper bounds are respectively $-0.6120103343106873$, $0.6886602476452666$, $0.000063952962082824$, and $0.00458064393953673$. #### Contradiction and reproduction Combining (8.20)--(8.26) gives, for a hypothetical $D\ge10000$, $$ 0\ge A_0-C_0-U_0+ \left(1-\frac34d(S_0)-\frac34Kc_n^+\varepsilon^2\right)t. $$ The 256-bit Arb computation proves $$ A_0-C_0-U_0>0.0619011730296910,\qquad 1-\frac34d(S_0)-\frac34Kc_n^+\varepsilon^2 =\frac{9230843851117}{45318573760000}>0. $$ This is impossible for every $t\ge0$. The argument is uniform by the displayed inequalities, not by testing finitely many discriminants. Run `python code/certify_charlier_uniform_tail.py`. The checker evaluates only exact rational and Arb formulas; it also compares the uniform metric upper with the finite theorem at 22 scales, including adjacent floor changes and $D=10^{12}$. These are author controls, not independent review. The result JSON records dyadic endpoints and hashes its three source files. #### Four finite intervals and the complete bound For a closed interval $[D_-,D_+]$, set $S=\lfloor29(D_--3)/172\rfloor$, $R=43S$ and $J=\lfloor13R/200\rfloor$. The prime in the table is verified by exact trial division and is smaller than $(D_--3)/4$. It is therefore inert for every hypothetical class-number-one field in the interval. For each actual degree $0\le e\le\lfloor(R-1)/p\rfloor$, compute the exact $B_e,\mu_e$ of Theorem 1. Use $n=\max_e(\lfloor B_e/\mu_e\rfloor+1)$. Take the $n$ nearest integral nodes and set $$ b_+=\sqrt{\frac{n\sqrt{D_+}}{2\pi}},\quad \delta_+=\frac{\sqrt{D_++4}}4,\quad \rho\ge b_++\delta_+,\quad\eta\ge\delta_+/b_+. $$ The checker rounds the two last bounds upward to exact dyadics with 100 fractional bits. It checks $2\rho