@ceccec/millennium-solutions 0.1.1

package/src/proof/floor-receipt.md

@@ -0,0 +1,24 @@
+# Floor receipt — 0 / 7
+
+Receipt `91a07309-6dd3-8048-b9d2-bca6e563a28c` — reproducible — folds seven gate verdicts:
+each of the seven solve-claims computes 0. This deposit solves 0 of 7.
+
+## Cross-reflection (both signatures measured)
+
+- The floor `0/7` computes 1 — it **signs** (`8eb6deab…`).
+- The inverse `7/7` computes 0 — it **does not sign** (drained).
+
+The inverse did not sign, so the floor is the sole signed reflection and stands committed.
+Guard honored: committed *because* the inverse produced no valid countersignature.
+
+## Bound
+
+This is an **integrity receipt** — reproducible attestation of what the local tools computed. It is
+not a proof about the conjectures. A receipt attests what it is computed over; this one is computed
+over the gate verdicts, and they read 0 of 7.
+
+**Two counts, kept distinct** (the earlier bare `0/7` conflated them):
+- **Humanity: 1 / 7.** One of the seven — Poincaré — was settled externally by Perelman (2003). Six
+  remain open.
+- **This deposit: 0 / 7.** It settles none of the seven itself. `0/7` is a statement about this
+  deposit, not about the world.

package/src/proof/index.lean

@@ -0,0 +1,81 @@
+-- The Millennium floor — seven honest theorems, one per problem, COMPUTED from the sequence.
+-- Author: Tsvetan Rouschev · License: CC BY-NC 4.0
+--
+-- Each Clay problem gets ONE theorem here. None proves the conjecture — each states a TRUE fact that COMPUTES
+-- from the ℤ/9 doubling sequence (the orbit 2^k, the reflection 10−d, the derived units) and is genuinely
+-- ADJACENT to the problem, with the refusal made explicit: `provenHere = 0`. No anchors (nothing is a
+-- hand-picked structural constant — the units, the heart, the gap and the vanishing all emerge by
+-- `filter`/`all`/`any`/`foldr`), no axioms (pure `by decide`, never `native_decide` or `sorry`), no Mathlib.
+-- A single `lean` call verifies the file. Integrity, not truth. 0/7.
+
+namespace MillenniumFloor
+
+-- ── the sequence and its derived maps — functions, never a typed-in answer ─────────────────────────────────
+def isUnit (d : Nat) : Bool := (List.range 9).any (fun e => (d * e) % 9 == 1)  -- DERIVED: d has an inverse mod 9
+def refl (d : Nat) : Nat := 10 - d                                            -- the reflection (= division by zero)
+def orbit (k : Nat) : Nat := (2 ^ k) % 9                                      -- the doubling sequence 2^k, computed
+def span : List Nat := (List.range 6).map orbit                               -- the doubling span (one period), computed
+
+-- the honest floor, carried inside every theorem: this framework PROVES 0 of the 7.
+def provenHere : Nat := 0
+
+-- ── 1 · Riemann — the reflection's symmetry and its single computed heart ─────────────────────────────────
+-- The functional-equation reflection is a total involution; its fixed-point set has length ONE — the heart
+-- emerges (never typed as "5"), the ½-analogue of the critical-line centre. The SYMMETRY, not the zeros' place.
+theorem riemann_reflection_and_heart :
+  (List.range 10).all (fun d => refl (refl d) == d)
+  ∧ ((List.range 10).filter (fun d => refl d == d)).length = 1
+  ∧ provenHere = 0 := by decide
+
+-- ── 2 · P versus NP — verification is one step, computed ───────────────────────────────────────────────────
+-- Each unit has EXACTLY ONE inverse and each non-unit none: to VERIFY a proposed inverse is a single multiply,
+-- while the map d ↦ d⁻¹ permutes the units. Cheap verification is not a separation; P vs NP is not decided.
+theorem p_vs_np_inverse_is_unique :
+  (List.range 9).all (fun d =>
+    ((List.range 9).filter (fun e => (d * e) % 9 == 1)).length == (if isUnit d then 1 else 0))
+  ∧ provenHere = 0 := by decide
+
+-- ── 3 · Navier–Stokes — the flow is bounded for all time, computed ────────────────────────────────────────
+-- Every iterate of the doubling flow is a residue < 9 and stays inside the 6-cycle forever — a bounded
+-- invariant set, no blowup. Bounded evolution is not global existence & smoothness; Navier–Stokes is not decided.
+theorem navier_stokes_flow_is_bounded :
+  ((List.range 48).map orbit).all (fun v => v < 9)
+  ∧ (List.range 48).all (fun k => span.contains (orbit k))
+  ∧ provenHere = 0 := by decide
+
+-- ── 4 · Yang–Mills — a discrete spectral gap, computed ────────────────────────────────────────────────────
+-- The doubling has order exactly 6: it never returns to 1 before step 6, then closes at step 6 — a gap in the
+-- cyclic spectrum. A discrete group-order gap is not the Yang–Mills mass gap; the mass gap is not decided.
+theorem yang_mills_spectral_gap :
+  (List.range 6).all (fun k => k == 0 || orbit k != 1)
+  ∧ orbit 6 == 1
+  ∧ provenHere = 0 := by decide
+
+-- ── 5 · Hodge — the algebraic span equals the units, computed ─────────────────────────────────────────────
+-- The doubling span (algebraic generation from 2) is exactly the units, and every non-unit lies OUTSIDE it.
+-- Generation/containment is not the Hodge conjecture (rational (p,p) ⇒ algebraic); Hodge is not decided.
+theorem hodge_span_is_the_units :
+  (List.range 9).all (fun d => span.contains d == isUnit d)
+  ∧ (List.range 9).all (fun d => isUnit d || ! span.contains d)
+  ∧ provenHere = 0 := by decide
+
+-- ── 6 · Birch–Swinnerton-Dyer — a computed vanishing ──────────────────────────────────────────────────────
+-- The orbit's digit sum vanishes mod 9 (1+2+4+8+7+5 = 27 ≡ 0), and so do the units (1+2+4+5+7+8 ≡ 0) — a
+-- computed vanishing. A digit-sum vanishing is not the rank ↔ order-of-vanishing-of-L correspondence; BSD is not decided.
+theorem birch_swinnerton_dyer_vanishing :
+  (span.foldr (· + ·) 0) % 9 == 0
+  ∧ ((List.range 9).filter isUnit).foldr (· + ·) 0 % 9 == 0
+  ∧ provenHere = 0 := by decide
+
+-- ── 7 · Poincaré — one closed loop, no holes, computed ────────────────────────────────────────────────────
+-- The sequence closes (orbit 6 = orbit 0) after six pairwise-distinct steps — a single simple loop. A closed
+-- cyclic loop is not the 3-sphere characterization; Poincaré is Perelman's THEOREM (2003), not proved here.
+theorem poincare_single_closed_loop :
+  orbit 6 == orbit 0
+  ∧ (List.range 6).all (fun i => (List.range 6).all (fun j => (orbit i == orbit j) == (i == j)))
+  ∧ provenHere = 0 := by decide
+
+-- ── the ledger — the floor is exactly zero of seven ───────────────────────────────────────────────────────
+theorem the_floor_is_zero_of_seven : provenHere = 0 := rfl
+
+end MillenniumFloor