Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Golden Germ Fourth-Order Ledger

Abstract

A finite signed fourth-order correction cancels the two surviving local modes below beta six and leaves a norm-summable prime deviation.

Theorem 1.1 (Fourth-order local cancellation reaches the beta-six boundary).

Proof. Machine-checked in Lean as D5/S3/Analytic/EulerGerm/GoldenGermFourthOrderLedger.golden_fourth_normalized_factor_deviation_norm_summable (✓ std3). ∎

Source. Repository-derived.

Commentary.

The frozen fourth-order exponent census supplies only the candidate weights below beta six; it does not determine which modes occur or cancel. This module’s seven-mode local expansion and the identity fourth_local_identity determine x y-squared and x-cubed y as the actual surviving correction modes. The signed factor C4 is therefore one minus x y-squared times the inverse of one minus x-cubed y. The displayed twelve-term polynomial H4 has no monomial below beta six; x-squared y-squared is its boundary term.

The theorem reuses the frozen third-order local factor K3 and records the exact rational identity C4 K3 equals one plus R4. Its shifted seventh-mode tail starts above beta six, and every factor arising from the numerator and denominator expansions adds a nonnegative mixed weight. Prime rpow summability and uniform geometric denominator bounds then prove norm summability whenever the real part of s is greater than one over beta six.

This is the next finite certificate in the golden Euler germ extraction ladder of OACTC parts 580 and 581. It advances the open local summability boundary from one over phi to the fifth power to one over beta six. It does not assert O-5, the Riemann Hypothesis, a global continuation or nonvanishing theorem, or an all-order extraction.

References