The Riemann Hypothesis as a ground: a precise formulation via Π1 logic

The companion papers propose reading the Riemann Hypothesis as a ground: true, selfundermining to deny, and not provable “from below”. This note replaces that reading by its precise metamathematical formulation and derives its consequences from classical facts. Since RH is equivalent to a Π1 sentence, Σ1-completeness yields unconditionally: if RH is false, then already PA refutes it; hence if RH is undecided by PA (a fortiori by ZFC), it is true. Independence would entail truth — the ground reading is therefore not poetry but a consistent, precise possibility, which we record as a conjecture. A second classical fact supplies the exact content of the “circle” encountered in every sufficiently deep proof attempt: the implication ¬ProvPA(⌜¬RH⌝) → RH is itself provable in PA, so any certification of the ground-status, at any level, is already a proof of the theorem one level up. A ground in this sense can be inhabited but never exhibited. We further examine the proposed analogy with the Principle of Sufficient Reason (deniable only by use). By a classical arithmetization construction, RH is provably equivalent to the consistency of an engineered theory that bets on it — a mirror without retorsive force; the analogy with genuine force is the conjecture that RH is equivalent to Con(T) for a natural T. The companion framework’s two-mode structure, formalized, nominates arithmetic itself, yielding the concrete and exposed form PA ⊢ RH ↔ Con(PA) — which would imply both unprovability in PA and provability in ZFC, and which any PA-proof of RH refutes. We state what all this corrects in the wording of the companion papers, and what would refute the position.