Theorem. (Symmetric projective model induction). The recursion is defined at every stage for every permutation of the indices. Every order gives It is therefore symmetric in the labelled pairs , independent of the chosen integral bases and primitive complements, and independent of the clearing exponents . The value changes by if is increased by . Replacing by , , changes the value by .
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.
Proof
Proof. The dimension-zero value is , which is (I.0.16). Suppose the formula has been proved in dimension , for all choices of data and orders. The matrix of remaining rows on is invertible, so the induction hypothesis applies after any first choice . Writing , the first term of (I.0.15) is Its second term is . Equation (I.0.3) gives precisely (I.0.16). This proves the claim for every first index and every later order, without assuming order-independence in dimension .
Permuting rows changes the determinant by a sign of absolute value one; a change of -basis multiplies it by a unit. The norms and the child lattices have the basis compatibilities proved in Lemma I.0.2. The formula itself contains no . The two change rules follow by replacing and by multiplying the matrix rows by , respectively. Finally, the primary induction (I.0.12), if evaluated on this class, has exactly the same finite base value and exactly the two terms in (I.0.15). Finite induction identifies its value with the displayed formula; the new proof of symmetry did not use that primary theory. ◻