Closed

Power-controlled rational factorization

Corollary 2.19.2. (Power-controlled rational factorization). Keep A,ρ,C,ϕA,\rho,C,\phi as above. Let g,f1,…,fsg,f_1,\ldots,f_s generate the unit ideal of AA, and put B=A{ρ−1X}/(gXi−fi)i=1s.B=A\{\rho^{-1}X\}/(gX_i-f_i)_{i=1}^s. There is a bounded factorization A→B→CA\to B\to C if and only if ϕ(g)\phi(g) is a unit and, for each ii, the ratios bi=ϕ(fi)ϕ(g)−1b_i=\phi(f_i)\phi(g)^{-1} satisfy ∥bin∥≤Ciρin\|b_i^n\|\leq C_i\rho_i^n for all n≥0n\geq 0 and some CiC_i. Such a factorization is unique.

Proof

Proof. Choose a0g+∑iaifi=1a_0g+\sum_i a_if_i=1. In BB the equality becomes g(a0+∑iaixi)=1.g\left(a_0+\sum_i a_ix_i\right)=1. Thus every factorization makes ϕ(g)\phi(g) invertible and forces ψ(xi)=ϕ(fi)ϕ(g)−1\psi(x_i)=\phi(f_i)\phi(g)^{-1}. Proposition 2.19.1 supplies the necessary power bounds. Conversely, the stated ratios satisfy ϕ(g)bi=ϕ(fi)\phi(g)b_i=\phi(f_i), so that proposition constructs the unique factorization. In the zero ring, the unit equation is interpreted with 1=01=0; the assertion then concerns the unique map to zero. ◻

Selected scopes (1)

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001443, 2.19.2.

Proof in chapter · Fixed-edition record