Paper IX: Arithmetic Packets, Dyadic Towers, and Local Polynomial Deformation

Download original file

This is the original TeX manuscript source. Use the paper’s PDF for typeset equations.

Read the typeset paper

Read this chapter with formatted equations

1 \hypertarget{cont7:paper-ix-weighted-first-order-root-motion}{%
2 \subsection{Paper IX: weighted first-order root
3 motion}\label{cont7:paper-ix-weighted-first-order-root-motion}}
4 
5 \textbf{Komorebi P. --- 8 September 2026.}
6 
7 \hypertarget{cont7:the-theorem}{%
8 \subsubsection{The theorem}\label{cont7:the-theorem}}
9 
10 Let \(p\) be prime, \(R=\mathbb Z_p\), \(K=\mathbb Q_p\), and
11 \(d,s,M\in\mathbb N\). Let \(F,H\in R[X_1,\ldots,X_d]^d\), let
12 \(a\in R^d\) satisfy \(F(a)=0\), and set \[
13 J=DF(a),\qquad G=F+p^M H.
14 \] Assume \[
15 J\in\operatorname{GL}_d(K),\qquad p^sJ^{-1}\in M_d(R),\qquad M>2s.
16 \] Then there is exactly one root \(b\) of \(G\) in \(a+p^{s+1}R^d\). It
17 satisfies \[
18 b-a\in p^{M-s}R^d,
19 \] and there is \(\varepsilon\in p^{2M-3s}R^d\) such that, in \(K^d\),
20 \[
21 \boxed{b-a=-p^M J^{-1}H(a)+\varepsilon.}
22 \] The inverse in this formula belongs to the original Jacobian
23 \(DF(a)\). The theorem constructs the perturbed root from these
24 hypotheses and proves uniqueness throughout the full ball of depth
25 \(s+1\). It does not require an additional Jacobian hypothesis on \(G\).
26 Coefficients and centers are arbitrary integral p-adic elements. Every
27 prime and finite square dimension are included, including \(p=2\) and
28 dimension zero.
29 
30 The error depth exceeds the displacement depth by \[
31 (2M-3s)-(M-s)=M-2s\ge1.
32 \] Thus the first-order term determines strictly more digits than the
33 displacement bound alone. These are guaranteed divisibility bounds;
34 equality of valuations is not asserted for every system.
35 
36 \hypertarget{cont7:root-construction-with-the-original-inverse}{%
37 \subsubsection{Root construction with the original
38 inverse}\label{cont7:root-construction-with-the-original-inverse}}
39 
40 Write \(A=p^sJ^{-1}\in M_d(R)\), so \(AJ=JA=p^sI\). Let \(t=p^{s+1}\)
41 and \(k=M-(2s+1)\ge0\). The actual polynomial Taylor and difference
42 identities give polynomial systems \(Q_F,Q_H\), both vanishing at zero,
43 such that \[
44 (AF)(a+tu)=p^{2s+1}u+p^{2s+2}Q_F(u),
45 \] \[
46 (AH)(a+tu)=(AH)(a)+tQ_H(u).
47 \] Consequently \[
48 (AG)(a+tu)=p^{2s+1}\bigl(C+u+pQ(u)\bigr),
49 \] where \[
50 C=p^kAH(a),\qquad
51 Q=Q_F+p^{M-s-1}Q_H,\qquad Q(0)=0.
52 \] All exponents are nonnegative under \(M>2s\). Actual integral
53 polynomial evaluation is 1-Lipschitz, so \(u\mapsto-C-pQ(u)\) is a
54 strict contraction on the complete space \(R^d\). Its unique fixed point
55 inherits the depth \(k\) of \(C\), because \(Q(0)=0\). Thus \(b=a+tu\)
56 has displacement depth \(s+1+k=M-s\).
57 
58 The certificate \(JA=p^sI\) makes multiplication by \(A\) injective, so
59 the normalized zero is an actual root of \(G\). Every root in \(a+tR^d\)
60 has the form \(a+tw\) and satisfies the same fixed-point equation. This
61 proves uniqueness on the entire stated ball using the original matrix
62 certificate.
63 
64 \hypertarget{cont7:the-first-order-error}{%
65 \subsubsection{The first-order error}\label{cont7:the-first-order-error}}
66 
67 Put \(\delta=b-a\) and \(L=M-s\). The displacement form of Taylor's
68 theorem, proved over any commutative ring, gives \[
69 E_F=(AF)(b)-(AF)(a)-p^s\delta\in p^{2L}R^d.
70 \] Polynomial congruence gives \[
71 E_H=(AH)(b)-(AH)(a)\in p^LR^d.
72 \] Since \(F(a)=0\) and \(G(b)=0\), \[
73 p^s\delta+p^MAH(a)=-E_F-p^ME_H.
74 \] We have \(M+L\ge2L\), so the right side lies in \(p^{2L}R^d\).
75 Cancelling the nonzero scalar \(p^s\) proves the integral estimate \[
76 \delta+p^{M-s}AH(a)\in p^{2M-3s}R^d.
77 \] Define this integral vector to be \(\varepsilon\). Under
78 \(R\hookrightarrow K\), the exact identity \(p^{M-s}A=p^MJ^{-1}\) gives
79 the displayed first-order formula. The Lean bridge checks matrix
80 evaluation and all coefficient inclusions explicitly.
81 
82 \hypertarget{cont7:sharpness-and-the-strict-threshold}{%
83 \subsubsection{Sharpness and the strict
84 threshold}\label{cont7:sharpness-and-the-strict-threshold}}
85 
86 For \(p=2\), take \(F(X)=X+X^2\), \(H(X)=1\), \(a=0\), \(s=0\), \(M=1\).
87 There is a unique root \(b\in2\mathbb Z_2\) of \(X+X^2+2\). Its equation
88 gives \(b+2=-b^2\). It also forces \(b\equiv2\pmod4\). Therefore \[
89 v_2(b+2)=2=2M-3s.
90 \] The accompanying Lean controls show that the error is divisible by
91 four and is not divisible by eight. This refutes a uniform replacement
92 of \(2M-3s\) by \(2M-3s+1\), even for a one-variable unit Jacobian.
93 
94 The prior strict-threshold example also applies to perturbations: take
95 \(F(X)=X^2-1\), \(H(X)=1\), \(a=1\), \(p=2\), \(s=1\), \(M=2\). Then
96 \(F(a)=0\), \(DF(a)=2\), and \(F+2^2H=X^2+3\) has no root modulo eight,
97 hence none in \(\mathbb Z_2\). The new explanatory identification uses
98 the previously checked no-root polynomial. The strict inequality
99 \(M>2s\) cannot uniformly be replaced by \(M\ge2s\).

Back to source controls

Back to Paper IX: Arithmetic Packets, Dyadic Towers, and Local Polynomial Deformation