Closed

Persistent logarithmic graph; F8GP-1

Theorem. (Persistent logarithmic graph; F8GP-1). For every real SS, put V0,S={z∈V0:∣f0(z)∣≥e−S},PS=P∩{λ+∑imisi+b⋅x≤S}.(1.7)V_{0,S}=\{z\in V_0:|f_0(z)|\geq e^{-S}\},\qquad P_S=P\cap\left\{\lambda+\sum_i m_i s_i+b\cdot x\leq S\right\}. \tag{1.7} Every nonempty V0,SV_{0,S} is pure of analytic dimension nn. The following chain is defined once, independently of SS: C0=F∗P.(1.8)C_0=F_*\mathcal P. \tag{1.8} The pushforward counts each full-rank cell with its lattice index and discards cells on which FF has rank below nn. It is a finite nonnegative integral nn-chain, and Trop⁡(g0,f0),V0,S(OV0,S)=C0∣{t≤S}(1.9)\boxed{\quad \operatorname{Trop}_{(g_0,f_0),V_{0,S}}(\mathcal O_{V_{0,S}}) =C_0|_{\{t\leq S\}} \quad} \tag{1.9} for every SS, with zero chain for the empty domain. Its support lies in (κ+M ⁣(∏i[−Ai,Bi]×Q))×[tmin⁡,∞),tmin⁡=λ−∑imiAi+min⁡Qb⋅x.(1.10)\left(\kappa+M\!\left(\prod_i[-A_i,B_i]\times Q\right)\right) \times[t_{\min},\infty), \quad t_{\min}=\lambda-\sum_i m_iA_i+\min_Q b\cdot x. \tag{1.10} Thus the same finite weighted chain works at all levels, including levels where a full-dimensional cell lies in {t=S}\{t=S\}.

Proof

Proof of foundations G.0.11. Purity is foundations C.1.40. On V0,SV_{0,S}, all entries of hh and (g0,f0)(g_0,f_0) are units. Their actual moment maps satisfy t(g0,f0)=F∘tht_{(g_0,f_0)}=F\circ t_h. If V0,SV_{0,S} is empty, the actual source image makes P∣{t∘F≤S}\mathcal P|_{\{t\circ F\leq S\}} zero. The closed-cutoff pushforward then gives the required zero chain. Otherwise adjoin the actual constant units a,c1,…,cra,c_1,\ldots,c_r to hh. The whole level algebras and the transverse Gauss dimensions are unchanged, and the saturated tangent lattices embed with zero constant coordinates and index one. The translated formula is now a literal character map for the identity finite map of V0,SV_{0,S}. Use whole-interior projection off the target absolute boundary image. That lower-dimensional image does not contain any top-dimensional cell of a full-rank image, even at t=St=S. On a common subdivision the finite-module chain and weights identify the closed chains from their generic coefficients. This gives Trop⁡(g0,f0),V0,S(O)=F∗Trop⁡h,V0,S(O).\operatorname{Trop}_{(g_0,f_0),V_{0,S}}(\mathcal O) =F_*\operatorname{Trop}_{h,V_{0,S}}(\mathcal O). Substitute (3.2), then (3.3), to obtain (1.9). The bounds in (1.10) follow directly from yi∈[−Ai,Bi]y_i\in[-A_i,B_i], x∈Qx\in Q, and si≥−Ais_i\geq-A_i. The finite chain is constructed before any SS is chosen. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002568.

Proof in chapter · Fixed-edition record