v0.11.0 — the order ≤ on constructive ℝ (foundation for the transcendentals)
v0.11.0 — the order ≤ on constructive ℝ
The foundation every transcendental (exp, cos/sin, log) rests on, built the Bishop way (F1Square/Analysis/ROrder.lean):
x ≤ y :⟺ ∀ n, xₙ ≤ yₙ + 2/(n+1).
- Order laws:
Rle_refl,Rle_of_Req(≈ ⟹ ≤),Rle_antisymm(x ≤ yandy ≤ x⟹x ≈ y), andRle_trans— the one genuine limiting step: chainingx ≤ y ≤ zthrough an auxiliary indexmgivesxₙ ≤ zₙ + 2/(n+1) + 6/(m+1)for everym, and the generalized Archimedean lemmaQarch_genkills the6/(m+1)tail (the argument behindReq_trans). Rnonnegcanonicalized (Bishopx ≥ 0), withRle_zero_of_Rnonneg. New ℚ signed-bound helpers;Qle_self_add/Qle_add_selfmoved toQOrder.- Honesty gate hardened to fail on duplicate proof-layer theorem short-names; coverage 288/288, enforced. Pure Lean 4, no Mathlib, no
sorry; axiom-clean and choice-free; CI machine-verified green.
Concrete remaining sequence (no open +)
- v0.12.0 — reciprocal
Rinv+expon ℝ (real powers, realexpon[0,1]via completeness, then halving/squaring). - v0.13.0 —
cos/sin(alternating-series sandwich) +log(positivity-as-data + artanh). - then the next phase — ζ's continuation into the critical strip (needs complex exp/log), the genuine
λₙrealizing the v0.10.0 interfaces, and the explicit-formula trace, which ends atλₙ > 0 ∀n= RH (the open frontier).
RH remains open (June 2026); no 𝔽₁-square construction exists. The crux is never asserted.
🤖 Generated with Claude Code