NAG-002935 · Accepted whole

Symmetric projective model induction

I Descent of the polarized mixed tower

Open in the English reader · PDF page 2064

Statement · exact TeX
\begin{theorem}[Symmetric projective model induction]
\label{f9mi:symmetricinduction}
The recursion is defined at every stage for every permutation of the
indices. Every order gives
\begin{equation}\label{eq:ex68:f9mi-projective:height-formula}
 H_E=\lambda\left(D\,v(\det A)
                       +\sum_{i=0}^r c_i\frac{D}{m_i}\right),
                    \qquad D=\prod_{i=0}^r m_i.
\end{equation}
It is therefore symmetric in the labelled pairs $(L_i,s_i)$, independent
of the chosen integral bases and primitive complements, and independent
of the clearing exponents $e_i$. The value changes by
$\lambda q D/m_i$ if $c_i$ is increased by $q\in\mathbf Q$.
Replacing $\ell_i$ by $b_i\ell_i$, $b_i\in K^\times$, changes the
value by $-D\sum_i\log|b_i|$.

This is a self-contained model recursion on the stated projective class.
It identifies the restriction of the primary BPS induction to this class
because its base value, divisor cycle and measure are the same. No
native smooth-integral comparison, analytic adjointness, metric limit,
model-change invariance or extension to arbitrary pseudo-divisors is
part of the assertion.
\end{theorem}
Full selected proof · exact TeX
\begin{proof}
The dimension-zero value is
$\lambda(m_0v(\ell_0)+c_0)$, which is \eqref{eq:ex68:f9mi-projective:height-formula}.
Suppose the formula has been proved in dimension $r-1$, for all choices
of data and orders. The matrix of remaining rows on $E_i$ is invertible,
so the induction hypothesis applies after any first choice $i$.
Writing $D_i=D/m_i$, the first term of \eqref{eq:ex68:f9mi-projective:recursive-definition} is
\[
 m_i\lambda\left(D_i v(\det A_i)
             +\sum_{j\ne i}c_j\frac{D_i}{m_j}\right)
 =\lambda\left(Dv(\det A_i)+\sum_{j\ne i}c_j\frac D{m_j}\right).
\]
Its second term is
$\lambda(Da_i+c_iD/m_i)$. Equation~\eqref{eq:ex68:f9mi-projective:detrec} gives precisely
\eqref{eq:ex68:f9mi-projective:height-formula}. This proves the claim for every first index
and every later order, without assuming order-independence in dimension
$r$.

Permuting rows changes the determinant by a sign of absolute value one;
a change of $R$-basis multiplies it by a unit. The norms and the child
lattices have the basis compatibilities proved in
Lemma~\ref{f9mi:primitivecut}. The formula itself contains no $e_i$.
The two change rules follow by replacing $c_i$ and by multiplying the
matrix rows by $b_i$, respectively. Finally, the primary induction
\eqref{eq:ex68:f9mi-projective:comparison-recursion}, if evaluated on this class, has exactly the same
finite base value and exactly the two terms in \eqref{eq:ex68:f9mi-projective:recursive-definition}.
Finite induction identifies its value with the displayed formula; the
new proof of symmetry did not use that primary theory.
\end{proof}
Typeset reader excerpt
Typeset mathematical passage from PDF page 2065
PDF page 2065

Typed proof inputs

Reader cross-references

Proof map

Verified map inputs · NAG-002935

Hypotheses for this application

  • The printed projective DVR model and root metrics
  • All supplied datum, divisor, measure and dimension-zero conditions remain in force.

AND · joint registered proof inputs

Substitute the atom calibration into the recursion. The primitive-cut determinant recurrence identifies the value for each first index.