Session 3 — Project kickoff: RH blueprint, staged workflow + archive design

{
  "questions": [
    {
      "question": "What format for the research paper draft?",
      "header": "Paper format",
      "options": [
        {
          "label": "LaTeX (Recommended)",
          "description": "Standard for math journals; compiles to PDF; arXiv-ready. I write and maintain the .tex source."
        },
        {
          "label": "Markdown + math",
          "description": "Simpler, readable in any editor; converted to PDF/LaTeX later via pandoc."
        },
        {
          "label": "Both",
          "description": "Draft in Markdown notes, assemble final LaTeX when paper shape is clear."
        }
      ]
    },
    {
      "question": "Should I initialize a git repository for version control of the archive?",
      "header": "Versioning",
      "options": [
        {
          "label": "Yes, local git (Recommended)",
          "description": "Full history, nothing lost even if a file is accidentally overwritten. Local only, nothing pushed anywhere."
        },
        {
          "label": "No",
          "description": "Plain files only; rely on careful session-end saves."
        }
      ]
    },
    {
      "question": "Storage format for numerical experiment outputs?",
      "header": "Data format",
      "options": [
        {
          "label": "CSV + JSON metadata (Recommended)",
          "description": "Human-readable tables with a small JSON sidecar recording script version, parameters, and timestamp."
        },
        {
          "label": "JSON only",
          "description": "Everything in structured JSON files."
        },
        {
          "label": "SQLite database",
          "description": "Queryable single-file DB; less transparent but efficient for large zero datasets."
        }
      ]
    }
  ]
}

User has answered your questions: "What format for the research paper draft?"="LaTeX (Recommended)", "Should I initialize a git repository for version control of the archive?"="Yes, local git (Recommended)", "Storage format for numerical experiment outputs?"="CSV + JSON metadata (Recommended)". You can now continue with the user's answers in mind.

{
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md"
}

{
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "## 8. SESSION LOG\n- Session 001: Project initialized from blueprint. \u2192 Begin Phase 0.",
  "new_string": "## 8. SESSION PROTOCOL & RESEARCH ARCHIVE (MANDATORY)\n\nMulti-stage project: computer is shut down between stages. NOTHING may live\nonly in conversation. The archive below is the single source of truth.\n\n### 8.1 Archive map\n```\nSTATE.md                    \u2b50 resume point \u2014 READ FIRST every session\nresearch/\n\u251c\u2500\u2500 journal/session-NNN.md  per-session narrative log\n\u251c\u2500\u2500 results/R-NNN-*.md      one file per result (+ index.md ledger)\n\u251c\u2500\u2500 graveyard/G-NNN-*.md    one file per dead end (+ index.md)\n\u251c\u2500\u2500 derivations/D-NNN-*.md  worked derivations (+ index.md)\n\u251c\u2500\u2500 numerics/scripts/       deterministic experiment scripts\n\u251c\u2500\u2500 numerics/data/          E-NNN-*.csv + E-NNN-*.json metadata sidecars\n\u251c\u2500\u2500 research.db             SQLite catalog (sessions, results, graveyard,\n\u2502                           derivations, experiments) \u2014 schema in\n\u2502                           numerics/scripts/schema.sql, CLI: db.py\n\u2514\u2500\u2500 paper/draft.tex         living LaTeX paper + references.bib\n```\n\n### 8.2 Storage conventions\n- Results/derivations/graveyard: plain Markdown, honesty tag on every claim.\n- Numerics: DUAL storage \u2014 CSV+JSON sidecar (human/paper-readable) AND\n  SQLite registration (queryable), written together via db.py.\n- Data is cached; scripts never recompute unless --force.\n- Paper assembled only from tagged files in results/.\n\n### 8.3 Session START protocol\n1. Read STATE.md \u2192 resume point, next action, open threads, blockers.\n2. Skim latest journal entry + results/index.md.\n\n### 8.4 Session END protocol (before any shutdown \u2014 no exceptions)\n1. Write journal/session-NNN.md (work, decisions, outcomes).\n2. File every result/dead end/derivation in its own file; update index.md\n   files; register in research.db.\n3. Update NGUYEN.md checklist (\u00a75), Graveyard (\u00a76), Result Ledger (\u00a77).\n4. Update STATE.md LAST with an explicit \"NEXT ACTION:\" line.\n5. git add + commit with session number in the message.\nNOTE: save artifacts IMMEDIATELY when produced (crash-safe), not batched.\n\n### 8.5 SESSION LOG (summary; details in research/journal/)\n- Session 001 (2026-08-17): Blueprint + mission prompt ingested; research\n  archive installed (git + SQLite + LaTeX skeleton). \u2192 Begin Phase 0."
}

{
  "filePath": "D:\\Python\\Quantum\\research\\paper\\paperA.tex",
  "oldString": "harness (Anthropic), over an archived series of research sessions\n(project ledger: sessions 001--041).",
  "newString": "harness (Anthropic), over an archived series of research sessions\n(project ledger: sessions 001--044).",
  "originalFile": "% ============================================================\n% NGUYEN-RH-1 \u2014 PAPER A (split 2026-08-20, session 013, from draft.tex)\n% An explicit finite-height Li-positivity theorem, machine-verified.\n% Self-contained artifact per the session-012-end-notes review:\n% \u00a73.1 + Appendices A.1/B of the combined draft, retargeted.\n% The spectral-line material lives in paperB.tex (in preparation).\n% ============================================================\n\\documentclass[11pt]{article}\n\\usepackage{amsmath,amssymb,amsthm,mathtools}\n\\usepackage{microtype}\n\\usepackage[colorlinks=true,linkcolor=blue,citecolor=blue]{hyperref}\n\n% The prose is dense with unhyphenatable compounds (Li-positivity,\n% [proved, ...] tags). Give TeX room to spread the slack instead of\n% running past the right margin.\n\\emergencystretch=2em\n\n\\newtheorem{theorem}{Theorem}\n\\newtheorem{lemma}[theorem]{Lemma}\n\\newtheorem{corollary}[theorem]{Corollary}\n\\theoremstyle{definition}\n\\newtheorem{definition}[theorem]{Definition}\n\\theoremstyle{remark}\n\\newtheorem{remark}[theorem]{Remark}\n\n\\title{An explicit finite-height Li-positivity theorem\\\\\nwith a machine-verified assembly\\thanks{This work was produced with\nsubstantial machine assistance; see the AI Contribution Statement.}}\n\\author{Dan T Nguyen\\thanks{Independent researcher}}\n\\date{Started: 2026-08-17; revised 2026-08-26}\n\n\\begin{document}\n\\maketitle\n\n\\begin{abstract}\n[proved, conditional on computation] The Keiper--Li coefficients of the\nRiemann $\\xi$-function satisfy $\\lambda_n > 0$ for all\n$1 \\le n \\le (T_0-1)^2 \\approx 9\\times10^{24}$, conditional on the\ninterval-arithmetic verification of RH to height $T_0 = 3\\times10^{12}$\n(Platt--Trudgian) and on finite Li-coefficient computations\n(Johansson's rigorous table to $10^5$ and this project's to $3000$),\nwith every constant traced. We have found no previous explicit assembly\nof this chain in the literature; by Voros's sharpening, positivity of\nall sufficiently large $\\lambda_n$ would itself imply RH, so no result\nshort of RH can assert an infinite positive tail. Moreover the full\nreduction is machine-verified in Lean~4 (package \\texttt{NguyenRH1}):\nthe theorem is proved from exactly seven explicit perimeter inputs,\nitemized with provenance in Appendix~B --- three explicit\nzero-counting bounds derived from Rosser's Riemann--von Mangoldt\nerror bound and four\ncomputational certificates\n(the Platt--Trudgian RH verification, Johansson's rigorous\nKeiper-coefficient table to $10^5$ transferred to the Li normalization,\na zero-location certificate for the low zeros, and one short-segment\ninterval constant) --- with the traced contour bound\n$|S_f(n)| \\le B(n)$ on $10^5 \\le n \\le (T_0-1)^2$ itself machine-proved\nfrom six of the seven (all but the Li table), and with axiom profile\nexactly the three standard\naxioms (\\texttt{propext}, \\texttt{Classical.choice},\n\\texttt{Quot.sound}) and no \\texttt{sorry} anywhere in the\ndevelopment's Li chain.\n\\end{abstract}\n\n\\section{Introduction}\n\nThe Riemann hypothesis (RH) asserts that every nontrivial zero of\n$\\zeta(s)$ has real part $1/2$. The strongest unconditional density\nresult to date is the (machine-verified) theorem that at least $2/3$\nof the nontrivial zeros are simple and on the critical line, and at\nleast $5/6$ of the zeros in a given range are distinct\n\\cite{anthropic2026riemann}; the underlying certificate method has a\ndocumented bandwidth-one ceiling near $0.682$ of the zeros. Two\nclassical reformulations frame most modern attacks: \\emph{Weil\npositivity} --- positivity of the Weil quadratic form on all of\n$C_c^2(\\mathbb R)$ is equivalent to RH \\cite{weil1952fonctions,\nbombieri2000weil}, and the negative index of its truncations counts\noff-line zero pairs \\cite{bombieri2000weil} --- and \\emph{Li's\ncriterion} --- $\\lambda_n > 0$ for all $n$ is equivalent to RH\n\\cite{li1997, bombieri1999lagarias}, with Voros's sharpening that\npositivity of any tail $\\{\\lambda_n\\}_{n \\ge N_0}$ already implies RH\n\\cite{voros2006sharpenings}.\n\nThis paper reports one theorem-level outcome of a systematic research\nprogram on RH: an explicit finite-height Li-positivity theorem,\nassembled with every constant traced, and with its full reduction ---\nincluding the contour estimate --- machine-verified in Lean~4 modulo a\ndeclared perimeter (computational certificates and explicit\nzero-counting bounds). A companion note (in preparation)\ncovers the spectral-line results of the same program (an exact\nfactorization on Suzuki's operator line and a valley theorem for the\nassociated model spaces). Every claim carries an explicit correctness\ntag, and every project-generated numerical input is produced by a\ndeterministic, archived script.\n\n\\begin{theorem}[R-004; conditional on computation]\n\\label{thm:finite-height-li-intro}\nAssume (i) the Riemann hypothesis verified to height\n$T_0 = 3\\times 10^{12}$ (Platt--Trudgian \\cite{platt2021riemann},\ninterval arithmetic), and (ii) $\\lambda_n > 0$ for all $n \\le 10^5$\n(finite computation; Section~3, Step~5). Then the Keiper--Li\ncoefficients satisfy\n$\\lambda_n > 0$ for all $1 \\le n \\le (T_0-1)^2 \\approx 9\\times10^{24}$.\n\\end{theorem}\n\nBy Voros's sharpening, eventual positivity of all sufficiently large\n$\\lambda_n$ would itself imply RH, so a result short of RH cannot\nassert an infinite positive tail; an explicit finite-height statement\nis the natural form of partial progress on this route. The statement\nhas an unpublished precursor: Voros \\cite{voros2017li} reports an\nunpublished result of Oesterl\u00e9 \\cite{oesterle2000} that RH to height\n$T_0$ implies $\\lambda_n \\ge 0$ for $n \\le T_0^2$ (the typescript is\nuncirculated; we rely on Voros's citation and have not independently\nverified it). A published weaker form is Lagarias's window with a\n$\\log^2$ denominator (Remark~(i)). The novelty claimed here is not the\n$T^2$ scale itself but the explicit, fully constant-traced,\n\\emph{strict}-positivity assembly --- Lagarias's contour argument\n\\cite{lagarias2007li} with Rosser's explicit Riemann--von Mangoldt\nerror bound \\cite[Thm~19]{rosser1941}, an elementary archimedean\nlower bound, a proved\nmargin convexity, the dog-leg repair of Section~\\ref{subsec:dogleg},\nand the finite verifications --- and its machine verification; that\nassembly we have found nowhere else in the literature.\n\nSection~2 recalls the certificate-method background and the sanity\ngate. Section~3 states and proves the theorem. Section~4 collects the\nobstruction analysis delimiting the method. Appendix~A describes the\nnumerical machinery; Appendix~B the formal-verification status.\n\n\\section{Background: the Weil-form certificate method}\n\nWe recall, in one paragraph, the machinery behind the state-of-the-art\ndensity theorem \\cite{anthropic2026riemann} --- the launchpad of this\nproject and the sanity gate for everything below; details follow that\npaper, and a companion note (in preparation) covers this project's own\nwork on that line. The Weil explicit formula \\cite{weil1952fonctions}\nexpresses, for a bandwidth-one test function, a quadratic form on the\nzeros as a functional of the primes; compressing it via a Gabor frame\nat the critical density yields a finite matrix identity\n$\\tilde G = P + Q$, with the prime side computed unconditionally from\nMontgomery's second moment \\cite{montgomery1973pair}. A rank--trace\ninequality converts that input into a lower bound on the number of\nsimple on-line zeros in a window, whose strength is governed by a\nwindow ratio $R(\\psi)$: $2 - R(\\psi)$ certifies $0.6725$ of zeros\nsimple and on the line and $0.83625$ distinct, and a sharpness analysis\nlocates the bandwidth-one ceiling of the method at $\\approx 0.682$ with\nstructural obstructions beyond (Section~4). One feature of this\nmachinery matters here: the certificate fails, as it must, for the\nDavenport--Heilbronn and Epstein zeta functions (which violate the\nRH-analogue); the main theorem of this paper has been required to pass\nthis gate structurally (project file D-053).\n\n\\section{The finite-height Li theorem (R-004)}\n\nLet $\\lambda_n = \\sum_{\\rho}{}'\\,\\bigl[1-\\bigl(1-\\tfrac1\\rho\\bigr)^n\\bigr]$\nbe the Keiper--Li coefficients of the Riemann $\\xi$-function. Li's\ncriterion states $\\lambda_n > 0$ for all $n \\geq 1$ if and only if the\nRiemann hypothesis holds \\cite{li1997,bombieri1999lagarias}. Voros\n\\cite{voros2006sharpenings} showed that ``$\\lambda_n > 0$ for all\n$n \\geq N_0$'' is already equivalent to RH for any $N_0$: eventual\npositivity of all sufficiently large $\\lambda_n$ would itself imply RH,\nso a result short of RH cannot assert an infinite positive tail. The\nnatural partial statement on this route is an \\emph{explicit\nfinite-height} one.\n\n\\begin{theorem}[R-004; conditional on computation]\n\\label{thm:finite-height-li}\nAssume (i) the Riemann hypothesis verified to height\n$T_0 = 3\\times 10^{12}$ (Platt--Trudgian \\cite{platt2021riemann},\ninterval arithmetic), and (ii) $\\lambda_n > 0$ for all $n \\le 10^5$\n(finite computation; Step~5). Then\n\\[\n\\lambda_n > 0 \\qquad \\text{for all } 1 \\le n \\le N_1 := (T_0-1)^2\n\\approx 9.0\\times 10^{24},\n\\]\nwith $N_1 = 8\\,999\\,999\\,999\\,994\\,000\\,000\\,000\\,001$ exactly.\nThe formal reduction of this statement is subject to exactly seven\nexplicit perimeter inputs, itemized with provenance in\nAppendix~\\ref{app:formal}.\n\\end{theorem}\n\nThe two assumptions displayed are the two principal computational\ninputs appearing in the headline statement.\nThe formal theorem consumes five further explicit perimeter inputs ---\nzero-counting bounds, a zero-location certificate, and one interval\nconstant --- which are established published results or stand-alone\ncertificates, instantiated with provenance in Appendix~B; they enter as\nhypotheses of the Lean reduction, not as additional conjectural\nassumptions.\n\n\\begin{proof}[Proof sketch (full assembly: D-037)]\nBombieri--Lagarias \\cite{bombieri1999lagarias} give\n$\\lambda_n = S_\\infty(n) - S_f(n) + 1$ with $S_\\infty$ the archimedean\nand $S_f$ the finite-place contribution.\n\n\\emph{Step 1 (archimedean lower bound).} From Lagarias's formula\n\\cite[(4.11)]{lagarias2007li},\n$S_\\infty(n) = \\sum_{j=1}^n (-1)^j \\binom{n}{j} a_j$ with\n$a_1 = (\\log 4\\pi + \\gamma)/2$ and $a_j = (1-2^{-j})\\zeta(j)\n= \\sum_{m \\text{ odd}} m^{-j}$ ($j \\ge 2$), the $j$-sum is a finite\ndifference and one obtains the \\emph{exact} identity\n$S_\\infty(n) = (1-a_1)n - 1 + \\sum_{m \\ge 3,\\, m \\text{ odd}}\n\\bigl[(1-\\tfrac1m)^n - 1 + \\tfrac{n}{m}\\bigr]$.\nBernoulli's inequality and the explicit harmonic bounds\n$\\log M + \\gamma + \\tfrac{1}{2M} - \\tfrac{1}{12M^2} \\le H_M \\le\n\\log M + \\gamma + \\tfrac{1}{2M}$ give, for $n \\ge 20$,\n\\[\nS_\\infty(n) \\;\\ge\\; \\tfrac12 n\\log n + (C_1 - \\tfrac{\\gamma}{2})\\,n - 4,\n\\qquad C_1 = \\tfrac{\\gamma - 1 - \\log 2\\pi}{2}.\n\\]\n(Machine-validated against exact values for $20 \\le n \\le 5000$.)\n\n\\emph{Step 2 (finite-part upper bound).} Tracing Lagarias's contour\nargument \\cite[Thm~6.1]{lagarias2007li} with explicit constants\n(Rosser's explicit Riemann--von Mangoldt error bound\n$|N(T) - P(T)| \\le 0.137\\log T + 0.443\\log\\log T + 1.588$ for\n$T \\ge 1467$, where $P(T) = \\frac{T}{2\\pi}\\log\\frac{T}{2\\pi e} +\n\\frac78$ \\cite[Thm~19]{rosser1941}, and the finite-range verifications\n$|S(T)| \\le 1$ for $T \\le 280$ and $|S(T)| \\le 2$ for\n$T \\le 6.8\\times10^6$ \\cite[Eq.~(1.2)]{trudgian2014ii}, partial\nfractions for $\\zeta'/\\zeta$ with the reference-point estimate\n$|R(s)| \\le 10.5\\log(|t|{+}2) + 48$ for $-5/2 \\le \\sigma \\le 3$,\n$|t| \\ge 10$ (D-056), kernel bounds $e^4+1$, a measured\nshort-segment constant $M_0 = 1.3352$) gives\n$|S_f(n)| \\le B(n)$ with\n\\[\n\\begin{split}\nB(n) =\\;& 4F(T_n) + 4T_n\\bigl[\\tfrac23 Z_2(T_n) + 10.5\\log(T_n{+}2) + 48\\bigr] \\\\\n& + 40M_0 + 2(e^4{+}1)\\,7H(T_n) + 2\\,\\mathrm{DL}(n) + I_{\\mathrm{Maj}}(n) + 1.\n\\end{split}\n\\]\nHere $T_n := \\sqrt n + 1$ is a deterministic majorant height: the\ncontour itself runs at a zero-avoiding height $\\tau_n \\in [\\sqrt n,\n\\sqrt n + 1]$, chosen by a pigeonhole on the unit-window zero count\nwith ordinate clearance $\\ge 1/(9C_0(\\sqrt n + 2))$\n(\\texttt{exists\\_zero\\_avoiding\\_T\\_wide}), and every majorant, being\nnondecreasing in the height, is evaluated at $T_n$. Further, $F$ is the\nhonest zero-count majorant (the formal\ndevelopment's mildly enlarged $F + S_b$ shape), $Z_2(t)$ the explicit\ntwo-unit-interval zero count (including the $\\log\\log$ term),\n$H(T) = 3C_0(T)^2 + 10.5\\log(T{+}2) + 48$ with $C_0$ the unit-interval\ncount, $\\mathrm{DL}(n) = \\tfrac{\\sqrt n+1}{4}(e^{5/2}+1) + 8.38 +\n\\tfrac14 I_{\\mathrm{Maj}}(n)$ the zero-free dog-leg charge for the\nright tail, $I_{\\mathrm{Maj}}(n) = 2(\\sqrt n+1)(e^{\\sqrt n/2}+1)\\cdot\n0.57\\cdot 2^{-(2\\sqrt n-2)}$ the right-vertical majorant, and the\nfinal $1$ the trivial-zero contribution.\\footnote{\\emph{Correction\nnote} (D-071 with E-034): three further adjustments to this $B(n)$\naccount were made during the machine closure of Step 2, and the\ndisplayed formula is the corrected one; the theorem statement is\nunaffected. (i) The bridge is $4F$, not $2N$: the residue sum runs\nover both signs of $\\gamma$ (a factor-2 accounting slip in the first\ntracing). (ii) The left-vertical near-sum charges the two-unit count\n$Z_2$ (its window $|\\gamma - T| \\le 1$ spans two unit intervals), not\nthe unit-interval $C_0$. (iii) The right-vertical kernel is charged\nhonestly as $e^{1/3} I_{\\mathrm{Maj}}(n)$ (the uniform bound is\n$e^{\\sqrt n/2+1/3}+1$), the factor $e^{1/3} \\le 1.4$ being absorbed by\nthe $2\\pi$ normalization of the residue theorem. The fourth and most\nsubstantive correction --- the repair of the right-horizontal estimate\n--- is Section~\\ref{subsec:dogleg}. All are machine-verified in\n\\texttt{NguyenRH1}.}\n\n\\emph{Step 3 (bridge).} For $n \\le (T_0-1)^2$ we have\n$\\tau_n \\le \\sqrt n + 1 \\le T_0$, so by assumption~(i) every zero with\n$|\\gamma| \\le \\tau_n$ is on the line; hence\n$|1-(1-1/\\rho)^n| \\le 2$ per zero and\n$|\\lambda_n(\\tau_n)| \\le 4F(T_n)$ (the residue sum runs over both signs\nof $\\gamma$, the count majorized at $T_n$); all other contour terms are\nindependent of the finite-height RH assumption.\n\n\\emph{Step 4 (margin).}\n$\\mathrm{margin}(n) := \\tfrac12 n\\log n + (C_1 - \\gamma/2)n - 4 - B(n) + 1$\nis convex for $n \\ge 20$ (proved: chain-rule reduction to eleven\none-variable sign conditions, each discharged elementarily \u2014 D-057),\nand $\\mathrm{margin}(8\\times 10^4) = 13\\,160 > 0$ with\n$\\mathrm{margin}(10^5) = 88\\,911 > \\mathrm{margin}(8\\times 10^4)$; by convexity\n(secant slopes increase) hence\n$\\mathrm{margin}(n) > 0$ for all $n \\in [10^5, N_1]$\\footnote{The\nmargin value at $8\\times10^4$ has a documented trail: $16\\,020$ with\nthe $F + S_b$ zero-count majorant (E-028); $15\\,764$ with the\nmildly enlarged majorant --- a\nnegative-weight term of $F + S_b$ dropped so that every convexity\nblock has provably negative $\\psi$ (the true majorant's $\\psi$ crosses\nzero near $T \\approx 16$), at a traced cost of $\\approx 0.9\\sqrt n$;\n$14\\,682$ after the honest-$B(n)$ corrections (i)--(ii) of the Step-2\nfootnote (the $4F$ bridge and the two-unit count $Z_2$); and\n$13\\,160$ after the dog-leg repair of Section~\\ref{subsec:dogleg}\n(E-034). The machine discharge consumes certified rational interval\nbounds instead: $B(8{\\cdot}10^4) \\le 332\\,000$ and\n$S_\\infty(8{\\cdot}10^4) \\ge 336\\,000$, i.e.\\\n$\\mathrm{margin}(8\\times10^4) \\ge 4\\,001$, together with the direct\ncomparison $\\mathrm{margin}(10^5) > \\mathrm{margin}(8\\times10^4)$\n(\\texttt{NguyenRH1}, \\texttt{marginTilde\\_FAlt\\_80000\\_pos},\n\\texttt{marginTilde\\_FAlt\\_80000\\_lt\\_100000}).}\n(also computed to $n = 4\\times10^5$ on a unit grid and to $N_1$ on a\nlogarithmic grid; $\\mathrm{margin}(N_1) = 2.458\\times 10^{26}$).\n\n\\emph{Step 5 (finite verification; the declared certificate\n\\texttt{LiVerifiedUpTo($10^5$)}).} The base range $n < 10^5$ is covered\nby rigorous high-precision computation of the ordinary Keiper--Li\ncoefficients. A normalization remark is required here. Johansson\n\\cite{johansson2015} tabulates the \\emph{Keiper} normalization,\ndefined by\n\\[\n\\log\\xi\\!\\left(\\frac1{1-x}\\right)\n= -\\log 2 + \\sum_{n \\ge 1} \\kappa_n x^n,\n\\]\nwhich differs from the Li normalization $\\lambda_n$ used in this paper\nby the positive factor\n\\[\n\\lambda_n = n\\,\\kappa_n \\qquad (n \\ge 1)\n\\]\n(the Keiper--Li relation: equate coefficients in\n$x\\,\\frac{d}{dx}\\log\\xi(1/(1-x))$ and use the\nsymmetry $\\rho \\leftrightarrow 1-\\rho$ of the zero set; cf.\\\n\\cite[Eq.~(12)]{voros2017li}), so positivity\nis identical in the two conventions. Johansson's table\n(interval-arithmetic error bounds throughout) gives\n$\\kappa_1, \\dots, \\kappa_{100000}$ all positive, matching the\nRH-true asymptotic, with $\\kappa_{100000} = 4.6258\\ldots$ certified\nto $\\sim 2900$ digits --- i.e.\\ $\\lambda_{100000} =\n10^5\\,\\kappa_{100000} \\approx 462\\,580.78$ in the present\nnormalization. Independently, this project verifies $\\lambda_n > 0$\nfor all $n \\le 3000$ in the Li normalization (two methods --- the\narithmetic side via Bombieri--Lagarias\nThm~2 and the zero side --- agreeing to $4.8\\times10^{-25}$ relative,\nand $\\lambda_1$ agreeing with its closed form to better than $10^{-28}$\nrelative). The crossover $N_0 = 8\\times 10^4$ is covered by a factor\n$1.25$.\\footnote{An earlier draft cited Voros's discretized Keiper--Li\ncomputations \\cite{voros2017li} (with Misguich) for this range; those\nconcern Voros's \\emph{deformed} sequence $\\Lambda_n$ (his notation),\nnot the ordinary coefficients, and the citation has been replaced by\nJohansson's rigorous table of the ordinary coefficients (in the Keiper\nnormalization above).}\n\\end{proof}\n\n\\subsection{Repair of the right-horizontal estimate}\n\\label{subsec:dogleg}\n\nThe geometric-decrease conclusion following\n\\cite[(6.12)]{lagarias2007li} is not implied by the displayed bounds\nwhen $T \\asymp \\sqrt n$: the per-step majorant ratio there is $e/2 > 1$\n(the zeta factor halves per unit step while the kernel ratio is $\\le e$),\nso the right-tail envelope grows like $e^{0.066\\sqrt n}$ rather than\ndecreasing ($\\sim 6\\times 10^{10}$ at $n = 10^5$ measured; E-031). In\nthe zeta specialization we replace this step by the following zero-free\ncontour deformation (D-073/D-074).\n\nKeep the residue cut at the actual contour height\n$\\tau_n \\in [\\sqrt n, \\sqrt n + 1]$ (so the bridge and the endpoint\n$N_1 = (T_0-1)^2$ are untouched) and deform only the right horizontal\nsegment $[3, 2\\sqrt n]$ at height $\\tau_n$ into a \\emph{dog-leg}: lift\nvertically from $3 + i\\tau_n$ to $3 + iU_n$ with\n$U_n := \\tfrac32\\,\\tau_n$ (the\nleft vertical), traverse horizontally at height $U_n$ (the high\nsegment), and drop back at $2\\sqrt n$ (the right vertical). The\nrectangle this traverses lies entirely in $\\Re w \\ge 3$, where $\\zeta$\nis zero-free and pole-free \\emph{unconditionally}, so Cauchy's theorem\ngives the exact identity\n\\[\nH_{\\mathrm{low}} \\;=\\; H_{\\mathrm{high}} - V_{\\mathrm{right}} +\n  V_{\\mathrm{left}}\n\\]\n(\\texttt{upper\\_right\\_horizontal\\_eq\\_dogleg} in the formal\ndevelopment). Each dog-leg piece has an honest bound, charged at the\nmajorant height $T_n$: the left vertical has length\n$\\tau_n/2 \\le (\\sqrt n + 1)/2$ and\ncontributes $\\le \\tfrac{\\sqrt n + 1}{4}(e^{5/2}+1)$; the high\nsegment contracts geometrically (the repaired stepping ratio\n$q = e^{4/9}/2 < 1$, certified) and contributes $\\le 8.38$; and the\nright vertical is exponentially small, $\\le \\tfrac14 I_{\\mathrm{Maj}}(n)$.\nThe charge replacing the broken ``$3.3$'' is therefore\n$\\mathrm{DL}(n) = \\tfrac{\\sqrt n + 1}{4}(e^{5/2}+1) + 8.38 +\n\\tfrac14 I_{\\mathrm{Maj}}(n)$ per side, with the margin essentially\nunchanged (margins $13\\,160$ / $88\\,911$ / $2.458\\times10^{26}$ at\n$8\\times10^4$ / $10^5$ / $N_1$). We record for completeness that the\nper-side bound at $T = \\sqrt n$ appears to hold empirically by a strong\nhidden cancellation (E-032: true-integral to envelope ratio down to\n$5.6\\times10^{-10}$); whether that cancellation admits a proof is an\nopen question we do not rely on.\n\n\\begin{remark}\n(i) Using Lagarias's printed bridge window $n \\le T^2/(4\\log^2 T)$\ninstead of the traced proof gives the conservative\n$N_1^* = 2.73\\times 10^{21}$; the theorem is robust either way.\n(ii) The traced worst-case bound $|S_f|$ is $\\sim 170\\times$ loose\nagainst the measured curve ($|S_f| \\le 13.52$ for $n \\le 5000$); the\nslack is structural to contour constants, not a gap.\n(iii) The dependence on computation is explicit and checkable:\nPlatt--Trudgian's interval-arithmetic verification of RH\n\\cite{platt2021riemann} and Johansson's rigorous Keiper-coefficient\ntable \\cite{johansson2015}, transferred to the present Li normalization\nvia $\\lambda_n = n\\kappa_n$, supplemented by this project's independent\nverification to $n \\le 3000$ (E-011/E-015).\n\\end{remark}\n\n\\section{Obstruction analysis}\n% Documented dead ends from research/graveyard/ where they\n% delimit the method (contributes to success criterion 4).\n\nThe following routes are closed with documented obstructions\n(full files in the project archive: graveyard G-001--G-003;\nderivations D-009--D-031):\n\\begin{itemize}\n\\item \\emph{Certificate extension past $2/3$ in the bandwidth-one\nframework} (Track A): a six-wall map (D-013) shows $>2/3$ is\nimpossible within the current data class; the window-class optimum is\nsaturated in both the $\\xi$ and $\\xi'$ worlds (D-009, D-030), and\nmoment-ladder certificates cap below $2/3$ at every order (G-002).\n\\item \\emph{Multiple-zero bounds as chain input} (G-001): the\n$s_2/p$ substitution symmetry makes depth$\\to$0 off-line pairs\nindistinguishable from double zeros in all two-moment data.\n\\item \\emph{Density theorems $\\to$ de~Bruijn--Newman $\\Lambda$}\n(G-003): one-sided information \u2014 density theorems lower-bound the\non-line fraction while $\\Lambda$ requires an upper bound on the\ncomplex fraction.\n\\item \\emph{$\\xi^{(k)}$-certificate routes} (T4/T4b, D-022, D-031):\nthe strength mechanism (a perfect-square node in the diagonal law)\ndoes not transfer to $\\xi$, and the $s_2/p$ symmetry caps every\nderivative class below $100\\%$.\n\\end{itemize}\n\n\\appendix\n\\section{Numerical experiments}\n\\label{app:numerics}\n% Tables/figures generated from research/numerics/data/ CSVs.\n\nAll experiments are deterministic scripts with CSV+JSON sidecars in the\nproject archive (\\texttt{research/numerics/}); checks as stated.\n\n\\subsection{Li-coefficient machinery (E-011/E-015/E-021/E-023/E-023b)}\n\\begin{itemize}\n\\item $\\lambda_n > 0$ verified for $n \\le 3000$ in the Li normalization\nof Section~3 from the arithmetic\nside (Bombieri--Lagarias Thm~2, zero-free; \\textsc{flint} Stieltjes +\nArb $\\zeta$, 1000--1450-digit working precision), cross-validated\nagainst the zero-side computation (agreement $4.8\\times10^{-25}$\nrelative) and $\\lambda_1$ agreeing with its closed form to better\nthan $10^{-28}$ relative.\n\\item Exact archimedean part: $S_\\infty(n) = \\tfrac12 n\\log n + C_1 n\n- \\tfrac14 - \\tfrac{1}{24n} + o(1/n)$ measured to $n = 5000$\n($c_0 = -1/4$ identified exactly; residuals match $-1/4 - 1/(24n)$ to\nall printed digits), and $|S_f(n)| \\le 13.52$ for $n \\le 5000$\n(max at $n = 3298$) vs the traced worst-case $\\sim 2280$ there \u2014\nthe contour constants are $\\sim 170\\times$ loose, as documented.\n\\item Margin assembly (E-028, fully traced constants $A = 10.5$,\n$B_0 = 48$): crossover at $n = 75\\,451$; adopted $N_0 = 8\\times10^4$\nwith margin $16\\,020$ and positive derivative ($13\\,160$ with the\nfinal formal-development majorant --- Step-4 footnote); convexity proved\n(D-057) and grid-confirmed to $N_1 \\approx 9\\times10^{24}$;\n$\\mathrm{margin}(N_1) = 2.458\\times10^{26}$. (First-estimate\nconstants $2/2$: crossover $32\\,871$; measured $0.9/1.0$: $30\\,217$.)\n\\end{itemize}\n\n\\section{Formal verification}\n\\label{app:formal}\n\nThe inherited density theorem \\cite{anthropic2026riemann} is formally\nverified in Lean~4 (repository \\texttt{zeta-23-lean}, tag v1.0); this\nproject performed a full \\texttt{lake} rebuild (9010 jobs) and a live\n\\texttt{\\#print axioms} audit of all comparator statements, confirming\nthe published axiom profile verbatim: no axioms beyond \\texttt{propext},\n\\texttt{Classical.choice}, and \\texttt{Quot.sound}, with \\texttt{sorry}\noccurring only in the trusted challenge-statement stubs.\n\nThe new result of this paper is formalized in the companion\npackage \\texttt{NguyenRH1} (same toolchain, path-linked to the vendored\n\\texttt{zeta-23-lean} and its \\textsc{Mathlib} build; no new axioms are\nintroduced anywhere). The first tier is complete: the archimedean lower\nbound for $S_\\infty(n)$ and the margin convexity are machine-proved\n(\\texttt{sInfty\\_lower\\_bound}, \\texttt{marginTilde\\_convex}, and the\nchain-rule identity \\texttt{chain\\_rule\\_sqrt\\_shift}), each with axiom\nprofile exactly the three standard axioms above. A design note on the\nconvexity proof: the pen-and-paper argument uses eleven one-variable\nsign conditions, but the Lean development proves an eight-block\n$\\psi$-table plus a separate analytic bound for the $I_I$ term\n($\\widetilde B_4$); the divergence from the eleven-row table is that\n$\\widetilde B_4$ is not concave, so it is excluded from the $\\psi$\nmachinery and bounded directly. That direct bound is itself a worked\nexample of this project's measured-to-traced conversion: the grid\ncheck of E-029 (maximum $2n\\,|\\widetilde B_4''(n)| = 0.189$ on\n$[20, 10^4]$, with the decay argument covering the tail) is superseded\nby a fully analytic factor-monotonicity proof of the sufficient\ninequality $\\widetilde\\psi''(s) - \\widetilde\\psi'(s)/s \\le 1.316 < 2$\nfor $s \\ge \\sqrt{20}$, i.e.\\ $\\widetilde B_4''(n) < 1/(2n)$ for all\n$n \\ge 20$ (\\texttt{iimaj\\_bracket\\_bound},\n\\texttt{IIMaj\\_deriv2\\_lt}).\n\nThe second tier is complete; the named analytic hypothesis is\ndischarged. The traced contour bound $|S_f(n)| \\le B(n)$ of Section~3\n(\\texttt{SfBoundProp}) is machine-proved (tier ii$'$), so the closed\nheadline theorem is machine-proved from exactly seven named hypotheses.\nIts final signature, copied verbatim from the development\n(\\texttt{LiClosed.lean}), is\n\\begin{quote}\\ttfamily\\upshape\\small\ntheorem lambda\\_pos\\_finite\\_height\\_closed\\\\\n\\hspace*{2em}(hRH : RHUpTo (3 * 10 \\^{} 12))\\\\\n\\hspace*{2em}(hfinite : LiVerifiedUpTo (10 \\^{} 5))\\\\\n\\hspace*{2em}(hZC : ZeroCountProp) (hZC2 : ZeroCountProp2)\\\\\n\\hspace*{2em}(hZCG : ZeroCountGlobalProp) (hNLZ : NoLowZeros)\\\\\n\\hspace*{2em}(hMZ : MZeroProp) :\\\\\n\\hspace*{2em}$\\forall$ n : $\\mathbb{N}$, 1 $\\leq$ n $\\to$ (n : $\\mathbb{R}$) $\\leq$ (3 * 10 \\^{} 12 $-$ 1) \\^{} 2 $\\to$\\\\\n\\hspace*{2em}0 $<$ (liCoeff n).re\n\\end{quote}\nAll seven hypotheses are trusted inputs --- assumed in the development,\nnot proved within it; every other step of the proof is machine-checked.\nTheir provenance is itemized in the following table.\n\\begin{center}\\scriptsize\n\\setlength{\\tabcolsep}{3pt}\n\\begin{tabular}{@{}l p{3.9cm} p{2.7cm} p{2.5cm}@{}}\n\\hline\nHypothesis & Statement & Source & Status \\\\\n\\hline\n\\texttt{RHUpTo} & $\\operatorname{Re}\\rho = 1/2$ for all zeros with\n  $|\\gamma| \\le 3\\times10^{12}$ &\n  Platt--Trudgian \\cite{platt2021riemann}, interval arithmetic &\n  computational certificate \\\\\n\\texttt{LiVerifiedUpTo} & $\\lambda_n > 0$ for $1 \\le n \\le 10^5$ &\n  Johansson \\cite{johansson2015} (Step-5 normalization); this project\n  to $n \\le 3000$ (App.~A) & computational certificate \\\\\n\\texttt{ZeroCountProp} & unit-window zero count $\\le C_0(t{+}1)$,\n  $t \\ge 2$ & Rosser \\cite{rosser1941}; derived (see below) &\n  derived explicit bound \\\\\n\\texttt{ZeroCountProp2} & two-unit zero count $\\le 0.6\\log(t{+}2) +\n  0.886\\log\\log(t{+}2) + 2.7$, $t \\ge 10$ &\n  Rosser \\cite{rosser1941}; derived (see below) &\n  derived explicit bound \\\\\n\\texttt{ZeroCountGlobalProp} & global zero count $N(T) \\le F(T)$,\n  $T \\ge 2$ & Rosser \\cite{rosser1941} (enlarged majorant); derived\n  (see below) & derived explicit bound \\\\\n\\texttt{NoLowZeros} & $|\\gamma| \\ge 14$ for every nontrivial zero &\n  Platt \\cite{platt2017isolating}; Gram\n  \\cite{gram1903} (see below) & computational certificate \\\\\n\\texttt{MZeroProp} & $|\\zeta'/\\zeta(-\\tfrac52 + it)| \\le 1.3352$ for\n  $|t| \\le 10$ & this project (E-023b), interval arithmetic &\n  computational certificate \\\\\n\\hline\n\\end{tabular}\n\\end{center}\nThe three zero-counting rows are derived bounds, not printed as such:\nthey are elementary specializations of Rosser's explicit\nRiemann--von Mangoldt error bound\n$|N(T) - P(T)| \\le R(T) := 0.137\\log T + 0.443\\log\\log T + 1.588$,\nvalid for $T \\ge 1467$, where $P(T) = \\frac{T}{2\\pi}\\log\\frac{T}{2\\pi\ne} + \\frac78$ \\cite[Thm~19]{rosser1941} (tabulated with its provenance\nin \\cite[Table~1]{trudgian2014ii}). The two window forms apply the\nbound at the window endpoints,\n$N(T_2) - N(T_1) \\le P(T_2) - P(T_1) + R(T_2) + R(T_1)$,\nand the global form uses $N(T) \\le P(T) + R(T)$ directly; the additive\nconstants and the enlargement of the majorant $F$ absorb the ranges\nbelow Rosser's threshold via the finite-range verifications\n$|S(T)| \\le 1$ for $T \\le 280$ and $|S(T)| \\le 2$ for\n$T \\le 6.8\\times10^6$ \\cite[Eq.~(1.2)]{trudgian2014ii} together with\nthe $O(1/T)$ theta remainder \\cite[Cor.~1]{trudgian2014ii}.\n\\texttt{NoLowZeros} is logically separate\nfrom \\texttt{RHUpTo}: it asserts a location fact about the low zeros,\nnot RH on an initial segment. Its provenance is zero-location\ncomputation: Platt \\cite{platt2017isolating} rigorously isolates the\nnontrivial zeros with $0 < \\gamma \\le 3.06\\times10^{10}$ by interval\narithmetic (an independent verification of RH to that height), the\nlowest at $\\gamma_1 = 14.134725\\ldots$ --- a value classical since\nGram \\cite{gram1903} --- so no nontrivial zero has $|\\gamma| < 14$;\nthe Platt--Trudgian verification \\cite{platt2021riemann} extends the\non-line confirmation to height $3\\times10^{12}$ via Turing's method.\n\\texttt{MZeroProp} is certified by interval arithmetic (E-023b,\ndeterministic script with CSV/JSON sidecar in the project archive):\nthe segment is covered by an adaptive family of $t$-boxes ($16\\,813$\nboxes) and $\\zeta'/\\zeta$ is evaluated on each box in Arb ball\narithmetic via the functional-equation form\n$\\zeta'/\\zeta(s) = \\log\\pi - \\tfrac12\\psi((1-s)/2) -\n\\tfrac12\\psi(s/2) + \\sum_{n\\ge1}\\Lambda(n)\\,n^{s-1}$\n(the $\\psi(s/2)$ argument being shifted past the digamma pole by\n$\\psi(w) = \\psi(w{+}3) - 1/w - 1/(w{+}1) - 1/(w{+}2)$, and the series\ntruncated with a certified integral tail), yielding the certified\nglobal bound $|\\zeta'/\\zeta(-\\tfrac52+it)| \\le 1.3331$ for\n$|t| \\le 10$, below the charged $1.3352$. This supersedes the\nproject's earlier sampled-Lipschitz certificate (E-023), whose sampled\nmaximum $1.33237$ it confirms.\n\nThe proof of \\texttt{SfBoundProp} contains the full complex-analytic\ncontent of Step 2, in the dependency chain\n\\begin{center}\n\\begin{tabular}{c}\npartial fractions \\\\\n$\\downarrow$ \\\\\n$S_f = \\operatorname{Res}_1$ \\\\\n$\\downarrow$ \\\\\nrectangle identity \\\\\n$\\downarrow$ \\\\\nfour side bounds \\\\\n$\\downarrow$ \\\\\n\\boxed{\\texttt{sfBoundProp}} \\\\\n$\\downarrow$ \\\\\n\\boxed{\\texttt{lambda\\_pos\\_finite\\_height\\_closed}}\n\\end{tabular}\n\\end{center}\nwith named capstones \\texttt{rectInt'\\_Jlag} (meromorphic residue\nmachinery on rectangles), \\texttt{partialFraction\\_identity} (the\npartial-fraction identity for $\\zeta'/\\zeta$),\n\\texttt{logDeriv\\_riemannZeta\\_sub\\_nearZeros\\_le\\_tight} (the\nreference-point bound $|R(s)| \\le 10.5\\log(|t|{+}2) + 48$),\n\\texttt{sf\\_eq\\_resW1} (the exact identity\n$S_f(n) = \\mathrm{Res}_1(n)$),\n\\texttt{upper\\_right\\_horizontal\\_eq\\_dogleg} and the\n\\texttt{LiDogLeg} bounds (Section~\\ref{subsec:dogleg}),\n\\texttt{LiSideBounds} (the four side bounds), and the fold\n\\texttt{sfBoundProp}. The two elementary evaluations of the explicit\nmargin function that the assembly consumes\n($\\mathrm{margin}(8{\\cdot}10^4) > 0$ and\n$\\mathrm{margin}(10^5) > \\mathrm{margin}(8{\\cdot}10^4)$) are discharged\nin the development itself, by certified rational interval bounds on\n$\\log$, $\\exp$, and $\\sqrt{\\cdot}$ (\\texttt{LiBasePoints.lean}). The\nmargin majorant in the development is a mildly enlarged $F{+}S_b$-shape\nfunction (a negative-weight term dropped, at a cost of $\\approx\n0.9\\sqrt n$ in the bound) chosen so that every convexity block has\nprovably negative $\\psi$; the axiom profile is unchanged --- the three\nstandard axioms, no \\texttt{sorryAx}, audited declaration-by-declaration\non the full chain.\n\nThe finite-height Li theorem remains, by design, \\emph{conditional} on\nits declared perimeter: the four computational certificates of the\ntable above (the Platt--Trudgian verifications, the Li tables, the\nzero-location certificate, and the short-segment constant) and the three\nexplicit zero-counting bounds derived from Rosser's Riemann--von\nMangoldt error bound \\cite[Thm~19]{rosser1941}. The\nformal reduction leaves exactly those seven inputs as trusted, which we\nregard as the honest formal target: every other step of the proof is\nmachine-checked.\n\n\\section*{AI Contribution Statement}\nThis research was conducted with substantial assistance from two AI\nsystems: Kimi K3 (Moonshot AI), operated through the Claude Code\nharness (Anthropic), over an archived series of research sessions\n(project ledger: sessions 001--041). Machine contributions included:\nderivation drafting and constant-tracing (D-036/D-037/D-056/D-057),\nthe Lean~4 formalization of the Li chain (package \\texttt{NguyenRH1}:\n\\texttt{sInfty\\_lower\\_bound}, \\texttt{marginTilde\\_convex},\n\\texttt{lambda\\_pos\\_finite\\_height\\_verified},\\\\\n\\texttt{sfBoundProp}, \\texttt{lambda\\_pos\\_finite\\_height\\_closed}),\nthe numerical experiment suite (E-001--E-034), and adversarial\nself-audit (D-060: four independent audit instances, $\\sim$55 claims\nchecked, 10 corrections filed; D-071/D-072/D-074: four further\n$B(n)$-account corrections found and repaired during the machine\nclosure). All research direction, verification decisions,\nperimeter declarations, and final approval are the responsibility of\nthe human author, who serves as guarantor of the work. All\nmachine-produced mathematics was validated by machine-checked proof\n(Lean~4, axiom profiles as stated in Appendix~B), by cross-validated\ndeterministic computation, or is explicitly tagged otherwise in the\ntext. Session logs and audit trails are preserved in the project\narchive.\n\n\\section*{Acknowledgments}\nThe author thanks Moonshot AI (Kimi K3) and Anthropic (the Claude Code\nharness) for making their systems available for research use. The\nsubstantive record of machine assistance is the AI Contribution\nStatement above.\n\n\\bibliographystyle{plain}\n\\bibliography{references}\n\\end{document}\n",
  "structuredPatch": [
    {
      "oldStart": 629,
      "oldLines": 7,
      "newStart": 629,
      "newLines": 7,
      "lines": [
        " This research was conducted with substantial assistance from two AI",
        " systems: Kimi K3 (Moonshot AI), operated through the Claude Code",
        " harness (Anthropic), over an archived series of research sessions",
        "-(project ledger: sessions 001--041). Machine contributions included:",
        "+(project ledger: sessions 001--044). Machine contributions included:",
        " derivation drafting and constant-tracing (D-036/D-037/D-056/D-057),",
        " the Lean~4 formalization of the Li chain (package \\texttt{NguyenRH1}:",
        " \\texttt{sInfty\\_lower\\_bound}, \\texttt{marginTilde\\_convex},"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "command": "cd /d/Python/Quantum && python research/numerics/scripts/db.py init && git init && git add -A && git -c user.name=\"NGUYEN-RH-1\" -c user.email=\"research@local\" commit -m \"Session 001: install research archive (STATE, journal, results, graveyard, numerics, SQLite catalog, LaTeX skeleton)\" && git log --oneline",
  "description": "Initialize SQLite catalog and git repo, create first commit"
}

=== python probe ===
PYTHON OK 3.6.8 (default, Aug 18 2026, 11:07:50) 
[GCC 8.5.0 20210514 (Red Hat 8.5.0-28)]
Linux-4.18.0-553.141.2.lve.el8.x86_64-x86_64-with-glibc2.3.4

=== env probe ===
SERVER_SOFTWARE=Apache
/usr/bin/python3
Python 3.6.8
composer
composite
convert
ea-php84
identify
lsphp
php

{
  "file_path": "C:\\Users\\lucky\\.nguyen\\projects\\D--Python-Quantum\\memory\\user_workflow.md",
  "content": "---\nname: Staged multi-session workflow with shutdowns\ndescription: User works on NGUYEN-RH-1 in stages separated by computer shutdowns; requires zero rework and full persistence of all research artifacts\ntype: user\n---\n\nUser runs the RH research project in stages and shuts down the computer\nbetween them. Hard requirements they set:\n\n- No work may be lost or redone between sessions \u2014 everything persists to\n  files (archive protocol in NGUYEN.md \u00a78).\n- They intend to publish a scientific paper from this work, so all artifacts\n  must be paper-quality and traceable.\n- Approved storage decisions (2026-08-17): LaTeX for the paper, local git\n  for versioning, and DUAL numerics storage \u2014 CSV+JSON sidecars AND SQLite\n  in parallel (user explicitly added SQLite on top of the recommended\n  CSV+JSON).\n\nHow to collaborate: follow the session start/end protocol in NGUYEN.md \u00a78\nreligiously; update STATE.md last with an explicit NEXT ACTION line; commit\nat session end.\n"
}

{
  "type": "update",
  "filePath": "D:\\Python\\Quantum\\web\\logs\\smtp_test.py",
  "content": "\"\"\"SSH: send a direct test mail via 127.0.0.1:25 from the server itself,\nreporting the SMTP conversation so failures are visible (unlike the\nfail_silently path in views.py).\"\"\"\nimport base64\n\nimport paramiko\n\nSSH_HOST = \"208.109.226.46\"\nSSH_USER = \"[cpanel-user]\"\nSSH_PASS = \"[REDACTED]\"\n\nPY = r'''\nimport smtplib, time\nstamp = time.strftime(\"%Y-%m-%d %H:%M:%S UTC\", time.gmtime())\ntry:\n    s = smtplib.SMTP(\"127.0.0.1\", 25, timeout=20)\n    s.set_debuglevel(1)\n    msg = (\"From: noreply@researchai.dev\\r\\n\"\n           \"To: dan@researchai.dev\\r\\n\"\n           \"Subject: [researchai.dev] SMTP direct test\\r\\n\"\n           \"\\r\\n\"\n           \"Direct smtplib test from the server, \" + stamp + \".\\r\\n\"\n           \"Verifying remote-mail routing for dan@researchai.dev.\\r\\n\")\n    refused = s.sendmail(\"noreply@researchai.dev\",\n                         [\"dan@researchai.dev\"], msg)\n    print(\"REFUSED:\", refused)\n    s.quit()\n    print(\"SEND OK\")\nexcept Exception as e:\n    print(\"SEND FAILED:\", type(e).__name__, e)\n'''\n\nclient = paramiko.SSHClient()\nclient.set_missing_host_key_policy(paramiko.AutoAddPolicy())\nclient.connect(SSH_HOST, port=22, username=SSH_USER, password=SSH_PASS,\n               timeout=20)\nb64 = base64.b64encode(PY.encode()).decode()\ncmd = (\"/opt/alt/python311/bin/python3.11 -c \"\n       f\"'import base64; exec(base64.b64decode(\\\"{b64}\\\"))'\")\nstdin, stdout, stderr = client.exec_command(cmd)\nprint(stdout.read().decode(\"utf-8\", \"replace\"))\nprint(stderr.read().decode(\"utf-8\", \"replace\"))\nclient.close()\n",
  "structuredPatch": [
    {
      "oldStart": 1,
      "oldLines": 6,
      "newStart": 1,
      "newLines": 8,
      "lines": [
        " \"\"\"SSH: send a direct test mail via 127.0.0.1:25 from the server itself,",
        " reporting the SMTP conversation so failures are visible (unlike the",
        " fail_silently path in views.py).\"\"\"",
        "+import base64",
        "+",
        " import paramiko",
        " ",
        " SSH_HOST = \"208.109.226.46\""
      ]
    },
    {
      "oldStart": 8,
      "oldLines": 7,
      "newStart": 10,
      "newLines": 7,
      "lines": [
        " SSH_PASS = \"[REDACTED]\"",
        " ",
        " PY = r'''",
        "-import smtplib, sys, time",
        "+import smtplib, time",
        " stamp = time.strftime(\"%Y-%m-%d %H:%M:%S UTC\", time.gmtime())",
        " try:",
        "     s = smtplib.SMTP(\"127.0.0.1\", 25, timeout=20)"
      ]
    },
    {
      "oldStart": 32,
      "oldLines": 8,
      "newStart": 34,
      "newLines": 9,
      "lines": [
        " client.set_missing_host_key_policy(paramiko.AutoAddPolicy())",
        " client.connect(SSH_HOST, port=22, username=SSH_USER, password=SSH_PASS,",
        "                timeout=20)",
        "+b64 = base64.b64encode(PY.encode()).decode()",
        " cmd = (\"/opt/alt/python311/bin/python3.11 -c \"",
        "-       + repr(PY))",
        "+       f\"'import base64; exec(base64.b64decode(\\\"{b64}\\\"))'\")",
        " stdin, stdout, stderr = client.exec_command(cmd)",
        " print(stdout.read().decode(\"utf-8\", \"replace\"))",
        " print(stderr.read().decode(\"utf-8\", \"replace\"))"
      ]
    }
  ],
  "originalFile": "\"\"\"SSH: send a direct test mail via 127.0.0.1:25 from the server itself,\nreporting the SMTP conversation so failures are visible (unlike the\nfail_silently path in views.py).\"\"\"\nimport paramiko\n\nSSH_HOST = \"208.109.226.46\"\nSSH_USER = \"[cpanel-user]\"\nSSH_PASS = \"[REDACTED]\"\n\nPY = r'''\nimport smtplib, sys, time\nstamp = time.strftime(\"%Y-%m-%d %H:%M:%S UTC\", time.gmtime())\ntry:\n    s = smtplib.SMTP(\"127.0.0.1\", 25, timeout=20)\n    s.set_debuglevel(1)\n    msg = (\"From: noreply@researchai.dev\\r\\n\"\n           \"To: dan@researchai.dev\\r\\n\"\n           \"Subject: [researchai.dev] SMTP direct test\\r\\n\"\n           \"\\r\\n\"\n           \"Direct smtplib test from the server, \" + stamp + \".\\r\\n\"\n           \"Verifying remote-mail routing for dan@researchai.dev.\\r\\n\")\n    refused = s.sendmail(\"noreply@researchai.dev\",\n                         [\"dan@researchai.dev\"], msg)\n    print(\"REFUSED:\", refused)\n    s.quit()\n    print(\"SEND OK\")\nexcept Exception as e:\n    print(\"SEND FAILED:\", type(e).__name__, e)\n'''\n\nclient = paramiko.SSHClient()\nclient.set_missing_host_key_policy(paramiko.AutoAddPolicy())\nclient.connect(SSH_HOST, port=22, username=SSH_USER, password=SSH_PASS,\n               timeout=20)\ncmd = (\"/opt/alt/python311/bin/python3.11 -c \"\n       + repr(PY))\nstdin, stdout, stderr = client.exec_command(cmd)\nprint(stdout.read().decode(\"utf-8\", \"replace\"))\nprint(stderr.read().decode(\"utf-8\", \"replace\"))\nclient.close()\n",
  "autoRead": false
}

{
  "file_path": "C:\\Users\\lucky\\.nguyen\\projects\\D--Python-Quantum\\memory\\MEMORY.md",
  "content": "# Memory Index\n\n- [Staged multi-session workflow](user_workflow.md) \u2014 user works in stages with shutdowns; zero-rework persistence is mandatory; LaTeX + git + dual CSV/JSON+SQLite storage approved\n"
}

File created successfully at: C:\Users\lucky\.nguyen\projects\D--Python-Quantum\memory\MEMORY.md

{
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "## 4. ATTACK TRACKS\n- **A. Certificate extension** (moments, windows, SDP, prime pairs)\n- **B. Spectral / Hilbert\u2013P\u00f3lya** (quantum formalism from R1; Gabor\n  frame \u2194 self-adjoint operator; Berry\u2013Keating; de Branges)\n- **C. Positivity criteria** (Weil growing support, Li coefficients,\n  de Bruijn\u2013Newman \u039b = 0)\n- **D. Formal verification** (Lean 4 skeletons for every lemma)",
  "new_string": "## 4. ATTACK TRACKS\n- **A. Certificate extension** (moments, windows, SDP, prime pairs)\n- **B. Spectral / Hilbert\u2013P\u00f3lya** (quantum formalism from R1; Gabor\n  frame \u2194 self-adjoint operator; Berry\u2013Keating; de Branges)\n- **C. Positivity criteria** (Weil growing support, Li coefficients,\n  de Bruijn\u2013Newman \u039b = 0)\n- **D. Formal verification** (Lean 4 skeletons for every lemma)\n\n## 4A. KNOWLEDGE INTEGRATION & EXTERNAL RESEARCH (STANDING ORDER)\nGoal reminder: solve RH by COMBINING all knowledge at our disposal.\n1. **Use the full equation inventory.** Every attack must actively consider\n   the complete toolset \u2014 quantum formalism (R1), analytic number theory\n   (R2, R4), spectral theory, random matrix theory, physics equations\n   (physics.info) \u2014 and seek cross-domain combinations, never stay inside\n   a single track by default.\n2. **Cross-pollination check.** Before abandoning any approach, ask: which\n   OTHER track's machinery could close this gap? Log cross-track ideas in\n   the session journal even when not pursued.\n3. **Web research before obstruction.** When knowledge is missing, research\n   the web (arXiv, surveys, MathOverflow, LMFDB, OEIS) BEFORE declaring a\n   dead end. Record every external source used \u2014 URL, what was taken, date \u2014\n   in the derivation/result file; paper-worthy sources go to references.bib.\n4. **Master tool index.** research/derivations/D-001 (built in Phase 0.1)\n   is the living index of all usable equations/tools; every newly\n   discovered tool is added there so no later session rediscovers it."
}

{
  "filePath": "D:\\Python\\Quantum\\RH-WEBSITE.md",
  "oldString": "- **Email notification (2026-08-28):** every submission also emails\n  `dan@researchai.dev` via the server's local Exim (`EMAIL_HOST=127.0.0.1:25`,\n  From `noreply@researchai.dev`) \u2014 production only, `FEEDBACK_NOTIFY_EMAIL`\n  lives in the deployed settings patch (unset locally = no-op);\n  `fail_silently` + try/except so mail can never break a submission.\n  (MX for researchai.dev is MS365; SPF `include:secureserver.net` covers\n  this host; DMARC passes via SPF alignment.)",
  "newString": "- **Email notification (2026-08-28, VERIFIED live):** every submission also\n  emails `dan@researchai.dev` via the server's local Exim\n  (`EMAIL_HOST=127.0.0.1:25`, From `noreply@researchai.dev`) \u2014 production\n  only, `FEEDBACK_NOTIFY_EMAIL` lives in the deployed settings patch (unset\n  locally = no-op); `fail_silently` + try/except so mail can never break a\n  submission. (MX for researchai.dev is MS365; SPF `include:secureserver.net`\n  covers this host; DMARC passes via SPF alignment.)\n  - \u26a0 GOTCHA (found + fixed 2026-08-28): cPanel **Email Routing** for\n    researchai.dev MUST be **Remote Mail Exchanger**. As a hosted domain it\n    defaulted to local, so Exim never consulted the public MX and\n    `/etc/valiases/researchai.dev` silently DISCARDED `dan@` (cPanel Track\n    Delivery showed \"Discard\"; MS365 quarantine empty because MS365 never\n    saw the mail). Verified after the switch by a live feedback-form test +\n    a direct smtplib test over SSH \u2014 both received in the MS365 inbox.\n  - OPS NOTE: the SSH shell is CageFS-jailed \u2014 it CANNOT see\n    `/etc/valiases`, `/etc/localdomains`, or `/var/log/exim_mainlog`\n    (all \"No such file\"). Delivery verification is inbox receipt + cPanel\n    Track Delivery; SMTP-path testing works (127.0.0.1:25 accepts).",
  "originalFile": "# RH-WEBSITE.md \u2014 NGUYEN-RH-1 Research Website\n# Standing plan + operations document. READ FIRST when doing website work.\n# Created: 2026-08-19 | Status: ACTIVE | Version: 1.0\n# ============================================================\n\n## 0. \u26d4 HARD RULE \u2014 READ FIRST (user directive, 2026-08-19)\n**DO NOT WRITE to any research document.** The research archive\n(NGUYEN.md, STATE.md, everything under `research/`, git history) is the\nsingle source of truth and is modified ONLY by the research agent per\nNGUYEN.md \u00a78.4. Website work may touch ONLY:\n- `D:\\Python\\Quantum\\web\\`          (all website code, data, logs)\n- `D:\\Python\\Quantum\\RH-WEBSITE.md` (this file)\n\nThe website reads research files exclusively through READ-ONLY handles:\nSQLite via `mode=ro` URI, text files opened `'r'`. Feedback submissions\ngo to `web/feedback/` + `web/feedback.db` \u2014 never into `research/`.\nWhen committing, stage ONLY `web/` and `RH-WEBSITE.md` by name.\n\n## 1. PURPOSE\nPublic-facing-style (localhost-only) interactive dashboard for the\nNGUYEN-RH-1 Riemann Hypothesis research project. Goals:\n- Landing page explaining RH and the research mission to a general audience.\n- Live progress: current stage, next action, metrics \u2014 auto-updating as the\n  research agent writes to the file system.\n- Browsable archive: results, experiments (+ interactive charts),\n  derivations, graveyard, journal, resources atlas, paper status.\n- Feedback channel: visitors submit comments/suggestions; searchable;\n  researcher reviews them to help the research.\n\n## 2. ARCHITECTURE\n- Location: `D:\\Python\\Quantum\\web\\` \u2014 Django project `rhweb`, app `dashboard`.\n- Interpreter: project `.venv` (`./.venv/Scripts/python.exe`).\n  Deps: `web/requirements-web.txt` (Django, markdown).\n- Server: `python web/manage.py runserver 127.0.0.1:8001` \u2014 localhost only.\n- Frontend: vanilla JS + vendored Plotly.js (interactive charts) +\n  vendored MathJax (tex-chtml) for math in markdown. NO CDN dependency.\n- Live updates: frontend polls `GET /api/status/` every 3 s; the endpoint\n  reports file mtimes + parsed STATE.md + active run-logs + new-feedback\n  count + summary_stats (checklist counters, phase table, collection\n  counts); changed panels refresh in place. No WebSockets/Redis.\n\n### Data flow (all read-only on research/)\n| Source | How read | Used by |\n|---|---|---|\n| STATE.md | parse `## SECTION` blocks ('r') | Dashboard, status bar |\n| NGUYEN.md | checklist \u00a75 `- [x]/[~]/[ ]` counts; \u00a77 ledger | Dashboard metrics, Roadmap |\n| research/research.db | sqlite3 `file:...?mode=ro` | Ledger, Experiments, Derivations, Graveyard, Journal indexes |\n| research/numerics/data/*.json | json.load ('r') | Experiment cards (checks, key values, caveats) |\n| research/numerics/data/*.csv | csv module, downsampled | Plotly charts, table previews |\n| research/**/*.md | python-markdown + math-protect | Archive pages |\n| research/numerics/data/*-run.log | tail (last N lines) | Live Runs page |\n| git log | `git log --oneline` subprocess (read-only) | Dashboard activity feed |\n\n## 3. FILE MAP\n```\nweb/\n\u251c\u2500\u2500 manage.py\n\u251c\u2500\u2500 lockcheck.py              # \u00a70 verification: proves the server never\n\u2502                             #   blocks writers (run: .venv python web/lockcheck.py)\n\u251c\u2500\u2500 requirements-web.txt\n\u251c\u2500\u2500 rhweb/                  # project: settings.py, urls.py, wsgi.py\n\u251c\u2500\u2500 dashboard/\n\u2502   \u251c\u2500\u2500 research_data.py    # ALL read-only parsers (single module to audit \u00a70)\n\u2502   \u251c\u2500\u2500 models.py           # Feedback + VisitorLog models (web/feedback.db ONLY)\n\u2502   \u251c\u2500\u2500 middleware.py       # VisitorLogMiddleware (access log \u2192 feedback.db)\n\u2502   \u251c\u2500\u2500 admin.py            # Django admin: feedback triage + visitor log views\n\u2502   \u251c\u2500\u2500 views.py            # pages (feedback POST also emails dan@researchai.dev)\n\u2502   \u251c\u2500\u2500 api.py              # /api/health, /api/status, /api/logtail\n\u2502   \u251c\u2500\u2500 urls.py\n\u2502   \u251c\u2500\u2500 templates/dashboard/*.html\n\u2502   \u2514\u2500\u2500 static/dashboard/{style.css, app.js, vendor/plotly.min.js, vendor/tex-chtml.js}\n\u251c\u2500\u2500 feedback/               # one JSON per submission (dual storage)\n\u251c\u2500\u2500 feedback.db             # SQLite index for search (Django default DB)\n\u2514\u2500\u2500 logs/                   # server.log, healthcheck.log\n```\n\n## 4. PAGES (left sidebar)\n1. **Home** `/` \u2014 RH explainer, mission, 4 attack tracks, success ladder.\n2. **Dashboard** `/dashboard/` \u2014 current stage (STATE.md), next action,\n   progress metrics (phases bar, tasks done/total, ledger size), git feed.\n3. **Roadmap** `/roadmap/` \u2014 NGUYEN.md \u00a75 checklist rendered w/ status.\n4. **Search** `/search/` \u2014 global archive search (see \u00a77 note): AND-of-terms\n   case-insensitive scan across all MD_COLLECTIONS markdown; snippets with\n   line numbers + highlighted matches; results hits link to /ledger/R-NNN/.\n5. **Results Ledger** `/ledger/` + `/ledger/R-NNN/` \u2014 claims + honesty tags.\n6. **Experiments** `/experiments/` + `/experiments/E-NNN/` \u2014 sidecar cards;\n   Plotly charts from CSVs (config in research_data.CHARTS); pass/fail badges.\n7. **Scripts & Data** `/scripts/` + `/scripts/<stem>/` \u2014 all experiment\n   scripts; per-script data files (experiment-table links \u222a exact-stem\n   matches) shown as paginated spreadsheet tables (500 rows/page, sticky\n   header + row-number gutter, numeric right-align) + JSON sidecars +\n   collapsible verbatim source-code view.\n8. **Derivations** `/derivations/` + detail \u2014 37 D-files, math rendered.\n9. **Graveyard** `/graveyard/` \u2014 documented dead ends.\n10. **Journal** `/journal/` + detail \u2014 session narratives.\n11. **Resources** `/resources/` + detail \u2014 43-note RH-equivalence atlas.\n12. **Paper** `/paper/` \u2014 paperA.tex status (first 80 lines), paper-folder\n    inventory.\n13. **Lean Proofs** `/lean/` + `/lean/<file>/` + `/lean/audit/<txt>/` \u2014\n    formal-verification transparency: toolchain + totals, axiom-policy card,\n    LiClosed.lean verbatim, the 7-perimeter defs extracted verbatim,\n    per-file declaration tables + source, #print-axioms audit transcripts.\n14. **Live Runs** `/live/` \u2014 tail view of *-run.log, 3 s polling.\n15. **Feedback** `/feedback/` \u2014 submit form + search (text, category, status).\n16. **Conversations** `/conversations/` \u2014 browse the Nguyen CLI conversation\n    index (`~/.nguyen/projects/D--Python-Quantum/agent.db`, outside the repo,\n    opened read-only): session list; per-session message cards with\n    thinking/tool blocks (collapsible), FTS search + kind filters; single\n    message view `/conversations/<spk>/msg/<id>/` with prev/next arrows,\n    arrow-key navigation, jump-to-id, raw JSON row view.\n\n## 5. FEEDBACK SYSTEM\n- Submit: name (optional), category (general/suggestion/question/correction/\n  track-A/B/C/D), text. CSRF-protected; autoescaped on render.\n- Dual storage (mirrors NGUYEN.md \u00a78.2): JSON file per submission in\n  `web/feedback/FB-<utc>-<id>.json` + row in `web/feedback.db`.\n- Search: full-text (name+text) + category/status filters.\n- Statuses: new \u2192 reviewed \u2192 acted-on (status changes are website data,\n  allowed under \u00a70; researcher notes field for follow-up).\n- **Email notification (2026-08-28):** every submission also emails\n  `dan@researchai.dev` via the server's local Exim (`EMAIL_HOST=127.0.0.1:25`,\n  From `noreply@researchai.dev`) \u2014 production only, `FEEDBACK_NOTIFY_EMAIL`\n  lives in the deployed settings patch (unset locally = no-op);\n  `fail_silently` + try/except so mail can never break a submission.\n  (MX for researchai.dev is MS365; SPF `include:secureserver.net` covers\n  this host; DMARC passes via SPF alignment.)\n\n## 5A. ADMIN BACKEND + VISITOR LOG (2026-08-28)\n- **Django admin at `/admin/`** \u2014 the researcher's private backend:\n  Feedback changelist (list-editable status, filters, search, date\n  hierarchy) + VisitorLog changelist (read-only, append-only).\n  Login: user `dan` + the same password as the SSH account (user choice\n  2026-08-28). Superuser created over SSH via\n  `DJANGO_SUPERUSER_*` env vars + `createsuperuser --noinput`.\n- **Visitor log:** `dashboard/middleware.py` VisitorLogMiddleware appends\n  one row per public GET/POST to `dashboard_visitorlog` in feedback.db:\n  created, ip, method, path, query, referrer, user_agent, is_bot (UA regex).\n  Skips `/static/`, `/api/` (3 s polling would flood it), `/admin/`,\n  `/favicon.ico`; exceptions swallowed \u2014 logging never breaks a page.\n  Raw Apache log also readable at `~/access-logs/researchai.121swr.com-ssl_log`\n  (researchai.dev traffic logs under the cPanel auto-subdomain).\n- Admin statics: collected into docroot `/static/admin/` via\n  `collectstatic` on the server (127 files, 2026-08-28).\n- OPS GOTCHAS (learned 2026-08-28): (1) in paramiko `exec_command` shells\n  `$PWD` is NOT set \u2014 use absolute paths in PYTHONPATH, plus\n  `DJANGO_SETTINGS_MODULE=rhweb.settings` for bare-python scripts;\n  (2) any POST to the live site needs an `Origin: https://researchai.dev`\n  header or Django CSRF 403s (admin login, feedback); (3) server-side\n  management: `cd $SITE && PYTHONPATH=$SITE/app/vendor:$SITE/app/web\n  /opt/alt/python311/bin/python3.11 app/web/manage.py <cmd>`.\n\n## 6. OPERATIONS\n### 6.1 Session-start protocol (website work)\n1. Read this file.\n2. Run `./.venv/Scripts/python.exe web/healthcheck.py --restart`\n   (checks /api/health + all routes + status-API freshness; restarts the\n   server if unreachable). Fix any failing route before other work.\n3. Check the watchdog is alive: `web/logs/watchdog.log` tail should show\n   entries within the last ~10 min; if not, restart it (\u00a76.2b).\n4. Review new feedback: `web/feedback.db` status='new' (or the /feedback/\n   page); surface relevant items to the user.\n5. Improvement pass (standing order, user 2026-08-19): look for at least\n   one interface or data-presentation improvement per session; log ideas\n   in \u00a78 below and implement the worthwhile ones.\n### 6.2 Start server (detached, sandbox DISABLED \u2014 long-run rule)\n```\ncd D:\\Python\\Quantum && ./.venv/Scripts/python.exe web/manage.py runserver \\\n  127.0.0.1:8001 >> web/logs/server.log 2>&1   # DETACHED_PROCESS\n```\n### 6.2b Watchdog (always-on monitoring, started 2026-08-19)\n`web/watchdog.py` runs detached between sessions: every 300 s it runs the\nhealth checks and restarts the server if unreachable. Logs:\n`web/logs/watchdog.log` + `web/logs/healthcheck.log`.\nStart detached: `subprocess.Popen([sys.executable, 'web/watchdog.py'], ...)`\nwith DETACHED_PROCESS (same pattern as \u00a76.2).\n### 6.3 Restart / health\n- Stop: find PID via `netstat -ano | findstr :8001`, `taskkill /PID <pid> /F`.\n- **Restart required after ANY code OR template change** (templates are\n  cached in-process \u2014 a home.html edit did not appear until restart,\n  2026-08-19). Static CSS/JS changes serve immediately \u2014 BUT runserver\n  sends no cache headers, so browsers heuristic-cache them: after ANY\n  style.css/app.js change, ALSO bump the `?v=` query on both tags in\n  `templates/dashboard/base.html` (convention: date-serial, e.g.\n  `?v=20260827-2`) or visitors keep running stale assets (hamburger\n  breakage, 2026-08-27).\n  NOTE: port is **8001** since 2026-08-19 \u2014 port 8000 is reserved for the\n  user's other service (do not use it).\n- Log tail: `web/logs/server.log`.\n- First run after code change to models:\n  `./.venv/Scripts/python.exe web/manage.py migrate`.\n### 6.4 Updating the site when research data changes shape\n- New experiment: automatic (db + sidecars). Charts: add entry to\n  `research_data.CHARTS` (x/y columns, type).\n- New markdown folders: register in `research_data.MD_COLLECTIONS`.\n- Never patch around \u00a70 \u2014 if a feature needs research-archive writes,\n  STOP and ask the user.\n### 6.5 Lock-safety guarantees (verified 2026-08-19, web/lockcheck.py)\n- Text/md/CSV/log reads use Python 'r' handles (Windows share mode allows\n  concurrent writers) and close immediately after each read.\n- research.db / agent.db opened SQLite mode=ro per query, closed in finally;\n  shared read lock exists only for the duration of each SELECT (ms).\n- Server runs --noreload: no autoreload file watchers held open.\n- git log is read-only plumbing (no index lock).\n- Empirical: 24 s of 4-thread HTTP load across all heavy pages while taking\n  120 DB write locks (BEGIN IMMEDIATE/ROLLBACK) + 360 write-intent file\n  opens on STATE.md, NGUYEN.md, CSVs, run-logs \u2014 zero conflicts, zero stalls.\n\n### 6.6 Production deployment \u2014 researchai.dev (live since 2026-08-27)\nThe public site runs on a shared Apache host via a CGI adapter; the local\nrepo is NOT modified for deployment (staging copy carries the prod patches).\n- **FTP login (user directive 2026-08-27: stored here for future use):**\n  - Server: `121swr.com` port 21 (plain FTP / explicit FTPS).\n    \u26a0 `ftp.121swr.com` does NOT exist in DNS \u2014 use `121swr.com`.\n  - Username: `[ftp-user]@researchai.dev`\n  - Password: `[REDACTED]`\n  - FTP root = web docroot. `SITE CHMOD` works; MFMT honored (preserves\n    mtimes \u2014 upload.py already sets them).\n- **SSH login (user directive 2026-08-28: stored here for future use):**\n  - IP address: `208.109.226.46`, port `22`\n  - cPanel username: `[cpanel-user]`\n  - Password: `[REDACTED]`\n  - The NGUYEN-RH-1 website lives in `~/public_html/researchai.dev`\n    (corrected 2026-08-28 \u2014 NOT the account `/public_html` root).\n  - **\u2b50 STANDING DIRECTIVE (user, 2026-08-28): use SSH/SFTP instead of\n    FTP for ALL server ops from now on** (uploads, updates, shell work) \u2014\n    it supersedes the FTP/upload.py workflow below. Verified working\n    2026-08-28 (password auth, CloudLinux EL8). `paramiko 5.0.0` is\n    installed in the project `.venv` for scripted SSH/SFTP.\n- \u26a0 This file now contains live credentials: **NEVER upload RH-WEBSITE.md\n  to the web host** (it is not in the deploy set \u2014 keep it that way).\n- Architecture: `.htaccess` routes non-file requests to `/app.cgi`\n  (wsgiref CGIHandler \u2192 Django WSGI); statics in `/static/` served by\n  Apache; all code/data under `/app/` (blocked by rewrite rule +\n  `/app/.htaccess` Require all denied). Server Python:\n  `/opt/alt/python311/bin/python3.11` (3.11.15); vendored Django 5.2.17 +\n  markdown in `/app/vendor/`. agent.db lives at `/app/web/database/agent.db`.\n- Staging + tooling: `D:\\Python\\quantum-deploy\\` \u2014 `docroot/` (server\n  mirror), `upload.py` (resumable 6-thread FTP, size-skip + MFMT; run\n  DETACHED \u2014 CLI kills foreground Bash at ~2 min), `fix_mtimes.py`,\n  `smoke_test.py`, `verify_site.py`. FTP password is passed via the\n  `FTP_PASS` env var, never written into the scripts.\n- Re-deploy: re-copy web/+research/+STATE.md+NGUYEN.md into\n  `docroot/app/`, re-apply the deployed-only patches (prod settings.py,\n  AGENT_DB path, scripts badges, Paper nav link hidden \u2014 user directive\n  2026-08-27, route stays live), then `FTP_PASS=... python upload.py`.\n\n## 7. IMPROVEMENT BACKLOG (standing order \u2014 review each session)\n\u26d4 DELIBERATE EXCLUSION (user directive, 2026-08-27):\n`research/correspondence/` (the Lagarias F-D package) is PRIVATE until\nthe user decides to publish \u2014 do NOT build any website view of it, and\ndo not re-propose it in coverage audits. Everything else in the\nresearch archive was verified fully covered by the site on 2026-08-27.\n\nIdeas not yet implemented, ranked by value:\n1. Conversations: \"new activity\" badge when agent.db grows between polls.\n2. Experiments: diff view when a sidecar's checks change between runs.\n3. Charts: E-019 zero-flow needs series-column grouping support.\n4. Search snippets: highlight ALL query terms in each snippet (currently\n   only the term at the snippet's anchor position gets <mark>).\n5. Mobile: plain .tbl tables inside cards can overflow very narrow\n   screens \u2014 wrap like .table-scroll.\nDone:\n- 2026-08-27: MM-DD-YYYY date format + nowrap date columns (user request) \u2014\n  new dashboard/templatetags/usdate.py filter applied to every UI date\n  render across 17 templates (Updated columns, file-detail lines,\n  Roadmap/Paper \"Last updated\", ledger/experiment/session dates); date\n  table cells get class=\"date\" with .tbl td.date{white-space:nowrap} so\n  hyphens no longer break the line; app.js freshness line formats\n  MM-DD-YYYY HH:MM:SS UTC. Archive markdown content dates stay verbatim\n  ISO (\u00a70 verbatim rule \u2014 UI chrome only). Asset version bumped\n  (?v=20260827-5). OPS NOTE: a server generation started BEFORE the new\n  templatetags/ dir existed 500s on {% load usdate %} (stale importlib\n  dir cache) \u2014 healthcheck --restart is mandatory after adding\n  templatetags modules; the watchdog self-healed this instance.\n- 2026-08-27: topbar search box on every page (user request) \u2014 compact\n  GET form in the sticky topbar (right side), submits to /search/?q=\u2026;\n  prefilled on the search page itself; topbar now flex with the task\n  text ellipsized; on \u2264900px the \"Current task:\" label hides and the\n  input narrows. Full-site crawl the same day: 300 pages, all 200, no\n  broken internal links (2 flagged /conversations/ pages were false\n  positives \u2014 archived session content literally contains traceback\n  text). Asset version bumped (?v=20260827-4).\n- 2026-08-27: Lean Proofs section `/lean/` (user request, full design) \u2014\n  transparency cards (toolchain v4.33.0-rc2, axiom policy, 29 files /\n  27,906 lines / 879 decls / 5 skeleton-only sorries / 22 audits / 483\n  audited decls), LiClosed.lean verbatim inline, the 7-perimeter def\n  blocks extracted verbatim with plain-language notes, per-file detail\n  pages (parsed declaration table + full source), audit transcript\n  viewer. Sorries counted as proof-terms only (by-sorry / :=-sorry) \u2014\n  matches the documented \"1 Suzuki + 4 valley\" exactly; the session-013\n  audit's 5 sorryAx labelled \"intended skeletons\" (not a failure).\n  Healthcheck now 27 routes.\n- 2026-08-27: Scripts & Data page `/scripts/` (user request) \u2014 index of all\n  45 research/numerics/scripts/*.py with their experiment links + data\n  files; detail pages render each CSV as a spreadsheet table (500-row\n  server-side pagination, sticky header, sticky row-number gutter with\n  true CSV line numbers, numeric-column right-align, hover stripes) and\n  each JSON sidecar as a collapsible pretty-printed block. Script\u2192data\n  mapping = experiments-table links \u222a exact-stem matches (verified: all\n  45 scripts resolve correctly; utility scripts show \"none registered\").\n  Routes added to healthcheck (now 24); traversal guard verified 404.\n- 2026-08-27: mobile/responsive sidebar (backlog #3) \u2014 at \u2264 900px the\n  sidebar goes off-canvas (translateX transition) behind a hamburger\n  button in the sticky topbar; backdrop tap, Escape, or any menu-link\n  click closes it; state is body.nav-open (aria-expanded wired);\n  content padding shrinks to 16px. Desktop layout unchanged.\n- 2026-08-27: dashboard + home stat counters auto-refresh (backlog #4) \u2014\n  /api/status/ now carries summary_stats(); app.js updates all counters\n  (dashboard: done/partial/open/results/experiments/feedback; home: done/\n  results/experiments/derivations/graveyard/sessions) every 3 s, and\n  rebuilds the dashboard phases table on change only (signature compare,\n  DOM-API build \u2014 no innerHTML). Static git-feed / recent-sessions tables\n  intentionally left server-rendered.\n- 2026-08-27: global search page `/search/` (backlog #1) \u2014 AND-of-terms\n  case-insensitive scan-on-query across all MD_COLLECTIONS markdown\n  (results/derivations/graveyard/journal/resources); up to 3 snippets per\n  file with line numbers + <mark> highlights; results hits mapped to\n  /ledger/R-NNN/; 100-file cap with truncation notice; sidebar entry;\n  /search/ + a sample query added to the healthcheck ROUTES (now 22).\n  Also: watchdog found dead (last log 2026-08-21) and respawned detached.\n- 2026-08-19: healthcheck.py + watchdog.py (\u00a76.1/\u00a76.2b); Home latest-result\n  card now dynamic (was hardcoded R-004); dashboard data-freshness line\n  (STATE.md/research.db/agent.db, live via polling); E-017 chart.\n- 2026-08-22: bug fixes. (1) git_log 500 on /dashboard/ \u2014 subprocess\n  decoded git's UTF-8 commit output as cp1252; reader thread died on\n  Unicode commit messages and stdout came back None. Fixed with\n  encoding=\"utf-8\", errors=\"replace\" + a None guard. (2) Roadmap Phase 2 /\n  5B checklists rendered as paragraph text \u2014 those phases have a note\n  paragraph directly above the list (no blank line) and python-markdown\n  never lets a list interrupt a paragraph (sane_lists or not). Fixed with\n  research_data._restore_interrupted_lists: inserts the missing blank line\n  before a list that follows paragraph text (skips indented item\n  continuations so existing lists stay tight; skips fenced code). Archive\n  text rendered verbatim as before \u2014 block structure only.\n- 2026-08-20: math typography pass APPLIED then REVERTED same day (user\n  directive). Context: MathJax 3.2.2 works (resources atlas has real\n  LaTeX); the research archive writes plain Unicode math, so MathJax has\n  nothing to typeset there \u2014 that is the correct, intended rendering.\n  A display-formula-lifting heuristic (research_data._display_formulas +\n  .math-line styling) was built and then removed at user request:\n  **the website renders the research archive VERBATIM \u2014 no presentation\n  transforms, no conversions, no re-boxing of archive text.** Do not\n  re-attempt Unicode\u2192LaTeX conversion or formula-detection heuristics;\n  the archive's plain-Unicode math is the source of truth and its\n  verbatim display is correct by definition.\n\n## 8. BUILD STATUS\n- [x] Plan written (v1.0, 2026-08-19)\n- [x] Dependencies installed (Django 6.1, markdown 3.10.3); vendored JS\n      (plotly 2.35.2, MathJax 3.2.2 tex-chtml)\n- [x] Django scaffold (rhweb project + dashboard app)\n- [x] Parsers / views / API (research_data.py read-only layer)\n- [x] Templates / CSS / JS (12 pages, sidebar, 3 s polling, Plotly charts)\n- [x] Server verified live at 127.0.0.1:8001 \u2014 all 15 routes 200;\n      feedback POST/search verified; path-traversal guard verified;\n      smoke-test data cleaned up\n- [x] Initial commit (web/ + RH-WEBSITE.md only)\n",
  "structuredPatch": [
    {
      "oldStart": 117,
      "oldLines": 13,
      "newStart": 117,
      "newLines": 24,
      "lines": [
        " - Search: full-text (name+text) + category/status filters.",
        " - Statuses: new \u2192 reviewed \u2192 acted-on (status changes are website data,",
        "   allowed under \u00a70; researcher notes field for follow-up).",
        "-- **Email notification (2026-08-28):** every submission also emails",
        "-  `dan@researchai.dev` via the server's local Exim (`EMAIL_HOST=127.0.0.1:25`,",
        "-  From `noreply@researchai.dev`) \u2014 production only, `FEEDBACK_NOTIFY_EMAIL`",
        "-  lives in the deployed settings patch (unset locally = no-op);",
        "-  `fail_silently` + try/except so mail can never break a submission.",
        "-  (MX for researchai.dev is MS365; SPF `include:secureserver.net` covers",
        "-  this host; DMARC passes via SPF alignment.)",
        "+- **Email notification (2026-08-28, VERIFIED live):** every submission also",
        "+  emails `dan@researchai.dev` via the server's local Exim",
        "+  (`EMAIL_HOST=127.0.0.1:25`, From `noreply@researchai.dev`) \u2014 production",
        "+  only, `FEEDBACK_NOTIFY_EMAIL` lives in the deployed settings patch (unset",
        "+  locally = no-op); `fail_silently` + try/except so mail can never break a",
        "+  submission. (MX for researchai.dev is MS365; SPF `include:secureserver.net`",
        "+  covers this host; DMARC passes via SPF alignment.)",
        "+  - \u26a0 GOTCHA (found + fixed 2026-08-28): cPanel **Email Routing** for",
        "+    researchai.dev MUST be **Remote Mail Exchanger**. As a hosted domain it",
        "+    defaulted to local, so Exim never consulted the public MX and",
        "+    `/etc/valiases/researchai.dev` silently DISCARDED `dan@` (cPanel Track",
        "+    Delivery showed \"Discard\"; MS365 quarantine empty because MS365 never",
        "+    saw the mail). Verified after the switch by a live feedback-form test +",
        "+    a direct smtplib test over SSH \u2014 both received in the MS365 inbox.",
        "+  - OPS NOTE: the SSH shell is CageFS-jailed \u2014 it CANNOT see",
        "+    `/etc/valiases`, `/etc/localdomains`, or `/var/log/exim_mainlog`",
        "+    (all \"No such file\"). Delivery verification is inbox receipt + cPanel",
        "+    Track Delivery; SMTP-path testing works (127.0.0.1:25 accepts).",
        " ",
        " ## 5A. ADMIN BACKEND + VISITOR LOG (2026-08-28)",
        " - **Django admin at `/admin/`** \u2014 the researcher's private backend:"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "## 5. PROJECT PLAN & CHECKLIST",
  "new_string": "## 5. PROJECT PLAN & CHECKLIST\n\n\u26a0 THE PLAN IS NOT CONCRETE. This is research: the plan and checklist may be\nupdated, extended, reordered, or pruned at ANY time as results demand.\nNever follow the checklist at the expense of the ultimate goal \u2014 solving\nthe Riemann Hypothesis. If a promising direction appears that is not in the\nplan, the plan changes, not the direction. All plan changes are committed\nto git with a one-line rationale."
}

{
  "filePath": "D:\\Python\\Quantum\\web\\dashboard\\urls.py",
  "oldString": "    path(\"roadmap/\", views.roadmap, name=\"roadmap\"),",
  "newString": "    path(\"roadmap/\", views.roadmap, name=\"roadmap\"),\n    path(\"search/\", views.search, name=\"search\"),",
  "originalFile": "from django.urls import path\n\nfrom . import api, views\n\nurlpatterns = [\n    path(\"\", views.home, name=\"home\"),\n    path(\"dashboard/\", views.dashboard, name=\"dashboard\"),\n    path(\"roadmap/\", views.roadmap, name=\"roadmap\"),\n    path(\"ledger/\", views.ledger, name=\"ledger\"),\n    path(\"ledger/<str:rid>/\", views.ledger_detail, name=\"ledger_detail\"),\n    path(\"experiments/\", views.experiments, name=\"experiments\"),\n    path(\"experiments/<str:eid>/\", views.experiment_detail, name=\"experiment_detail\"),\n    path(\"paper/\", views.paper, name=\"paper\"),\n    path(\"live/\", views.live, name=\"live\"),\n    path(\"conversations/\", views.conversations, name=\"conversations\"),\n    path(\"conversations/<int:spk>/\", views.conversation_session,\n         name=\"conversation_session\"),\n    path(\"conversations/<int:spk>/msg/<int:mid>/\", views.conversation_message,\n         name=\"conversation_message\"),\n    path(\"feedback/\", views.feedback, name=\"feedback\"),\n    path(\"api/health/\", api.health, name=\"api_health\"),\n    path(\"api/status/\", api.status, name=\"api_status\"),\n    path(\"api/logtail/\", api.logtail, name=\"api_logtail\"),\n]\n\nfor kind in (\"derivations\", \"graveyard\", \"journal\", \"resources\"):\n    urlpatterns.append(path(f\"{kind}/\", views.collection, {\"kind\": kind},\n                            name=f\"collection_{kind}\"))\n    urlpatterns.append(path(f\"{kind}/<str:name>/\", views.collection_item,\n                            {\"kind\": kind}, name=f\"item_{kind}\"))\n",
  "structuredPatch": [
    {
      "oldStart": 6,
      "oldLines": 6,
      "newStart": 6,
      "newLines": 7,
      "lines": [
        "     path(\"\", views.home, name=\"home\"),",
        "     path(\"dashboard/\", views.dashboard, name=\"dashboard\"),",
        "     path(\"roadmap/\", views.roadmap, name=\"roadmap\"),",
        "+    path(\"search/\", views.search, name=\"search\"),",
        "     path(\"ledger/\", views.ledger, name=\"ledger\"),",
        "     path(\"ledger/<str:rid>/\", views.ledger_detail, name=\"ledger_detail\"),",
        "     path(\"experiments/\", views.experiments, name=\"experiments\"),"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-001-quantum-formalism-index.md",
  "content": "# D-001 \u2014 Master Equation & Tool Index (living document)\nDate: 2026-08-17 | Session: 001 | Task: 0.1 | Status: in-progress (grows with project)\n\nPurpose (per NGUYEN.md \u00a74A.4): the single living index of ALL equations and\ntools available to the project. Every newly discovered tool \u2014 from any\nsource \u2014 is added here so no session ever rediscovers it. Each entry is\nannotated with its role in the RH attack. Relevance claims are tagged\n[RIGOROUS] / [HEURISTIC] / [SPECULATIVE].\n\nExternal references: Physics Hypertextbook ToC https://physics.info/\n(equation-level reference, consult on demand per \u00a74A.3).\n\n---\n\n## PART I \u2014 QUANTUM FORMALISM (from Notes.txt; Track B core)\n\n### Q1. Born rule \u2014 \u03c1 = |\u03c8|\u00b2, \u222b|\u03c8|\u00b2 dV = 1\n- Role: normalization of states. In Hilbert\u2013P\u00f3lya modeling, candidate\n  eigenfunctions must be square-integrable on the chosen configuration\n  space \u2014 the choice of L\u00b2-space IS the choice of spectral problem. [RIGOROUS]\n\n### Q2. Time-dependent Schr\u00f6dinger equation \u2014 i\u0127 \u2202\u03c8/\u2202t = \u0124\u03c8\n- Role: defines unitary evolution. Contrast with the de Bruijn\u2013Newman flow,\n  which is a HEAT (dissipative) flow \u2202_t f = \u2202_x\u00b2 f driving zeros toward/away\n  from the real line. Unitary vs. dissipative evolution is the structural\n  difference between Track B (spectrum) and Track C (\u039b = 0) attacks. [RIGOROUS analogy]\n\n### Q3. Time-independent Schr\u00f6dinger equation \u2014 \u0124\u03c6 = E\u03c6\n- Role: THE Hilbert\u2013P\u00f3lya template. RH \u27fa \u2203 self-adjoint \u0124 with spectrum\n  {\u03b3_\u03c1} (zero ordinates). Every Track B candidate is an instance: specify\n  Hilbert space + self-adjoint \u0124, compute spectrum, compare to {\u03b3_\u03c1}. [RIGOROUS]\n\n### Q4. Position/momentum operators \u2014 p\u0302 = \u2212i\u0127\u2207, x\u0302 = x\u00b7\n- Role: building blocks of the Berry\u2013Keating Hamiltonian\n  \u0124_BK = \u00bd(x\u0302p\u0302 + p\u0302x\u0302) = \u2212i\u0127(x d/dx + \u00bd), the dilation generator. Its formal\n  \"eigenfunctions\" x^(\u22121/2\u2212iE/\u0127) on the half-line connect directly to the\n  Mellin transform and to \u03b6(\u00bd+iE) \u2014 the critical line appears as the\n  L\u00b2-unitarity axis of the dilation group. [RIGOROUS connection; spectrum\n  problem itself is HEURISTIC \u2014 needs boundary conditions, see Phase 2.2]\n\n### Q5. Canonical commutation relations \u2014 [x\u0302\u1d62, p\u0302\u2c7c] = i\u0127\u03b4\u1d62\u2c7c\n- Role: algebraic foundation. Any operator model importing CCR structure\n  inherits Stone\u2013von Neumann rigidity (unique irreducible representation),\n  which constrains candidate Hamiltonians. The Weyl (exponentiated) form\n  underlies Gabor frames \u2014 see Q6, Q12. [RIGOROUS]\n\n### Q6. Heisenberg uncertainty \u2014 \u0394A \u0394B \u2265 \u00bd|\u27e8[\u00c2,B\u0302]\u27e9|; \u0394x \u0394p \u2265 \u0127/2\n- Role: direct analogue of the paper's critical-density Gabor frame\n  (Lemma 2.1, h = 2\u03c0/L): time-frequency localization limits. ALSO the\n  structural reason for the bandwidth-one ceiling \u2248 0.682: Fourier-support\n  restrictions are uncertainty constraints (cf. Benedicks-type uncertainty\n  principles in harmonic analysis). Track A ceiling analysis should mine\n  uncertainty-principle literature. [HEURISTIC bridge, worth formalizing]\n\n### Q7. Expectation values \u2014 \u27e8A\u27e9 = \u27e8\u03c8|\u00c2|\u03c8\u27e9\n- Role: the Weil form W(f,g) = \u03a3_\u03c1 m_\u03c1 f\u0302(\u03b3_\u03c1) \u1e21\u0302(\u03b3_\u03c1) is formally a sum of\n  spectral weights \u2014 if W were \u27e8f|\u03c1(\u0124)|g\u27e9 for a self-adjoint \u0124, RH follows.\n  Track B central task: realize W as a genuine spectral quadratic form.\n  [RIGOROUS as equivalence \u2014 Weil positivity \u27fa RH; realization is the open problem]\n\n### Q8. Probability current / continuity equation\n- Role: conservation laws for zero dynamics under flows (de Bruijn\u2013Newman,\n  heat flows). Zeros are conserved under continuous deformations except at\n  collisions \u2014 a \"current\" picture for tracking off-line motion. [HEURISTIC]\n\n### Q9. Angular momentum \u2014 so(3) algebra, [L\u1d62,L\u2c7c] = i\u0127\u03b5\u1d62\u2c7c\u2096L\u2096\n- Role: representation-theoretic toolkit. No direct known RH role; kept for\n  completeness. Possible relevance via representation theory of SL(2,\u211d)\n  (Mellin/dilation group) in de Branges theory. [SPECULATIVE]\n\n### Q10. Pauli matrices / spin-\u00bd \u2014 2\u00d72 Hermitian units\n- Role: linear-algebra toolkit for the paper's 2\u00d72 signature blocks:\n  on-line zeros \u2192 rank-one positive blocks P; off-line pairs {\u03c1, 1\u2212\u03c1\u0304} \u2192\n  signature (1,1) blocks Q. Pauli basis diagonalizes any 2\u00d72 Hermitian \u2014\n  useful for inertia computations in the rank\u2013trace inequality. [RIGOROUS utility]\n\n### Q11. Hydrogen atom \u2014 E_n = \u221213.6 eV/n\u00b2\n- Role: example of a completely solved spectral problem; template for\n  \"guess the potential from the spectrum\" inverse problems. No direct RH\n  role identified. [SPECULATIVE \u2014 keep for inverse-spectral intuition]\n\n### Q12. Quantum harmonic oscillator \u2014 E_n = \u0127\u03c9(n+\u00bd), Hermite\u2013Gaussian eigenfunctions\n- Role: HIGH VALUE. Hermite functions are eigenfunctions of the Fourier\n  transform \u2014 the natural self-dual test-function basis for Weil forms\n  (self-dual cones in CGdL20-style SDP, Track A.1.2). Gaussian ground state\n  = extremizer of uncertainty (Q6) and of many Fourier inequalities.\n  Also: oscillator representation of SL(2,\u211d) connects to automorphic forms. [RIGOROUS utility]\n\n### Q13. Time-evolution operator \u2014 \u00db = T exp(\u2212(i/\u0127)\u222b\u0124 dt); Heisenberg picture\n- Role: framework for flow-based attacks (Track C de Bruijn\u2013Newman): study\n  d\u03b3/dt of zero ordinates under deformations of \u0124 or of the window.\n  Heisenberg vs. Schr\u00f6dinger picture = evolve operators vs. evolve states \u2014\n  dual viewpoints for moment methods (evolve G\u0303 vs. evolve test functions). [HEURISTIC bridge]\n\n### Q14. Ehrenfest theorem \u2014 classical limit of expectations\n- Role: gateway to SEMICLASSICS \u2014 the deepest physics\u2013RH bridge. Gutzwiller\n  trace formula: quantum spectrum \u2194 classical periodic orbits. For the\n  Berry\u2013Keating system, periodic orbits are (conjecturally) at lengths\n  log p \u2014 the primes. The Weil explicit formula IS formally a Gutzwiller\n  trace formula with primes as orbits and zeros as spectrum. This is the\n  master heuristic of Track B; making it rigorous = Hilbert\u2013P\u00f3lya. [HEURISTIC \u2014 the central open problem]\n\n---\n\n## PART II \u2014 NUMBER-THEORETIC TOOLS (to be populated in Phases 0.2\u20130.4)\nPlaceholder. Will index: Weil explicit formula, rank\u2013trace inequality,\nMontgomery second moment, window theory R(\u03c8), Gabor compression Lemma 2.1,\nSylvester inertia, SDP self-dual cone machinery, pair-correlation results,\nRudnick\u2013Sarnak moment bounds, Davenport\u2013Heilbronn/Epstein counterexamples.\n\n## PART III \u2014 EXTERNAL DISCOVERIES (web research log, per \u00a74A.3)\n(empty \u2014 each entry: date, URL, tool, what it adds)\n"
}

{
  "type": "create",
  "filePath": "D:\\Python\\Quantum\\web\\rhweb\\urls.py",
  "content": "from django.urls import include, path\n\nurlpatterns = [\n    path(\"\", include(\"dashboard.urls\")),\n]\n",
  "structuredPatch": [],
  "originalFile": null
}

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\db.py",
  "old_string": "def cmd_list(a) -> None:",
  "new_string": "def cmd_add_derivation(a) -> None:\n    con = connect()\n    con.execute(\n        \"\"\"INSERT OR REPLACE INTO derivations\n           (id, title, task, status, file, date) VALUES (?,?,?,?,?,?)\"\"\",\n        (a.id, a.title, a.task, a.status, a.file, date.today().isoformat()),\n    )\n    con.commit()\n    print(f\"logged derivation {a.id}\")\n\n\ndef cmd_add_graveyard(a) -> None:\n    con = connect()\n    con.execute(\n        \"\"\"INSERT OR REPLACE INTO graveyard\n           (id, title, track, obstruction, file, date) VALUES (?,?,?,?,?,?)\"\"\",\n        (a.id, a.title, a.track, a.obstruction, a.file, date.today().isoformat()),\n    )\n    con.commit()\n    print(f\"logged graveyard entry {a.id}\")\n\n\ndef cmd_list(a) -> None:"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\paper\\draft.tex",
  "oldString": "with $R(\\psi_0) = 4/3$ for the triangle window and\n$R(\\psi_{MT}) = \\tfrac12 + \\tfrac{1}{\\sqrt2}\\cot\\tfrac{1}{\\sqrt2}\n= 1.32749\\ldots$ for the Montgomery--Taylor window (both verified\nsymbolically to $60$ digits in this project), giving the certified\nfractions $2 - R(\\psi)$: $0.6725$ of zeros simple and on the line,\n$0.83625$ distinct.",
  "newString": "with $R(\\psi_0) = 4/3$ for the flat window\n$\\psi_0 = \\mathbf 1_{[-1/2,1/2]}$ and\n$R(\\psi_{MT}) = \\tfrac12 + \\tfrac{1}{\\sqrt2}\\cot\\tfrac{1}{\\sqrt2}\n= 1.32749\\ldots$ for the Montgomery--Taylor window (both verified\nsymbolically and against $60$-digit reference values in this project,\nE-001), giving the certified fractions $2 - R(\\psi)$: $0.6725$ of\nzeros simple and on the line, $0.83625$ distinct.",
  "originalFile": "% ============================================================\n% NGUYEN-RH-1 \u2014 working paper draft (living document)\n% Grown incrementally from research/results/ (each R-# = verified part)\n% ============================================================\n\\documentclass[11pt]{article}\n\\usepackage{amsmath,amssymb,amsthm,mathtools}\n\\usepackage[colorlinks=true,linkcolor=blue,citecolor=blue]{hyperref}\n\n\\newtheorem{theorem}{Theorem}\n\\newtheorem{lemma}[theorem]{Lemma}\n\\newtheorem{corollary}[theorem]{Corollary}\n\\theoremstyle{definition}\n\\newtheorem{definition}[theorem]{Definition}\n\\theoremstyle{remark}\n\\newtheorem{remark}[theorem]{Remark}\n\n\\title{Toward the Riemann Hypothesis:\\\\\nWorking Draft --- Project NGUYEN-RH-1}\n\\author{Kimi K3\\thanks{Moonshot AI}\n\\and Claude Code\\thanks{Anthropic}\n\\and Dan T Nguyen\\thanks{ResearchAi}}\n\\date{Started: 2026-08-17; revised 2026-08-19}\n\n\\begin{document}\n\\maketitle\n\n\\begin{abstract}\nThree contributions, each carrying an explicit correctness tag.\n(1)~[proved, conditional on computation] An explicit finite-height\nLi-positivity theorem: the Keiper--Li coefficients satisfy\n$\\lambda_n > 0$ for all $1 \\le n \\le (T_0-1)^2 \\approx 9\\times10^{24}$,\nconditional on the interval-arithmetic verification of RH to height\n$T_0 = 3\\times10^{12}$ (Platt--Trudgian) and on finite Li-coefficient\ncomputations, with every constant traced (first assembled explicit\nchain; by Voros's sharpening this is the maximal content of the Li\nroute short of RH).\n(2)~[proved modulo itemized formalities] On Suzuki's operator line:\nan exact factorization $W = F\\cdot(R_0 + R_\\tau)$ of his\ncharacteristic function reducing his Corollary~1.6 to a\nWiener--Hopf tail-cancellation, and a Krein-space reduction of his\nlimit formula to a real-spectrum statement.\n(3)~[proved, conditional on RH] A valley theorem for the\nreproducing-kernel diagonal of the associated model spaces\n(plateau, floors, universal profile), explaining and certifying a\nspectral-measure analysis carried out numerically to $a = 12$: the\nkernel diagonal exhibits valleys exactly at the true zero ordinates\n(symbol $= 1 + {}$zero comb), positions lock quadratically, and the\nconsolidation obstruction is isolated as a generic Szeg\\H{o}\nequilibrium with residual $\\to Z/(2\\pi)$; all identified breaking\nchannels are mapped, with closures documented.\n\\end{abstract}\n\n\\section{Introduction}\n\nThe Riemann hypothesis (RH) asserts that every nontrivial zero of\n$\\zeta(s)$ has real part $1/2$. The strongest unconditional density\nresult to date is the (machine-verified) theorem that at least $2/3$\nof the nontrivial zeros are simple and on the critical line, and at\nleast $5/6$ of the zeros in a given range are distinct\n\\cite{anthropic2026riemann}; the underlying certificate method has a\ndocumented bandwidth-one ceiling near $0.682$ of the zeros. Two\nclassical reformulations frame most modern attacks: \\emph{Weil\npositivity} --- positivity of the Weil quadratic form on all of\n$C_c^2(\\mathbb R)$ is equivalent to RH \\cite{weil1952fonctions,\nbombieri2000weil}, and the negative index of its truncations counts\noff-line zero pairs \\cite{bombieri2000weil} --- and \\emph{Li's\ncriterion} --- $\\lambda_n > 0$ for all $n$ is equivalent to RH\n\\cite{li1997, bombieri1999lagarias}, with Voros's sharpening that\npositivity of any tail $\\{\\lambda_n\\}_{n \\ge N_0}$ already implies RH\n\\cite{voros2006sharpenings}.\n\nThis paper reports the output of a systematic research program that\nattacked RH along four tracks (certificate extension, spectral /\nHilbert--P\\'olya, positivity criteria, formal verification), closing\neach route either with a theorem or with a documented obstruction.\nEvery claim carries an explicit correctness tag, and every numerical\ninput is produced by a deterministic, archived script. The three\ntheorem-level contributions are:\n\n\\begin{enumerate}\n\\item \\textbf{An explicit finite-height Li theorem} (Section~3.1).\nConditional on the interval-arithmetic verification of RH to height\n$T_0 = 3\\times10^{12}$ \\cite{platt2021riemann} and on finite\nLi-coefficient computations, $\\lambda_n > 0$ for all\n$n \\le (T_0-1)^2 \\approx 9\\times10^{24}$, with all constants traced\nthrough Lagarias's contour argument \\cite{lagarias2007li}. By Voros's\nsharpening no infinite-range partial statement exists, so this is the\nmaximal content of the Li route short of RH; the explicit chain\nappears not to have been assembled before.\n\n\\item \\textbf{The Suzuki operator line, reduced} (Section~3.2).\nSuzuki's self-adjoint operator family $\\bar D_{a,\\theta}$\n\\cite{suzuki2026weil} realizes the Weil form through model spaces of a\n\\emph{screw function}; his Corollary~1.6 asserts that a certain limit\nformula would imply RH. We give an exact factorization of his\ncharacteristic function, $W = F\\,(R_0 + R_\\tau)$, isolating the open\ncontent of the limit formula as a finite-interval Wiener--Hopf\ntail-cancellation $(\\star)$ on the symbol $\\hat g = z^{-2}\\xi'/\\xi$,\nand a Krein-space reduction: the limit formula holds for some boundary\nflow $\\theta(a)$ if and only if the limit operator has real spectrum.\n\n\\item \\textbf{The valley theorem} (Section~3.3). Conditional on RH,\nthe reproducing-kernel diagonal $K_a(z,z)$ of the model spaces\n$\\mathcal H(T_a)$ is proved to exhibit a plateau $\\to 2a$ away from\nthe zeros and valleys of depth $\\log 2a + o(1)$ with a universal\nprofile at the zero ordinates. This certifies, and is certified by, a\nnumerical spectral-measure analysis to $a=12$: the operator's symbol\nis $1 + {}$the zero comb (the explicit formula in operator-symbol\nform), spectral atoms lock onto the true ordinates quadratically\n($0.65/a^2$), and the obstruction to ``consolidation'' of the measure\nonto the zeros is isolated as a generic Szeg\\H{o} equilibrium with\nresidual $\\to Z/(2\\pi)$ per window $[0,Z]$. A stress test with\nsynthetic off-line zero pairs shows the associated detector responds\nat three levels (bare form, pencil, tuned carrier).\n\\end{enumerate}\n\nSection~4 collects the obstruction analysis: routes that are closed,\nwith the obstruction identified in each case (six-wall ceiling map for\ncertificate extension; substitution symmetries; one-sided information\nin density routes; disjoint feasibility windows for the ground-state\nchannel). Appendix~A describes the numerical machinery;\nAppendix~B the formal-verification status.\n\n\\section{Background: the Weil-form certificate method}\n\nWe recall the machinery behind the state-of-the-art density theorem\n\\cite{anthropic2026riemann}, which is the launchpad and the sanity\ngate for everything below; details and notation follow that paper.\n\n\\emph{The Weil explicit formula} \\cite{weil1952fonctions} expresses,\nfor a test function $\\psi$ supported in $[-\\tfrac12,\\tfrac12]$ (the\n\\emph{bandwidth-one} class), a quadratic form on the zeros as a\nfunctional of the primes. Compressing it via a Gabor (Gaussian\nwindowed exponential) frame at the critical density $h = 2\\pi/L$\nyields a finite matrix identity $\\tilde G = P + Q$: a zero-side\nmatrix $\\tilde G$ built from the zeros in a window of size $L$\ndecomposes into a prime-side matrix $P$ (computed unconditionally\nfrom Montgomery's second moment / pair-correlation input\n\\cite{montgomery1973pair}) and a controlled remainder $Q$.\n\n\\emph{The rank--trace inequality.} Writing $\\tilde G$ in inertia form,\na rank--trace comparison between the positive eigenspace of $\\tilde G$\nand the positive part of $P$ converts the second-moment input\n$\\|\\tilde G\\|_{HS}^2 = (R(\\psi) + o(1))\\,N$ into a lower bound on the\nnumber of simple on-line zeros in the window. The strength of the\ncertificate is governed by the \\emph{window ratio}\n\\[\nR(\\psi) \\;=\\; \\frac{\\int \\psi^2 \\;+\\;\n\\iint |u-v|\\,\\psi(u)\\psi(v)\\,du\\,dv}{\\bigl(\\int \\psi\\bigr)^2}\n\\qquad (\\psi \\in C([-\\tfrac12,\\tfrac12]) \\text{ even}, \\ \\psi > 0),\n\\]\nwith $R(\\psi_0) = 4/3$ for the triangle window and\n$R(\\psi_{MT}) = \\tfrac12 + \\tfrac{1}{\\sqrt2}\\cot\\tfrac{1}{\\sqrt2}\n= 1.32749\\ldots$ for the Montgomery--Taylor window (both verified\nsymbolically to $60$ digits in this project), giving the certified\nfractions $2 - R(\\psi)$: $0.6725$ of zeros simple and on the line,\n$0.83625$ distinct. A sharpness analysis locates the bandwidth-one\nceiling of the method at $\\approx 0.682$, and shows the obstructions\nto going further are structural (Section~4).\n\nTwo features of this machinery matter for the present paper. First,\nits only zero-side input is the Weil form itself, so any\nreformulation of the Weil form --- as an operator family (Suzuki's\nline, Section~3.2) or as a reproducing-kernel variational problem\n(Section~3.3) --- inherits the same positivity content. Second, the\ncertificate fails, as it must, for the Davenport--Heilbronn and\nEpstein zeta functions (which violate the RH-analogue); we use this\nas a standing sanity gate on every new criterion.\n\n\\section{Results}\n% Each new theorem/lemma imported from research/results/R-NNN-*.md\n% with its [PROVED]/[PROVED-CONDITIONAL] tag.\n\n\\subsection{An explicit finite-height Li-positivity theorem (R-004)}\n\nLet $\\lambda_n = \\sum_{\\rho}{}'\\,\\bigl[1-\\bigl(1-\\tfrac1\\rho\\bigr)^n\\bigr]$\nbe the Keiper--Li coefficients of the Riemann $\\xi$-function. Li's\ncriterion states $\\lambda_n > 0$ for all $n \\geq 1$ if and only if the\nRiemann hypothesis holds \\cite{li1997,bombieri1999lagarias}. Voros\n\\cite{voros2006sharpenings} showed that ``$\\lambda_n > 0$ for all\n$n \\geq N_0$'' is already equivalent to RH for any $N_0$, so no\npartial infinite-range statement exists; the maximal content of the Li\nroute short of RH is an \\emph{explicit finite-height} statement.\n\n\\begin{theorem}[R-004; conditional on computation]\n\\label{thm:finite-height-li}\nAssume the Riemann hypothesis verified to height\n$T_0 = 3\\times 10^{12}$ (Platt--Trudgian \\cite{platt2021riemann},\ninterval arithmetic). Then\n\\[\n\\lambda_n > 0 \\qquad \\text{for all } 1 \\le n \\le N_1 := (T_0-1)^2\n= 8\\,999\\,999\\,999\\,994\\,000\\,000\\,000\\,001 \\approx 9.0\\times 10^{24}.\n\\]\n\\end{theorem}\n\n\\begin{proof}[Proof sketch (full assembly: D-037)]\nBombieri--Lagarias \\cite{bombieri1999lagarias} give\n$\\lambda_n = S_\\infty(n) - S_f(n) + 1$ with $S_\\infty$ the archimedean\nand $S_f$ the finite-place contribution.\n\n\\emph{Step 1 (archimedean lower bound).} From Lagarias's formula\n\\cite[(4.11)]{lagarias2007li},\n$S_\\infty(n) = \\sum_{j=1}^n (-1)^j \\binom{n}{j} a_j$ with\n$a_1 = (\\log 4\\pi + \\gamma)/2$ and $a_j = (1-2^{-j})\\zeta(j)\n= \\sum_{m \\text{ odd}} m^{-j}$ ($j \\ge 2$), the $j$-sum is a finite\ndifference and one obtains the \\emph{exact} identity\n$S_\\infty(n) = (1-a_1)n - 1 + \\sum_{m \\ge 3,\\, m \\text{ odd}}\n\\bigl[(1-\\tfrac1m)^n - 1 + \\tfrac{n}{m}\\bigr]$.\nBernoulli's inequality and the explicit harmonic bounds\n$\\log M + \\gamma + \\tfrac{1}{2M} - \\tfrac{1}{12M^2} \\le H_M \\le\n\\log M + \\gamma + \\tfrac{1}{2M}$ give, for $n \\ge 20$,\n\\[\nS_\\infty(n) \\;\\ge\\; \\tfrac12 n\\log n + (C_1 - \\tfrac{\\gamma}{2})\\,n - 4,\n\\qquad C_1 = \\tfrac{\\gamma - 1 - \\log 2\\pi}{2}.\n\\]\n(Machine-validated against exact values for $20 \\le n \\le 5000$.)\n\n\\emph{Step 2 (finite-part upper bound).} Tracing Lagarias's contour\nargument \\cite[Thm~6.1]{lagarias2007li} with explicit constants\n(Trudgian's $N(T)$ and $S(T)$ bounds \\cite{trudgian2014}, partial\nfractions for $\\zeta'/\\zeta$ with the reference-point estimate\n$|R(s)| \\le 10.5\\log(|t|{+}2) + 48$ for $-5/2 \\le \\sigma \\le 3$,\n$|t| \\ge 10$ (D-056), kernel bounds $e^4+1$, a measured\nshort-segment constant $M_0 = 1.3352$) gives\n$|S_f(n)| \\le B(n)$ with\n\\[\nB(n) = 2N(\\sqrt n{+}1) + 4T\\bigl[\\tfrac23 C_0(T) + 10.5\\log(T{+}2) + 48\\bigr]\n+ 40M_0 + 2(e^4{+}1)\\bigl[7H(T) + 3.3\\bigr] + o(1),\n\\]\n$T = \\sqrt n + 1$, $C_0(t)$ the explicit unit-interval zero count\n(the honest Trudgian form, including the $\\log\\log$ term),\n$H(T) = 3C_0(T)^2 + 10.5\\log(T{+}2) + 48$.\n\n\\emph{Step 3 (bridge).} For $n \\le (T_0-1)^2$ every zero with\n$|\\gamma| \\le \\sqrt n + 1$ is on the line, so\n$|1-(1-1/\\rho)^n| \\le 2$ per zero and\n$|\\lambda_n(T)| \\le 2N(T)$; all other contour terms are\n\\emph{unconditional}.\n\n\\emph{Step 4 (margin).}\n$\\mathrm{margin}(n) := \\tfrac12 n\\log n + (C_1 - \\gamma/2)n - 4 - B(n) + 1$\nis convex for $n \\ge 20$ (proved: chain-rule reduction to eleven\none-variable sign conditions, each discharged elementarily \u2014 D-057),\nand $\\mathrm{margin}(8\\times 10^4) = 16\\,020 > 0$ with positive\nderivative; hence\n$\\mathrm{margin}(n) > 0$ for all $n \\in [8\\times10^4, N_1]$\n(also computed to $n = 4\\times10^5$ on a unit grid and to $N_1$ on a\nlogarithmic grid; $\\mathrm{margin}(N_1) = 2.458\\times 10^{26}$).\n\n\\emph{Step 5 (finite verification).} $\\lambda_n > 0$ for $n \\le 3000$\nby exact high-precision computation (this project, two independent\nmethods, agreement to $4.8\\times10^{-25}$ relative), and for\n$n \\le 5\\times10^5$ by Misguich--Voros \\cite{voros2017li}. The ranges\noverlap $N_0 = 8\\times 10^4$ by a factor $6.25$.\n\\end{proof}\n\n\\begin{remark}\n(i) Using Lagarias's printed bridge window $n \\le T^2/(4\\log^2 T)$\ninstead of the traced proof gives the conservative\n$N_1^* = 2.73\\times 10^{21}$; the theorem is robust either way.\n(ii) The traced worst-case bound $|S_f|$ is $\\sim 170\\times$ loose\nagainst the measured curve ($|S_f| \\le 13.52$ for $n \\le 5000$); the\nslack is structural to contour constants, not a gap.\n(iii) The dependence on computation is explicit: Platt--Trudgian's\ninterval-arithmetic verification, and the finite Li-coefficient\nverifications.\n\\end{remark}\n\n\\subsection{The Suzuki operator line: exact factorization and the\nspectral-measure equilibrium (R-003, D-040--D-046)}\n\nSuzuki \\cite{suzuki2026weil} constructs, for each $a > 0$, a\nself-adjoint operator family $\\bar D_{a,\\theta}$ on model spaces\n$\\mathcal H(T_a)$ built from the \\emph{screw function} $g$ of $\\zeta$\n($\\hat g(z) = z^{-2}\\xi'(\\tfrac12-iz)/\\xi(\\tfrac12-iz)$), whose spectra\nare the zeros of\n$W(a,\\theta;z) = (z-i)V_+(z) + e^{i\\theta}(z+i)V_-(z)$, with $V_\\pm$\nthe Fourier transforms of deficiency vectors. His Corollary~1.6 states\nthat a limit formula $e^{\\phi(a,z)}W(a,\\theta(a);z) \\to\nz^2\\xi(\\tfrac12-iz)/\\xi'(\\tfrac12-iz)$ (uniform on compacts, for some\nchoice of $\\theta(a)$, $\\phi$) would imply RH.\n\n\\begin{theorem}[R-003; modulo standard tempered-FT bookkeeping]\nOne has the exact factorization\n$W(a,\\theta;z) = F(z)\\,M(a,\\theta;z)$ with\n$F(z) = z^2\\xi(\\tfrac12-iz)/\\xi'(\\tfrac12-iz)$ and\n$M = R_0 + R_\\tau$, where\n$R_0 = 2e^{a+i\\theta/2}\\sin(az - \\theta/2) + o(e^a)$ is an explicit\nsine skeleton and $R_\\tau$ is the out-of-interval tail transform.\nHence the limit formula is equivalent to the \\emph{tail-cancellation\nstatement} $(\\star)$: $R_\\tau$ cancels the skeleton leaving a zero-free\nremainder \u2014 a finite-interval Wiener--Hopf remainder estimate on the\nsymbol $\\hat g$, whose factorization is gated by the zero locations.\n\\end{theorem}\n\nWe studied the spectral (Clark/de~Branges) measures\n$\\mu_a = \\sum_k w_k\\,\\delta_{z_k}$ of $\\bar D_{a,\\pi}$ numerically to\n$a = 12$ ($w_k = 1/K_a(z_k,z_k)$, $K_a$ the model-space reproducing\nkernel; Galerkin machinery validated against the zero-side explicit\nformula to $4.5\\times10^{-6}$). The picture that emerges\n(D-040--D-045):\n\\begin{enumerate}\n\\item \\emph{The metric knows the zeros.} $K_a(z,z)$ has deep narrow\nvalleys exactly at the true ordinates $\\gamma$ (depth\n$\\Delta(a) \\approx \\log a + 0.64$, width $\\sim 1.5/a$), while\n$K_a(z,z) \\to 2a$ (the free Paley--Wiener diagonal) on the plateau:\nthe operator's symbol is \\emph{1 + the zero comb} \u2014 the explicit\nformula in operator-symbol form.\n\\item \\emph{Positions lock and masses are right.} Each $\\gamma$ has a\nspectral atom within $\\approx 0.65/a^2$ (quadratic locking, correcting\nan earlier wrong-direction metric), carrying mass $\\approx m_\\gamma = 1$.\n\\item \\emph{The equilibrium.} The residual mass over the excess\n(lattice) atoms tends to $Z/(2\\pi)$ per window $[0,Z]$, not to zero:\nthe family equilibrates exactly at the consolidation boundary\n(generic Szeg\\H{o} bulk behavior). At fixed $\\theta$ this is structural\n($\\theta$-independence is measured: residual spread $\\le 2.2\\%$ over\nthe full extension family).\n\\item \\emph{The breaking mechanism.} A shift $\\lambda \\to \\lambda_a^-$\n(bottom of the Weil-form spectrum) pins the valley floors (masses stay\n$1$) while the plateau response diverges \u2014 the unique channel that\nkills the residual. It is machinery-blocked: $\\lambda_a$ decays\nsuperexponentially ($0.414$ at $a{=}0.25$ to $<3\\times10^{-12}$ at\n$a{=}2$) below any achievable discretization floor at zero-resolving\n$a$ (Graveyard G-004).\n\\end{enumerate}\n\nOn the operator-theoretic side (D-041): the limit operator $D$ exists\nunconditionally as a $J$-self-adjoint operator in a Krein space\n(negative index = number of off-line zero pairs, Bombieri), with\n$\\mathrm{spec}(D) = \\Gamma$; and deficiency-element convergence is\nequivalent to strong resolvent convergence\n$\\bar D_{a,\\theta(a)} \\to D$ (Theorem D1), giving the reduction:\nthe limit formula (1.12) holds for some $\\theta(a), \\phi$ if and only\nif $\\mathrm{spec}(D) \\subset \\mathbb R$. The real-spectrum persistence\nstep is exactly RH (the paywall), as expected.\n\n\\subsection{The valley theorem (D-048--D-050)}\n\nThe spectral-measure picture above rests on a theorem about the\nreproducing-kernel diagonal $K_a(z,z) = \\langle e_z, T_a^{-1}e_z\\rangle$\nof the model spaces $\\mathcal H(T_a)$.\n\n\\begin{theorem}[valley law; conditional on RH]\nAssume RH. For $a \\ge 1$, $z \\in \\mathbb R$:\n\\begin{enumerate}\n\\item \\emph{(plateau)} $K_a(z,z) \\le 2a$ exactly, and\n$K_a(z,z) \\ge 2a(1 - C'(z,\\delta)/a)$ for\n$\\mathrm{dist}(z,\\Gamma) \\ge \\delta$, with explicit $C'$;\n\\item \\emph{(floors)} at each zero $\\gamma$,\n$K_a(\\gamma,\\gamma) \\le 1/m_\\gamma$ exactly; and if $\\gamma$ has no\nother zero within distance $1$,\n\\[\n1 - \\tfrac{1}{2a} - C\\tfrac{1+\\log\\gamma}{a^2}\n\\;\\le\\; K_a(\\gamma,\\gamma),\n\\]\nwith explicit $C$; in general the same rate holds up to an explicit\nlocal-configuration constant (a Gram-determinant factor and an\nannulus count $E(\\gamma,a)$, zero generically) via node-killing\nprojection test functions (D-058);\n\\item \\emph{(profile)} near such a zero, $K_a$ has the universal lower\nenvelope $1/(\\mathrm{sinc}^2((z-\\gamma)a) + 1/(2a) + D_1/(4a^2))$.\n\\end{enumerate}\nIn particular the valley depth $\\Delta(a) = \\log 2a + o(1)$.\n\\end{theorem}\n\n\\begin{proof}[Proof idea (D-049, D-058)]\nThe variational identity\n$K_a(z,z) = \\sup_v |\\hat v(z)|^2/(\\|v\\|^2 + Q_W^a(v))$ (the sup over\nthe zero-side form domain, which contains the flat bumps \u2014 Lemma FD)\nwith the Weil explicit formula $Q_W^a(v) = \\sum_\\gamma m_\\gamma|\\hat\nv(\\gamma)|^2$ (the pure comb under RH). Plateau upper bound:\n$T_a \\ge I$. Floor: single-term domination above; below, the flat\nbump for isolated zeros, and in general the projection of $e_\\gamma$\noff the span of the nearby evaluation vectors (which vanishes exactly\nat the neighboring zeros). The combinatorial input is Trudgian's\nzero-density bound.\n\\end{proof}\n\n\\begin{remark}[the detector content; D-050, E-027]\nThe detector has three levels (measured, E-027; all four cases\n$a \\in \\{4,8\\}$, two heights): (L1) the bare Weil form is indefinite\nfor \\emph{any} off-line deviation $\\delta > 0$ (strict Schwarz on the\ntwo evaluation functionals; no threshold), with tiny magnitude near\n$\\delta = 0$; (L2) the pencil $T_a = I + B_a$ loses positivity at a\nmagnitude-set onset (measured $\\delta \\approx 0.11$ at $a=4$,\n$0.038$ at $a=8$); (L3) the tuned flat-carrier quotient turns negative\nexactly at $\\delta = \\pi/(2a)$ (proved one-direction; measured to\n$0.9\\%$). Hence the measured valley picture (floors $\\approx 1$ at\nthe true ordinates, plateau $\\to 2a$) is a numerical verification of\nWeil positivity in the $\\mathcal H(T_a)$ metric to scale $a = 12$,\nand an off-line pair produces negative form directions localized at\nits height.\n\\end{remark}\n\n\\section{Obstruction analysis}\n% Documented dead ends from research/graveyard/ where they\n% delimit the method (contributes to success criterion 4).\n\nThe following routes are closed with documented obstructions\n(full files in the project archive, graveyard G-001--G-004 and\nderivations D-009--D-013):\n\\begin{itemize}\n\\item \\emph{Certificate extension past $2/3$ in the bandwidth-one\nframework} (Track A): a six-wall map (D-013) shows $>2/3$ is\nimpossible within the current data class; the window-class optimum is\nsaturated in both the $\\xi$ and $\\xi'$ worlds (D-009, D-030), and\nmoment-ladder certificates cap below $2/3$ at every order (G-002).\n\\item \\emph{Multiple-zero bounds as chain input} (G-001): the\n$s_2/p$ substitution symmetry makes depth$\\to$0 off-line pairs\nindistinguishable from double zeros in all two-moment data.\n\\item \\emph{Density theorems $\\to$ de~Bruijn--Newman $\\Lambda$}\n(G-003): one-sided information \u2014 density theorems lower-bound the\non-line fraction while $\\Lambda$ requires an upper bound on the\ncomplex fraction.\n\\item \\emph{$\\xi^{(k)}$-certificate routes} (T4/T4b, D-022, D-031):\nthe strength mechanism (a perfect-square node in the diagonal law)\ndoes not transfer to $\\xi$, and the $s_2/p$ symmetry caps every\nderivative class below $100\\%$.\n\\item \\emph{The $\\lambda \\to \\lambda_a^-$ ground-state channel}\n(G-004, D-046): the feasibility windows are disjoint \u2014 ground-state\nresolution requires $a \\lesssim 1.3$ (superexponential decay of\n$\\lambda_a$) while zero resolution requires $a \\gtrsim 4$.\n\\end{itemize}\n\n\\appendix\n\\section{Numerical experiments}\n% Tables/figures generated from research/numerics/data/ CSVs.\n\nAll experiments are deterministic scripts with CSV+JSON sidecars in the\nproject archive (\\texttt{research/numerics/}); checks as stated.\n\n\\subsection{Li-coefficient machinery (E-011/E-015/E-021/E-023)}\n\\begin{itemize}\n\\item $\\lambda_n > 0$ verified for $n \\le 3000$ from the arithmetic\nside (Bombieri--Lagarias Thm~2, zero-free; \\textsc{flint} Stieltjes +\nArb $\\zeta$, 1000--1450-digit working precision), cross-validated\nagainst the zero-side computation (agreement $4.8\\times10^{-25}$\nrelative) and $\\lambda_1$ to 102 digits against\n$\\gamma/2$-type closed forms.\n\\item Exact archimedean part: $S_\\infty(n) = \\tfrac12 n\\log n + C_1 n\n- \\tfrac14 - \\tfrac{1}{24n} + o(1/n)$ measured to $n = 5000$\n($c_0 = -1/4$ identified exactly; residuals match $-1/4 - 1/(24n)$ to\nall printed digits), and $|S_f(n)| \\le 13.52$ for $n \\le 5000$\n(max at $n = 3298$) vs the traced worst-case $\\sim 2280$ there \u2014\nthe contour constants are $\\sim 170\\times$ loose, as documented.\n\\item Margin assembly (E-028, fully traced constants $A = 10.5$,\n$B_0 = 48$): crossover at $n = 75\\,451$; adopted $N_0 = 8\\times10^4$\nwith margin $16\\,020$ and positive derivative; convexity proved\n(D-057) and grid-confirmed to $N_1 \\approx 9\\times10^{24}$;\n$\\mathrm{margin}(N_1) = 2.458\\times10^{26}$. (First-estimate\nconstants $2/2$: crossover $32\\,871$; measured $0.9/1.0$: $30\\,217$.)\n\\end{itemize}\n\n\\subsection{Spectral-measure program (E-016--E-025)}\n\\begin{itemize}\n\\item Galerkin realization of Suzuki's Weil-form operator validated\nagainst the zero-side explicit formula to $4.5\\times10^{-6}$;\nzero-location by sign-change + Brent refinement; winding-number\ndiagnostics for off-axis zeros.\n\\item Clark/de~Branges weights $1/K_a(z_k,z_k)$ via Schur-reduced\nbordered Toeplitz solves (validated to $3.6\\times10^{-14}$ against\ndense bordered solves; $h$-refinement $1.1\\times10^{-3}$).\n\\item Valley observable: $\\Delta(a) = 2.16, 2.51, 2.74, 2.87, 2.94$\nfor $a = 4,6,8,10,12$; plateau $K \\to 2a$; floors $\\approx 1.04$;\nmass within $\\pm0.1$ of true zeros $63\\% \\to 72.5\\%$; positional\nlocking $\\approx 0.65/a^2$; residual $\\to Z/(2\\pi)$.\n\\item $\\theta$-independence (E-024): residual spread $\\le 2.2\\%$ over\n$7$ boundary conditions $\\times$ $3$ values of $a$.\n\\item $\\lambda$-flow (E-025): discretization floor documented\n(pencil bottom crosses zero at $a \\approx 5.2$ for $h = 0.01$,\n$O(h)$ artifact); channel response measured at $a=4$\n($\\Delta\\colon 2.16 \\to 6.99$, residual $48 \\to 11$).\n\\item Detector stress test (E-027): a synthetic off-line zero pair\n(mid-gap heights $23.0$, $51.4$; $a \\in \\{4,8\\}$; Legendre--Galerkin\nzero-side form, $N > \\gamma^* a$) confirms the three-level detector\npicture: bare-form negativity onset immediate ($\\sim 10^{13}\\times$\ncontrol floor at the smallest $\\delta$), pencil positivity loss at\n$\\delta \\approx 0.11$ ($a=4$) / $0.038$ ($a=8$), tuned-carrier\nthreshold at $\\pi/(2a)$ to $\\le 0.9\\%$; negative directions\nlocalized at the pair (contrast $3.4$--$6.1$).\n\\end{itemize}\n\n\\section{Formal verification}\n\nThe inherited density theorem \\cite{anthropic2026riemann} is formally\nverified in Lean~4 (repository \\texttt{zeta-23-lean}, tag v1.0); a\nstatic audit performed in this project confirmed the published axiom\nprofile: no real axioms beyond \\texttt{propext},\n\\texttt{Classical.choice}, and \\texttt{Quot.sound}, with\n\\texttt{sorry} occurring only in the trusted challenge-statement stubs\n(full \\texttt{lake} rebuild deferred).\n\nThe new results of this paper are \\emph{not yet} formalized. In order\nof increasing formalization cost, the targets are: (i) the elementary\narchimedean lower bound for $S_\\infty(n)$ and the margin convexity\n(eleven one-variable sign conditions, each elementary --- suited to a\n\\texttt{positivity}/interval-arithmetic tactic pipeline); (ii) the\ntraced contour bound for $|S_f(n)|$ (requires explicit $N(T)$, $S(T)$,\nand partial-fraction bounds for $\\zeta'/\\zeta$ --- a nontrivial but\nfinite library task); (iii) the valley theorem (requires a formal\nmodel-space/reproducing-kernel infrastructure that does not currently\nexist in \\textsc{Mathlib}); (iv) the Wiener--Hopf reduction\n(Section~3.2), whose remaining steps are open mathematics rather than\nformalization work. The finite-height Li theorem is, by design,\n\\emph{conditional} on computations (Platt--Trudgian's interval\narithmetic; the Li-coefficient verifications); formalizing the\n\\emph{reduction} would leave exactly those computational certificates\nas trusted inputs, which we regard as the honest formal target.\n\n\\bibliographystyle{plain}\n\\bibliography{references}\n\\end{document}\n",
  "structuredPatch": [
    {
      "oldStart": 149,
      "oldLines": 12,
      "newStart": 149,
      "newLines": 13,
      "lines": [
        " \\iint |u-v|\\,\\psi(u)\\psi(v)\\,du\\,dv}{\\bigl(\\int \\psi\\bigr)^2}",
        " \\qquad (\\psi \\in C([-\\tfrac12,\\tfrac12]) \\text{ even}, \\ \\psi > 0),",
        " \\]",
        "-with $R(\\psi_0) = 4/3$ for the triangle window and",
        "+with $R(\\psi_0) = 4/3$ for the flat window",
        "+$\\psi_0 = \\mathbf 1_{[-1/2,1/2]}$ and",
        " $R(\\psi_{MT}) = \\tfrac12 + \\tfrac{1}{\\sqrt2}\\cot\\tfrac{1}{\\sqrt2}",
        " = 1.32749\\ldots$ for the Montgomery--Taylor window (both verified",
        "-symbolically to $60$ digits in this project), giving the certified",
        "-fractions $2 - R(\\psi)$: $0.6725$ of zeros simple and on the line,",
        "-$0.83625$ distinct. A sharpness analysis locates the bandwidth-one",
        "+symbolically and against $60$-digit reference values in this project,",
        "+E-001), giving the certified fractions $2 - R(\\psi)$: $0.6725$ of",
        "+zeros simple and on the line, $0.83625$ distinct. A sharpness analysis locates the bandwidth-one",
        " ceiling of the method at $\\approx 0.682$, and shows the obstructions",
        " to going further are structural (Section~4).",
        " "
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\db.py",
  "old_string": "    l = sub.add_parser(\"list\")",
  "new_string": "    d = sub.add_parser(\"add-derivation\")\n    d.add_argument(\"id\")\n    d.add_argument(\"--title\", required=True)\n    d.add_argument(\"--task\", default=\"\")\n    d.add_argument(\"--status\", default=\"in-progress\")\n    d.add_argument(\"--file\", required=True)\n    d.set_defaults(func=cmd_add_derivation)\n\n    g = sub.add_parser(\"add-graveyard\")\n    g.add_argument(\"id\")\n    g.add_argument(\"--title\", required=True)\n    g.add_argument(\"--track\", default=\"\")\n    g.add_argument(\"--obstruction\", required=True)\n    g.add_argument(\"--file\", required=True)\n    g.set_defaults(func=cmd_add_graveyard)\n\n    l = sub.add_parser(\"list\")"
}

{
  "filePath": "D:\\Python\\Quantum\\web\\dashboard\\templates\\dashboard\\feedback.html",
  "oldString": "<div class=\"grid-2\">\n<section class=\"card\">\n  <h2>Submit</h2>\n  <form method=\"post\" class=\"fb-form\">\n    {% csrf_token %}\n    <label>Name (optional)\n      <input type=\"text\" name=\"name\" maxlength=\"120\" placeholder=\"Anonymous\">\n    </label>\n    <label>Category\n      <select name=\"category\">\n        {% for value, label in categories %}<option value=\"{{ value }}\">{{ label }}</option>{% endfor %}\n      </select>\n    </label>\n    <label>Your feedback\n      <textarea name=\"text\" rows=\"7\" required\n        placeholder=\"An idea for a track, a reference we should read, a correction, a question\u2026\"></textarea>\n    </label>\n    <button type=\"submit\">Submit feedback</button>\n  </form>\n</section>\n\n<section class=\"card\">\n  <h2>Search</h2>\n  <form method=\"get\" class=\"fb-search\">\n    <input type=\"text\" name=\"q\" value=\"{{ q }}\" placeholder=\"Search text\u2026\">\n    <select name=\"category\">\n      <option value=\"\">All categories</option>\n      {% for value, label in categories %}\n        <option value=\"{{ value }}\" {% if cat == value %}selected{% endif %}>{{ label }}</option>\n      {% endfor %}\n    </select>\n    <select name=\"status\">\n      <option value=\"\">All statuses</option>\n      {% for value, label in statuses %}\n        <option value=\"{{ value }}\" {% if status == value %}selected{% endif %}>{{ label }}</option>\n      {% endfor %}\n    </select>\n    <button type=\"submit\">Search</button>\n  </form>\n</section>\n</div>\n\n<section class=\"card\">\n  <h2>Submissions ({{ items|length }})</h2>\n  {% for it in items %}\n    <div class=\"fb-item\">\n      <div class=\"fb-head\">\n        <span class=\"tag tag-cat\">{{ it.get_category_display }}</span>\n        <strong>{{ it.name|default:\"Anonymous\" }}</strong>\n        <span class=\"muted\">{{ it.created }}</span>\n        <span class=\"tag {% if it.status == 'new' %}tag-run{% elif it.status == 'reviewed' %}tag-num{% else %}tag-ok{% endif %}\">{{ it.get_status_display }}</span>\n      </div>\n      <p>{{ it.text|linebreaksbr }}</p>\n      {% if it.notes %}<p class=\"fb-notes\"><em>Researcher notes:</em> {{ it.notes|linebreaksbr }}</p>{% endif %}\n    </div>\n  {% empty %}\n    <p class=\"muted\">No feedback yet \u2014 be the first.</p>\n  {% endfor %}\n</section>\n{% endblock %}",
  "newString": "<section class=\"card\">\n  <h2>Submit</h2>\n  <form method=\"post\" class=\"fb-form\">\n    {% csrf_token %}\n    <label>Name (optional)\n      <input type=\"text\" name=\"name\" maxlength=\"120\" placeholder=\"Anonymous\">\n    </label>\n    <label>Category\n      <select name=\"category\">\n        {% for value, label in categories %}<option value=\"{{ value }}\">{{ label }}</option>{% endfor %}\n      </select>\n    </label>\n    <label>Your feedback\n      <textarea name=\"text\" rows=\"7\" required\n        placeholder=\"An idea for a track, a reference we should read, a correction, a question\u2026\"></textarea>\n    </label>\n    <button type=\"submit\">Submit feedback</button>\n  </form>\n</section>\n{% endblock %}",
  "originalFile": "{% extends \"dashboard/base.html\" %}\n{% block title %}Feedback{% endblock %}\n{% block nav_feedback %}active{% endblock %}\n{% block content %}\n<h1>Feedback & Suggestions</h1>\n<p class=\"muted\">Comments, ideas, corrections, and questions for the research\nprogram. Submissions are stored and reviewed by the researcher \u2014 a good\nsuggestion can change the attack plan.</p>\n\n<div class=\"grid-2\">\n<section class=\"card\">\n  <h2>Submit</h2>\n  <form method=\"post\" class=\"fb-form\">\n    {% csrf_token %}\n    <label>Name (optional)\n      <input type=\"text\" name=\"name\" maxlength=\"120\" placeholder=\"Anonymous\">\n    </label>\n    <label>Category\n      <select name=\"category\">\n        {% for value, label in categories %}<option value=\"{{ value }}\">{{ label }}</option>{% endfor %}\n      </select>\n    </label>\n    <label>Your feedback\n      <textarea name=\"text\" rows=\"7\" required\n        placeholder=\"An idea for a track, a reference we should read, a correction, a question\u2026\"></textarea>\n    </label>\n    <button type=\"submit\">Submit feedback</button>\n  </form>\n</section>\n\n<section class=\"card\">\n  <h2>Search</h2>\n  <form method=\"get\" class=\"fb-search\">\n    <input type=\"text\" name=\"q\" value=\"{{ q }}\" placeholder=\"Search text\u2026\">\n    <select name=\"category\">\n      <option value=\"\">All categories</option>\n      {% for value, label in categories %}\n        <option value=\"{{ value }}\" {% if cat == value %}selected{% endif %}>{{ label }}</option>\n      {% endfor %}\n    </select>\n    <select name=\"status\">\n      <option value=\"\">All statuses</option>\n      {% for value, label in statuses %}\n        <option value=\"{{ value }}\" {% if status == value %}selected{% endif %}>{{ label }}</option>\n      {% endfor %}\n    </select>\n    <button type=\"submit\">Search</button>\n  </form>\n</section>\n</div>\n\n<section class=\"card\">\n  <h2>Submissions ({{ items|length }})</h2>\n  {% for it in items %}\n    <div class=\"fb-item\">\n      <div class=\"fb-head\">\n        <span class=\"tag tag-cat\">{{ it.get_category_display }}</span>\n        <strong>{{ it.name|default:\"Anonymous\" }}</strong>\n        <span class=\"muted\">{{ it.created }}</span>\n        <span class=\"tag {% if it.status == 'new' %}tag-run{% elif it.status == 'reviewed' %}tag-num{% else %}tag-ok{% endif %}\">{{ it.get_status_display }}</span>\n      </div>\n      <p>{{ it.text|linebreaksbr }}</p>\n      {% if it.notes %}<p class=\"fb-notes\"><em>Researcher notes:</em> {{ it.notes|linebreaksbr }}</p>{% endif %}\n    </div>\n  {% empty %}\n    <p class=\"muted\">No feedback yet \u2014 be the first.</p>\n  {% endfor %}\n</section>\n{% endblock %}\n",
  "structuredPatch": [
    {
      "oldStart": 7,
      "oldLines": 7,
      "newStart": 7,
      "newLines": 6,
      "lines": [
        " program. Submissions are stored and reviewed by the researcher \u2014 a good",
        " suggestion can change the attack plan.</p>",
        " ",
        "-<div class=\"grid-2\">",
        " <section class=\"card\">",
        "   <h2>Submit</h2>",
        "   <form method=\"post\" class=\"fb-form\">"
      ]
    },
    {
      "oldStart": 27,
      "oldLines": 44,
      "newStart": 26,
      "newLines": 5,
      "lines": [
        "     <button type=\"submit\">Submit feedback</button>",
        "   </form>",
        " </section>",
        "-",
        "-<section class=\"card\">",
        "-  <h2>Search</h2>",
        "-  <form method=\"get\" class=\"fb-search\">",
        "-    <input type=\"text\" name=\"q\" value=\"{{ q }}\" placeholder=\"Search text\u2026\">",
        "-    <select name=\"category\">",
        "-      <option value=\"\">All categories</option>",
        "-      {% for value, label in categories %}",
        "-        <option value=\"{{ value }}\" {% if cat == value %}selected{% endif %}>{{ label }}</option>",
        "-      {% endfor %}",
        "-    </select>",
        "-    <select name=\"status\">",
        "-      <option value=\"\">All statuses</option>",
        "-      {% for value, label in statuses %}",
        "-        <option value=\"{{ value }}\" {% if status == value %}selected{% endif %}>{{ label }}</option>",
        "-      {% endfor %}",
        "-    </select>",
        "-    <button type=\"submit\">Search</button>",
        "-  </form>",
        "-</section>",
        "-</div>",
        "-",
        "-<section class=\"card\">",
        "-  <h2>Submissions ({{ items|length }})</h2>",
        "-  {% for it in items %}",
        "-    <div class=\"fb-item\">",
        "-      <div class=\"fb-head\">",
        "-        <span class=\"tag tag-cat\">{{ it.get_category_display }}</span>",
        "-        <strong>{{ it.name|default:\"Anonymous\" }}</strong>",
        "-        <span class=\"muted\">{{ it.created }}</span>",
        "-        <span class=\"tag {% if it.status == 'new' %}tag-run{% elif it.status == 'reviewed' %}tag-num{% else %}tag-ok{% endif %}\">{{ it.get_status_display }}</span>",
        "-      </div>",
        "-      <p>{{ it.text|linebreaksbr }}</p>",
        "-      {% if it.notes %}<p class=\"fb-notes\"><em>Researcher notes:</em> {{ it.notes|linebreaksbr }}</p>{% endif %}",
        "-    </div>",
        "-  {% empty %}",
        "-    <p class=\"muted\">No feedback yet \u2014 be the first.</p>",
        "-  {% endfor %}",
        "-</section>",
        " {% endblock %}",
        " "
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\index.md",
  "old_string": "| # | Title | Phase/Task | Status | Date |\n|---|-------|-----------|--------|------|\n| \u2014 | (empty) | | | |",
  "new_string": "| # | Title | Phase/Task | Status | Date |\n|---|-------|-----------|--------|------|\n| D-001 | Master equation & tool index (quantum formalism; living doc) | 0.1 | in-progress (grows) | 2026-08-17 |"
}

{
  "filePath": "D:\\Python\\Quantum\\web\\dashboard\\views.py",
  "oldString": "        messages.error(request, \"Feedback text cannot be empty.\")\n\n    q = (request.GET.get(\"q\") or \"\").strip()\n    cat = request.GET.get(\"category\") or \"\"\n    status = request.GET.get(\"status\") or \"\"\n    items = Feedback.objects.all()\n    if q:\n        from django.db.models import Q\n        items = items.filter(Q(text__icontains=q) | Q(name__icontains=q))\n    if cat:\n        items = items.filter(category=cat)\n    if status:\n        items = items.filter(status=status)\n    return render(request, \"dashboard/feedback.html\", {\n        \"items\": items[:200],\n        \"q\": q, \"cat\": cat, \"status\": status,\n        \"categories\": Feedback.CATEGORY_CHOICES,\n        \"statuses\": Feedback.STATUS_CHOICES,\n    })",
  "newString": "        messages.error(request, \"Feedback text cannot be empty.\")\n\n    # Submit-only page (2026-08-28): submissions are NOT displayed publicly;\n    # triage happens in the Django admin.\n    return render(request, \"dashboard/feedback.html\", {\n        \"categories\": Feedback.CATEGORY_CHOICES,\n    })",
  "originalFile": "\"\"\"Page views for the RH-WEBSITE dashboard. All research data read-only.\"\"\"\nimport json\nfrom pathlib import Path\n\nfrom django.conf import settings\nfrom django.contrib import messages\nfrom django.http import Http404\nfrom django.shortcuts import redirect, render\n\nfrom . import research_data as rd\nfrom .models import Feedback\n\n\ndef home(request):\n    state = rd.parse_state()\n    results = rd.get_results()\n    return render(request, \"dashboard/home.html\", {\n        \"stats\": rd.summary_stats(),\n        \"position\": state.get(\"CURRENT POSITION\", \"\"),\n        \"latest\": results[-1] if results else None,\n    })\n\n\ndef dashboard(request):\n    state = rd.parse_state()\n    return render(request, \"dashboard/dashboard.html\", {\n        \"position\": state.get(\"CURRENT POSITION\", \"\"),\n        \"next_action\": state.get(\"NEXT ACTION\", \"\"),\n        \"blockers\": state.get(\"BLOCKERS\", \"\"),\n        \"checklist\": rd.parse_checklist(),\n        \"stats\": rd.summary_stats(),\n        \"commits\": rd.git_log(12),\n        \"new_feedback\": Feedback.objects.filter(status=\"new\").count(),\n        \"sessions\": rd.get_sessions()[-4:],\n    })\n\n\ndef roadmap(request):\n    nguyen = rd.REPO / \"NGUYEN.md\"\n    return render(request, \"dashboard/roadmap.html\", {\n        \"html\": rd.render_markdown(rd.read_text(nguyen)) if nguyen.exists() else \"\",\n        \"mtime\": rd._iso(nguyen.stat().st_mtime) if nguyen.exists() else None,\n    })\n\n\ndef ledger(request):\n    return render(request, \"dashboard/ledger.html\", {\"results\": rd.get_results()})\n\n\ndef ledger_detail(request, rid):\n    row = rd.get_result(rid)\n    if not row:\n        raise Http404\n    path = (rd.RESEARCH / \"results\" / Path(row[\"file\"]).name).resolve()\n    if (rd.RESEARCH / \"results\").resolve() not in path.parents or not path.exists():\n        raise Http404\n    return render(request, \"dashboard/ledger_detail.html\", {\n        \"row\": row,\n        \"html\": rd.render_markdown(rd.read_text(path)),\n        \"mtime\": rd._iso(path.stat().st_mtime),\n    })\n\n\ndef experiments(request):\n    rows = rd.get_experiments()\n    for row in rows:\n        sc = rd.experiment_sidecar(row)\n        row[\"checks\"] = (sc or {}).get(\"checks\") or {}\n        row[\"task\"] = (sc or {}).get(\"task\", \"\")\n    return render(request, \"dashboard/experiments.html\", {\"experiments\": rows})\n\n\ndef experiment_detail(request, eid):\n    row = rd.get_experiment(eid)\n    if not row:\n        raise Http404\n    sidecar = rd.experiment_sidecar(row)\n    chart = rd.chart_data(row)\n    return render(request, \"dashboard/experiment_detail.html\", {\n        \"exp\": row,\n        \"sidecar\": sidecar,\n        \"chart_json\": json.dumps(chart) if chart else None,\n        \"preview\": rd.csv_preview(row),\n    })\n\n\ndef collection(request, kind):\n    if kind not in rd.MD_COLLECTIONS:\n        raise Http404\n    meta = {}\n    if kind == \"derivations\":\n        meta = {Path(d[\"file\"]).stem: d for d in rd.get_derivations()}\n    elif kind == \"graveyard\":\n        meta = {Path(g[\"file\"]).stem: g for g in rd.get_graveyard()}\n    return render(request, \"dashboard/collection.html\", {\n        \"kind\": kind,\n        \"items\": rd.collection_list(kind),\n        \"meta\": meta,\n    })\n\n\ndef collection_item(request, kind, name):\n    if kind not in rd.MD_COLLECTIONS:\n        raise Http404\n    item = rd.collection_item(kind, name)\n    if not item:\n        raise Http404\n    return render(request, \"dashboard/collection_item.html\", {\n        \"kind\": kind, \"item\": item})\n\n\ndef search(request):\n    q = (request.GET.get(\"q\") or \"\").strip()\n    return render(request, \"dashboard/search.html\", {\n        \"search\": rd.search_archive(q) if q else None,\n        \"q\": q,\n    })\n\n\ndef scripts(request):\n    return render(request, \"dashboard/scripts.html\",\n                  {\"scripts\": rd.script_list()})\n\n\ndef script_detail(request, name):\n    item = rd.script_item(name)\n    if not item:\n        raise Http404\n    sel_csv = request.GET.get(\"csv\")\n    try:\n        page = max(1, int(request.GET.get(\"page\", \"1\")))\n    except ValueError:\n        page = 1\n    for i, f in enumerate(item[\"files\"]):\n        f[\"idx\"] = i\n        if f[\"kind\"] == \"csv\":\n            f[\"table\"] = rd.csv_page(\n                f[\"path\"], page if sel_csv == str(i) else 1)\n        elif f[\"kind\"] == \"json\":\n            f[\"pretty\"] = rd.json_pretty(f[\"path\"])\n    return render(request, \"dashboard/script_detail.html\", {\n        \"item\": item, \"sel_csv\": sel_csv, \"page\": page})\n\n\ndef lean(request):\n    files = rd.lean_files()\n    audits = rd.lean_audits()\n    return render(request, \"dashboard/lean.html\", {\n        \"toolchain\": rd.lean_toolchain(),\n        \"files\": files,\n        \"audits\": audits,\n        \"closed_source\": rd.lean_closed_source(),\n        \"perimeter\": rd.lean_perimeter(),\n        \"totals\": {\n            \"files\": len(files),\n            \"lines\": sum(f[\"lines\"] for f in files),\n            \"decls\": sum(f[\"decls\"] for f in files),\n            \"sorries\": sum(f[\"sorries\"] for f in files),\n            \"audits\": len(audits),\n            \"audit_decls\": sum(a[\"decls\"] for a in audits),\n        },\n    })\n\n\ndef lean_detail(request, name):\n    item = rd.lean_item(name)\n    if not item:\n        raise Http404\n    return render(request, \"dashboard/lean_detail.html\", {\"item\": item})\n\n\ndef lean_audit(request, name):\n    item = rd.lean_audit_item(name)\n    if not item:\n        raise Http404\n    return render(request, \"dashboard/lean_audit.html\", {\"item\": item})\n\n\ndef paper(request):\n    folder = rd.RESEARCH / \"paper\"\n    files = []\n    if folder.exists():\n        for p in sorted(folder.iterdir()):\n            if p.is_file():\n                files.append({\"name\": p.name,\n                              \"size\": p.stat().st_size,\n                              \"mtime\": rd._iso(p.stat().st_mtime)})\n    paper = folder / \"paperA.tex\"\n    paper_head = None\n    if paper.exists():\n        paper_head = \"\\n\".join(rd.read_text(paper).splitlines()[:80])\n    return render(request, \"dashboard/paper.html\", {\n        \"files\": files, \"paper_head\": paper_head, \"paper_name\": paper.name,\n        \"paper_mtime\": rd._iso(paper.stat().st_mtime) if paper.exists() else None,\n    })\n\n\ndef live(request):\n    return render(request, \"dashboard/live.html\", {\"logs\": rd.run_logs()})\n\n\ndef conversations(request):\n    if not rd.agent_available():\n        raise Http404\n    return render(request, \"dashboard/conversations.html\", {\n        \"sessions\": rd.agent_sessions(),\n    })\n\n\ndef conversation_session(request, spk):\n    session = rd.agent_session(spk)\n    if not session:\n        raise Http404\n    q = (request.GET.get(\"q\") or \"\").strip()\n    kind = request.GET.get(\"kind\") or \"\"\n    messages_list = rd.agent_messages(spk, q=q or None, kind=kind or None)\n    return render(request, \"dashboard/conversation_session.html\", {\n        \"session\": session,\n        \"messages_list\": messages_list,\n        \"q\": q, \"kind\": kind,\n        \"kinds\": [(\"\", \"Everything\"), (\"user\", \"Prompts (user)\"),\n                  (\"thinking\", \"Thinking\"), (\"text\", \"Replies (text)\"),\n                  (\"tool\", \"Tool use\")],\n    })\n\n\ndef conversation_message(request, spk, mid):\n    session = rd.agent_session(spk)\n    msg = rd.agent_message(spk, mid)\n    if not session or not msg:\n        raise Http404\n    return render(request, \"dashboard/conversation_message.html\", {\n        \"session\": session, \"msg\": msg,\n    })\n\n\ndef feedback(request):\n    if request.method == \"POST\":\n        text = (request.POST.get(\"text\") or \"\").strip()\n        name = (request.POST.get(\"name\") or \"\").strip()[:120]\n        category = request.POST.get(\"category\") or \"general\"\n        valid = {c for c, _ in Feedback.CATEGORY_CHOICES}\n        if category not in valid:\n            category = \"general\"\n        if text:\n            fb = Feedback.objects.create(name=name, category=category, text=text)\n            # Dual storage: JSON file per submission (RH-WEBSITE.md \u00a75).\n            fb_dir = Path(settings.BASE_DIR) / \"feedback\"\n            fb_dir.mkdir(exist_ok=True)\n            payload = {\n                \"id\": fb.id,\n                \"created\": fb.created.isoformat(),\n                \"name\": fb.name,\n                \"category\": fb.category,\n                \"text\": fb.text,\n                \"status\": fb.status,\n            }\n            fname = f\"FB-{fb.created:%Y%m%dT%H%M%S}-{fb.id:04d}.json\"\n            (fb_dir / fname).write_text(\n                json.dumps(payload, indent=2), encoding=\"utf-8\")\n            # Email notification (production only \u2014 FEEDBACK_NOTIFY_EMAIL is\n            # set in the deployed settings patch; unset locally = no-op).\n            # A mail failure must never break a submission.\n            notify = getattr(settings, \"FEEDBACK_NOTIFY_EMAIL\", None)\n            if notify:\n                try:\n                    from django.core.mail import send_mail\n                    send_mail(\n                        subject=\"[researchai.dev] New feedback: \"\n                                f\"{fb.get_category_display()}\",\n                        message=(\n                            \"New feedback submitted on researchai.dev\\n\\n\"\n                            f\"From: {fb.name or 'Anonymous'}\\n\"\n                            f\"Category: {fb.get_category_display()}\\n\"\n                            f\"Date (UTC): {fb.created:%Y-%m-%d %H:%M:%S}\\n\\n\"\n                            f\"{fb.text}\\n\\n\"\n                            \"-- Review it at \"\n                            \"https://researchai.dev/admin/dashboard/feedback/\\n\"\n                        ),\n                        from_email=getattr(settings, \"DEFAULT_FROM_EMAIL\", None),\n                        recipient_list=[notify],\n                        fail_silently=True,\n                    )\n                except Exception:  # noqa: BLE001 \u2014 never break a submission\n                    pass\n            messages.success(request, \"Thank you \u2014 your feedback has been recorded.\")\n            return redirect(\"feedback\")\n        messages.error(request, \"Feedback text cannot be empty.\")\n\n    q = (request.GET.get(\"q\") or \"\").strip()\n    cat = request.GET.get(\"category\") or \"\"\n    status = request.GET.get(\"status\") or \"\"\n    items = Feedback.objects.all()\n    if q:\n        from django.db.models import Q\n        items = items.filter(Q(text__icontains=q) | Q(name__icontains=q))\n    if cat:\n        items = items.filter(category=cat)\n    if status:\n        items = items.filter(status=status)\n    return render(request, \"dashboard/feedback.html\", {\n        \"items\": items[:200],\n        \"q\": q, \"cat\": cat, \"status\": status,\n        \"categories\": Feedback.CATEGORY_CHOICES,\n        \"statuses\": Feedback.STATUS_CHOICES,\n    })\n",
  "structuredPatch": [
    {
      "oldStart": 287,
      "oldLines": 21,
      "newStart": 287,
      "newLines": 9,
      "lines": [
        "             return redirect(\"feedback\")",
        "         messages.error(request, \"Feedback text cannot be empty.\")",
        " ",
        "-    q = (request.GET.get(\"q\") or \"\").strip()",
        "-    cat = request.GET.get(\"category\") or \"\"",
        "-    status = request.GET.get(\"status\") or \"\"",
        "-    items = Feedback.objects.all()",
        "-    if q:",
        "-        from django.db.models import Q",
        "-        items = items.filter(Q(text__icontains=q) | Q(name__icontains=q))",
        "-    if cat:",
        "-        items = items.filter(category=cat)",
        "-    if status:",
        "-        items = items.filter(status=status)",
        "+    # Submit-only page (2026-08-28): submissions are NOT displayed publicly;",
        "+    # triage happens in the Django admin.",
        "     return render(request, \"dashboard/feedback.html\", {",
        "-        \"items\": items[:200],",
        "-        \"q\": q, \"cat\": cat, \"status\": status,",
        "         \"categories\": Feedback.CATEGORY_CHOICES,",
        "-        \"statuses\": Feedback.STATUS_CHOICES,",
        "     })",
        " "
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "- [ ] 0.1 Parse notes.txt; index all quantum equations for Track B.",
  "new_string": "- [x] 0.1 Parse notes.txt; index all quantum equations for Track B.\n      \u2192 research/derivations/D-001 (living master tool index, Part I done)"
}

{
  "filePath": "D:\\Python\\Quantum\\RH-WEBSITE.md",
  "oldString": "- Dual storage (mirrors NGUYEN.md \u00a78.2): JSON file per submission in\n  `web/feedback/FB-<utc>-<id>.json` + row in `web/feedback.db`.\n- Search: full-text (name+text) + category/status filters.",
  "newString": "- Dual storage (mirrors NGUYEN.md \u00a78.2): JSON file per submission in\n  `web/feedback/FB-<utc>-<id>.json` + row in `web/feedback.db`.\n- **Submit-only page (user directive 2026-08-28):** submissions are NOT\n  displayed publicly \u2014 the Submissions list AND the Search form were\n  removed from `/feedback/` (search would leak all feedback via queries).\n  Triage happens in the Django admin Feedback changelist (\u00a75A).",
  "originalFile": "# RH-WEBSITE.md \u2014 NGUYEN-RH-1 Research Website\n# Standing plan + operations document. READ FIRST when doing website work.\n# Created: 2026-08-19 | Status: ACTIVE | Version: 1.0\n# ============================================================\n\n## 0. \u26d4 HARD RULE \u2014 READ FIRST (user directive, 2026-08-19)\n**DO NOT WRITE to any research document.** The research archive\n(NGUYEN.md, STATE.md, everything under `research/`, git history) is the\nsingle source of truth and is modified ONLY by the research agent per\nNGUYEN.md \u00a78.4. Website work may touch ONLY:\n- `D:\\Python\\Quantum\\web\\`          (all website code, data, logs)\n- `D:\\Python\\Quantum\\RH-WEBSITE.md` (this file)\n\nThe website reads research files exclusively through READ-ONLY handles:\nSQLite via `mode=ro` URI, text files opened `'r'`. Feedback submissions\ngo to `web/feedback/` + `web/feedback.db` \u2014 never into `research/`.\nWhen committing, stage ONLY `web/` and `RH-WEBSITE.md` by name.\n\n## 1. PURPOSE\nPublic-facing-style (localhost-only) interactive dashboard for the\nNGUYEN-RH-1 Riemann Hypothesis research project. Goals:\n- Landing page explaining RH and the research mission to a general audience.\n- Live progress: current stage, next action, metrics \u2014 auto-updating as the\n  research agent writes to the file system.\n- Browsable archive: results, experiments (+ interactive charts),\n  derivations, graveyard, journal, resources atlas, paper status.\n- Feedback channel: visitors submit comments/suggestions; searchable;\n  researcher reviews them to help the research.\n\n## 2. ARCHITECTURE\n- Location: `D:\\Python\\Quantum\\web\\` \u2014 Django project `rhweb`, app `dashboard`.\n- Interpreter: project `.venv` (`./.venv/Scripts/python.exe`).\n  Deps: `web/requirements-web.txt` (Django, markdown).\n- Server: `python web/manage.py runserver 127.0.0.1:8001` \u2014 localhost only.\n- Frontend: vanilla JS + vendored Plotly.js (interactive charts) +\n  vendored MathJax (tex-chtml) for math in markdown. NO CDN dependency.\n- Live updates: frontend polls `GET /api/status/` every 3 s; the endpoint\n  reports file mtimes + parsed STATE.md + active run-logs + new-feedback\n  count + summary_stats (checklist counters, phase table, collection\n  counts); changed panels refresh in place. No WebSockets/Redis.\n\n### Data flow (all read-only on research/)\n| Source | How read | Used by |\n|---|---|---|\n| STATE.md | parse `## SECTION` blocks ('r') | Dashboard, status bar |\n| NGUYEN.md | checklist \u00a75 `- [x]/[~]/[ ]` counts; \u00a77 ledger | Dashboard metrics, Roadmap |\n| research/research.db | sqlite3 `file:...?mode=ro` | Ledger, Experiments, Derivations, Graveyard, Journal indexes |\n| research/numerics/data/*.json | json.load ('r') | Experiment cards (checks, key values, caveats) |\n| research/numerics/data/*.csv | csv module, downsampled | Plotly charts, table previews |\n| research/**/*.md | python-markdown + math-protect | Archive pages |\n| research/numerics/data/*-run.log | tail (last N lines) | Live Runs page |\n| git log | `git log --oneline` subprocess (read-only) | Dashboard activity feed |\n\n## 3. FILE MAP\n```\nweb/\n\u251c\u2500\u2500 manage.py\n\u251c\u2500\u2500 lockcheck.py              # \u00a70 verification: proves the server never\n\u2502                             #   blocks writers (run: .venv python web/lockcheck.py)\n\u251c\u2500\u2500 requirements-web.txt\n\u251c\u2500\u2500 rhweb/                  # project: settings.py, urls.py, wsgi.py\n\u251c\u2500\u2500 dashboard/\n\u2502   \u251c\u2500\u2500 research_data.py    # ALL read-only parsers (single module to audit \u00a70)\n\u2502   \u251c\u2500\u2500 models.py           # Feedback + VisitorLog models (web/feedback.db ONLY)\n\u2502   \u251c\u2500\u2500 middleware.py       # VisitorLogMiddleware (access log \u2192 feedback.db)\n\u2502   \u251c\u2500\u2500 admin.py            # Django admin: feedback triage + visitor log views\n\u2502   \u251c\u2500\u2500 views.py            # pages (feedback POST also emails dan@researchai.dev)\n\u2502   \u251c\u2500\u2500 api.py              # /api/health, /api/status, /api/logtail\n\u2502   \u251c\u2500\u2500 urls.py\n\u2502   \u251c\u2500\u2500 templates/dashboard/*.html\n\u2502   \u2514\u2500\u2500 static/dashboard/{style.css, app.js, vendor/plotly.min.js, vendor/tex-chtml.js}\n\u251c\u2500\u2500 feedback/               # one JSON per submission (dual storage)\n\u251c\u2500\u2500 feedback.db             # SQLite index for search (Django default DB)\n\u2514\u2500\u2500 logs/                   # server.log, healthcheck.log\n```\n\n## 4. PAGES (left sidebar)\n1. **Home** `/` \u2014 RH explainer, mission, 4 attack tracks, success ladder.\n2. **Dashboard** `/dashboard/` \u2014 current stage (STATE.md), next action,\n   progress metrics (phases bar, tasks done/total, ledger size), git feed.\n3. **Roadmap** `/roadmap/` \u2014 NGUYEN.md \u00a75 checklist rendered w/ status.\n4. **Search** `/search/` \u2014 global archive search (see \u00a77 note): AND-of-terms\n   case-insensitive scan across all MD_COLLECTIONS markdown; snippets with\n   line numbers + highlighted matches; results hits link to /ledger/R-NNN/.\n5. **Results Ledger** `/ledger/` + `/ledger/R-NNN/` \u2014 claims + honesty tags.\n6. **Experiments** `/experiments/` + `/experiments/E-NNN/` \u2014 sidecar cards;\n   Plotly charts from CSVs (config in research_data.CHARTS); pass/fail badges.\n7. **Scripts & Data** `/scripts/` + `/scripts/<stem>/` \u2014 all experiment\n   scripts; per-script data files (experiment-table links \u222a exact-stem\n   matches) shown as paginated spreadsheet tables (500 rows/page, sticky\n   header + row-number gutter, numeric right-align) + JSON sidecars +\n   collapsible verbatim source-code view.\n8. **Derivations** `/derivations/` + detail \u2014 37 D-files, math rendered.\n9. **Graveyard** `/graveyard/` \u2014 documented dead ends.\n10. **Journal** `/journal/` + detail \u2014 session narratives.\n11. **Resources** `/resources/` + detail \u2014 43-note RH-equivalence atlas.\n12. **Paper** `/paper/` \u2014 paperA.tex status (first 80 lines), paper-folder\n    inventory.\n13. **Lean Proofs** `/lean/` + `/lean/<file>/` + `/lean/audit/<txt>/` \u2014\n    formal-verification transparency: toolchain + totals, axiom-policy card,\n    LiClosed.lean verbatim, the 7-perimeter defs extracted verbatim,\n    per-file declaration tables + source, #print-axioms audit transcripts.\n14. **Live Runs** `/live/` \u2014 tail view of *-run.log, 3 s polling.\n15. **Feedback** `/feedback/` \u2014 submit form + search (text, category, status).\n16. **Conversations** `/conversations/` \u2014 browse the Nguyen CLI conversation\n    index (`~/.nguyen/projects/D--Python-Quantum/agent.db`, outside the repo,\n    opened read-only): session list; per-session message cards with\n    thinking/tool blocks (collapsible), FTS search + kind filters; single\n    message view `/conversations/<spk>/msg/<id>/` with prev/next arrows,\n    arrow-key navigation, jump-to-id, raw JSON row view.\n\n## 5. FEEDBACK SYSTEM\n- Submit: name (optional), category (general/suggestion/question/correction/\n  track-A/B/C/D), text. CSRF-protected; autoescaped on render.\n- Dual storage (mirrors NGUYEN.md \u00a78.2): JSON file per submission in\n  `web/feedback/FB-<utc>-<id>.json` + row in `web/feedback.db`.\n- Search: full-text (name+text) + category/status filters.\n- Statuses: new \u2192 reviewed \u2192 acted-on (status changes are website data,\n  allowed under \u00a70; researcher notes field for follow-up).\n- **Email notification (2026-08-28, VERIFIED live):** every submission also\n  emails `dan@researchai.dev` via the server's local Exim\n  (`EMAIL_HOST=127.0.0.1:25`, From `noreply@researchai.dev`) \u2014 production\n  only, `FEEDBACK_NOTIFY_EMAIL` lives in the deployed settings patch (unset\n  locally = no-op); `fail_silently` + try/except so mail can never break a\n  submission. (MX for researchai.dev is MS365; SPF `include:secureserver.net`\n  covers this host; DMARC passes via SPF alignment.)\n  - \u26a0 GOTCHA (found + fixed 2026-08-28): cPanel **Email Routing** for\n    researchai.dev MUST be **Remote Mail Exchanger**. As a hosted domain it\n    defaulted to local, so Exim never consulted the public MX and\n    `/etc/valiases/researchai.dev` silently DISCARDED `dan@` (cPanel Track\n    Delivery showed \"Discard\"; MS365 quarantine empty because MS365 never\n    saw the mail). Verified after the switch by a live feedback-form test +\n    a direct smtplib test over SSH \u2014 both received in the MS365 inbox.\n  - OPS NOTE: the SSH shell is CageFS-jailed \u2014 it CANNOT see\n    `/etc/valiases`, `/etc/localdomains`, or `/var/log/exim_mainlog`\n    (all \"No such file\"). Delivery verification is inbox receipt + cPanel\n    Track Delivery; SMTP-path testing works (127.0.0.1:25 accepts).\n\n## 5A. ADMIN BACKEND + VISITOR LOG (2026-08-28)\n- **Django admin at `/admin/`** \u2014 the researcher's private backend:\n  Feedback changelist (list-editable status, filters, search, date\n  hierarchy) + VisitorLog changelist (read-only, append-only).\n  Login: user `dan` + the same password as the SSH account (user choice\n  2026-08-28). Superuser created over SSH via\n  `DJANGO_SUPERUSER_*` env vars + `createsuperuser --noinput`.\n- **Visitor log:** `dashboard/middleware.py` VisitorLogMiddleware appends\n  one row per public GET/POST to `dashboard_visitorlog` in feedback.db:\n  created, ip, method, path, query, referrer, user_agent, is_bot (UA regex).\n  Skips `/static/`, `/api/` (3 s polling would flood it), `/admin/`,\n  `/favicon.ico`; exceptions swallowed \u2014 logging never breaks a page.\n  Raw Apache log also readable at `~/access-logs/researchai.121swr.com-ssl_log`\n  (researchai.dev traffic logs under the cPanel auto-subdomain).\n- Admin statics: collected into docroot `/static/admin/` via\n  `collectstatic` on the server (127 files, 2026-08-28).\n- OPS GOTCHAS (learned 2026-08-28): (1) in paramiko `exec_command` shells\n  `$PWD` is NOT set \u2014 use absolute paths in PYTHONPATH, plus\n  `DJANGO_SETTINGS_MODULE=rhweb.settings` for bare-python scripts;\n  (2) any POST to the live site needs an `Origin: https://researchai.dev`\n  header or Django CSRF 403s (admin login, feedback); (3) server-side\n  management: `cd $SITE && PYTHONPATH=$SITE/app/vendor:$SITE/app/web\n  /opt/alt/python311/bin/python3.11 app/web/manage.py <cmd>`.\n\n## 6. OPERATIONS\n### 6.1 Session-start protocol (website work)\n1. Read this file.\n2. Run `./.venv/Scripts/python.exe web/healthcheck.py --restart`\n   (checks /api/health + all routes + status-API freshness; restarts the\n   server if unreachable). Fix any failing route before other work.\n3. Check the watchdog is alive: `web/logs/watchdog.log` tail should show\n   entries within the last ~10 min; if not, restart it (\u00a76.2b).\n4. Review new feedback: `web/feedback.db` status='new' (or the /feedback/\n   page); surface relevant items to the user.\n5. Improvement pass (standing order, user 2026-08-19): look for at least\n   one interface or data-presentation improvement per session; log ideas\n   in \u00a78 below and implement the worthwhile ones.\n### 6.2 Start server (detached, sandbox DISABLED \u2014 long-run rule)\n```\ncd D:\\Python\\Quantum && ./.venv/Scripts/python.exe web/manage.py runserver \\\n  127.0.0.1:8001 >> web/logs/server.log 2>&1   # DETACHED_PROCESS\n```\n### 6.2b Watchdog (always-on monitoring, started 2026-08-19)\n`web/watchdog.py` runs detached between sessions: every 300 s it runs the\nhealth checks and restarts the server if unreachable. Logs:\n`web/logs/watchdog.log` + `web/logs/healthcheck.log`.\nStart detached: `subprocess.Popen([sys.executable, 'web/watchdog.py'], ...)`\nwith DETACHED_PROCESS (same pattern as \u00a76.2).\n### 6.3 Restart / health\n- Stop: find PID via `netstat -ano | findstr :8001`, `taskkill /PID <pid> /F`.\n- **Restart required after ANY code OR template change** (templates are\n  cached in-process \u2014 a home.html edit did not appear until restart,\n  2026-08-19). Static CSS/JS changes serve immediately \u2014 BUT runserver\n  sends no cache headers, so browsers heuristic-cache them: after ANY\n  style.css/app.js change, ALSO bump the `?v=` query on both tags in\n  `templates/dashboard/base.html` (convention: date-serial, e.g.\n  `?v=20260827-2`) or visitors keep running stale assets (hamburger\n  breakage, 2026-08-27).\n  NOTE: port is **8001** since 2026-08-19 \u2014 port 8000 is reserved for the\n  user's other service (do not use it).\n- Log tail: `web/logs/server.log`.\n- First run after code change to models:\n  `./.venv/Scripts/python.exe web/manage.py migrate`.\n### 6.4 Updating the site when research data changes shape\n- New experiment: automatic (db + sidecars). Charts: add entry to\n  `research_data.CHARTS` (x/y columns, type).\n- New markdown folders: register in `research_data.MD_COLLECTIONS`.\n- Never patch around \u00a70 \u2014 if a feature needs research-archive writes,\n  STOP and ask the user.\n### 6.5 Lock-safety guarantees (verified 2026-08-19, web/lockcheck.py)\n- Text/md/CSV/log reads use Python 'r' handles (Windows share mode allows\n  concurrent writers) and close immediately after each read.\n- research.db / agent.db opened SQLite mode=ro per query, closed in finally;\n  shared read lock exists only for the duration of each SELECT (ms).\n- Server runs --noreload: no autoreload file watchers held open.\n- git log is read-only plumbing (no index lock).\n- Empirical: 24 s of 4-thread HTTP load across all heavy pages while taking\n  120 DB write locks (BEGIN IMMEDIATE/ROLLBACK) + 360 write-intent file\n  opens on STATE.md, NGUYEN.md, CSVs, run-logs \u2014 zero conflicts, zero stalls.\n\n### 6.6 Production deployment \u2014 researchai.dev (live since 2026-08-27)\nThe public site runs on a shared Apache host via a CGI adapter; the local\nrepo is NOT modified for deployment (staging copy carries the prod patches).\n- **FTP login (user directive 2026-08-27: stored here for future use):**\n  - Server: `121swr.com` port 21 (plain FTP / explicit FTPS).\n    \u26a0 `ftp.121swr.com` does NOT exist in DNS \u2014 use `121swr.com`.\n  - Username: `[ftp-user]@researchai.dev`\n  - Password: `[REDACTED]`\n  - FTP root = web docroot. `SITE CHMOD` works; MFMT honored (preserves\n    mtimes \u2014 upload.py already sets them).\n- **SSH login (user directive 2026-08-28: stored here for future use):**\n  - IP address: `208.109.226.46`, port `22`\n  - cPanel username: `[cpanel-user]`\n  - Password: `[REDACTED]`\n  - The NGUYEN-RH-1 website lives in `~/public_html/researchai.dev`\n    (corrected 2026-08-28 \u2014 NOT the account `/public_html` root).\n  - **\u2b50 STANDING DIRECTIVE (user, 2026-08-28): use SSH/SFTP instead of\n    FTP for ALL server ops from now on** (uploads, updates, shell work) \u2014\n    it supersedes the FTP/upload.py workflow below. Verified working\n    2026-08-28 (password auth, CloudLinux EL8). `paramiko 5.0.0` is\n    installed in the project `.venv` for scripted SSH/SFTP.\n- \u26a0 This file now contains live credentials: **NEVER upload RH-WEBSITE.md\n  to the web host** (it is not in the deploy set \u2014 keep it that way).\n- Architecture: `.htaccess` routes non-file requests to `/app.cgi`\n  (wsgiref CGIHandler \u2192 Django WSGI); statics in `/static/` served by\n  Apache; all code/data under `/app/` (blocked by rewrite rule +\n  `/app/.htaccess` Require all denied). Server Python:\n  `/opt/alt/python311/bin/python3.11` (3.11.15); vendored Django 5.2.17 +\n  markdown in `/app/vendor/`. agent.db lives at `/app/web/database/agent.db`.\n- Staging + tooling: `D:\\Python\\quantum-deploy\\` \u2014 `docroot/` (server\n  mirror), `upload.py` (resumable 6-thread FTP, size-skip + MFMT; run\n  DETACHED \u2014 CLI kills foreground Bash at ~2 min), `fix_mtimes.py`,\n  `smoke_test.py`, `verify_site.py`. FTP password is passed via the\n  `FTP_PASS` env var, never written into the scripts.\n- Re-deploy: re-copy web/+research/+STATE.md+NGUYEN.md into\n  `docroot/app/`, re-apply the deployed-only patches (prod settings.py,\n  AGENT_DB path, scripts badges, Paper nav link hidden \u2014 user directive\n  2026-08-27, route stays live), then `FTP_PASS=... python upload.py`.\n\n## 7. IMPROVEMENT BACKLOG (standing order \u2014 review each session)\n\u26d4 DELIBERATE EXCLUSION (user directive, 2026-08-27):\n`research/correspondence/` (the Lagarias F-D package) is PRIVATE until\nthe user decides to publish \u2014 do NOT build any website view of it, and\ndo not re-propose it in coverage audits. Everything else in the\nresearch archive was verified fully covered by the site on 2026-08-27.\n\nIdeas not yet implemented, ranked by value:\n1. Conversations: \"new activity\" badge when agent.db grows between polls.\n2. Experiments: diff view when a sidecar's checks change between runs.\n3. Charts: E-019 zero-flow needs series-column grouping support.\n4. Search snippets: highlight ALL query terms in each snippet (currently\n   only the term at the snippet's anchor position gets <mark>).\n5. Mobile: plain .tbl tables inside cards can overflow very narrow\n   screens \u2014 wrap like .table-scroll.\nDone:\n- 2026-08-27: MM-DD-YYYY date format + nowrap date columns (user request) \u2014\n  new dashboard/templatetags/usdate.py filter applied to every UI date\n  render across 17 templates (Updated columns, file-detail lines,\n  Roadmap/Paper \"Last updated\", ledger/experiment/session dates); date\n  table cells get class=\"date\" with .tbl td.date{white-space:nowrap} so\n  hyphens no longer break the line; app.js freshness line formats\n  MM-DD-YYYY HH:MM:SS UTC. Archive markdown content dates stay verbatim\n  ISO (\u00a70 verbatim rule \u2014 UI chrome only). Asset version bumped\n  (?v=20260827-5). OPS NOTE: a server generation started BEFORE the new\n  templatetags/ dir existed 500s on {% load usdate %} (stale importlib\n  dir cache) \u2014 healthcheck --restart is mandatory after adding\n  templatetags modules; the watchdog self-healed this instance.\n- 2026-08-27: topbar search box on every page (user request) \u2014 compact\n  GET form in the sticky topbar (right side), submits to /search/?q=\u2026;\n  prefilled on the search page itself; topbar now flex with the task\n  text ellipsized; on \u2264900px the \"Current task:\" label hides and the\n  input narrows. Full-site crawl the same day: 300 pages, all 200, no\n  broken internal links (2 flagged /conversations/ pages were false\n  positives \u2014 archived session content literally contains traceback\n  text). Asset version bumped (?v=20260827-4).\n- 2026-08-27: Lean Proofs section `/lean/` (user request, full design) \u2014\n  transparency cards (toolchain v4.33.0-rc2, axiom policy, 29 files /\n  27,906 lines / 879 decls / 5 skeleton-only sorries / 22 audits / 483\n  audited decls), LiClosed.lean verbatim inline, the 7-perimeter def\n  blocks extracted verbatim with plain-language notes, per-file detail\n  pages (parsed declaration table + full source), audit transcript\n  viewer. Sorries counted as proof-terms only (by-sorry / :=-sorry) \u2014\n  matches the documented \"1 Suzuki + 4 valley\" exactly; the session-013\n  audit's 5 sorryAx labelled \"intended skeletons\" (not a failure).\n  Healthcheck now 27 routes.\n- 2026-08-27: Scripts & Data page `/scripts/` (user request) \u2014 index of all\n  45 research/numerics/scripts/*.py with their experiment links + data\n  files; detail pages render each CSV as a spreadsheet table (500-row\n  server-side pagination, sticky header, sticky row-number gutter with\n  true CSV line numbers, numeric-column right-align, hover stripes) and\n  each JSON sidecar as a collapsible pretty-printed block. Script\u2192data\n  mapping = experiments-table links \u222a exact-stem matches (verified: all\n  45 scripts resolve correctly; utility scripts show \"none registered\").\n  Routes added to healthcheck (now 24); traversal guard verified 404.\n- 2026-08-27: mobile/responsive sidebar (backlog #3) \u2014 at \u2264 900px the\n  sidebar goes off-canvas (translateX transition) behind a hamburger\n  button in the sticky topbar; backdrop tap, Escape, or any menu-link\n  click closes it; state is body.nav-open (aria-expanded wired);\n  content padding shrinks to 16px. Desktop layout unchanged.\n- 2026-08-27: dashboard + home stat counters auto-refresh (backlog #4) \u2014\n  /api/status/ now carries summary_stats(); app.js updates all counters\n  (dashboard: done/partial/open/results/experiments/feedback; home: done/\n  results/experiments/derivations/graveyard/sessions) every 3 s, and\n  rebuilds the dashboard phases table on change only (signature compare,\n  DOM-API build \u2014 no innerHTML). Static git-feed / recent-sessions tables\n  intentionally left server-rendered.\n- 2026-08-27: global search page `/search/` (backlog #1) \u2014 AND-of-terms\n  case-insensitive scan-on-query across all MD_COLLECTIONS markdown\n  (results/derivations/graveyard/journal/resources); up to 3 snippets per\n  file with line numbers + <mark> highlights; results hits mapped to\n  /ledger/R-NNN/; 100-file cap with truncation notice; sidebar entry;\n  /search/ + a sample query added to the healthcheck ROUTES (now 22).\n  Also: watchdog found dead (last log 2026-08-21) and respawned detached.\n- 2026-08-19: healthcheck.py + watchdog.py (\u00a76.1/\u00a76.2b); Home latest-result\n  card now dynamic (was hardcoded R-004); dashboard data-freshness line\n  (STATE.md/research.db/agent.db, live via polling); E-017 chart.\n- 2026-08-22: bug fixes. (1) git_log 500 on /dashboard/ \u2014 subprocess\n  decoded git's UTF-8 commit output as cp1252; reader thread died on\n  Unicode commit messages and stdout came back None. Fixed with\n  encoding=\"utf-8\", errors=\"replace\" + a None guard. (2) Roadmap Phase 2 /\n  5B checklists rendered as paragraph text \u2014 those phases have a note\n  paragraph directly above the list (no blank line) and python-markdown\n  never lets a list interrupt a paragraph (sane_lists or not). Fixed with\n  research_data._restore_interrupted_lists: inserts the missing blank line\n  before a list that follows paragraph text (skips indented item\n  continuations so existing lists stay tight; skips fenced code). Archive\n  text rendered verbatim as before \u2014 block structure only.\n- 2026-08-20: math typography pass APPLIED then REVERTED same day (user\n  directive). Context: MathJax 3.2.2 works (resources atlas has real\n  LaTeX); the research archive writes plain Unicode math, so MathJax has\n  nothing to typeset there \u2014 that is the correct, intended rendering.\n  A display-formula-lifting heuristic (research_data._display_formulas +\n  .math-line styling) was built and then removed at user request:\n  **the website renders the research archive VERBATIM \u2014 no presentation\n  transforms, no conversions, no re-boxing of archive text.** Do not\n  re-attempt Unicode\u2192LaTeX conversion or formula-detection heuristics;\n  the archive's plain-Unicode math is the source of truth and its\n  verbatim display is correct by definition.\n\n## 8. BUILD STATUS\n- [x] Plan written (v1.0, 2026-08-19)\n- [x] Dependencies installed (Django 6.1, markdown 3.10.3); vendored JS\n      (plotly 2.35.2, MathJax 3.2.2 tex-chtml)\n- [x] Django scaffold (rhweb project + dashboard app)\n- [x] Parsers / views / API (research_data.py read-only layer)\n- [x] Templates / CSS / JS (12 pages, sidebar, 3 s polling, Plotly charts)\n- [x] Server verified live at 127.0.0.1:8001 \u2014 all 15 routes 200;\n      feedback POST/search verified; path-traversal guard verified;\n      smoke-test data cleaned up\n- [x] Initial commit (web/ + RH-WEBSITE.md only)\n",
  "structuredPatch": [
    {
      "oldStart": 114,
      "oldLines": 7,
      "newStart": 114,
      "newLines": 10,
      "lines": [
        "   track-A/B/C/D), text. CSRF-protected; autoescaped on render.",
        " - Dual storage (mirrors NGUYEN.md \u00a78.2): JSON file per submission in",
        "   `web/feedback/FB-<utc>-<id>.json` + row in `web/feedback.db`.",
        "-- Search: full-text (name+text) + category/status filters.",
        "+- **Submit-only page (user directive 2026-08-28):** submissions are NOT",
        "+  displayed publicly \u2014 the Submissions list AND the Search form were",
        "+  removed from `/feedback/` (search would leak all feedback via queries).",
        "+  Triage happens in the Django admin Feedback changelist (\u00a75A).",
        " - Statuses: new \u2192 reviewed \u2192 acted-on (status changes are website data,",
        "   allowed under \u00a70; researcher notes field for follow-up).",
        " - **Email notification (2026-08-28, VERIFIED live):** every submission also"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\STATE.md",
  "old_string": "# STATE.md \u2014 NGUYEN-RH-1 RESUME POINT\n# \u2b50 READ THIS FIRST at the start of every session.\nLast updated: 2026-08-17 | Session: 001 (archive installation)\n\n## CURRENT POSITION\nPhase 0 \u2014 Initialization & Ingestion. Research archive system installed.\n\n## COMPLETED\n- [x] Project blueprint written (NGUYEN.md)\n- [x] Mission prompt ingested (RHC-Prompt.txt)\n- [x] Research archive structure + session protocol installed (see NGUYEN.md \u00a78)\n- [x] Git repository initialized; SQLite catalog created (research/research.db)\n\n## IN PROGRESS\n(none \u2014 clean stop)\n\n## NEXT ACTION\nPhase 0.1: Parse Notes.txt; index quantum equations for Track B\n\u2192 output file: research/derivations/D-001-quantum-formalism-index.md\n\n## OPEN CONJECTURES / THREADS\n(none yet)\n\n## BLOCKERS\n(none)\n\n## HANDOFF NOTES\n- Resources confirmed present: Notes.txt, Anthropic paper PDF, .venv (mpmath stack TBD in 0.6).\n- Session protocol: see NGUYEN.md \u00a78. Journal every session; update this file last.",
  "new_string": "# STATE.md \u2014 NGUYEN-RH-1 RESUME POINT\n# \u2b50 READ THIS FIRST at the start of every session.\nLast updated: 2026-08-17 | Session: 001 (Phase 0.1 complete)\n\n## CURRENT POSITION\nPhase 0 \u2014 Initialization & Ingestion. 0.1 done; starting 0.2 next.\n\n## COMPLETED\n- [x] Project blueprint written (NGUYEN.md)\n- [x] Mission prompt ingested (RHC-Prompt.txt)\n- [x] Research archive structure + session protocol installed (NGUYEN.md \u00a78)\n- [x] Git repository initialized; SQLite catalog created (research/research.db)\n- [x] Standing order \u00a74A (full-knowledge combination, web research) added\n- [x] Pacing/sub-stage rules \u00a78.5 + plan-mutability directive \u00a75 added\n- [x] 0.1: Notes.txt parsed \u2192 research/derivations/D-001 master tool index\n      (Part I quantum formalism: 14 equations annotated for RH roles;\n      Part II number theory = placeholder for 0.2\u20130.4; Part III web log)\n\n## IN PROGRESS\n(none \u2014 clean stop)\n\n## NEXT ACTION\nPhase 0.2: Deep-read \"Anthropic Riemann Hypothesis Paper.pdf\"; reproduce\nthe main chain line by line \u2192 research/derivations/D-002. Also populate\nD-001 Part II with the paper's machinery as it is mastered.\nNOTE (\u00a78.5): 0.2 is heavy \u2014 break into sub-stages:\n  0.2a = statements + notation map (Thms A/B, definitions)\n  0.2b = zero side (Weil form, Gabor compression, Lemma 2.1)\n  0.2c = prime side (Montgomery second moment, R(\u03c8) theory)\n  0.2d = rank\u2013trace lemma 3.2 + main chain assembly\n  0.2e = \u00a77.2 sharpness/ceiling analysis\n\n## OPEN CONJECTURES / THREADS\n- Q6 uncertainty-principle \u2194 bandwidth-one ceiling bridge (from D-001):\n  formalize via Benedicks-type Fourier uncertainty; feeds Track A task 1.1.\n- Q14 Gutzwiller/primes-as-orbits: central Track B heuristic, Phase 2.\n\n## BLOCKERS\n(none)\n\n## HANDOFF NOTES\n- db.py now supports: init, log-experiment, add-result, add-derivation,\n  add-graveyard, list.\n- Break prompt rule active: ask before long runs, especially near 5:00 PM.\n"
}

{
  "filePath": "D:\\Python\\Quantum\\web\\healthcheck.py",
  "oldString": "    \"/\", \"/dashboard/\", \"/roadmap/\", \"/ledger/\", \"/ledger/R-004/\",",
  "newString": "    \"/\", \"/dashboard/\", \"/roadmap/\", \"/search/\", \"/search/?q=finite-height\",\n    \"/ledger/\", \"/ledger/R-004/\",",
  "originalFile": "\"\"\"\nRH-WEBSITE health check (RH-WEBSITE.md \u00a76).\n\nChecks the server end to end:\n  1. GET /api/health/ responds ok\n  2. Every public route returns 200\n  3. /api/status/ carries fresh research-state fields\n\nUsage:\n  ./.venv/Scripts/python.exe web/healthcheck.py            # check only\n  ./.venv/Scripts/python.exe web/healthcheck.py --restart  # restart if down\n\nExit code 0 = healthy (or successfully restarted), 1 = unhealthy.\nAppends one line per run to web/logs/healthcheck.log.\n\"\"\"\nimport subprocess\nimport sys\nimport time\nimport urllib.request\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nBASE = \"http://127.0.0.1:8001\"\nROOT = Path(__file__).resolve().parent.parent\nLOG = Path(__file__).resolve().parent / \"logs\" / \"healthcheck.log\"\n\nROUTES = [\n    \"/\", \"/dashboard/\", \"/roadmap/\", \"/ledger/\", \"/ledger/R-004/\",\n    \"/experiments/\", \"/experiments/E-015/\",\n    \"/derivations/\", \"/derivations/D-037-finite-height-theorem/\",\n    \"/graveyard/\", \"/graveyard/G-001-multiple-zero-bounds/\",\n    \"/journal/\", \"/journal/session-008/\",\n    \"/resources/\", \"/paper/\", \"/live/\", \"/feedback/\",\n    \"/conversations/\",\n    \"/api/health/\", \"/api/status/\",\n]\n\n\ndef _get(path, timeout=10):\n    with urllib.request.urlopen(BASE + path, timeout=timeout) as r:\n        return r.status, r.read()\n\n\ndef run_checks():\n    failures = []\n    try:\n        status, _ = _get(\"/api/health/\", timeout=5)\n        if status != 200:\n            failures.append(\"/api/health/ not 200\")\n    except Exception as e:  # noqa: BLE001\n        return [f\"server unreachable: {e}\"]  # nothing else will work\n\n    for route in ROUTES:\n        try:\n            status, _ = _get(route)\n            if status != 200:\n                failures.append(f\"{route} -> {status}\")\n        except Exception as e:  # noqa: BLE001\n            failures.append(f\"{route} -> {e}\")\n\n    try:\n        import json\n        _, body = _get(\"/api/status/\")\n        data = json.loads(body)\n        for field in (\"next_action\", \"position\", \"mtimes\", \"server_time\"):\n            if field not in data:\n                failures.append(f\"/api/status/ missing {field}\")\n    except Exception as e:  # noqa: BLE001\n        failures.append(f\"/api/status/ parse: {e}\")\n    return failures\n\n\ndef restart():\n    python = ROOT / \".venv\" / \"Scripts\" / \"python.exe\"\n    log = open(ROOT / \"web\" / \"logs\" / \"server.log\", \"a\", encoding=\"utf-8\")\n    subprocess.Popen(\n        [str(python), \"web/manage.py\", \"runserver\", \"127.0.0.1:8001\", \"--noreload\"],\n        cwd=str(ROOT), stdout=log, stderr=subprocess.STDOUT,\n        creationflags=subprocess.DETACHED_PROCESS | subprocess.CREATE_NEW_PROCESS_GROUP)\n    time.sleep(5)\n\n\ndef log_line(msg):\n    LOG.parent.mkdir(exist_ok=True)\n    ts = datetime.now(timezone.utc).isoformat(timespec=\"seconds\")\n    with open(LOG, \"a\", encoding=\"utf-8\") as fh:\n        fh.write(f\"{ts} {msg}\\n\")\n\n\ndef main():\n    do_restart = \"--restart\" in sys.argv\n    failures = run_checks()\n\n    if failures and do_restart and any(\"unreachable\" in f for f in failures):\n        log_line(f\"DOWN ({failures[0]}) \u2014 restarting\")\n        restart()\n        failures = run_checks()\n        if not failures:\n            log_line(\"restart successful \u2014 healthy\")\n\n    if failures:\n        log_line(f\"UNHEALTHY: {'; '.join(failures[:5])}\")\n        print(\"UNHEALTHY:\")\n        for f in failures:\n            print(\" -\", f)\n        sys.exit(1)\n    log_line(f\"OK ({len(ROUTES)} routes)\")\n    print(f\"healthy \u2014 {len(ROUTES)} routes OK\")\n    sys.exit(0)\n\n\nif __name__ == \"__main__\":\n    main()\n",
  "structuredPatch": [
    {
      "oldStart": 25,
      "oldLines": 7,
      "newStart": 25,
      "newLines": 8,
      "lines": [
        " LOG = Path(__file__).resolve().parent / \"logs\" / \"healthcheck.log\"",
        " ",
        " ROUTES = [",
        "-    \"/\", \"/dashboard/\", \"/roadmap/\", \"/ledger/\", \"/ledger/R-004/\",",
        "+    \"/\", \"/dashboard/\", \"/roadmap/\", \"/search/\", \"/search/?q=finite-height\",",
        "+    \"/ledger/\", \"/ledger/R-004/\",",
        "     \"/experiments/\", \"/experiments/E-015/\",",
        "     \"/derivations/\", \"/derivations/D-037-finite-height-theorem/\",",
        "     \"/graveyard/\", \"/graveyard/G-001-multiple-zero-bounds/\","
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "command": "cd /d/Python/Quantum && .venv/Scripts/python.exe -c \"import pypdf; print('pypdf', pypdf.__version__)\" 2>&1 || .venv/Scripts/python.exe -m pip install pypdf 2>&1 | tail -2",
  "description": "Check for pypdf in venv, install if missing"
}

ProcessId       : 3040
ParentProcessId : 33752
CommandLine     : D:\Python\Quantum\.venv\Scripts\python.exe web/manage.py runserver 127.0.0.1:8001 
                  --noreload

{
  "file_path": "D:\\Python\\Quantum\\research\\paper\\anthropic-paper-fulltext.txt",
  "offset": 400,
  "limit": 420
}

{
  "type": "text",
  "file": {
    "filePath": "C:\\Users\\lucky\\.nguyen\\projects\\D--Python-Quantum\\memory\\project_website_deployed.md",
    "content": "---\nname: RH website deployed live at researchai.dev\ndescription: The Django research site runs in production at https://researchai.dev since 2026-08-27 \u2014 architecture, staging pattern, re-deploy procedure\ntype: project\n---\n\nThe RH research website is LIVE at https://researchai.dev (deployed 2026-08-27), ~0.6\u20131.0 s/page.\n\n**Why:** user wanted the local Django dashboard (web/, previously localhost:8001) hosted publicly on their shared Apache host, with agent.db relocated to web/database/agent.db. Local repo must NOT be modified (user directive) \u2014 all deployment changes live in the staging copy only.\n\n**How to apply:**\n- Architecture: Apache docroot = FTP root. `.htaccess` routes non-file requests to `/app.cgi` (wsgiref CGIHandler \u2192 Django WSGI, `SCRIPT_NAME=''`, PATH_INFO routing) + forces HTTPS; statics collected to `/static/` served directly; `/app/` holds all code/data and is blocked by both a root rewrite rule and `/app/.htaccess` `Require all denied` (verified 403 on agent.db/settings.py).\n- Server layout: `/app/web/` (Django project, feedback.db, database/agent.db), `/app/research/` (read-only archive the site renders), `/app/vendor/` (Django 5.2.17 + markdown 3.10.3 + asgiref/sqlparse/tzdata, pure-Python, runs on server Python 3.11), STATE.md + NGUYEN.md at `/app/`.\n- Deployed-only patches (NOT in local repo): `settings.py` prod version (DEBUG=False, ALLOWED_HOSTS=researchai.dev, real SECRET_KEY, STATIC_ROOT, CSRF_TRUSTED_ORIGINS, secure cookies) and `research_data.py` AGENT_DB \u2192 `REPO / \"web\" / \"database\" / \"agent.db\"`. PLUS (2026-08-27, user-approved option 2): scripts-index role badges \u2014 `_script_import_graph()` in research_data.py + `scripts.html` badge cell tag the 5 non-experiment scripts (`prime_backend_v2` = library imported by 5 experiments; `db` + 3 E-021-diag = utility) with `.tag tag-open`. PLUS (2026-08-27, user request): MM-DD-YYYY dates \u2014 `dashboard/templatetags/usdate.py` filter applied to all UI date renders in 17 templates (+ `class=\"date\"` nowrap cells, `.tbl td.date` CSS, app.js freshness fmt, assets `?v=20260827-5`); archive markdown content dates stay verbatim ISO on purpose (hard rule). **The usdate change was ported to the local repo 2026-08-27 (user request) \u2014 local web/ HAS it (uncommitted, along with the RH-WEBSITE.md \u00a77 log entry); the scripts role badges remain deployed-only.** Gotcha logged in RH-WEBSITE.md \u00a77: a runserver generation started before a new templatetags/ dir exists 500s on {% load %} (stale importlib dir cache) \u2014 healthcheck --restart mandatory; the watchdog self-heals via its route checks. PLUS (2026-08-27, user directive): the **Paper sidebar link is hidden on the public deployment only** (base.html `<li>` removed in the deployed copy; /paper/ route still answers 200; local keeps the link). Deployed-only patches are now: prod settings.py, AGENT_DB path, scripts badges, hidden Paper link.\n- NOT uploaded (deliberate): research/correspondence (PRIVATE per user directive), .git, zeta-23-lean, all .lake caches, .venv, session notes/directive files, the Anthropic PDF. Dashboard git feed shows empty on the server (no .git; git_log() degrades gracefully).\n- Staging + tooling lives at **D:\\Python\\quantum-deploy\\** (outside the repo): `docroot/` (exact server mirror), `upload.py` (resumable 6-thread FTP upload, size-skip; run detached \u2014 CLI kills foreground Bash at ~2 min, exit 143 confirmed), `fix_mtimes.py` (bulk MFMT \u2014 restores original mtimes on the server; Pure-FTPd honors `MFMT YYYYMMDDHHMMSS <path>` in UTC), `smoke_test.py` (local crawl), `verify_site.py` (live suite; its feedback POST creates a real entry \u2014 clean up after with a one-off CGI, and note the POST needs an Origin header or Django 403s). upload.py MFMTs every file it uploads, so re-deploys keep original edit dates \u2014 run fix_mtimes.py once if dates ever look like the upload day again.\n- Re-deploy after research changes: re-copy web/+research/+STATE.md+NGUYEN.md into `docroot/app/`, re-apply the two patches, re-run `upload.py` (skips unchanged). agent.db on the server is a snapshot \u2014 re-copy `web/database/agent.db` to refresh the Conversations pages.\n- Local Django is 6.1/py3.14, server runs 5.2/py3.11 \u2014 requirements-web.txt specifies Django>=5.0 so both are in-spec; full route crawl passed on 5.2.",
    "numLines": 18,
    "startLine": 1,
    "totalLines": 18
  }
}

{
  "command": "date \"+%H:%M %Y-%m-%d\"",
  "description": "Check current local time"
}

healthy � 28 routes OK

{
  "file_path": "D:\\Python\\Quantum\\research\\paper\\anthropic-paper-fulltext.txt",
  "offset": 819,
  "limit": 430
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\PrintAxioms.lean",
    "content": "/- Session 016 axiom audit: ii\u2032-1b(ii) new declarations. -/\nimport Mathlib\nimport NguyenRH1.LiPrincipal\n\nopen NguyenRH1\n\n#print axioms rectInt'_ppart\n#print axioms rectInt_deriv_eq_zero\n#print axioms deriv_Gprim\n#print axioms Acoeff_one",
    "numLines": 10,
    "startLine": 1,
    "totalLines": 10
  }
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-005-linear-algebra-and-chain.md",
  "content": "# D-005 \u2014 Linear algebra (\u00a73) + chain assembly (\u00a76); task 0.3 fulfilled\nDate: 2026-08-17 | Session: 001 | Tasks: 0.2d + 0.3 | Status: complete\nSource: fulltext pp. 5\u20136 (\u00a73), p. 11 (\u00a76). Re-derived independently.\n\n---\n\n## Lemma 3.1 (Inertia under pull-back). [VERIFIED]\nQ\u2080 Hermitian on \u2102\u1d50, A : \u2102\u1d48 \u2192 \u2102\u1d50 linear \u27f9 n\u208a(A*Q\u2080A) \u2264 n\u208a(Q\u2080).\nProof re-derived: if A*Q\u2080A is positive definite on U \u2282 \u2102\u1d48, then A|_U is\ninjective (Ax = 0, x \u2208 U \u27f9 x*A*Q\u2080Ax = 0 \u27f9 x = 0) and Q\u2080 is positive\ndefinite on A(U); hence dim U = dim A(U) \u2264 n\u208a(Q\u2080). Taking U maximal:\nn\u208a(A*Q\u2080A) \u2264 n\u208a(Q\u2080). \u2714 (This is Sylvester's law of inertia for\ncongruence; A need not be invertible \u2014 injectivity on U suffices.)\n\n## Lemma 3.2 (Rank\u2013trace inequality) \u2014 TASK 0.3 INDEPENDENT REPRODUCTION\n**Statement.** P, Q Hermitian d\u00d7d, P \u2ab0 0, rank P \u2264 r, n\u208a(Q) \u2264 b \u27f9\n  r \u2265 2 tr P + 4 tr Q \u2212 4b \u2212 \u2016P+Q\u2016\u00b2_HS.   (3.1)\n\n**My reproduction.** Jordan decomposition Q = Q\u207a \u2212 Q\u207b, Q\u00b1 \u2ab0 0, Q\u207aQ\u207b = 0,\nrank Q\u207a = n\u208a(Q) \u2264 b. Expand:\n  \u2016P+Q\u2016\u00b2_HS = \u2016P\u2016\u00b2 + \u2016Q\u207a\u2016\u00b2 + \u2016Q\u207b\u2016\u00b2 + 2tr(PQ\u207a) \u2212 2tr(PQ\u207b) \u2212 2tr(Q\u207aQ\u207b).\ntr(PQ\u207a) \u2265 0 (trace of product of two PSD matrices: tr(PQ\u207a) =\ntr(P^{1/2}Q\u207aP^{1/2}) \u2265 0 \u2714); tr(Q\u207aQ\u207b) = 0 \u2714. Drop the \u22650 term:\n  \u2016P+Q\u2016\u00b2 \u2265 \u2016P\u2016\u00b2 \u2212 2tr(PQ\u207b) + \u2016Q\u207b\u2016\u00b2 + \u2016Q\u207a\u2016\u00b2.   (*)\nVon Neumann trace inequality: tr(PQ\u207b) \u2264 \u03a3\u1d62 p\u1d62n\u1d62 (p\u2081\u2265\u22ef\u2265p_d \u22650 eigenvalues\nof P, n\u2081\u2265\u22ef\u2265n_d\u22650 of Q\u207b). \u27f9 first three terms of (*) satisfy\n  \u2016P\u2016\u00b2 \u2212 2tr(PQ\u207b) + \u2016Q\u207b\u2016\u00b2 \u2265 \u03a3\u1d62(p\u1d62 \u2212 n\u1d62)\u00b2.   (**)\nSplit at r (p\u1d62 = 0 for i > r since rank P \u2264 r):\n  \u03a3\u1d62(p\u1d62\u2212n\u1d62)\u00b2 \u2265 \u03a3_{i\u2264r}(p\u1d62\u2212n\u1d62)\u00b2 + \u03a3_{i>r} n\u1d62\u00b2.\nScalar inequality x\u00b2 \u2265 2x \u2212 1 at x = p\u1d62\u2212n\u1d62 (i\u2264r):\n  \u03a3_{i\u2264r}(p\u1d62\u2212n\u1d62)\u00b2 \u2265 2\u03a3_{i\u2264r}(p\u1d62\u2212n\u1d62) \u2212 r = 2tr P \u2212 r \u2212 2\u03a3_{i\u2264r}n\u1d62\n                  \u2265 2tr P \u2212 r \u2212 4\u03a3_{i\u2264r}n\u1d62   (n\u1d62 \u2265 0).\nAnd \u03a3_{i>r}n\u1d62\u00b2 \u2265 0 \u2265 \u22124\u03a3_{i>r}n\u1d62. Since tr Q\u207b = \u03a3_{all i} n\u1d62:\n  (**) \u2265 2tr P \u2212 r \u2212 4tr Q\u207b.   (***)\nFor Q\u207a: positive eigenvalues q\u2081..q_{b\u2032}, b\u2032 \u2264 b; scalar (x\u22122)\u00b2 \u2265 0, i.e.\nx\u00b2 \u2265 4x \u2212 4:\n  \u2016Q\u207a\u2016\u00b2 = \u03a3 q\u2c7c\u00b2 \u2265 \u03a3(4q\u2c7c \u2212 4) = 4tr Q\u207a \u2212 4b\u2032 \u2265 4tr Q\u207a \u2212 4b.   (****)\nInsert (***),(****) into (*):\n  \u2016P+Q\u2016\u00b2 \u2265 2tr P \u2212 r \u2212 4tr Q\u207b + 4tr Q\u207a \u2212 4b\n         = 2tr P \u2212 r + 4tr Q \u2212 4b   (tr Q = tr Q\u207a \u2212 tr Q\u207b).\nRearranged: r \u2265 2tr P + 4tr Q \u2212 4b \u2212 \u2016P+Q\u2016\u00b2. \u220e [VERIFIED \u2014 every\ninequality step independently justified]\n\n**Equality case (checked):** P = \u03a0\u2081, Q = 2\u03a0\u2082, orthogonal projections\n\u03a0\u2081 \u22a5 \u03a0\u2082, ranks r, b: tr P = r, tr Q = 2b, \u2016P+Q\u2016\u00b2 = tr \u03a0\u2081 + 4tr \u03a0\u2082 =\nr + 4b. RHS = 2r + 8b \u2212 4b \u2212 (r + 4b) = r \u2714 equality.\n**Tightness map (where the proof can lose):** (i) dropping 2tr(PQ\u207a) \u2265 0 \u2014\nlossy unless P \u22a5 Q\u207a; (ii) von Neumann \u2014 lossy unless P, Q\u207b simultaneously\ndiagonalizable with aligned order; (iii) x\u00b2 \u2265 2x\u22121 \u2014 tight only at\np\u1d62\u2212n\u1d62 = 1; (iv) x\u00b2 \u2265 4x\u22124 \u2014 tight only at q\u2c7c = 2. \u27f9 The certificate is\ntight exactly for eigenvalue pattern {1}_P, {2}_Q: this is why simple\nzeros (charge 1) and off-line pairs (charge... matching v-norms \u2248 1, pairs\nat signature (1,1) scaled by 2) saturate it. Any improvement must exploit\na regime where these four inequalities are NOT simultaneously tight \u2014\nkey input for task 1.1.\n\n**Remark 3.3 (variational view, checked):** minimize U \u21a6 \u2016P+UQU*\u2016\u00b2_HS\nover the (compact) unitary group; first-order condition tr([P,UQU*]H) = 0\n\u2200 Hermitian H \u27f9 [P, UQU*] = 0 \u27f9 simultaneous diagonalization \u27f9 (3.1)\nreduces to scalar (x\u22121)\u00b2 \u2265 0, x\u00b2 \u2265 0, (x\u22122)\u00b2 \u2265 0 in the three sign cases.\nSetting Q = 0 and optimizing the scalar parameter recovers the\nCauchy\u2013Schwarz rank bound rank P \u2265 (tr P)\u00b2/\u2016P\u2016\u00b2_HS. \u2714\n[Note: Lemma 3.2 with Q\u22600 is NOT implied by C\u2013S; the 4tr Q \u2212 4b term is\nthe genuinely new content \u2014 it charges off-line mass at rate 4 instead of\nlosing it entirely.]\n\n**Genealogy (checked against \u00a71.2):** (3.1) is the matrix form of\nm\u00b2 \u2265 2m \u2212 1 (per-zero: multiplicity m costs m\u00b2 in \u2016G\u0303\u2016\u00b2, earns 2m\u22121...\ni.e. m\u00b2 \u2212 (2m\u22121) = (m\u22121)\u00b2 \u2265 0); with simple zeros on the rank side and\nmultiple ones at flat charge 4 it recovers m\u00b2 \u2265 3m \u2212 2\n(m\u00b2 \u2212 (3m\u22122) = (m\u22121)(m\u22122) \u2265 0 \u2714). The flat charge 4 for Q-eigenvalues\nis what treats off-line pairs and multiple zeros uniformly.\n\n## Lemma 3.4 (Weyl). [VERIFIED]\nA, E Hermitian, \u2016E\u2016 \u2264 \u03b8 \u27f9 n\u208a(A) \u2265 #{i : \u03bb\u1d62(A+E) > \u03b8}.\nCourant\u2013Fischer: \u03bb\u1d62(A) \u2265 \u03bb\u1d62(A+E) \u2212 \u2016E\u2016 > \u03b8 \u2212 \u03b8 = 0 for each counted i. \u2714\n(Role: lets inertia statements survive the o(1) tail \u1ebc; insurance for the\nchain, used implicitly when passing from G\u0303+\u1ebc to G\u0303.)\n\n## Chain assembly (\u00a76) \u2014 full verification\nSetup: P\u2081 := (aL\u00b2)\u207b\u00b9 \u03a3_{\u03c1\u2208on, m_\u03c1=1} v_\u03c1v_\u03c1\u1d40 (simple on-line), Q\u2032 := G\u0303 \u2212 P\u2081.\n- P\u2081 \u2ab0 0, rank P\u2081 \u2264 s\u2081, tr P\u2081 \u2264 s\u2081 (Lemma 2.1, m_\u03c1=1: each \u2016v_\u03c1\u2016\u00b2 \u2264 aL\u00b2). \u2714\n- Q\u2032 = pull-back of \u2295_{on, m\u22652} m_\u03c1|x|\u00b2 \u2295 \u2295_pairs [[0,m_\u03c1],[m_\u03c1,0]] \u2014\n  the pair block [[0,m],[m,0]] has eigenvalues \u00b1m \u2714 (one positive per pair);\n  on-line multiple zeros contribute one positive direction each \u27f9\n  n\u208a(Q\u2032) \u2264 s\u2082 + p (Lemma 3.1). \u2714\n- Apply Lemma 3.2 with r = s\u2081, b = s\u2082 + p, tr Q\u2032 = tr G\u0303 \u2212 tr P\u2081:\n  rank P\u2081 \u2265 2tr P\u2081 + 4(tr G\u0303 \u2212 tr P\u2081) \u2212 4(s\u2082+p) \u2212 \u2016G\u0303\u2016\u00b2\n         = 4tr G\u0303 \u2212 2tr P\u2081 \u2212 4(s\u2082+p) \u2212 \u2016G\u0303\u2016\u00b2.\n- Key inequality: tr P\u2081 + 2(s\u2082+p) \u2264 s\u2081 + 2s\u2082 + 2p \u2264 N(I\u2032)\n  (tr P\u2081 \u2264 s\u2081; m_\u03c1 \u2265 2 per multiple on-line point; m \u2265 1 per off-line zero,\n  2 zeros per pair). \u2714 \u27f9 \u22122tr P\u2081 \u2212 4(s\u2082+p) \u2265 \u22122N(I\u2032).\n- \u27f9 rank P\u2081 \u2265 4tr G\u0303 \u2212 2N(I\u2032) \u2212 \u2016G\u0303\u2016\u00b2_HS\n  = 4N(I\u2032) \u2212 2N(I\u2032) \u2212 R(\u03c8)N + o(N) = (2 \u2212 R(\u03c8) \u2212 o(1))N\n  (Prop 4.2 + Thm 5.7 + N(I\u2032) = N(I) + O(\u221aT L)). \u2714\n- Rank side: N^s_0(I) = s\u2081 \u2212 O(\u221aT L) \u2265 rank P\u2081 \u2212 O(\u221aT L) (Cor 4.5). \u2714\n\u27f9 (1.2): N^s_0 \u2265 (2 \u2212 R(\u03c8) \u2212 o(1))N. \u03c8\u2080: 2 \u2212 4/3 = 2/3 \u220e (i).\n(ii): from the display before the key inequality:\n  3tr P\u2081... rearranged form: 3s\u2081 + 4(s\u2082+p) \u2265 4tr G\u0303 \u2212 \u2016G\u0303\u2016\u00b2 (using\n  tr P\u2081 \u2264 s\u2081 to go from \u22122tr P\u2081 to \u2265 \u22122s\u2081: check \u2014 rank P\u2081 \u2265 4tr G\u0303 \u2212\n  2tr P\u2081 \u2212 4(s\u2082+p) \u2212 \u2016G\u0303\u2016\u00b2 and rank P\u2081 \u2264 s\u2081, tr P\u2081 \u2264 s\u2081 \u27f9\n  s\u2081 \u2265 4tr G\u0303 \u2212 2s\u2081 \u2212 4(s\u2082+p) \u2212 \u2016G\u0303\u2016\u00b2 \u27f9 3s\u2081 + 4(s\u2082+p) \u2265 4tr G\u0303 \u2212 \u2016G\u0303\u2016\u00b2 \u2714);\n  subtract s\u2081 + 2s\u2082 + 2p \u2264 N(I\u2032):\n  2(s\u2081+s\u2082+p) \u2265 (3 \u2212 R(\u03c8) \u2212 o(1))N; N_d(I\u2032) \u2265 s\u2081+s\u2082+2p \u2265 s\u2081+s\u2082+p \u27f9\n  N_d \u2265 \u00bd(3 \u2212 R(\u03c8) \u2212 o(1))N. \u03c8\u2080: \u00bd(3\u22124/3) = 5/6 \u220e (ii). [VERIFIED]\nCumulative (0,T): dyadic summation, rate O(log log T/log T) (Remark 6.1). \u2714\nTheorem B: \u03c7-twisted inputs, no poles for \u03c7\u2260\u03c7\u2080, chain unchanged. \u2714\n\n## TASK 0.3 SIGN-OFF\nLemma 3.2 reproduced independently with all four loss-points mapped and\nthe equality case confirmed. The inequality is elementary (von Neumann +\ntwo scalar inequalities) but the STRUCTURE \u2014 charging Q at rate 4 with\ncap 4b \u2014 is the paper's load-bearing idea.\n\n## OBSERVATIONS FOR THE ATTACK\n1. **The four tightness conditions are the blueprint for improvement.**\n   Beating 2/3 requires either (i) data that makes tr(PQ\u207a) > 0 usable\n   (correlation between simple-zero vectors and off-line/multiple mass),\n   (ii) eigenvalue distributions of P, Q\u207b that break von Neumann alignment,\n   or (iii)/(iv) non-saturating eigenvalues \u2014 i.e. moments beyond the\n   second. All three need NEW prime-side input (support > 1 or higher\n   moments) \u2014 consistent with \u00a77.2, now understood mechanistically.\n2. The chain uses rank P\u2081 \u2264 s\u2081 AND tr P\u2081 \u2264 s\u2081 (both saturated by simple\n   zeros). Multiple on-line zeros waste (m_\u03c1\u22121) trace AND occupy Q\u2032-budget\n   at rate... a double zero on the line costs 2 in N but returns 0 rank:\n   the worst case for the certificate. Bounding multiple-zero density by\n   OTHER means (e.g. derivatives of \u03be, Levinson-style) would tighten\n   tr P\u2081 + 2(s\u2082+p) \u2264 N \u2014 a cross-track hook (Track A \u2194 classical\n   mollifier methods).\n"
}

{
  "type": "create",
  "filePath": "D:\\Python\\Quantum\\research\\journal\\session-017.md",
  "content": "# Session 017 \u2014 2026-08-21 \u2014 Tier ii\u2032 sub-stage ii\u2032-1b(iii) COMPLETE (ii\u2032-1b now fully done)\n\n## Directive\nContinue tier ii\u2032 per D-064: finish ii\u2032-1b \u2014 (iii) the rectangle residue\ntheorem for the Lagarias-kernel integrand J (STATE.md NEXT ACTION).\n\n## Work done\n**ii\u2032-1b(iii) COMPLETE (commit f3d7244)** \u2014 LiSides.lean (~460 lines, 19\nnew declarations, single-file check clean, full `lake build` GREEN 8745\njobs \u2014 first build covering LiResidue/LiPrincipal, which session 016 had\nleft out of the package root; root NguyenRH1.lean now imports all three):\n\n* `kFun n w = (w/(w\u22121))\u207f\u22121`, `Jlag n w = kFun n w\u00b7(\u2212\u03b6\u2032/\u03b6(w))`,\n  `Rfun n = Jlag n \u2212 ppart n` + differentiability/continuity kits\n  (`kFun_differentiableAt`, `ppart_differentiableAt`,\n  `Jlag_differentiableAt`, `Rfun_differentiableAt`, `ppart_continuousAt`).\n* `zeta_order_ne_top_of_ne` : analyticOrderAt \u03b6 \u03c1 \u2260 \u22a4 for all \u03c1 \u2260 1 \u2014\n  identity principle through the ENTIRE zetaA (avoids punctured-plane\n  connectedness): analyticOrderAt_ne_top_of_isPreconnected on univ with\n  zetaA 1 = 1 \u2260 0, then order(zetaA) = order((w\u22121)\u00b7\u03b6) = 0 + order(\u03b6)\n  via `analyticOrderAt_congr` + `analyticOrderAt_mul`. NOTE: zetaA's\n  value-1-at-1 also makes `riemannZeta 1`'s junk value irrelevant\n  everywhere \u2014 no `\u03b6(1) \u2260 0` lemma needed.\n* `rectangle_mem_nhds_of_mem_not_border` \u2014 interior from border avoidance\n  (extracted from the vendored hZint argument).\n* **Removable singularity at 1** (`Rfun_bounded_near_one`): on \ud835\udcdd[\u2260] 1,\n  R = (Ffun n \u2212 TaylP n)/(w\u22121)^{n+1} (`Rfun_eq_sub_div_near_one`, from\n  `Jlag_mul_pow` + `ppart_mul_pow`); `Ffun_sub_TaylP_order`: order \u2265 n+1\n  via `natCast_le_analyticOrderAt_iff_iteratedDeriv_eq_zero` \u2014\n  `iteratedDeriv_TaylP` (the i-th deriv of the Taylor poly matches Ffun's:\n  descFactorial/0^{j\u2212i} split, `Finset.sum_eq_single`); then\n  `Rfun_tendsto_one` by cases on order = \u22a4 (R \u2192 0) or factorization\n  g = (w\u22121)^m\u00b7h with m \u2265 n+1 (R \u2192 0^{m\u2212n\u22121}\u00b7h(1)). Residue at 1 is 0\n  for R \u2014 exactly what `residueTheorem_finset` needs with 1 \u2208 S.\n* **Residue at a zero** (`Rfun_residue_at`): for ANY \u03c1 \u2260 1,\n  R \u2212 mult(\u03c1)\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f)/(w\u2212\u03c1) is bounded on \ud835\udcdd[\u2260] \u03c1 \u2014 logDeriv normal\n  form \u03b6 = (w\u2212\u03c1)^m\u00b7h, h(\u03c1) \u2260 0 (from `zeta_order_ne_top_of_ne` +\n  `AnalyticAt.analyticOrderAt_ne_top`), so \u2212\u03b6\u2032/\u03b6 = \u2212m/(w\u2212\u03c1) \u2212 h\u2032/h; the\n  kFun slope \u2192 kFun\u2032(\u03c1), h\u2032/h and ppart continuous. Multiple zeros OK\n  (logDeriv poles are simple). Sign check: residue = \u2212m\u00b7kFun n \u03c1\n  = m\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) \u2713 matches D-064.\n* **`rectInt'_Jlag`** (the deliverable): rectangle with 1 interior, no\n  zeros of \u03b6 on the border, Sz any finset with\n  `s \u2208 Sz \u2194 s \u2208 Rectangle \u2227 zetaA s = 0` (supplied form, like the\n  vendored `rectangleIntegral'_mul_logDeriv`; downstream produces Sz from\n  `finite_zeros_rectangle` \u2014 zetaA is entire so it applies across w = 1):\n    RectangleIntegral' (Jlag n) z w\n      = ResW1 n + \u03a3_{\u03c1 \u2208 Sz} (zeroMult \u03c1)\u00b7(1 \u2212 (\u03c1/(\u03c1\u22121))\u207f).\n  Proof: residueTheorem_finset on R with S = insert 1 Sz, A 1 = 0,\n  A \u03c1 = mult\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f); then Jlag = Rfun + ppart,\n  `RectangleIntegral'_add`, `rectInt'_ppart` (session 016).\n\nAxiom audit (PrintAxioms.lean): all 19 declarations \u2014 propext,\nClassical.choice, Quot.sound ONLY. No sorryAx.\n\n**Deferred (documented in file header):** zeroMult(\u22122) = 1 (trivial-zero\nsimplicity \u2014 not in Mathlib/Zeta23; would need the functional-equation\nderiv computation). The sum keeps zeroMult symbolic; the\nSz = {nontrivial} \u222a {\u22122} split on the D-064 rectangle is ii\u2032-4 territory.\n\n## Lean notes (hard-won this session, additions to the handoff list)\n- `analyticOrderAt_ne_top_of_isPreconnected` is **AnalyticOnNhd-namespaced**\n  (`AnalyticOnNhd.analyticOrderAt_ne_top_of_isPreconnected`).\n- `mul_div_cancel_left\u2080 (b) (ha : a \u2260 0) : a * b / a = b` \u2014 the EXPLICIT\n  arg is b (the kept factor); pass `_`.\n- `Tendsto.congr'` needs an `EventuallyEq` \u2014 a raw `\u2200\u1da0 s, f s = c` has no\n  `.symm`; ascribe the have as `f =\u1da0[l] g` explicitly.\n- `mem_nhdsWithin_of_mem_nhds` yields the raw set-membership form\n  ({x | p x} \u2208 \ud835\udcdd s); coerce to `f =\u1da0[\ud835\udcdd s] g` by type ascription before\n  `.deriv_eq` / `.self_of_nhds` dot-projection works.\n- `analyticOrderAt_mul` in a `rw` needs `(f := ...) (g := ...)` named \u2014\n  `analyticAt_id.sub analyticAt_const` elaborates to `id \u2212 const`, not\n  the `fun w => w \u2212 1` lambda; `show`-bridge for the defeq.\n- `field_simp` sometimes closes the cleared goal itself \u2014 a trailing\n  `ring` then errors \"no goals\". Remove on recompile error.\n- `Nat.cast_analyticOrderNatAt (h : order \u2260 \u22a4) : \u2191orderNat = order` \u2014\n  rewrite direction `\u2190 ... at h` to turn an order bound into a nat bound\n  (`ENat.natCast_le_natCast.mp`).\n- `riemannZeta 1 = (\u03b3 \u2212 log 4\u03c0)/2` (Mathlib ZetaAsymp) \u2014 junk value but\n  nonzero; routing everything through zetaA avoids needing it.\n\n## State at stop\nii\u2032-1b (R1 residue machinery) FULLY COMPLETE: (i) ResW1_eq_sum, (ii)\nrectInt'_ppart, (iii) rectInt'_Jlag. The sides identity\nsides(T) = ResW1 n + \u03a3_{\u03c1 \u2208 Sz} mult\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) is now a Lean theorem.\nNext: **ii\u2032-2** \u2014 R2(i)/(ii) elementary swaps: \u03bb_n = \u03a3_j (\u22121)^{j+1}C(n,j)\u03c3_j\n(binomial + paired swap) and S_\u221e = \u03a3_j C(n,j)\u03c4_{j\u22121} (D-064 \u00a74 R2).\n",
  "structuredPatch": [],
  "originalFile": null
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-006-sharpness-ceiling-lean.md",
  "content": "# D-006 \u2014 \u00a77 sharpness/ceiling + conditional extensions + Lean (App. A)\nDate: 2026-08-17 | Session: 001 | Task: 0.2e | Status: complete\nSource: fulltext pp. 12\u201317. This completes the 0.2 sub-stage series.\n\n---\n\n## 1. \u00a77.1 \u2014 Position vs. prior work (map)\n- [Ary22]/[BGSTB24]: unconditional Fej\u00e9r-kernel sum over zero differences\n  = (4/3+o(1))(T/2\u03c0)log T \u2014 the zero-side reading of our \u2016G\u0303\u2016\u00b2_HS.\n- [GS25 Thm 2]: unconditional bound on the diagonal (\u03b3=\u03b3\u2032) sum with\n  constant C < 2 would give \u2265 2\u2212C simple/on-line; C = 4/3 needs discarding\n  \u03b3\u2260\u03b3\u2032 terms = termwise positivity that FAILS off the line. [BGSTB25,\n  GS26] achieve it under \"all zeros within o(1/log T) of the line\".\n- Theorem A = unconditional substitute reaching their 2\u2212C = 2/3: instead\n  of isolating the horizontal diagonal termwise, Lemma 3.2 bounds the rank\n  from tr, \u2016\u00b7\u2016_HS, and positive index. 5/6 = (3\u2212C)/2 = average of simple\n  and critical proportions [GS25 Thm 3(ii)] = RH-conditional [CGG98,(1.2)].\n- Bombieri [Bom00]: negative index of truncated Weil form = #off-line\n  pairs seen. Yoshida [Yos92]: positivity of W on small support.\n  **No prior use of positive index/rank + second moment together.**\n\n## 2. \u00a77.2 \u2014 Sharpness and limits (THE ceiling analysis)\n\n**(a) Dimension.** rank P, n\u208a(G\u0303) \u2264 d = N(1+o(1)): trivial ceiling 100%.\nX \u2264 T restriction is from Prop 5.4 (off-diagonal primes). X \u226b T needs\nHardy\u2013Littlewood prime-pair info \u27fa Montgomery pair correlation for\nsupport > 1 [Mon73, GM87].\nExtreme configuration test: all zeros off-line pairs \u27f9 rank P = 0,\nn\u208a(Q) \u2264 N/2, Lemma 3.2 forces \u2016G\u0303\u2016\u00b2 \u2265 2N > (4/3)N \u2014 contradiction with\n(P) only shows \u2265 2/3 are not of this kind. **Nothing in the method\ndistinguishes \"two thirds\" from \"all\".** [This is the precise statement of\nthe wall.]\n\n**(b) Sharpness of the three counts.** Given only tr, \u2016\u00b7\u2016\u00b2_HS, block\nstructure, tr P\u2081 \u2264 s\u2081: \u00a76 inequalities are SHARP. Extremal: (2/3)N\nmutually orthogonal simple on-line + (1/6)N on-line doubles realizes\ntr = N, \u2016\u00b7\u2016\u00b2 = (4/3)N, s\u2081 = (2/3)N, N_d = (5/6)N \u2014 Montgomery's RH\nextremal. Off-line pairs of depth \u2192 0 are spectrally identical; there\nThm A(i) is exact (2/3) and A(ii) is not sharp (N_d = N). \u27f9 **Improving\nthe constants with this exact data set is impossible** (formal sense).\n\n**(c) Two levels of integrality.** (P,Q) decomposition recovers\n(m\u22121)\u00b2 \u2265 0; (P\u2081,Q\u2032) regrouping recovers (m\u22121)(m\u22122) \u2265 0. Interacting\nsimple zeros (eigenvalues in (0,2)) are harmless on the rank side;\nmultiple on-line points and off-line pairs sit on the index side at flat\ncharge 4. = [CGG98,(1.2)] made unconditional.\n\n**(d) CMS connection.** Lemma 3.2 is the m=1 case of the one-sided\nChebyshev\u2013Markov\u2013Stieltjes bound: knowing moments d\u207b\u00b9tr G\u0303\u1d4f for k \u2264 2m,\nthe sharp lower bound for n\u208a(G\u0303)/d is 1 \u2212 \u039b_m(0), \u039b_m = Christoffel\nfunction of the moment sequence at 0. \u27f9 The natural upgrade path is\nMOMENTS, and the upgrade is quantified by Christoffel functions.\n\n**(e) Rudnick\u2013Sarnak wall.** Prime-side evaluation of tr G\u0303\u1d4f by the\ndiagonal method works exactly when X\u1d4f \u2264 T^{2\u2212\u03b5} [RS96]. At X \u224d T: only\nk = 1,2 (tr G\u0303 and \u2016G\u0303\u2016\u00b2 = tr G\u0303\u00b2). **Unconditionally, higher moments add\nnothing.** [Confirmed: this is why the certificate is a 2-moment object.]\n\n**(f) Conditional ladder HL*(k\u2080).** Hypothesis: tr G\u0303\u1d4f = d\u00b7m_k(1)(1+o(1))\nfor k \u2264 k\u2080, where m_k(1) = k-th moment of the limiting spectral\ndistribution of the sine-kernel Gram matrix over the sine process.\n(k=4 encodes Hardy\u2013Littlewood-type additive correlations\n\u03a3_m(\u039b\u2217\u039b)(m)(\u039b\u2217\u039b)(m+h), |h| \u2264 X\u00b2/T.)\nComputed: m_k(1) = 1, 4/3, 2, 13/4 (k \u2264 4); \u039b\u2082(0;1) = 5/36.\nHL*(4) \u27f9 N^s_0/N \u2265 13/18 = 0.7222. HL*(\u221e) \u27f9 100% simple on line \u2014 the\nceiling of (a). **RH itself is out of reach of the mechanism.**\nComplementary to [GLSS25]: full-support pair correlation conjecture \u27f9\n100% simple zeros on the line.\n[Verify later (Phase 1): m_k sequence and 13/18 computation \u2014 reproduction\ntarget 1.3; the moment sequence 1, 4/3, 2, 13/4 looks like it comes from a\nspecific density \u2014 identify it: candidate \u03c1(x) = (2/\u03c0)\u221a... or Mar\u010denko\u2013\nPastur-like. NUMERICALLY CHECKABLE. \u2192 logged as open thread.]\n\n**The bandwidth-one ceiling (\u2248 0.682, partially Lean-verified).**\nDefinition: a bandwidth-one certificate p depends on the zero\nconfiguration only through its first two trace moments against test\nfunctions of Fourier support in [\u22121,1] + the on-line/off-line partition,\nand satisfies p \u2264 N^s_0/N configuration-wise. Thm A(i)'s certificate is of\nthis kind.\nLean theorem `Zeta23.PairCeiling.ceiling_law256`: for any such p and any\nwindow r of Fourier support in [\u22121,1],\n  c\u2080 + \u222b\u2080\u00b9 r(x)x dx \u2264 p + 0.824|r(1)| + 2.55\u00d710\u207b\u2076(|r\u2032(1)| + \u222b\u2080\u00b9|r\u2033|)\nunder hypotheses h_valid (sampled form factor S_j of the explicit\n256-periodic law, `Zeta23/PairCeiling/LawN256.lean` \u2014 optimum of the\nfinite program) and EnclOK (form-factor enclosures).\np\u2080 := 1 \u2212 a_N \u2264 0.6818287 (exact rational, rounded up).\nBand-limited windows have r(\u00b11) = 0 \u27f9 0.824-term vanishes \u27f9 bound\np\u2080 + 2.55\u00d710\u207b\u2076(|r\u2032(1)| + \u222b|r\u2033|) < 0.6819 for |r\u2032(1)| + \u222b|r\u2033| < 8.2\n(both windows (2.6) qualify).\n**Audit caveat:** at tag v1.0 the enclosures EnclOK are certified by\nINTERVAL ARITHMETIC, not the Lean kernel. Kernel-checked (given EnclOK):\n255 near-CUE row inequalities |256S(j) \u2212 j| \u2264 3\u00d710\u207b\u2074\u2070, edge bound\n|D(1)| \u2264 0.82395317 and its sign, analytic stability inequality. This is\nthe ONLY numerical certification in the paper; Theorems A/B are\nindependent of it (3 standard axioms only).\n\u27f9 **Theorem A is within 0.016 of the ceiling of its own method class.**\nBeating 0.682 provably requires leaving bandwidth one (support > 1\nform-factor input) or using \u2265 3 moments.\n\n## 3. \u00a77.3 \u2014 Conditional extensions (roadmap material)\nUnder RH, tr G\u0303\u00b3 available [Hej94, RS96]. Cubic weight\n\u03c9(m) = \u00bdm + (1/18)(2m\u00b2 \u2212 m\u00b3) + (4/9)\u00b71_{m=1} (tight at m = 1,2,3;\nSchur\u2013Horn + convex minorant of \u2212x\u00b2/9 + x\u00b3/18); window cos(8s/5)1_{|s|\u22641/2}\n+ [BHB13] N^s/N \u2265 19/27 (RH) \u27f9 N_d/N \u2265 0.85082 (cf. 0.8477 [CGdL20] RH).\nIf Montgomery's form factor were known on support (\u2212\u03bb\u2080,\u03bb\u2080) for ALL \u03bb\u2080:\nmethod certifies 100% simple zeros on the line.\n\n## 4. Remark 7.1 \u2014 Zeros of \u03be\u2032 (unconditional, new)\nSame argument applied to \u03be\u2032: N^s_{0,\u03be\u2032}/N_{\u03be\u2032} \u2265 0.85838 (flat window);\n0.86864 with quartic window v(s) = 1 \u2212 (7/100)(2s)\u00b2 \u2212 (51/200)(2s)\u2074;\ndistinct: 0.92919 / 0.93432.\nComparators: Conrey 79.874% (uncond.); FGL14 85.84% (RH); CGdL20\n0.8825/0.9412 (RH). Wu [Wu15] 0.86957 on-line (not simple, uncond.) \u2014\nNOT exceeded; the new content is SIMPLICITY. Flat-window 85.838% =\nFGL's RH-constant with RH removed. Lean: `Zeta23.XiPrime.*`.\n\n## 5. Appendix A \u2014 Lean formalisation (facts for task 0.5)\nToolchain v4.33.0-rc2; Mathlib 51e6992efd06; repo tag v1.0;\ngithub.com/anthropics/zeta-23-lean.\nCounting functions defined directly against Mathlib's riemannZeta\n(Zeta23/Statement.lean). Main theorems carry NO hypotheses:\n`two_thirds_on_critical_line`, `thmB_0_mult` (2/3 simple on-line),\n`thmC_0_mult` (5/6 distinct), Montgomery\u2013Taylor variants with\ncMT := \u221a2 tan(1/\u221a2)/(1 + (1/\u221a2)tan(1/\u221a2)), Theorem B analogues,\ncomparator/ directory restating against Mathlib alone.\nAudit: no axiom declarations beyond Mathlib's; #print axioms on all main\ndeclarations \u27f9 only propext, Classical.choice, Quot.sound; no sorry.\nContributed to Mathlib: von Neumann trace inequality (Hermitian), both\ndirections of Sylvester's law of inertia (Hermitian forms).\nAnalytic inputs (\u00a72) appear as theorems in their own right; several ported\nwith attribution from PrimeNumberTheoremAnd [PNT+].\n\n## 6. SYNTHESIS \u2014 the obstruction map, now mechanistic (Phase 1 input)\n| Wall | Precise mechanism | Escape requires |\n|---|---|---|\n| 2/3 certificate | Lemma 3.2 tight at eigenvalues {1}_P,{2}_Q (D-005) | data breaking simultaneous tightness |\n| 0.682 bandwidth-one | 2-moment + support-[\u22121,1] certificates: finite program optimum p\u2080 \u2264 0.6818287 (Lean + interval arith.) | support > 1 OR \u2265 3 moments |\n| X \u2264 T (bandwidth) | Prop 5.4 off-diagonal O(L\u00b2X) vs main TL\u00b3 (D-004) | Hardy\u2013Littlewood prime-pair input |\n| moments k \u2264 2 | Rudnick\u2013Sarnak X\u1d4f \u2264 T^{2\u2212\u03b5} (\u00a77.2e) | new unconditional moment input |\n| RH itself | sine-process moments give 100% simple but not RH (\u00a77.2f) | DIFFERENT mechanism entirely |\n\n**Open threads logged to STATE.md:**\n- T1: reproduce m_k(1) = 1,4/3,2,13/4 + \u039b\u2082(0;1) = 5/36 numerically\n  (identify the limiting density) \u2014 feeds Phase 1 task 1.3.\n- T2: Christoffel/CMS formulation (\u00a77.2d) \u2014 is there a weighted/variant\n  CMS bound using tr G\u0303\u00b2 differently? (task 1.1 material)\n- T3: the 0.824 edge constant / finite program LawN256 \u2014 understand the\n  256-periodic law construction before attempting to beat 0.682.\n- T4: \u03be\u2032-analogue (Remark 7.1) \u2014 the method is stronger on \u03be\u2032; do our\n  Track A ideas also transfer there? (cheap secondary target)\n"
}

{
  "type": "create",
  "filePath": "D:\\Python\\Quantum\\research\\journal\\session-008.md",
  "content": "# Session 008 \u2014 2026-08-19\n## Regroup + R7 registration; task 3.8 COMPLETE (R-004 finite-height Li theorem)\n\n### Part 1 \u2014 Regroup (user-requested) and resources registration\n- User asked for a regroup + formal registration of the resources folder.\n- Created research/resources/index.md: all 43 notes cataloged in 4 groups\n  (Foundations / Zeros & explicit formulas / RH equivalences / RMT\n  statistics), each mapped to the track/task it feeds.\n- NGUYEN.md \u00a72: R7 row added. D-001 Part III: pointer entry.\n- Found: research/paper/Detailed_Derivations_...txt is an OLDER DRAFT\n  duplicate (54,034 vs 54,367 bytes, missing intro) of the resources\n  compendium \u2014 untracked, flagged to user for deletion (not deleted).\n- Committed as session-008 opening (e7b72ad).\n\n### Part 2 \u2014 Task 3.8 (D-037 \u2192 R-004) COMPLETE\nAssembled the explicit finite-height Li theorem. Full chain in D-037:\n1. Read inputs: D-032/D-033 (design), D-036 (constants), E-021 data,\n   Lagarias math/0404394 PDF \u00a71 (Thm 1.1, bridge (1.16)) and \u00a76\n   (Thm 6.1 proof, read in full).\n2. **Coordinate-system audit** of D-036 (variant A kernel-plane vs\n   variant B w-plane): resolved \u2014 D-036/E-021 consistent in variant B\n   (contour in the \u03b6\u2032/\u03b6 argument plane, \u03c3\u2080 = \u22125/2, trivial zero \u22122\n   inside, residue \u2264 1). No bug.\n3. **Real gap found**: D-036's uniform |\u03b6\u2032/\u03b6| bound on segment (III)\n   rests on the R-bound verified only for |t| \u2265 10; the line passes\n   within 1/2 of the trivial pole at w = \u22122. Closed by E-023 S1:\n   M\u2080 = max_{|t|\u226410} |\u03b6\u2032/\u03b6(\u22125/2+it)| = 1.3352 (grid + Lipschitz \u00d72).\n   Contribution 40\u00b7M\u2080 = 53.4 \u2014 negligible.\n4. **S_\u221e elementary lower bound derived** (new, D-037 \u00a73): from\n   Lagarias (4.11) via finite differences:\n   S_\u221e(n) = (1\u2212a\u2081)n \u2212 1 + \u03a3_{m odd\u22653} [(1\u22121/m)\u207f \u2212 1 + n/m]\n   \u27f9 S_\u221e(n) \u2265 \u00bdn log n + (C\u2081\u2212\u03b3/2)n \u2212 4 (n \u2265 20), fully explicit\n   (harmonic bounds). Validated vs E-021 exact values (E-023 V1).\n   Avoids tracing Lagarias \u00a75's O(1) lemmas entirely.\n5. Margin assembly (E-023): margin convex for n \u2265 20; crossover\n   32 871 (traced A=2/B\u2080=2) / 30 217 (measured 0.9/1.0); adopted\n   N\u2080 = 5\u00d710\u2074 (margin 67 705). Finite verification contiguous:\n   ours to 3000 (ledger #3) + Misguich\u2013Voros to 5\u00d710\u2075 (10\u00d7 overlap).\n6. Bridge: n \u2264 (T\u2080\u22121)\u00b2 from the proof's actual requirement\n   (\u221an+1 \u2264 T\u2080); Lagarias's printed (1.16) window T\u00b2/(4log\u00b2T) is\n   conservative slack \u2014 fallback N\u2081* = 2.726\u00d710\u00b2\u00b9 documented.\n\n**THEOREM (R-004, ledger #6):** \u03bb_n > 0 for all\n1 \u2264 n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 = 8 999 999 999 994 000 000 000 001 \u2248 9.0\u00d710\u00b2\u2074,\nT\u2080 = 3\u00d710\u00b9\u00b2 (Platt\u2013Trudgian). Tag [PROVED-CONDITIONAL(computational\nRH-to-T\u2080; finite verification; one numeric sub-bound)]. Criterion-3\ndeliverable; the maximal content of the Li route short of RH (Voros).\n\n### Adversarial review highlights (D-037 \u00a77)\n- P1\u2013P6 proved/elementary; H1\u2013H5 computational/heuristic, each with\n  sensitivity analysis (theorem insensitive to H2/H3 links) and upgrade\n  paths: D-039 (Binet-form digamma sub-bound proof), E-023b (acb box\n  cover for M\u2080).\n- Sanity gates pass: no claim beyond N\u2081; no D-H/Epstein analogue.\n\n### State of the plan\n- Track C (Phase 3): 3.1\u20133.8 ALL CLOSED. The Li/front-A line has\n  delivered its maximal deliverable.\n- Next per plan: 2.10 (E-022 spectral-measure numerics), 2.9-D1 (Krein\n  frame), 2.11 (D-038 transition scale). Optional: D-039, E-023b.\n\n### Handoff notes\n- E-023 script: research/numerics/scripts/E-023-finite-height-assembly.py;\n  data E-023-assembly.csv/.json; db registered (session 8).\n- Platt\u2013Trudgian exact height: \"3\u00d710\u00b9\u00b2\" per title/abstract\n  (arXiv:2004.09765); confirm exact certified height at paper write-up\n  (N\u2081 insensitive at <1% level).\n- N\u2080 could be pushed under 3000 (fully self-contained verification) only\n  with a fundamentally sharper horizontal-segment treatment (I_II/IV\n  dominate B(n) below n ~ 10\u2075: 2(e\u2074+1)\u00b77H(T), H = 3C\u2080\u00b2 ~ zero-avoidance\n  d_min); not needed for the theorem \u2014 literature bridge suffices.\n- E-021 n=10\u2074 rerun still available cheaply via caches (unchanged).\n",
  "structuredPatch": [],
  "originalFile": null
}

{
  "command": "cd /d/Python/Quantum && .venv/Scripts/python.exe -c \"import sympy, mpmath, numpy; print('sympy', sympy.__version__, '| mpmath', mpmath.__version__, '| numpy', numpy.__version__)\"",
  "description": "Check numerical stack availability in venv"
}

83M

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-001-window-constants.py",
  "content": "\"\"\"E-001 \u2014 Task 0.4: symbolic + numeric verification of window constants.\n\nR(psi) := [\u222b\u03c8\u00b2 + \u222c|u\u2212v|\u03c8(u)\u03c8(v)dudv] / (\u222b\u03c8)\u00b2   on [\u22121/2, 1/2], \u03c8 even.\n\nClaims verified (paper Lemma 5.6; hand-derived in D-004 \u00a77):\n  R(\u03c8\u2080)   = 4/3                        (\u03c8\u2080 = indicator)\n  R(\u03c8_MT) = 1/2 + (1/\u221a2)cot(1/\u221a2)      (\u03c8_MT = cos(\u221a2 s))\nand the certificates 2 \u2212 R(\u03c8), (3 \u2212 R(\u03c8))/2.\n\nOutputs: research/numerics/data/E-001-window-constants.csv (+ .json sidecar)\n\"\"\"\nimport json\nimport sys\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport mpmath as mp\nimport sympy as sp\n\nREPO = Path(__file__).resolve().parents[3]\nDATA = REPO / \"research\" / \"numerics\" / \"data\"\nDPS = 50\n\nu, v = sp.symbols(\"u v\", real=True)\nhalf = sp.Rational(1, 2)\n\n\ndef R_symbolic(psi):\n    \"\"\"Compute R(\u03c8) symbolically for even \u03c8 on [-1/2, 1/2].\"\"\"\n    num1 = sp.integrate(psi**2, (u, -half, half))\n    # \u222c|u\u2212v|\u03c8(u)\u03c8(v) = 2\u222b_{u>v}(u\u2212v)\u03c8(u)\u03c8(v)  (integrand symmetric)\n    inner = sp.integrate((u - v) * psi.subs(u, v), (v, -half, u))\n    num2 = 2 * sp.integrate(sp.simplify(psi * inner), (u, -half, half))\n    den = sp.integrate(psi, (u, -half, half)) ** 2\n    return sp.simplify((num1 + num2) / den)\n\n\ndef main() -> int:\n    mp.mp.dps = DPS\n    ok = True\n\n    psi0 = sp.Integer(1)\n    psiMT = sp.cos(sp.sqrt(2) * u)\n\n    R0 = R_symbolic(psi0)\n    RMT = R_symbolic(psiMT)\n    RMT_claim = sp.Rational(1, 2) + sp.cot(1 / sp.sqrt(2)) / sp.sqrt(2)\n\n    checks = []\n    checks.append((\"R(psi0) == 4/3\",\n                   sp.simplify(R0 - sp.Rational(4, 3)) == 0, R0))\n    checks.append((\"R(psiMT) == 1/2 + (1/sqrt2)cot(1/sqrt2)\",\n                   sp.simplify(RMT - RMT_claim) == 0, RMT))\n\n    rows = []\n    for name, R in [(\"psi0\", sp.Rational(4, 3)), (\"psiMT\", RMT_claim)]:\n        Rm = mp.mpf(sp.N(R, 60))\n        rows.append({\n            \"window\": name,\n            \"R_exact\": str(R),\n            \"R_numeric\": mp.nstr(Rm, 30),\n            \"2_minus_R\": mp.nstr(2 - Rm, 30),\n            \"distinct_(3-R)/2\": mp.nstr((3 - Rm) / 2, 30),\n        })\n\n    for label, passed, val in checks:\n        print(f\"[{'PASS' if passed else 'FAIL'}] {label}  (got {val})\")\n        ok &= passed\n\n    print(\"\\nCertificates:\")\n    for r in rows:\n        print(f\"  {r['window']:>6}: R = {r['R_numeric']}\")\n        print(f\"         2 - R = {r['2_minus_R']}   (3-R)/2 = {r['distinct_(3-R)/2']}\")\n\n    csv_path = DATA / \"E-001-window-constants.csv\"\n    json_path = DATA / \"E-001-window-constants.json\"\n    if csv_path.exists() and \"--force\" not in sys.argv:\n        print(f\"\\ncached: {csv_path} exists (use --force to recompute)\")\n        return 0 if ok else 1\n\n    with csv_path.open(\"w\", encoding=\"utf-8\", newline=\"\") as f:\n        f.write(\",\".join(rows[0].keys()) + \"\\n\")\n        for r in rows:\n            f.write(\",\".join(r.values()) + \"\\n\")\n\n    meta = {\n        \"experiment\": \"E-001\",\n        \"task\": \"0.4\",\n        \"description\": \"Symbolic+numeric verification of R(psi0)=4/3 and \"\n                       \"R(psiMT)=1/2+(1/sqrt(2))cot(1/sqrt(2)); certificates \"\n                       \"2-R and (3-R)/2\",\n        \"script\": \"research/numerics/scripts/E-001-window-constants.py\",\n        \"parameters\": {\"windows\": [\"psi0\", \"psiMT\"], \"dps\": DPS},\n        \"symbolic_checks\": {label: passed for label, passed, _ in checks},\n        \"timestamp_utc\": datetime.now(timezone.utc).isoformat(),\n        \"row_count\": len(rows),\n    }\n    json_path.write_text(json.dumps(meta, indent=2), encoding=\"utf-8\")\n    print(f\"\\nwrote {csv_path.name}, {json_path.name}\")\n    return 0 if ok else 1\n\n\nif __name__ == \"__main__\":\n    raise SystemExit(main())\n"
}

File created successfully at: D:\Python\Quantum\research\numerics\scripts\E-001-window-constants.py

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-001-window-constants.py",
  "old_string": "        \"symbolic_checks\": {label: passed for label, passed, _ in checks},",
  "new_string": "        \"symbolic_checks\": {label: bool(passed) for label, passed, _ in checks},"
}

{
  "filePath": "D:\\Python\\Quantum\\web\\dashboard\\templates\\dashboard\\script_detail.html",
  "oldString": "                {% for cell in row %}\n                  <td class=\"{% if f.table.numeric|lookup:forloop.counter0 %}num{% endif %}\">{{ cell }}</td>\n                {% endfor %}",
  "newString": "                {% for cell in row %}\n                  <td class=\"{% if cell.num %}num{% endif %}\">{{ cell.v }}</td>\n                {% endfor %}",
  "originalFile": "{% extends \"dashboard/base.html\" %}\n{% block title %}{{ item.file }}{% endblock %}\n{% block nav_scripts %}active{% endblock %}\n{% block content %}\n<h1>{{ item.file }}</h1>\n<p class=\"muted\">\n  Experiments:\n  {% for e in item.experiments %}<a href=\"/experiments/{{ e.id|urlencode }}/\">{{ e.id }}</a>{% if not forloop.last %}, {% endif %}{% empty %}none registered{% endfor %}\n  \u00b7 script updated {{ item.mtime|slice:\":10\" }}\n</p>\n\n{% for f in item.files %}\n  <section class=\"card\" id=\"csv-{{ f.idx }}\">\n    <h2><code>{{ f.name }}</code>\n      <span class=\"muted\">\u2014 {{ f.size|filesizeformat }}, updated {{ f.mtime|slice:\":10\" }}</span></h2>\n\n    {% if f.kind == \"csv\" and f.table %}\n      <div class=\"pager\">\n        {% if f.table.page > 1 %}\n          <a href=\"?csv={{ f.idx }}&page={{ f.table.page|add:\"-1\" }}#csv-{{ f.idx }}\">\u2190 prev</a>\n        {% endif %}\n        <span class=\"muted\">page {{ f.table.page }} of {{ f.table.pages }}\n          \u00b7 {{ f.table.per }}/page \u00b7 {{ f.table.total }} rows</span>\n        {% if f.table.page < f.table.pages %}\n          <a href=\"?csv={{ f.idx }}&page={{ f.table.page|add:\"1\" }}#csv-{{ f.idx }}\">next \u2192</a>\n        {% endif %}\n      </div>\n      <div class=\"sheet\">\n        <table>\n          <thead>\n            <tr><th class=\"rn\">#</th>\n              {% for h in f.table.header %}<th>{{ h }}</th>{% endfor %}</tr>\n          </thead>\n          <tbody>\n            {% for row in f.table.rows %}\n              <tr>\n                <td class=\"rn\">{{ forloop.counter0|add:f.table.first_line }}</td>\n                {% for cell in row %}\n                  <td class=\"{% if f.table.numeric|lookup:forloop.counter0 %}num{% endif %}\">{{ cell }}</td>\n                {% endfor %}\n              </tr>\n            {% endfor %}\n          </tbody>\n        </table>\n      </div>\n    {% elif f.kind == \"json\" %}\n      <details>\n        <summary>JSON sidecar (click to expand)</summary>\n        <pre class=\"json-box\">{{ f.pretty }}</pre>\n      </details>\n    {% endif %}\n  </section>\n{% empty %}\n  <p class=\"muted\">No data files registered for this script (utility/diagnostic script).</p>\n{% endfor %}\n{% endblock %}\n",
  "structuredPatch": [
    {
      "oldStart": 36,
      "oldLines": 7,
      "newStart": 36,
      "newLines": 7,
      "lines": [
        "               <tr>",
        "                 <td class=\"rn\">{{ forloop.counter0|add:f.table.first_line }}</td>",
        "                 {% for cell in row %}",
        "-                  <td class=\"{% if f.table.numeric|lookup:forloop.counter0 %}num{% endif %}\">{{ cell }}</td>",
        "+                  <td class=\"{% if cell.num %}num{% endif %}\">{{ cell.v }}</td>",
        "                 {% endfor %}",
        "               </tr>",
        "             {% endfor %}"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "questions": [
    {
      "header": "Task 0.5",
      "options": [
        {
          "description": "I run git clone into D:\\Python\\Quantum\\zeta-23-lean, check out tag v1.0, and inspect the structure + axiom audit docs.",
          "label": "Yes, clone it now"
        },
        {
          "description": "Do 0.6 (numerical sandbox: 10\u2074 zeros, finite G\u0303, empirical tr/HS/inertia checks) now; clone the Lean repo later.",
          "label": "Skip to 0.6 first"
        },
        {
          "description": "Run the session-end protocol now; do 0.5/0.6 in the next session.",
          "label": "Stop for today"
        }
      ],
      "question": "Task 0.5 needs to clone the zeta-23-lean repository from GitHub (network access). Proceed?"
    }
  ]
}

User has answered your questions: "Task 0.5 needs to clone the zeta-23-lean repository from GitHub (network access). Proceed?"="Yes, clone it now". You can now continue with the user's answers in mind.

{
  "command": "cd /d/Python/Quantum/zeta-23-lean && ls && echo \"--- toolchain ---\" && cat lean-toolchain 2>/dev/null && echo \"--- Zeta23 dir ---\" && ls Zeta23/ 2>/dev/null && echo \"--- docs ---\" && ls docs/ 2>/dev/null; ls *.md 2>/dev/null",
  "description": "Inspect zeta-23-lean repository structure"
}

  4975/5303 files, 0.0 MB sent
  5000/5303 files, 0.0 MB sent

{
  "file_path": "D:\\Python\\Quantum\\zeta-23-lean\\Zeta23\\FromPNTPlus\\Tactic\\AdditiveCombination.lean",
  "offset": 160,
  "limit": 45
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiSideBounds.lean",
    "content": "    (hTwide : \u2200 \u03c1 : \u2102, IsNontrivialZero \u03c1 \u2192 Real.sqrt (n : \u211d) - 1 < \u03c1.im \u2192\n      \u03c1.im < Real.sqrt (n : \u211d) + 2 \u2192\n        1 / (9 * C0hat (Real.sqrt (n : \u211d) + 2)) \u2264 |\u03c1.im - T|)\n    (hTn : Real.sqrt (n : \u211d) \u2264 T) (hTn1 : T \u2264 Real.sqrt (n : \u211d) + 1) :\n    \u2016HIntegral (Jlag n) (-5 / 2) 3 T\u2016 \u2264\n      (Real.exp 4 + 1) *\n        (2 * Z2hat T * Real.log (148.5 * C0hat (Real.sqrt (n : \u211d) + 2)) +\n          (3 - -5 / 2) * (10.5 * Real.log (T + 2) + 48)) := by\n  classical\n  have hnR : (100000 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n  have h10T : (10 : \u211d) \u2264 T := by\n    have h1 : (10 : \u211d) \u2264 Real.sqrt (n : \u211d) := by\n      rw [Real.le_sqrt (by norm_num) (by positivity)]\n      nlinarith [hnR]\n    linarith\n  have hT0 : (0 : \u211d) \u2264 T := by linarith\n  have hn1 : 1 \u2264 n := by omega\n  have hlen : (-5 / 2 : \u211d) \u2264 3 := by norm_num\n  have hC0 : (0 : \u211d) < C0hat (Real.sqrt (n : \u211d) + 2) := by\n    have h2 := two_le_C0hat (by nlinarith [Real.sqrt_nonneg (n : \u211d)] :\n      (1 : \u211d) \u2264 Real.sqrt (n : \u211d) + 2)\n    linarith\n  have hB0nn : (0 : \u211d) \u2264 2 * Real.log (148.5 * C0hat (Real.sqrt (n : \u211d) + 2)) := by\n    have h1 : (1 : \u211d) \u2264 148.5 * C0hat (Real.sqrt (n : \u211d) + 2) := by nlinarith [hC0]\n    have h3 := Real.log_nonneg h1\n    linarith\n  -- zero-freeness on the horizontal + the path continuity machines\n  have hzne : \u2200 \u03c3 : \u211d, riemannZeta ((\u03c3 : \u211d) + (T : \u211d) * Complex.I) \u2260 0 :=\n    fun \u03c3 => zeta_ne_zero_horizontal hTwide hn1 hTn hTn1\n  have hne1 : \u2200 \u03c3 : \u211d, ((\u03c3 : \u211d) + (T : \u211d) * Complex.I) \u2260 1 := by",
    "numLines": 30,
    "startLine": 770,
    "totalLines": 1175
  }
}

{
  "file_path": "C:\\Users\\lucky\\AppData\\Local\\Temp\\nguyen\\ff74d795-3344-493a-8c08-dc1bd8e633e1\\tasks\\besuw09fx.output"
}

File does not exist. Note: your current working directory is D:\Python\Quantum.

File does not exist. Note: your current working directory is D:\Python\Quantum.

{
  "command": "cd /d/Python/Quantum && wc -l research/numerics/data/E-002-zeros-first-10000.csv 2>/dev/null; tail -2 research/numerics/data/E-002-zeros-first-10000.csv 2>/dev/null",
  "description": "Check partial E-002 CSV progress"
}

Shell command failed
Traceback (most recent call last):
  File "<string>", line 14, in <module>
    print(repr(html[s:m.end()+40])); print('---')
    ~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "C:\Users\lucky\AppData\Local\Programs\Python\Python314\Lib\encodings\cp1252.py", line 19, in encode
    return codecs.charmap_encode(input,self.errors,encoding_table)[0]
           ~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
UnicodeEncodeError: 'charmap' codec can't encode character '\u2082' in position 45: character maps to <undefined>
Exit code 1

Shell command failed
Traceback (most recent call last):
  File "<string>", line 14, in <module>
    print(repr(html[s:m.end()+40])); print('---')
    ~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "C:\Users\lucky\AppData\Local\Programs\Python\Python314\Lib\encodings\cp1252.py", line 19, in encode
    return codecs.charmap_encode(input,self.errors,encoding_table)[0]
           ~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
UnicodeEncodeError: 'charmap' codec can't encode character '\u2082' in position 45: character maps to <undefined>
Exit code 1

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-003-finite-Gtilde.py",
  "old_string": "    U = pad * L  # total padded window\n    full = np.zeros(pad * M)\n    full[: M // 2] = phi[M // 2:]          # u in [0, L/2)\n    full[-M // 2:] = phi[: M // 2]         # u in [\u2212L/2, 0)\n    F = np.fft.fft(full) * du              # \u03d5\u0302 at \u03be_m = 2\u03c0m/U (phase: u\u2080=\u2212L/2 handled by shift)\n    # correct phase: our samples start at u = \u2212L/2 \u27f9 multiply by e^{+i\u03be L/2}... but\n    # we placed phi at DFT positions for u\u2208[0,U); u=\u2212L/2..0 mapped to end.\n    # With the placement above, F[m] \u2248 \u03d5\u0302(\u03be_m) directly (periodic extension).\n    m = np.arange(pad * M)\n    xi = 2 * np.pi * m / U\n    xi_signed = np.where(xi <= np.pi * pad * M / U * 0 + np.pi * M * pad / U / 2,\n                         xi, xi - 2 * np.pi * pad * M / U * 1.0)\n    # simpler: signed frequencies\n    xi_signed = 2 * np.pi * np.fft.fftfreq(pad * M, d=du)\n    order = np.argsort(xi_signed)\n    spline = CubicSpline(xi_signed[order], F[order])\n    return spline, a",
  "new_string": "    # Zero-pad to pad*M samples, rotating so index 0 \u2194 u=0 (DFT convention);\n    # then FFT[m]\u00b7du = \u03d5\u0302(\u03be_m) directly on the signed grid fftfreq.\n    full = np.zeros(pad * M)\n    full[: M // 2] = phi[M // 2:]          # u in [0, L/2)\n    full[-M // 2:] = phi[: M // 2]         # u in [\u2212L/2, 0)\n    F = np.fft.fft(full) * du\n    xi_signed = 2 * np.pi * np.fft.fftfreq(pad * M, d=du)\n    order = np.argsort(xi_signed)\n    spline = CubicSpline(xi_signed[order], F[order])\n    return spline, a"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\paper\\paperA.tex",
  "oldString": "\\cite{lagarias2007li} with Rosser's explicit $S(T)$ bound\n\\cite{rosser1941}, an elementary archimedean lower bound, a proved\nmargin convexity, the dog-leg repair of Section~\\ref{subsec:dogleg},",
  "newString": "\\cite{lagarias2007li} with Rosser's explicit Riemann--von Mangoldt\nerror bound \\cite[Thm~19]{rosser1941}, an elementary archimedean\nlower bound, a proved\nmargin convexity, the dog-leg repair of Section~\\ref{subsec:dogleg},",
  "originalFile": "% ============================================================\n% NGUYEN-RH-1 \u2014 PAPER A (split 2026-08-20, session 013, from draft.tex)\n% An explicit finite-height Li-positivity theorem, machine-verified.\n% Self-contained artifact per the session-012-end-notes review:\n% \u00a73.1 + Appendices A.1/B of the combined draft, retargeted.\n% The spectral-line material lives in paperB.tex (in preparation).\n% ============================================================\n\\documentclass[11pt]{article}\n\\usepackage{amsmath,amssymb,amsthm,mathtools}\n\\usepackage{microtype}\n\\usepackage[colorlinks=true,linkcolor=blue,citecolor=blue]{hyperref}\n\n% The prose is dense with unhyphenatable compounds (Li-positivity,\n% [proved, ...] tags). Give TeX room to spread the slack instead of\n% running past the right margin.\n\\emergencystretch=2em\n\n\\newtheorem{theorem}{Theorem}\n\\newtheorem{lemma}[theorem]{Lemma}\n\\newtheorem{corollary}[theorem]{Corollary}\n\\theoremstyle{definition}\n\\newtheorem{definition}[theorem]{Definition}\n\\theoremstyle{remark}\n\\newtheorem{remark}[theorem]{Remark}\n\n\\title{An explicit finite-height Li-positivity theorem\\\\\nwith a machine-verified assembly\\thanks{This work was produced with\nsubstantial machine assistance; see the AI Contribution Statement.}}\n\\author{Dan T Nguyen\\thanks{Independent researcher}}\n\\date{Started: 2026-08-17; revised 2026-08-26}\n\n\\begin{document}\n\\maketitle\n\n\\begin{abstract}\n[proved, conditional on computation] The Keiper--Li coefficients of the\nRiemann $\\xi$-function satisfy $\\lambda_n > 0$ for all\n$1 \\le n \\le (T_0-1)^2 \\approx 9\\times10^{24}$, conditional on the\ninterval-arithmetic verification of RH to height $T_0 = 3\\times10^{12}$\n(Platt--Trudgian) and on finite Li-coefficient computations\n(Johansson's rigorous table to $10^5$ and this project's to $3000$),\nwith every constant traced. We have found no previous explicit assembly\nof this chain in the literature; by Voros's sharpening, positivity of\nall sufficiently large $\\lambda_n$ would itself imply RH, so no result\nshort of RH can assert an infinite positive tail. Moreover the full\nreduction is machine-verified in Lean~4 (package \\texttt{NguyenRH1}):\nthe theorem is proved from exactly seven explicit perimeter inputs,\nitemized with provenance in Appendix~B --- three explicit\nzero-counting bounds derived from Rosser's Riemann--von Mangoldt\nerror bound and four\ncomputational certificates\n(the Platt--Trudgian RH verification, Johansson's rigorous Li table,\na zero-location certificate for the low zeros, and one short-segment\ninterval constant) --- with the traced contour bound\n$|S_f(n)| \\le B(n)$ on $10^5 \\le n \\le (T_0-1)^2$ itself machine-proved\nfrom six of the seven (all but the Li table), and with axiom profile\nexactly the three standard\naxioms (\\texttt{propext}, \\texttt{Classical.choice},\n\\texttt{Quot.sound}) and no \\texttt{sorry} anywhere in the\ndevelopment's Li chain.\n\\end{abstract}\n\n\\section{Introduction}\n\nThe Riemann hypothesis (RH) asserts that every nontrivial zero of\n$\\zeta(s)$ has real part $1/2$. The strongest unconditional density\nresult to date is the (machine-verified) theorem that at least $2/3$\nof the nontrivial zeros are simple and on the critical line, and at\nleast $5/6$ of the zeros in a given range are distinct\n\\cite{anthropic2026riemann}; the underlying certificate method has a\ndocumented bandwidth-one ceiling near $0.682$ of the zeros. Two\nclassical reformulations frame most modern attacks: \\emph{Weil\npositivity} --- positivity of the Weil quadratic form on all of\n$C_c^2(\\mathbb R)$ is equivalent to RH \\cite{weil1952fonctions,\nbombieri2000weil}, and the negative index of its truncations counts\noff-line zero pairs \\cite{bombieri2000weil} --- and \\emph{Li's\ncriterion} --- $\\lambda_n > 0$ for all $n$ is equivalent to RH\n\\cite{li1997, bombieri1999lagarias}, with Voros's sharpening that\npositivity of any tail $\\{\\lambda_n\\}_{n \\ge N_0}$ already implies RH\n\\cite{voros2006sharpenings}.\n\nThis paper reports one theorem-level outcome of a systematic research\nprogram on RH: an explicit finite-height Li-positivity theorem,\nassembled with every constant traced, and with its full reduction ---\nincluding the contour estimate --- machine-verified in Lean~4 modulo a\ndeclared perimeter (computational certificates and explicit\nzero-counting bounds). A companion note (in preparation)\ncovers the spectral-line results of the same program (an exact\nfactorization on Suzuki's operator line and a valley theorem for the\nassociated model spaces). Every claim carries an explicit correctness\ntag, and every numerical input is produced by a deterministic,\narchived script.\n\n\\begin{theorem}[R-004; conditional on computation]\n\\label{thm:finite-height-li-intro}\nAssume (i) the Riemann hypothesis verified to height\n$T_0 = 3\\times 10^{12}$ (Platt--Trudgian \\cite{platt2021riemann},\ninterval arithmetic), and (ii) $\\lambda_n > 0$ for all $n \\le 10^5$\n(finite computation; Section~3, Step~5). Then the Keiper--Li\ncoefficients satisfy\n$\\lambda_n > 0$ for all $1 \\le n \\le (T_0-1)^2 \\approx 9\\times10^{24}$.\n\\end{theorem}\n\nBy Voros's sharpening, eventual positivity of all sufficiently large\n$\\lambda_n$ would itself imply RH, so a result short of RH cannot\nassert an infinite positive tail; an explicit finite-height statement\nis the natural form of partial progress on this route. The statement\nhas an unpublished precursor: Voros \\cite{voros2017li} reports an\nunpublished result of Oesterl\u00e9 \\cite{oesterle2000} that RH to height\n$T_0$ implies $\\lambda_n \\ge 0$ for $n \\le T_0^2$ (the typescript is\nuncirculated; we rely on Voros's citation and have not independently\nverified it). A published weaker form is Lagarias's window with a\n$\\log^2$ denominator (Remark~(i)). The novelty claimed here is not the\n$T^2$ scale itself but the explicit, fully constant-traced,\n\\emph{strict}-positivity assembly --- Lagarias's contour argument\n\\cite{lagarias2007li} with Rosser's explicit $S(T)$ bound\n\\cite{rosser1941}, an elementary archimedean lower bound, a proved\nmargin convexity, the dog-leg repair of Section~\\ref{subsec:dogleg},\nand the finite verifications --- and its machine verification; that\nassembly we have found nowhere else in the literature.\n\nSection~2 recalls the certificate-method background and the sanity\ngate. Section~3 states and proves the theorem. Section~4 collects the\nobstruction analysis delimiting the method. Appendix~A describes the\nnumerical machinery; Appendix~B the formal-verification status.\n\n\\section{Background: the Weil-form certificate method}\n\nWe recall, in one paragraph, the machinery behind the state-of-the-art\ndensity theorem \\cite{anthropic2026riemann} --- the launchpad of this\nproject and the sanity gate for everything below; details follow that\npaper, and a companion note (in preparation) covers this project's own\nwork on that line. The Weil explicit formula \\cite{weil1952fonctions}\nexpresses, for a bandwidth-one test function, a quadratic form on the\nzeros as a functional of the primes; compressing it via a Gabor frame\nat the critical density yields a finite matrix identity\n$\\tilde G = P + Q$, with the prime side computed unconditionally from\nMontgomery's second moment \\cite{montgomery1973pair}. A rank--trace\ninequality converts that input into a lower bound on the number of\nsimple on-line zeros in a window, whose strength is governed by a\nwindow ratio $R(\\psi)$: $2 - R(\\psi)$ certifies $0.6725$ of zeros\nsimple and on the line and $0.83625$ distinct, and a sharpness analysis\nlocates the bandwidth-one ceiling of the method at $\\approx 0.682$ with\nstructural obstructions beyond (Section~4). One feature of this\nmachinery matters here: the certificate fails, as it must, for the\nDavenport--Heilbronn and Epstein zeta functions (which violate the\nRH-analogue); the main theorem of this paper has been required to pass\nthis gate structurally (project file D-053).\n\n\\section{The finite-height Li theorem (R-004)}\n\nLet $\\lambda_n = \\sum_{\\rho}{}'\\,\\bigl[1-\\bigl(1-\\tfrac1\\rho\\bigr)^n\\bigr]$\nbe the Keiper--Li coefficients of the Riemann $\\xi$-function. Li's\ncriterion states $\\lambda_n > 0$ for all $n \\geq 1$ if and only if the\nRiemann hypothesis holds \\cite{li1997,bombieri1999lagarias}. Voros\n\\cite{voros2006sharpenings} showed that ``$\\lambda_n > 0$ for all\n$n \\geq N_0$'' is already equivalent to RH for any $N_0$: eventual\npositivity of all sufficiently large $\\lambda_n$ would itself imply RH,\nso a result short of RH cannot assert an infinite positive tail. The\nnatural partial statement on this route is an \\emph{explicit\nfinite-height} one.\n\n\\begin{theorem}[R-004; conditional on computation]\n\\label{thm:finite-height-li}\nAssume (i) the Riemann hypothesis verified to height\n$T_0 = 3\\times 10^{12}$ (Platt--Trudgian \\cite{platt2021riemann},\ninterval arithmetic), and (ii) $\\lambda_n > 0$ for all $n \\le 10^5$\n(finite computation; Step~5). Then\n\\[\n\\lambda_n > 0 \\qquad \\text{for all } 1 \\le n \\le N_1 := (T_0-1)^2\n\\approx 9.0\\times 10^{24},\n\\]\nwith $N_1 = 8\\,999\\,999\\,999\\,994\\,000\\,000\\,000\\,001$ exactly.\n\\end{theorem}\n\nThe two assumptions displayed are the two computational certificates.\nThe formal theorem consumes five further explicit perimeter inputs ---\nzero-counting bounds, a zero-location certificate, and one interval\nconstant --- which are established published results or stand-alone\ncertificates, instantiated with provenance in Appendix~B; they enter as\nhypotheses of the Lean reduction, not as additional conjectural\nassumptions.\n\n\\begin{proof}[Proof sketch (full assembly: D-037)]\nBombieri--Lagarias \\cite{bombieri1999lagarias} give\n$\\lambda_n = S_\\infty(n) - S_f(n) + 1$ with $S_\\infty$ the archimedean\nand $S_f$ the finite-place contribution.\n\n\\emph{Step 1 (archimedean lower bound).} From Lagarias's formula\n\\cite[(4.11)]{lagarias2007li},\n$S_\\infty(n) = \\sum_{j=1}^n (-1)^j \\binom{n}{j} a_j$ with\n$a_1 = (\\log 4\\pi + \\gamma)/2$ and $a_j = (1-2^{-j})\\zeta(j)\n= \\sum_{m \\text{ odd}} m^{-j}$ ($j \\ge 2$), the $j$-sum is a finite\ndifference and one obtains the \\emph{exact} identity\n$S_\\infty(n) = (1-a_1)n - 1 + \\sum_{m \\ge 3,\\, m \\text{ odd}}\n\\bigl[(1-\\tfrac1m)^n - 1 + \\tfrac{n}{m}\\bigr]$.\nBernoulli's inequality and the explicit harmonic bounds\n$\\log M + \\gamma + \\tfrac{1}{2M} - \\tfrac{1}{12M^2} \\le H_M \\le\n\\log M + \\gamma + \\tfrac{1}{2M}$ give, for $n \\ge 20$,\n\\[\nS_\\infty(n) \\;\\ge\\; \\tfrac12 n\\log n + (C_1 - \\tfrac{\\gamma}{2})\\,n - 4,\n\\qquad C_1 = \\tfrac{\\gamma - 1 - \\log 2\\pi}{2}.\n\\]\n(Machine-validated against exact values for $20 \\le n \\le 5000$.)\n\n\\emph{Step 2 (finite-part upper bound).} Tracing Lagarias's contour\nargument \\cite[Thm~6.1]{lagarias2007li} with explicit constants\n(the Riemann--von Mangoldt formula $N(T) = F(T) + S(T)$ with Rosser's\nexplicit bound $|S(T)| \\le 0.137\\log T + 0.443\\log\\log T + 1.588$,\n$T \\ge 1467$ \\cite{rosser1941}, and the finite-range verifications\n$|S(T)| \\le 1$ for $T \\le 280$ and $|S(T)| \\le 2$ for\n$T \\le 6.8\\times10^6$ \\cite[Eq.~(1.2)]{trudgian2014ii}, partial\nfractions for $\\zeta'/\\zeta$ with the reference-point estimate\n$|R(s)| \\le 10.5\\log(|t|{+}2) + 48$ for $-5/2 \\le \\sigma \\le 3$,\n$|t| \\ge 10$ (D-056), kernel bounds $e^4+1$, a measured\nshort-segment constant $M_0 = 1.3352$) gives\n$|S_f(n)| \\le B(n)$ with\n\\[\n\\begin{split}\nB(n) =\\;& 4F(T_n) + 4T_n\\bigl[\\tfrac23 Z_2(T_n) + 10.5\\log(T_n{+}2) + 48\\bigr] \\\\\n& + 40M_0 + 2(e^4{+}1)\\,7H(T_n) + 2\\,\\mathrm{DL}(n) + I_{\\mathrm{Maj}}(n) + 1.\n\\end{split}\n\\]\nHere $T_n := \\sqrt n + 1$ is a deterministic majorant height: the\ncontour itself runs at a zero-avoiding height $\\tau_n \\in [\\sqrt n,\n\\sqrt n + 1]$, chosen by a pigeonhole on the unit-window zero count\nwith ordinate clearance $\\ge 1/(9C_0(\\sqrt n + 2))$\n(\\texttt{exists\\_zero\\_avoiding\\_T\\_wide}), and every majorant, being\nnondecreasing in the height, is evaluated at $T_n$. Further, $F$ is the\nhonest zero-count majorant (the formal\ndevelopment's mildly enlarged $F + S_b$ shape), $Z_2(t)$ the explicit\ntwo-unit-interval zero count (including the $\\log\\log$ term),\n$H(T) = 3C_0(T)^2 + 10.5\\log(T{+}2) + 48$ with $C_0$ the unit-interval\ncount, $\\mathrm{DL}(n) = \\tfrac{\\sqrt n+1}{4}(e^{5/2}+1) + 8.38 +\n\\tfrac14 I_{\\mathrm{Maj}}(n)$ the zero-free dog-leg charge for the\nright tail, $I_{\\mathrm{Maj}}(n) = 2(\\sqrt n+1)(e^{\\sqrt n/2}+1)\\cdot\n0.57\\cdot 2^{-(2\\sqrt n-2)}$ the right-vertical majorant, and the\nfinal $1$ the trivial-zero contribution.\\footnote{\\emph{Correction\nnote} (D-071 with E-034): three further adjustments to this $B(n)$\naccount were made during the machine closure of Step 2, and the\ndisplayed formula is the corrected one; the theorem statement is\nunaffected. (i) The bridge is $4F$, not $2N$: the residue sum runs\nover both signs of $\\gamma$ (a factor-2 accounting slip in the first\ntracing). (ii) The left-vertical near-sum charges the two-unit count\n$Z_2$ (its window $|\\gamma - T| \\le 1$ spans two unit intervals), not\nthe unit-interval $C_0$. (iii) The right-vertical kernel is charged\nhonestly as $e^{1/3} I_{\\mathrm{Maj}}(n)$ (the uniform bound is\n$e^{\\sqrt n/2+1/3}+1$), the factor $e^{1/3} \\le 1.4$ being absorbed by\nthe $2\\pi$ normalization of the residue theorem. The fourth and most\nsubstantive correction --- the repair of the right-horizontal estimate\n--- is Section~\\ref{subsec:dogleg}. All are machine-verified in\n\\texttt{NguyenRH1}.}\n\n\\emph{Step 3 (bridge).} For $n \\le (T_0-1)^2$ we have\n$\\tau_n \\le \\sqrt n + 1 \\le T_0$, so by assumption~(i) every zero with\n$|\\gamma| \\le \\tau_n$ is on the line; hence\n$|1-(1-1/\\rho)^n| \\le 2$ per zero and\n$|\\lambda_n(\\tau_n)| \\le 4F(T_n)$ (the residue sum runs over both signs\nof $\\gamma$, the count majorized at $T_n$); all other contour terms are\n\\emph{unconditional}.\n\n\\emph{Step 4 (margin).}\n$\\mathrm{margin}(n) := \\tfrac12 n\\log n + (C_1 - \\gamma/2)n - 4 - B(n) + 1$\nis convex for $n \\ge 20$ (proved: chain-rule reduction to eleven\none-variable sign conditions, each discharged elementarily \u2014 D-057),\nand $\\mathrm{margin}(8\\times 10^4) = 13\\,160 > 0$ with\n$\\mathrm{margin}(10^5) = 88\\,911 > \\mathrm{margin}(8\\times 10^4)$; by convexity\n(secant slopes increase) hence\n$\\mathrm{margin}(n) > 0$ for all $n \\in [10^5, N_1]$\\footnote{The\nmargin value at $8\\times10^4$ has a documented trail: $16\\,020$ with\nthe $F + S_b$ zero-count majorant (E-028); $15\\,764$ with the\nmildly enlarged majorant --- a\nnegative-weight term of $F + S_b$ dropped so that every convexity\nblock has provably negative $\\psi$ (the true majorant's $\\psi$ crosses\nzero near $T \\approx 16$), at a traced cost of $\\approx 0.9\\sqrt n$;\n$14\\,682$ after the honest-$B(n)$ corrections (i)--(ii) of the Step-2\nfootnote (the $4F$ bridge and the two-unit count $Z_2$); and\n$13\\,160$ after the dog-leg repair of Section~\\ref{subsec:dogleg}\n(E-034). The machine discharge consumes certified rational interval\nbounds instead: $B(8{\\cdot}10^4) \\le 332\\,000$ and\n$S_\\infty(8{\\cdot}10^4) \\ge 336\\,000$, i.e.\\\n$\\mathrm{margin}(8\\times10^4) \\ge 4\\,001$, together with the direct\ncomparison $\\mathrm{margin}(10^5) > \\mathrm{margin}(8\\times10^4)$\n(\\texttt{NguyenRH1}, \\texttt{marginTilde\\_FAlt\\_80000\\_pos},\n\\texttt{marginTilde\\_FAlt\\_80000\\_lt\\_100000}).}\n(also computed to $n = 4\\times10^5$ on a unit grid and to $N_1$ on a\nlogarithmic grid; $\\mathrm{margin}(N_1) = 2.458\\times 10^{26}$).\n\n\\emph{Step 5 (finite verification; the declared certificate\n\\texttt{LiVerifiedUpTo($10^5$)}).} The base range $n < 10^5$ is covered\nby rigorous high-precision computation of the ordinary Keiper--Li\ncoefficients. A normalization remark is required here. Johansson\n\\cite{johansson2015} tabulates the \\emph{Keiper} normalization,\ndefined by\n\\[\n\\log\\xi\\!\\left(\\frac1{1-x}\\right)\n= -\\log 2 + \\sum_{n \\ge 1} \\Lambda_n x^n,\n\\]\nwhich differs from the Li normalization $\\lambda_n$ used in this paper\nby the positive factor\n\\[\n\\lambda_n = n\\,\\Lambda_n \\qquad (n \\ge 1)\n\\]\n(equate coefficients in $x\\,\\frac{d}{dx}\\log\\xi(1/(1-x))$ and use the\nsymmetry $\\rho \\leftrightarrow 1-\\rho$ of the zero set), so positivity\nis identical in the two conventions. Johansson's table\n(interval-arithmetic error bounds throughout) gives\n$\\Lambda_1, \\dots, \\Lambda_{100000}$ all positive, matching the\nRH-true asymptotic, with $\\Lambda_{100000} = 4.6258\\ldots$ certified\nto $\\sim 2900$ digits --- i.e.\\ $\\lambda_{100000} =\n10^5\\,\\Lambda_{100000} \\approx 462\\,580.78$ in the present\nnormalization. Independently, this project verifies $\\lambda_n > 0$\nfor all $n \\le 3000$ in the Li normalization (two methods --- the\narithmetic side via Bombieri--Lagarias\nThm~2 and the zero side --- agreeing to $4.8\\times10^{-25}$ relative,\nand $\\lambda_1$ agreeing with its closed form to better than $10^{-28}$\nrelative). The crossover $N_0 = 8\\times 10^4$ is covered by a factor\n$1.25$.\\footnote{An earlier draft cited Voros's discretized Keiper--Li\ncomputations \\cite{voros2017li} (with Misguich) for this range; those\nconcern a \\emph{deformed} sequence $\\Lambda_n$, not the ordinary\n$\\lambda_n$, and the citation has been replaced by Johansson's rigorous\nordinary-$\\lambda_n$ table.}\n\\end{proof}\n\n\\subsection{Repair of the right-horizontal estimate}\n\\label{subsec:dogleg}\n\nThe geometric-decrease conclusion following\n\\cite[(6.12)]{lagarias2007li} is not implied by the displayed bounds\nwhen $T \\asymp \\sqrt n$: the per-step majorant ratio there is $e/2 > 1$\n(the zeta factor halves per unit step while the kernel ratio is $\\le e$),\nso the right-tail envelope grows like $e^{0.066\\sqrt n}$ rather than\ndecreasing ($\\sim 6\\times 10^{10}$ at $n = 10^5$ measured; E-031). In\nthe zeta specialization we replace this step by the following zero-free\ncontour deformation (D-073/D-074).\n\nKeep the residue cut at the actual contour height\n$\\tau_n \\in [\\sqrt n, \\sqrt n + 1]$ (so the bridge and the endpoint\n$N_1 = (T_0-1)^2$ are untouched) and deform only the right horizontal\nsegment $[3, 2\\sqrt n]$ at height $\\tau_n$ into a \\emph{dog-leg}: lift\nvertically from $3 + i\\tau_n$ to $3 + iU_n$ with\n$U_n := \\tfrac32\\,\\tau_n$ (the\nleft vertical), traverse horizontally at height $U_n$ (the high\nsegment), and drop back at $2\\sqrt n$ (the right vertical). The\nrectangle this traverses lies entirely in $\\Re w \\ge 3$, where $\\zeta$\nis zero-free and pole-free \\emph{unconditionally}, so Cauchy's theorem\ngives the exact identity\n\\[\nH_{\\mathrm{low}} \\;=\\; H_{\\mathrm{high}} - V_{\\mathrm{right}} +\n  V_{\\mathrm{left}}\n\\]\n(\\texttt{upper\\_right\\_horizontal\\_eq\\_dogleg} in the formal\ndevelopment). Each dog-leg piece has an honest bound, charged at the\nmajorant height $T_n$: the left vertical has length\n$\\tau_n/2 \\le (\\sqrt n + 1)/2$ and\ncontributes $\\le \\tfrac{\\sqrt n + 1}{4}(e^{5/2}+1)$; the high\nsegment contracts geometrically (the repaired stepping ratio\n$q = e^{4/9}/2 < 1$, certified) and contributes $\\le 8.38$; and the\nright vertical is exponentially small, $\\le \\tfrac14 I_{\\mathrm{Maj}}(n)$.\nThe charge replacing the broken ``$3.3$'' is therefore\n$\\mathrm{DL}(n) = \\tfrac{\\sqrt n + 1}{4}(e^{5/2}+1) + 8.38 +\n\\tfrac14 I_{\\mathrm{Maj}}(n)$ per side, with the margin essentially\nunchanged (margins $13\\,160$ / $88\\,911$ / $2.458\\times10^{26}$ at\n$8\\times10^4$ / $10^5$ / $N_1$). We record for completeness that the\nper-side bound at $T = \\sqrt n$ appears to hold empirically by a strong\nhidden cancellation (E-032: true-integral to envelope ratio down to\n$5.6\\times10^{-10}$); whether that cancellation admits a proof is an\nopen question we do not rely on.\n\n\\begin{remark}\n(i) Using Lagarias's printed bridge window $n \\le T^2/(4\\log^2 T)$\ninstead of the traced proof gives the conservative\n$N_1^* = 2.73\\times 10^{21}$; the theorem is robust either way.\n(ii) The traced worst-case bound $|S_f|$ is $\\sim 170\\times$ loose\nagainst the measured curve ($|S_f| \\le 13.52$ for $n \\le 5000$); the\nslack is structural to contour constants, not a gap.\n(iii) The dependence on computation is explicit and checkable:\nPlatt--Trudgian's interval-arithmetic verification of RH\n\\cite{platt2021riemann} and Johansson's rigorous ordinary-$\\lambda_n$\ntable \\cite{johansson2015}, supplemented by this project's independent\nverification to $n \\le 3000$ (E-011/E-015).\n\\end{remark}\n\n\\section{Obstruction analysis}\n% Documented dead ends from research/graveyard/ where they\n% delimit the method (contributes to success criterion 4).\n\nThe following routes are closed with documented obstructions\n(full files in the project archive: graveyard G-001--G-003;\nderivations D-009--D-031):\n\\begin{itemize}\n\\item \\emph{Certificate extension past $2/3$ in the bandwidth-one\nframework} (Track A): a six-wall map (D-013) shows $>2/3$ is\nimpossible within the current data class; the window-class optimum is\nsaturated in both the $\\xi$ and $\\xi'$ worlds (D-009, D-030), and\nmoment-ladder certificates cap below $2/3$ at every order (G-002).\n\\item \\emph{Multiple-zero bounds as chain input} (G-001): the\n$s_2/p$ substitution symmetry makes depth$\\to$0 off-line pairs\nindistinguishable from double zeros in all two-moment data.\n\\item \\emph{Density theorems $\\to$ de~Bruijn--Newman $\\Lambda$}\n(G-003): one-sided information \u2014 density theorems lower-bound the\non-line fraction while $\\Lambda$ requires an upper bound on the\ncomplex fraction.\n\\item \\emph{$\\xi^{(k)}$-certificate routes} (T4/T4b, D-022, D-031):\nthe strength mechanism (a perfect-square node in the diagonal law)\ndoes not transfer to $\\xi$, and the $s_2/p$ symmetry caps every\nderivative class below $100\\%$.\n\\end{itemize}\n\n\\appendix\n\\section{Numerical experiments}\n% Tables/figures generated from research/numerics/data/ CSVs.\n\nAll experiments are deterministic scripts with CSV+JSON sidecars in the\nproject archive (\\texttt{research/numerics/}); checks as stated.\n\n\\subsection{Li-coefficient machinery (E-011/E-015/E-021/E-023)}\n\\begin{itemize}\n\\item $\\lambda_n > 0$ verified for $n \\le 3000$ in the Li normalization\nof Section~3 from the arithmetic\nside (Bombieri--Lagarias Thm~2, zero-free; \\textsc{flint} Stieltjes +\nArb $\\zeta$, 1000--1450-digit working precision), cross-validated\nagainst the zero-side computation (agreement $4.8\\times10^{-25}$\nrelative) and $\\lambda_1$ agreeing with its closed form to better\nthan $10^{-28}$ relative.\n\\item Exact archimedean part: $S_\\infty(n) = \\tfrac12 n\\log n + C_1 n\n- \\tfrac14 - \\tfrac{1}{24n} + o(1/n)$ measured to $n = 5000$\n($c_0 = -1/4$ identified exactly; residuals match $-1/4 - 1/(24n)$ to\nall printed digits), and $|S_f(n)| \\le 13.52$ for $n \\le 5000$\n(max at $n = 3298$) vs the traced worst-case $\\sim 2280$ there \u2014\nthe contour constants are $\\sim 170\\times$ loose, as documented.\n\\item Margin assembly (E-028, fully traced constants $A = 10.5$,\n$B_0 = 48$): crossover at $n = 75\\,451$; adopted $N_0 = 8\\times10^4$\nwith margin $16\\,020$ and positive derivative ($13\\,160$ with the\nfinal formal-development majorant --- Step-4 footnote); convexity proved\n(D-057) and grid-confirmed to $N_1 \\approx 9\\times10^{24}$;\n$\\mathrm{margin}(N_1) = 2.458\\times10^{26}$. (First-estimate\nconstants $2/2$: crossover $32\\,871$; measured $0.9/1.0$: $30\\,217$.)\n\\end{itemize}\n\n\\section{Formal verification}\n\nThe inherited density theorem \\cite{anthropic2026riemann} is formally\nverified in Lean~4 (repository \\texttt{zeta-23-lean}, tag v1.0); this\nproject performed a full \\texttt{lake} rebuild (9010 jobs) and a live\n\\texttt{\\#print axioms} audit of all comparator statements, confirming\nthe published axiom profile verbatim: no axioms beyond \\texttt{propext},\n\\texttt{Classical.choice}, and \\texttt{Quot.sound}, with \\texttt{sorry}\noccurring only in the trusted challenge-statement stubs.\n\nThe new result of this paper is formalized in the companion\npackage \\texttt{NguyenRH1} (same toolchain, path-linked to the vendored\n\\texttt{zeta-23-lean} and its \\textsc{Mathlib} build; no new axioms are\nintroduced anywhere). The first tier is complete: the archimedean lower\nbound for $S_\\infty(n)$ and the margin convexity are machine-proved\n(\\texttt{sInfty\\_lower\\_bound}, \\texttt{marginTilde\\_convex}, and the\nchain-rule identity \\texttt{chain\\_rule\\_sqrt\\_shift}), each with axiom\nprofile exactly the three standard axioms above. A design note on the\nconvexity proof: the pen-and-paper argument uses eleven one-variable\nsign conditions, but the Lean development proves an eight-block\n$\\psi$-table plus a separate analytic bound for the $I_I$ term\n($\\widetilde B_4$); the divergence from the eleven-row table is that\n$\\widetilde B_4$ is not concave, so it is excluded from the $\\psi$\nmachinery and bounded directly. That direct bound is itself a worked\nexample of this project's measured-to-traced conversion: the grid\ncheck of E-029 (maximum $2n\\,|\\widetilde B_4''(n)| = 0.189$ on\n$[20, 10^4]$, with the decay argument covering the tail) is superseded\nby a fully analytic factor-monotonicity proof of the sufficient\ninequality $\\widetilde\\psi''(s) - \\widetilde\\psi'(s)/s \\le 1.316 < 2$\nfor $s \\ge \\sqrt{20}$, i.e.\\ $\\widetilde B_4''(n) < 1/(2n)$ for all\n$n \\ge 20$ (\\texttt{iimaj\\_bracket\\_bound},\n\\texttt{IIMaj\\_deriv2\\_lt}).\n\nThe second tier is complete; the named analytic hypothesis is\ndischarged. The traced contour bound $|S_f(n)| \\le B(n)$ of Section~3\n(\\texttt{SfBoundProp}) is machine-proved (tier ii$'$), so the closed\nheadline theorem is machine-proved from exactly seven named hypotheses.\nIts final signature, copied verbatim from the development\n(\\texttt{LiClosed.lean}), is\n\\begin{quote}\\ttfamily\\upshape\\small\ntheorem lambda\\_pos\\_finite\\_height\\_closed\\\\\n\\hspace*{2em}(hRH : RHUpTo (3 * 10 \\^{} 12))\\\\\n\\hspace*{2em}(hfinite : LiVerifiedUpTo (10 \\^{} 5))\\\\\n\\hspace*{2em}(hZC : ZeroCountProp) (hZC2 : ZeroCountProp2)\\\\\n\\hspace*{2em}(hZCG : ZeroCountGlobalProp) (hNLZ : NoLowZeros)\\\\\n\\hspace*{2em}(hMZ : MZeroProp) :\\\\\n\\hspace*{2em}$\\forall$ n : $\\mathbb{N}$, 1 $\\leq$ n $\\to$ (n : $\\mathbb{R}$) $\\leq$ (3 * 10 \\^{} 12 $-$ 1) \\^{} 2 $\\to$\\\\\n\\hspace*{2em}0 $<$ (liCoeff n).re\n\\end{quote}\nAll seven hypotheses are trusted inputs --- assumed in the development,\nnot proved within it; every other step of the proof is machine-checked.\nTheir provenance is itemized in the following table.\n\\begin{center}\\scriptsize\n\\setlength{\\tabcolsep}{3pt}\n\\begin{tabular}{@{}l p{3.9cm} p{2.7cm} p{2.5cm}@{}}\n\\hline\nHypothesis & Statement & Source & Status \\\\\n\\hline\n\\texttt{RHUpTo} & $\\operatorname{Re}\\rho = 1/2$ for all zeros with\n  $|\\gamma| \\le 3\\times10^{12}$ &\n  Platt--Trudgian \\cite{platt2021riemann}, interval arithmetic &\n  computational certificate \\\\\n\\texttt{LiVerifiedUpTo} & $\\lambda_n > 0$ for $1 \\le n \\le 10^5$ &\n  Johansson \\cite{johansson2015} (Step-5 normalization); this project\n  to $n \\le 3000$ (App.~A) & computational certificate \\\\\n\\texttt{ZeroCountProp} & unit-window zero count $\\le C_0(t{+}1)$,\n  $t \\ge 2$ & Rosser \\cite{rosser1941}; derived (see below) &\n  derived explicit bound \\\\\n\\texttt{ZeroCountProp2} & two-unit zero count $\\le 0.6\\log(t{+}2) +\n  0.886\\log\\log(t{+}2) + 2.7$, $t \\ge 10$ &\n  Rosser \\cite{rosser1941}; derived (see below) &\n  derived explicit bound \\\\\n\\texttt{ZeroCountGlobalProp} & global zero count $N(T) \\le F(T)$,\n  $T \\ge 2$ & Rosser \\cite{rosser1941} (enlarged majorant); derived\n  (see below) & derived explicit bound \\\\\n\\texttt{NoLowZeros} & $|\\gamma| \\ge 14$ for every nontrivial zero &\n  Platt \\cite{platt2017isolating}; Gram\n  \\cite{gram1903} (see below) & computational certificate \\\\\n\\texttt{MZeroProp} & $|\\zeta'/\\zeta(-\\tfrac52 + it)| \\le 1.3352$ for\n  $|t| \\le 10$ & this project (E-023), interval arithmetic &\n  computational certificate \\\\\n\\hline\n\\end{tabular}\n\\end{center}\nThe three zero-counting rows are derived bounds, not printed as such:\nthey are elementary specializations of the Riemann--von Mangoldt\nformula $N(T) = F(T) + S(T)$, $F(T) = \\frac{T}{2\\pi}\\log\\frac{T}{2\\pi\ne} + \\frac78$, combined with Rosser's explicit bound\n$|S(T)| \\le 0.137\\log T + 0.443\\log\\log T + 1.588$, valid for\n$T \\ge 1467$ \\cite{rosser1941} (tabulated with its provenance in\n\\cite[Table~1]{trudgian2014ii}). The two window forms take differences\nof the formula at the window endpoints, and the global form uses\n$N(T) \\le F(T) + |S(T)|$; the additive constants and the enlargement\nof $F$ absorb the ranges below Rosser's threshold via the finite-range\nverifications $|S(T)| \\le 1$ for $T \\le 280$ and $|S(T)| \\le 2$ for\n$T \\le 6.8\\times10^6$ \\cite[Eq.~(1.2)]{trudgian2014ii}.\n\\texttt{NoLowZeros} is logically separate\nfrom \\texttt{RHUpTo}: it asserts a location fact about the low zeros,\nnot RH on an initial segment. Its provenance is zero-location\ncomputation: Platt \\cite{platt2017isolating} rigorously isolates the\nnontrivial zeros with $0 < \\gamma \\le 3.06\\times10^{10}$ by interval\narithmetic (an independent verification of RH to that height), the\nlowest at $\\gamma_1 = 14.134725\\ldots$ --- a value classical since\nGram \\cite{gram1903} --- so no nontrivial zero has $|\\gamma| < 14$;\nthe Platt--Trudgian verification \\cite{platt2021riemann} extends the\non-line confirmation to height $3\\times10^{12}$ via Turing's method.\n\\texttt{MZeroProp} is a grid\nevaluation with a sampled-Lipschitz margin of safety $\\times 2$\n(E-023), in the same interval-arithmetic trust class.\n\nThe proof of \\texttt{SfBoundProp} contains the full complex-analytic\ncontent of Step 2, in the dependency chain\n\\begin{center}\n\\begin{tabular}{c}\npartial fractions \\\\\n$\\downarrow$ \\\\\n$S_f = \\operatorname{Res}_1$ \\\\\n$\\downarrow$ \\\\\nrectangle identity \\\\\n$\\downarrow$ \\\\\nfour side bounds \\\\\n$\\downarrow$ \\\\\n\\boxed{\\texttt{sfBoundProp}} \\\\\n$\\downarrow$ \\\\\n\\boxed{\\texttt{lambda\\_pos\\_finite\\_height\\_closed}}\n\\end{tabular}\n\\end{center}\nwith named capstones \\texttt{rectInt'\\_Jlag} (meromorphic residue\nmachinery on rectangles), \\texttt{partialFraction\\_identity} (the\npartial-fraction identity for $\\zeta'/\\zeta$),\n\\texttt{logDeriv\\_riemannZeta\\_sub\\_nearZeros\\_le\\_tight} (the\nreference-point bound $|R(s)| \\le 10.5\\log(|t|{+}2) + 48$),\n\\texttt{sf\\_eq\\_resW1} (the exact identity\n$S_f(n) = \\mathrm{Res}_1(n)$),\n\\texttt{upper\\_right\\_horizontal\\_eq\\_dogleg} and the\n\\texttt{LiDogLeg} bounds (Section~\\ref{subsec:dogleg}),\n\\texttt{LiSideBounds} (the four side bounds), and the fold\n\\texttt{sfBoundProp}. The two elementary evaluations of the explicit\nmargin function that the assembly consumes\n($\\mathrm{margin}(8{\\cdot}10^4) > 0$ and\n$\\mathrm{margin}(10^5) > \\mathrm{margin}(8{\\cdot}10^4)$) are discharged\nin the development itself, by certified rational interval bounds on\n$\\log$, $\\exp$, and $\\sqrt{\\cdot}$ (\\texttt{LiBasePoints.lean}). The\nmargin majorant in the development is a mildly enlarged $F{+}S_b$-shape\nfunction (a negative-weight term dropped, at a cost of $\\approx\n0.9\\sqrt n$ in the bound) chosen so that every convexity block has\nprovably negative $\\psi$; the axiom profile is unchanged --- the three\nstandard axioms, no \\texttt{sorryAx}, audited declaration-by-declaration\non the full chain.\n\nThe finite-height Li theorem remains, by design, \\emph{conditional} on\nits declared perimeter: the four computational certificates of the\ntable above (the Platt--Trudgian verifications, the Li tables, the\nzero-location certificate, and the interval constant) and the three\nexplicit zero-counting bounds derived from the Riemann--von Mangoldt\nformula with Rosser's $S(T)$ bound \\cite{rosser1941}. The\nformal reduction leaves exactly those seven inputs as trusted, which we\nregard as the honest formal target: every other step of the proof is\nmachine-checked.\n\n\\section*{AI Contribution Statement}\nThis research was conducted with substantial assistance from two AI\nsystems: Kimi K3 (Moonshot AI), operated through the Claude Code\nharness (Anthropic), over an archived series of research sessions\n(project ledger: sessions 001--041). Machine contributions included:\nderivation drafting and constant-tracing (D-036/D-037/D-056/D-057),\nthe Lean~4 formalization of the Li chain (package \\texttt{NguyenRH1}:\n\\texttt{sInfty\\_lower\\_bound}, \\texttt{marginTilde\\_convex},\n\\texttt{lambda\\_pos\\_finite\\_height\\_verified},\\\\\n\\texttt{sfBoundProp}, \\texttt{lambda\\_pos\\_finite\\_height\\_closed}),\nthe numerical experiment suite (E-001--E-034), and adversarial\nself-audit (D-060: four independent audit instances, $\\sim$55 claims\nchecked, 10 corrections filed; D-071/D-072/D-074: four further\n$B(n)$-account corrections found and repaired during the machine\nclosure). All research direction, verification decisions,\nperimeter declarations, and final approval are the responsibility of\nthe human author, who serves as guarantor of the work. All\nmachine-produced mathematics was validated by machine-checked proof\n(Lean~4, axiom profiles as stated in Appendix~B), by cross-validated\ndeterministic computation, or is explicitly tagged otherwise in the\ntext. Session logs and audit trails are preserved in the project\narchive.\n\n\\section*{Acknowledgments}\nThe author thanks Moonshot AI (Kimi K3) and Anthropic (the Claude Code\nharness) for making their systems available for research use. The\nsubstantive record of machine assistance is the AI Contribution\nStatement above.\n\n\\bibliographystyle{plain}\n\\bibliography{references}\n\\end{document}\n",
  "structuredPatch": [
    {
      "oldStart": 113,
      "oldLines": 8,
      "newStart": 113,
      "newLines": 9,
      "lines": [
        " $\\log^2$ denominator (Remark~(i)). The novelty claimed here is not the",
        " $T^2$ scale itself but the explicit, fully constant-traced,",
        " \\emph{strict}-positivity assembly --- Lagarias's contour argument",
        "-\\cite{lagarias2007li} with Rosser's explicit $S(T)$ bound",
        "-\\cite{rosser1941}, an elementary archimedean lower bound, a proved",
        "+\\cite{lagarias2007li} with Rosser's explicit Riemann--von Mangoldt",
        "+error bound \\cite[Thm~19]{rosser1941}, an elementary archimedean",
        "+lower bound, a proved",
        " margin convexity, the dog-leg repair of Section~\\ref{subsec:dogleg},",
        " and the finite verifications --- and its machine verification; that",
        " assembly we have found nowhere else in the literature."
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "command": "powershell.exe -NoProfile -Command \"Get-CimInstance Win32_Processor | Select-Object Name, NumberOfCores, NumberOfLogicalProcessors, MaxClockSpeed | Format-List; Get-CimInstance Win32_ComputerSystem | Select-Object TotalPhysicalMemory | Format-List\" 2>&1",
  "description": "Query CPU model, cores, and RAM via PowerShell"
}

local: edited 17 templates; leftover: []

{
  "command": "powercfg.exe /getactivescheme 2>&1; powercfg.exe /list 2>&1",
  "description": "Show active and available Windows power plans"
}

LiArchimedean.lean            252 lines     6 decls  sorry=0
LiAssembly.lean               476 lines    16 decls  sorry=0
LiBasePoints.lean             717 lines    26 decls  sorry=0
LiCircleBound.lean           3929 lines    65 decls  sorry=0
LiClosed.lean                  37 lines     1 decls  sorry=0
LiContour.lean                807 lines    33 decls  sorry=0
LiCrux.lean                   438 lines     8 decls  sorry=0
LiDigamma.lean               1036 lines    51 decls  sorry=0
LiDigammaLeft.lean           1043 lines    15 decls  sorry=0
LiDisc.lean                  1362 lines    57 decls  sorry=0
LiDogLeg.lean                1423 lines    44 decls  sorry=0
LiFEntire.lean               1129 lines    30 decls  sorry=0
LiGapCircles.lean             206 lines     2 decls  sorry=0
LiMoments.lean               1014 lines    50 decls  sorry=0
LiPrincipal.lean              314 lines    15 decls  sorry=0
LiRBound.lean                 755 lines    28 decls  sorry=0
LiReflect.lean                993 lines    26 decls  sorry=0
LiResidue.lean                264 lines    16 decls  sorry=0
LiSeries.lean                 604 lines    22 decls  sorry=0
LiSideBounds.lean            1731 lines    27 decls  sorry=0
LiSides.lean                  522 lines    25 decls  sorry=0
LiSkeleton.lean              2828 lines   115 decls  sorry=2
LiSqueeze.lean                342 lines     5 decls  sorry=0
LiSwaps.lean                  414 lines    15 decls  sorry=0
LiTightR.lean                4480 lines   152 decls  sorry=0
LiTrivialZeros.lean           347 lines     9 decls  sorry=0
LiZetaCoeff.lean              267 lines     9 decls  sorry=0
SuzukiSkeleton.lean            72 lines     5 decls  sorry=2
ValleySkeleton.lean           104 lines     6 decls  sorry=5
TOTAL 27906 lines, 879 decls

{
  "command": "cd /d/Python/Quantum && .venv/Scripts/python.exe research/numerics/scripts/E-002-first-zeros.py",
  "description": "Resume E-002 zero computation from n=3001",
  "timeout": 600000,
  "run_in_background": true
}

SUCCESS: The process with PID 45060 (child process of PID 53700) has been terminated.
SUCCESS: The process with PID 53700 (child process of PID 12776) has been terminated.
relaunched pid 45196
48

{
  "command": "nvidia-smi --query-gpu=name,memory.total,driver_version,compute_cap --format=csv 2>&1",
  "description": "Query NVIDIA GPU model, VRAM, and compute capability"
}

[master 2187995] blueprint: done marker -> ☑ glyph (site styles it blue, no border box)
 1 file changed, 48 insertions(+), 48 deletions(-)
[master c9304d2] website: wrap ☑ checklist marker in blue .tkm-check span
 1 file changed, 3 insertions(+), 1 deletion(-)
c9304d2 website: wrap ☑ checklist marker in blue .tkm-check span
2187995 blueprint: done marker -> ☑ glyph (site styles it blue, no border box)

{
  "file_path": "C:\\Users\\lucky\\AppData\\Local\\Temp\\nguyen\\ff74d795-3344-493a-8c08-dc1bd8e633e1\\tasks\\bro0wkvfe.output"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\derivations\\D-034-star-literature-map.md",
    "content": "# D-034 \u2014 Task (\u2605)a: literature map for the Wiener\u2013Hopf / resolvent-convergence attack on (\u2605)\nDate: 2026-08-18 | Session: 006 cont.8 | Task: (\u2605) analytic attack\nStatus: complete. Sources recorded per \u00a74A.3.\n\n## 1. Direct hits: none \u2014 the (\u2605) framing is new territory\n- arXiv sweep \"Wiener\u2013Hopf + Riemann\": 26 hits, ALL Riemann\u2013Hilbert /\n  Riemann-surface / gravitational \u2014 NO paper connects Wiener\u2013Hopf\n  factorization to RH, \u03b6-zeros, or explicit formulas. The WH reading of\n  Cor 1.6 (D-026) appears to be genuinely uncharted as a framing.\n- Screw-function corpus (all Suzuki): 2206.03682 (JLMS 2023 \u2014 screw\n  function of \u03b6, RH-equivalences, \u011d identity [13]); 2209.04658 (screw\n  line under RH, \u210b(A\u221e) \u2245 de Branges space [14]); 2606.09096 (the\n  Cor 1.6 paper \u2014 our R-003 source); 2409.00888 (M-functions/\n  Goldbach); 2308.11860 (survey, no new results).\n\n## 2. The machinery that EXISTS and fits the wall\n- **Krein\u2013Langer [paper ref 8]** (IEOT 78, 2014): screw-function\n  theory \u2014 continuation of hermitian positive definite functions;\n  g is a screw function \u27fa RH (Suzuki [13] Thm 1.2). The representing\n  measure of the screw function is the spectral object behind \u011d.\n- **Finite-interval convolution asymptotics** (Krein 1958/62;\n  Gohberg\u2013Feldman, \"Convolution Equations and Projection Methods\",\n  1974): the finite-interval resolvent of g\u2217v = h on [\u2212a,a] converges\n  as a \u2192 \u221e to the half-line Wiener\u2013Hopf resolvent PROVIDED the symbol\n  admits the appropriate factorization. This is the classical engine\n  behind the v\u00b1(a) \u2192 v\u00b1(\u221e) question (original Q-S3a) \u2014 and the\n  factorization of \u011d(z) = z\u207b\u00b2\u03be\u2032(\u00bd\u2212iz)/\u03be(\u00bd\u2212iz) is RH-gated (poles of \u011d\n  at z = i(\u00bd\u2212\u03c1) \u2014 all real \u27fa RH; D-035 \u00a72).\n- **Strong resolvent convergence of self-adjoint extensions** (classical\n  Krein resolvent formalism; e.g. Gorbachuk\u2013Gorbachuk): norm-convergence\n  of deficiency elements \u27f9 strong resolvent convergence of the\n  extensions D_{a,\u03b8(a)} \u2192 D. This is the exact theorem-class the\n  v\u00b1-convergence question belongs to.\n- **de Branges spaces / indefinite (de Branges\u2013Krein) spaces**\n  (de Branges 1968; Krein\u2013Langer): \u210b(A\u221e) \u2245 de Branges space under RH\n  [14]; without RH, Q_W is indefinite \u2014 negative index = off-line\n  pairs (Bombieri [Bom00]) \u2014 the right frame is a Krein-space\n  de Branges space.\n- **Connes 1999 trace formula** (and Connes\u2013Consani\u2013Moscovici\n  2511.22755 \u2014 zeta spectral triples, the sister v\u0302a \u2192 \u03be conjecture\n  (1.2)): the scaling-action/Weil-positivity framing of the same\n  positivity; NOT the WH framing but the same gate.\n\n## 3. What does NOT exist (the gap)\n- No WH-factorization analysis of \u011d = z\u207b\u00b2\u03be\u2032/\u03be anywhere.\n- No unconditional (Krein-space) version of Suzuki's [14] isomorphism.\n- No convergence theorem for D_{a,\u03b8} as a \u2192 \u221e in ANY metric (Suzuki's\n  \u00a77.5 expectation is stated under RH only, as a heuristic).\n- No known example of a strong-resolvent limit of real-spectrum\n  operators being used to FORCE real spectrum in the limit (the\n  phenomenon needed for (\u2605)) \u2014 in Krein spaces, spectrum can leave \u211d\n  in pairs; controlling that = the wall (D-035 \u00a73).",
    "numLines": 52,
    "startLine": 1,
    "totalLines": 52
  }
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "4. **Master tool index.** research/derivations/D-001 (built in Phase 0.1)\n   is the living index of all usable equations/tools; every newly\n   discovered tool is added there so no later session rediscovers it.",
  "new_string": "4. **Master tool index.** research/derivations/D-001 (built in Phase 0.1)\n   is the living index of all usable equations/tools; every newly\n   discovered tool is added there so no later session rediscovers it.\n5. **NO-BOUNDARIES RULE (user directive, 2026-08-17).** Do not merely\n   follow what has been done. The metric is success on the ultimate goal,\n   not fidelity to any tradition. Actively import ANY domain of human\n   knowledge that could crack a wall in the obstruction map (D-006 \u00a76) \u2014\n   no field is off-limits. Candidate reservoirs to sweep systematically:\n   random matrix theory & free probability; operator theory (de Branges,\n   Krein, canonical systems); harmonic analysis (uncertainty principles,\n   restriction theory, Beurling\u2013Malliavin); mathematical physics\n   (integrable systems, quantum chaos, scattering); probability (Gaussian\n   processes, determinantal point processes); algebraic geometry & finite\n   fields (Weil's proof for curves \u2014 the ONE case RH is proven); p-adic\n   and adelic methods; ergodic theory; information theory; optimization\n   (SDP/SOS hierarchies); machine-assisted discovery. At each phase\n   boundary, run a DOMAIN SWEEP: list the current walls, ask which\n   untouched field has machinery shaped like each wall, web-research the\n   top candidates (per \u00a74A.3), and log findings in D-001 Part III \u2014\n   including negative ones (a field that provably does not apply is\n   documented progress)."
}

{
  "filePath": "D:\\Python\\Quantum\\web\\dashboard\\static\\dashboard\\style.css",
  "oldString": ".md blockquote { border-left: 3px solid var(--accent2); margin: 10px 0; padding: 2px 14px; color: var(--muted); }\n.math-line { overflow-x: auto; }\n\n/* checklist task markers ([x] / [~] / [ ] / \u2611) \u2014 colored boxes, uniform size */\n.tkm { display: inline-block; min-width: 1.9em; text-align: center;\n       border: 1px solid; border-radius: 4px; padding: 0 3px; margin-right: 2px;\n       font-weight: 700; line-height: 1.35; box-sizing: border-box; }\n.tkm-x { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }\n.tkm-tilde { color: #e3b341; border-color: #e3b341; background: rgba(227,179,65,.10); }\n.tkm-open { color: #9da7b3; border-color: #6e7681; background: rgba(110,118,129,.10); }\n.tkm-check { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }",
  "newString": ".md blockquote { border-left: 3px solid var(--accent2); margin: 10px 0; padding: 2px 14px; color: var(--muted); }\n.math-line { overflow-x: auto; }",
  "originalFile": ":root {\n  --bg: #0d1117;\n  --bg-panel: #141a24;\n  --bg-card: #1a2230;\n  --border: #2a3040;\n  --text: #d5dbe5;\n  --muted: #8b93a3;\n  --accent: #4f9cf9;\n  --accent2: #7c5cff;\n  --ok: #3fb96b;\n  --warn: #e0a93e;\n  --fail: #e05e5e;\n  --mono: \"Cascadia Code\", Consolas, \"Courier New\", monospace;\n}\n\n* { box-sizing: border-box; }\nhtml, body { margin: 0; height: 100%; }\nbody {\n  background: var(--bg);\n  color: var(--text);\n  font: 15px/1.6 \"Segoe UI\", system-ui, sans-serif;\n}\n\n/* ---------- sidebar (fixed: stays put while content scrolls) ---------- */\n#sidebar {\n  width: 240px; height: 100vh;\n  position: fixed; top: 0; left: 0; z-index: 10;\n  overflow-y: auto;\n  background: var(--bg-panel);\n  border-right: 1px solid var(--border);\n  display: flex; flex-direction: column;\n}\n.brand { padding: 18px 18px 12px; border-bottom: 1px solid var(--border); }\n.brand-title { font-weight: 700; letter-spacing: 1px; color: var(--accent); }\n.brand-sub { font-size: 12px; color: var(--muted); }\n.menu { list-style: none; margin: 8px 0; padding: 0; flex: 1; overflow-y: auto; }\n.menu a {\n  display: block; padding: 9px 18px; color: var(--text);\n  text-decoration: none; border-left: 3px solid transparent;\n}\n.menu a:hover { background: #1d2635; }\n.menu a.active {\n  border-left-color: var(--accent);\n  background: #1d2635; color: #fff; font-weight: 600;\n}\n.sidebar-foot {\n  padding: 12px 18px; border-top: 1px solid var(--border);\n  font-size: 12px; color: var(--muted);\n}\n.dot {\n  display: inline-block; width: 9px; height: 9px; border-radius: 50%;\n  background: var(--fail); margin-right: 7px;\n}\n.dot.on { background: var(--ok); box-shadow: 0 0 6px var(--ok); }\n.badge {\n  background: var(--accent2); color: #fff; border-radius: 10px;\n  font-size: 11px; padding: 1px 7px; margin-left: 6px;\n}\n.tbl td.date { white-space: nowrap; }\n\n/* ---------- content ---------- */\n#nav-toggle {\n  display: none; background: none; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px;\n  padding: 2px 10px; margin-right: 10px; font-size: 17px; line-height: 1.4;\n}\n#nav-backdrop { display: none; }\n#content { margin-left: 240px; padding: 0 34px 60px; max-width: 1180px; }\n#topbar {\n  position: sticky; top: 0; z-index: 5;\n  background: var(--bg); border-bottom: 1px solid var(--border);\n  padding: 10px 0; margin-bottom: 20px;\n  font-size: 13px; color: var(--muted);\n  display: flex; align-items: center; gap: 10px;\n}\n#topbar-task {\n  color: var(--text);\n  flex: 1; min-width: 0;\n  overflow: hidden; text-overflow: ellipsis; white-space: nowrap;\n}\n.top-search { display: flex; gap: 6px; flex-shrink: 0; }\n.top-search input {\n  width: 210px; background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px;\n  padding: 5px 10px; font-size: 13px;\n}\n.top-search button { padding: 5px 12px; font-size: 13px; }\n.topbar-label { font-weight: 600; margin-right: 6px; }\n\n/* content links (class-less anchors in cards/body text) */\n#content a:not([class]) { color: #8fbfff; text-decoration: none; }\n#content a:not([class]):hover { color: #c4dcff; text-decoration: underline; }\n\nh1 { font-size: 26px; margin: 10px 0 14px; }\nh2 { font-size: 19px; margin: 6px 0 12px; color: #eaf0f8; }\nh3 { font-size: 15px; margin: 16px 0 8px; color: #c8d2e0; }\ncode { font-family: var(--mono); font-size: 13px; color: #9ecbff; }\n.muted { color: var(--muted); }\n.wrap { word-break: break-word; }\n\n.hero { padding: 26px 0 6px; }\n.hero h1 { font-size: 38px; margin-bottom: 6px;\n  background: linear-gradient(90deg, var(--accent), var(--accent2));\n  -webkit-background-clip: text; background-clip: text; color: transparent; }\n.hero-sub { font-size: 17px; color: var(--muted); max-width: 760px; }\n.credits { display: flex; gap: 26px; flex-wrap: wrap; margin: 14px 0 4px; }\n.credits div { display: flex; gap: 7px; align-items: baseline; }\n.credits dt { color: var(--muted); font-size: 13px; }\n.credits dd { margin: 0; font-weight: 600; color: #eaf0f8; font-size: 14px; }\n\n.card {\n  background: var(--bg-card); border: 1px solid var(--border);\n  border-radius: 10px; padding: 18px 22px; margin: 16px 0;\n}\n.grid-2 { display: grid; grid-template-columns: 1fr 1fr; gap: 0 20px; }\n@media (max-width: 1000px) { .grid-2 { grid-template-columns: 1fr; } }\n\n/* ---------- mobile sidebar (off-canvas \u2264 900px) ---------- */\n@media (max-width: 900px) {\n  #sidebar {\n    transform: translateX(-105%);\n    transition: transform .2s ease-in-out;\n    z-index: 20;\n  }\n  body.nav-open #sidebar { transform: none; box-shadow: 0 0 40px rgba(0,0,0,.6); }\n  #nav-toggle { display: inline-block; }\n  #nav-backdrop {\n    position: fixed; inset: 0; z-index: 15;\n    background: rgba(0,0,0,.5);\n  }\n  body.nav-open #nav-backdrop { display: block; }\n  #content { margin-left: 0; padding: 0 16px 60px; }\n  .top-search input { width: 120px; }\n  .topbar-label { display: none; }\n}\n\n.track-grid { display: grid; grid-template-columns: repeat(auto-fit, minmax(220px, 1fr)); gap: 14px; }\n.track { background: #151d2b; border: 1px solid var(--border); border-radius: 8px; padding: 12px 16px; }\n.track h3 { margin-top: 0; color: var(--accent); }\n\n.stat-grid { display: grid; grid-template-columns: repeat(auto-fit, minmax(130px, 1fr)); gap: 12px; margin: 10px 0; }\n.stat { background: #151d2b; border: 1px solid var(--border); border-radius: 8px; padding: 12px; text-align: center; }\n.stat-num { font-size: 26px; font-weight: 700; color: var(--accent); }\n.stat-label { font-size: 12px; color: var(--muted); }\n\n.state-box {\n  background: #10151f; border: 1px solid var(--border); border-radius: 8px;\n  padding: 12px 14px; white-space: pre-wrap; word-break: break-word;\n  font-family: var(--mono); font-size: 12.5px; color: #b9c4d4;\n  max-height: 420px; overflow-y: auto;\n}\n.state-box.small { max-height: 90px; }\n.log-tail { height: 380px; max-height: 380px; }\n.live-chip {\n  font-size: 11px; color: var(--ok); border: 1px solid var(--ok);\n  border-radius: 10px; padding: 0 8px; vertical-align: middle;\n}\n.live-chip::before { content: \"\u25cf \"; }\n\n.tbl { width: 100%; border-collapse: collapse; font-size: 13.5px; }\n.tbl th, .tbl td { text-align: left; padding: 7px 10px; border-bottom: 1px solid var(--border); vertical-align: top; }\n.tbl th { color: var(--muted); font-weight: 600; font-size: 12px; text-transform: uppercase; letter-spacing: .4px; }\n.tbl a { color: var(--accent); text-decoration: none; }\n.tbl a:hover { text-decoration: underline; }\n.table-scroll { overflow-x: auto; }\n.table-scroll .tbl td { font-family: var(--mono); font-size: 12px; white-space: nowrap; }\n\n.tag {\n  display: inline-block; font-size: 11.5px; font-weight: 600;\n  border-radius: 10px; padding: 1px 9px; white-space: nowrap;\n}\n.tag-ok   { background: #14301f; color: var(--ok); border: 1px solid var(--ok); }\n.tag-cond { background: #2e2a12; color: var(--warn); border: 1px solid var(--warn); }\n.tag-num  { background: #152438; color: var(--accent); border: 1px solid var(--accent); }\n.tag-run  { background: #241a38; color: var(--accent2); border: 1px solid var(--accent2); }\n.tag-open { background: #1a1f29; color: var(--muted); border: 1px solid var(--muted); }\n.tag-fail { background: #331818; color: var(--fail); border: 1px solid var(--fail); }\n.tag-cat  { background: #152438; color: #9ecbff; border: 1px solid var(--border); }\n\n.check { display: inline-block; width: 20px; height: 20px; line-height: 20px;\n  text-align: center; border-radius: 50%; font-size: 12px; margin-right: 3px; }\n.check-pass { background: #14301f; color: var(--ok); }\n.check-fail { background: #331818; color: var(--fail); }\n\n.commit-list { list-style: none; padding: 0; margin: 0; }\n.commit-list li { padding: 5px 0; border-bottom: 1px solid var(--border); }\n.commit-list code { color: var(--text); }\n\n.ladder li { margin: 6px 0; }\n\n.md { font-size: 15px; }\n.md table { width: 100%; border-collapse: collapse; font-size: 13px; margin: 12px 0; }\n.md th, .md td { border: 1px solid var(--border); padding: 6px 9px; text-align: left; vertical-align: top; }\n.md th { background: #151d2b; }\n.md h1, .md h2, .md h3 { color: #eaf0f8; }\n.md pre { background: #10151f; border: 1px solid var(--border); border-radius: 8px; padding: 12px; overflow-x: auto; }\n.md code { font-size: 12.5px; }\n.md blockquote { border-left: 3px solid var(--accent2); margin: 10px 0; padding: 2px 14px; color: var(--muted); }\n.math-line { overflow-x: auto; }\n\n/* checklist task markers ([x] / [~] / [ ] / \u2611) \u2014 colored boxes, uniform size */\n.tkm { display: inline-block; min-width: 1.9em; text-align: center;\n       border: 1px solid; border-radius: 4px; padding: 0 3px; margin-right: 2px;\n       font-weight: 700; line-height: 1.35; box-sizing: border-box; }\n.tkm-x { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }\n.tkm-tilde { color: #e3b341; border-color: #e3b341; background: rgba(227,179,65,.10); }\n.tkm-open { color: #9da7b3; border-color: #6e7681; background: rgba(110,118,129,.10); }\n.tkm-check { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }\n\n.fb-form label, .fb-search { display: block; margin: 10px 0; font-size: 13.5px; }\n.fb-form input, .fb-form select, .fb-form textarea,\n.fb-search input, .fb-search select {\n  display: block; width: 100%; margin-top: 4px;\n  background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px; padding: 8px 10px;\n  font: inherit;\n}\n.fb-search { display: grid; grid-template-columns: 2fr 1fr 1fr auto; gap: 8px; align-items: end; }\nbutton {\n  background: var(--accent); color: #06121f; border: 0; border-radius: 6px;\n  padding: 9px 18px; font-weight: 700; cursor: pointer; font-size: 14px;\n}\nbutton:hover { filter: brightness(1.1); }\n.fb-item { border-top: 1px solid var(--border); padding: 12px 0; }\n\n/* global search */\n.search-form { display: flex; gap: 8px; margin: 14px 0 20px; max-width: 720px; }\n.search-form input[type=\"text\"] {\n  flex: 1; background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px; padding: 8px 10px;\n  font: inherit;\n}\n.search-hit { margin-bottom: 12px; }\n.search-hit-head { margin-bottom: 4px; font-size: 14px; }\n.search-hit-head a { color: var(--accent); text-decoration: none; font-weight: 600; }\n.search-hit-head a:hover { text-decoration: underline; }\n.snippet {\n  background: #10151f; border: 1px solid var(--border); border-radius: 6px;\n  padding: 5px 10px; margin: 6px 0; font-family: var(--mono);\n  font-size: 12.5px; white-space: pre-wrap; word-break: break-word;\n  color: var(--muted);\n}\n.snippet-ln { color: var(--accent2); margin-right: 8px; user-select: none; }\n.snippet mark { background: #4a3d10; color: #ffe08a; border-radius: 2px; padding: 0 1px; }\n\n/* spreadsheet data tables (scripts & data) */\n.pager { display: flex; gap: 14px; align-items: center; margin: 4px 0 8px; font-size: 13px; }\n.pager a { color: var(--accent); text-decoration: none; font-weight: 600; }\n.pager a:hover { text-decoration: underline; }\n.sheet {\n  overflow: auto; max-height: 72vh;\n  border: 1px solid var(--border); border-radius: 6px;\n}\n.sheet table { border-collapse: separate; border-spacing: 0; font-family: var(--mono); font-size: 12.5px; }\n.sheet th, .sheet td { padding: 3px 14px; white-space: nowrap; }\n.sheet thead th {\n  position: sticky; top: 0; z-index: 2;\n  background: var(--bg-panel); color: var(--accent);\n  border-bottom: 2px solid var(--border); text-align: left;\n}\n.sheet td { border-bottom: 1px solid #1c2431; }\n.sheet td.num { text-align: right; }\n.sheet .rn {\n  position: sticky; left: 0; z-index: 1;\n  background: var(--bg-panel); color: var(--muted);\n  text-align: right; border-right: 1px solid var(--border);\n  user-select: none;\n}\n.sheet thead .rn { z-index: 3; }\n.sheet tbody tr:hover td { background: #1d2635; }\n.sheet tbody tr:hover .rn { background: #232f44; }\n.json-box {\n  background: #10151f; border: 1px solid var(--border); border-radius: 6px;\n  padding: 10px 14px; max-height: 480px; overflow: auto;\n  font-family: var(--mono); font-size: 12.5px; white-space: pre-wrap;\n  word-break: break-word;\n}\ndetails summary { cursor: pointer; color: var(--accent); }\n.code-box { white-space: pre; word-break: normal; }\ndetails.perim { margin: 8px 0; }\ndetails.perim > summary { line-height: 1.5; }\n.fb-head { display: flex; gap: 10px; align-items: center; flex-wrap: wrap; margin-bottom: 4px; }\n.fb-notes { color: var(--muted); font-size: 13.5px; }\n\n.messages { margin: 10px 0; }\n.msg { padding: 10px 14px; border-radius: 8px; margin: 6px 0; }\n.msg.success { background: #14301f; border: 1px solid var(--ok); }\n.msg.error { background: #331818; border: 1px solid var(--fail); }\n\n.log-row:hover { background: #1d2635; }\n.freshness { font-size: 12.5px; }\n\n/* ---------- conversations ---------- */\n.msgcard {\n  background: var(--bg-card); border: 1px solid var(--border);\n  border-radius: 10px; padding: 12px 18px; margin: 12px 0;\n}\n.msg-user { border-left: 4px solid var(--accent2); }\n.msg-assistant { border-left: 4px solid var(--accent); }\n.msg-head { display: flex; gap: 12px; align-items: center; flex-wrap: wrap;\n  margin-bottom: 8px; font-size: 13px; }\n.msg-id { font-family: var(--mono); color: var(--muted); }\n.role-badge { font-size: 11.5px; font-weight: 700; border-radius: 10px; padding: 1px 9px; }\n.role-user { background: #241a38; color: var(--accent2); border: 1px solid var(--accent2); }\n.role-assistant { background: #152438; color: var(--accent); border: 1px solid var(--accent); }\n.msg-open { margin-left: auto; color: var(--accent); text-decoration: none; font-size: 12.5px; }\n.msg-open:hover { text-decoration: underline; }\n\n.msgtext { white-space: pre-wrap; word-break: break-word; margin: 8px 0; }\n\ndetails.think, details.tool, details.rawjson {\n  border: 1px solid var(--border); border-radius: 8px;\n  margin: 8px 0; background: #121824;\n}\ndetails.think summary, details.tool summary, details.rawjson summary {\n  cursor: pointer; padding: 8px 12px; font-size: 13px; color: var(--muted);\n  user-select: none;\n}\ndetails.think summary:hover, details.tool summary:hover { color: var(--text); }\n.think-body {\n  padding: 4px 14px 12px; white-space: pre-wrap; word-break: break-word;\n  color: #b8a7e8; font-style: italic; font-size: 13.5px;\n  border-top: 1px dashed var(--border);\n}\n.tool-body { padding: 4px 14px 12px; border-top: 1px dashed var(--border); }\n.tool-label { font-size: 11.5px; text-transform: uppercase; letter-spacing: .5px;\n  color: var(--muted); margin: 10px 0 4px; }\n.tool-body pre, .rawjson pre {\n  background: #0c1119; border: 1px solid var(--border); border-radius: 6px;\n  padding: 10px 12px; margin: 0; font-family: var(--mono); font-size: 12px;\n  white-space: pre-wrap; word-break: break-all; max-height: 480px; overflow-y: auto;\n}\n.rawjson { margin-top: 10px; }\n.rawjson pre { margin: 0 14px 12px; }\n\n.msgnav {\n  display: flex; gap: 14px; align-items: center; flex-wrap: wrap;\n  background: var(--bg-card); border: 1px solid var(--border);\n  border-radius: 10px; padding: 12px 18px; margin: 14px 0;\n  position: sticky; top: 44px; z-index: 4;\n}\n.navbtn {\n  background: #152438; border: 1px solid var(--accent); color: var(--accent);\n  border-radius: 6px; padding: 6px 14px; text-decoration: none; font-weight: 600;\n  font-family: var(--mono); font-size: 13px;\n}\n.navbtn:hover { background: #1b2f4a; }\n.navbtn.disabled { border-color: var(--border); color: var(--muted); background: none; }\n.msgpos { font-size: 13.5px; }\n.jumpbox { margin-left: auto; display: flex; gap: 8px; }\n.jumpbox input {\n  width: 90px; background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px; padding: 6px 10px;\n}\n.jumpbox button { padding: 6px 12px; font-size: 13px; }\n\n.conv-filter { display: flex; gap: 10px; align-items: center; flex-wrap: wrap; }\n.conv-filter input[type=\"text\"] {\n  flex: 1; min-width: 220px; background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px; padding: 8px 12px; font: inherit;\n}\n.conv-filter select {\n  background: #10151f; color: var(--text);\n  border: 1px solid var(--border); border-radius: 6px; padding: 8px 12px; font: inherit;\n}\n.count-note { font-size: 12.5px; }\n",
  "structuredPatch": [
    {
      "oldStart": 198,
      "oldLines": 15,
      "newStart": 198,
      "newLines": 6,
      "lines": [
        " .md blockquote { border-left: 3px solid var(--accent2); margin: 10px 0; padding: 2px 14px; color: var(--muted); }",
        " .math-line { overflow-x: auto; }",
        " ",
        "-/* checklist task markers ([x] / [~] / [ ] / \u2611) \u2014 colored boxes, uniform size */",
        "-.tkm { display: inline-block; min-width: 1.9em; text-align: center;",
        "-       border: 1px solid; border-radius: 4px; padding: 0 3px; margin-right: 2px;",
        "-       font-weight: 700; line-height: 1.35; box-sizing: border-box; }",
        "-.tkm-x { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }",
        "-.tkm-tilde { color: #e3b341; border-color: #e3b341; background: rgba(227,179,65,.10); }",
        "-.tkm-open { color: #9da7b3; border-color: #6e7681; background: rgba(110,118,129,.10); }",
        "-.tkm-check { color: #58a6ff; border-color: #58a6ff; background: rgba(88,166,255,.12); }",
        "-",
        " .fb-form label, .fb-search { display: block; margin: 10px 0; font-size: 13.5px; }",
        " .fb-form input, .fb-form select, .fb-form textarea,",
        " .fb-search input, .fb-search select {"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-002-first-zeros.py",
  "old_string": "    print(f\"monotone: {mono} | g1 ok: {g1_ok} | RvM err: \"\n          f\"{mp.nstr(rvm_err, 5)} (\u226a log T \u2248 {mp.nstr(mp.log(T), 3)})\")",
  "new_string": "    print(f\"monotone: {mono} | g1 ok: {g1_ok} | RvM err: \"\n          f\"{mp.nstr(rvm_err, 5)} (should be << log T = \"\n          f\"{mp.nstr(mp.log(T), 3)})\")"
}

{
  "filePath": "D:\\Python\\quantum-deploy\\docroot\\app\\web\\dashboard\\research_data.py",
  "oldString": "_TASK_MARK_RE = re.compile(r\"(<li>\\s*(?:<p>)?)(?:\\[(x|~| )\\]|(\u2611))\")\n_TASK_MARK_CLASS = {\"x\": \"x\", \"~\": \"tilde\", \" \": \"open\"}\n\n\ndef _task_mark_span(m):\n    \"\"\"Wrap a leading checklist marker in a styled span (display-only;\n    the marker text itself stays verbatim).\"\"\"\n    if m.group(3) is not None:  # \u2611 done \u2014 blue box, same size as [~]/[ ]\n        return m.group(1) + '<span class=\"tkm tkm-check\">\u2611</span>'\n    cls = _TASK_MARK_CLASS[m.group(2)]\n    return (m.group(1) + '<span class=\"tkm tkm-' + cls + '\">['\n            + m.group(2) + \"]</span>\")\n\n\ndef render_markdown(text):\n    \"\"\"Render markdown, protecting $...$ math spans for MathJax.\"\"\"\n    store = []\n\n    def stash(m):\n        store.append(m.group(0))\n        return f\"@@MATH{len(store) - 1}@@\"\n\n    protected = _MATH_RE.sub(stash, _restore_interrupted_lists(text))\n    html = markdown.markdown(\n        protected, extensions=[\"tables\", \"fenced_code\", \"sane_lists\"])\n    for i, s in enumerate(store):\n        html = html.replace(f\"@@MATH{i}@@\", s)\n    return _TASK_MARK_RE.sub(_task_mark_span, html)",
  "newString": "def render_markdown(text):\n    \"\"\"Render markdown, protecting $...$ math spans for MathJax.\"\"\"\n    store = []\n\n    def stash(m):\n        store.append(m.group(0))\n        return f\"@@MATH{len(store) - 1}@@\"\n\n    protected = _MATH_RE.sub(stash, _restore_interrupted_lists(text))\n    html = markdown.markdown(\n        protected, extensions=[\"tables\", \"fenced_code\", \"sane_lists\"])\n    for i, s in enumerate(store):\n        html = html.replace(f\"@@MATH{i}@@\", s)\n    return html",
  "originalFile": "\"\"\"\nRead-only access layer for the NGUYEN-RH-1 research archive.\n\nHARD RULE (RH-WEBSITE.md \u00a70): every handle opened here is READ-ONLY.\nSQLite is opened with mode=ro; files are opened 'r'. Nothing in this\nmodule may write to REPO_ROOT or RESEARCH_DIR.\n\"\"\"\nimport csv\nimport json\nimport re\nimport sqlite3\nimport subprocess\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport markdown\nfrom django.conf import settings\n\nREPO = Path(settings.REPO_ROOT)\nRESEARCH = Path(settings.RESEARCH_DIR)\nDATA = RESEARCH / \"numerics\" / \"data\"\nDB = RESEARCH / \"research.db\"\n\nMAX_CHART_POINTS = 3000\nPREVIEW_ROWS = 25\n\n\n# ---------------------------------------------------------------- files\n\ndef read_text(path):\n    return Path(path).read_text(encoding=\"utf-8\", errors=\"replace\")\n\n\ndef mtime(path):\n    p = Path(path)\n    return p.stat().st_mtime if p.exists() else None\n\n\ndef _iso(ts):\n    return datetime.fromtimestamp(ts, tz=timezone.utc).isoformat(timespec=\"seconds\")\n\n\n# ---------------------------------------------------------------- sqlite (read-only)\n\ndef _query(sql, params=()):\n    con = sqlite3.connect(f\"file:{DB}?mode=ro\", uri=True)\n    try:\n        con.row_factory = sqlite3.Row\n        return [dict(r) for r in con.execute(sql, params)]\n    finally:\n        con.close()\n\n\ndef get_results():\n    return _query(\"SELECT * FROM results ORDER BY id\")\n\n\ndef get_experiments():\n    return _query(\"SELECT * FROM experiments ORDER BY id\")\n\n\ndef get_derivations():\n    return _query(\"SELECT * FROM derivations ORDER BY id\")\n\n\ndef get_graveyard():\n    return _query(\"SELECT * FROM graveyard ORDER BY id\")\n\n\ndef get_sessions():\n    return _query(\"SELECT * FROM sessions ORDER BY id\")\n\n\ndef get_result(rid):\n    rows = _query(\"SELECT * FROM results WHERE id = ?\", (rid,))\n    return rows[0] if rows else None\n\n\ndef get_experiment(eid):\n    rows = _query(\"SELECT * FROM experiments WHERE id = ?\", (eid,))\n    return rows[0] if rows else None\n\n\n# ---------------------------------------------------------------- STATE.md / NGUYEN.md\n\ndef parse_state():\n    \"\"\"Split STATE.md into its '## SECTION' blocks.\"\"\"\n    path = REPO / \"STATE.md\"\n    if not path.exists():\n        return {}\n    sections, current = {}, \"_header\"\n    for line in read_text(path).splitlines():\n        m = re.match(r\"^##\\s+(.*)\", line)\n        if m:\n            current = m.group(1).strip()\n            sections[current] = []\n        else:\n            sections.setdefault(current, []).append(line)\n    return {k: \"\\n\".join(v).strip() for k, v in sections.items()}\n\n\ndef parse_checklist():\n    \"\"\"Parse NGUYEN.md \u00a75 phases and their checkbox tasks.\"\"\"\n    path = REPO / \"NGUYEN.md\"\n    if not path.exists():\n        return {\"phases\": [], \"done\": 0, \"partial\": 0, \"open\": 0}\n    text = read_text(path)\n    m = re.search(r\"## 5\\..*?(?=\\n## 6\\.)\", text, re.S)\n    section = m.group(0) if m else text\n\n    phases, phase = [], None\n    totals = {\"done\": 0, \"partial\": 0, \"open\": 0}\n    for line in section.splitlines():\n        pm = re.match(r\"###\\s+(\u2705|\u2b1c|\ud83d\udd36)?\\s*(PHASE\\s+\\d+.*)\", line)\n        if pm:\n            phase = {\"name\": pm.group(2).strip(), \"marker\": pm.group(1) or \"\",\n                     \"done\": 0, \"partial\": 0, \"open\": 0}\n            phases.append(phase)\n            continue\n        tm = re.match(r\"- (?:\\[(x|~| )\\]|(\u2705|\ud83d\udd36|\u2b1c|\u2611|\ud83d\udd38|\u2610))\", line)\n        if tm:\n            if tm.group(1) is not None:\n                key = {\"x\": \"done\", \"~\": \"partial\", \" \": \"open\"}[tm.group(1)]\n            else:\n                key = {\"\u2705\": \"done\", \"\u2611\": \"done\",\n                       \"\ud83d\udd36\": \"partial\", \"\ud83d\udd38\": \"partial\",\n                       \"\u2b1c\": \"open\", \"\u2610\": \"open\"}[tm.group(2)]\n            totals[key] += 1\n            if phase is not None:\n                phase[key] += 1\n    return {\"phases\": phases, **totals}\n\n\n# ---------------------------------------------------------------- markdown\n\n_MATH_RE = re.compile(\n    r\"(\\$\\$.*?\\$\\$|\\\\\\[.*?\\\\\\]|\\\\\\(.*?\\\\\\)|\\$[^$\\n]+?\\$)\", re.S)\n\n_LIST_ITEM_RE = re.compile(r\"^\\s*([-*+] |\\d+\\. )\")\n_BLOCK_START_RE = re.compile(r\"^\\s*(#|\\||>|[-*+] |\\d+\\. )\")\n\n\ndef _restore_interrupted_lists(text):\n    \"\"\"Insert a blank line before a list item that directly follows a\n    paragraph line.\n\n    python-markdown (with or without sane_lists) never lets a list\n    interrupt a paragraph: a ``- item`` line written right after a text\n    line renders as literal paragraph text. The archive writes such\n    lists (e.g. NGUYEN.md Phase 2 / 5B checklists after their note\n    paragraphs). Adding the missing blank line lets the list parse as a\n    list; visible text is unchanged. Fenced code blocks are skipped.\n    \"\"\"\n    out, prev, in_fence = [], \"\", False\n    for line in text.splitlines():\n        if line.lstrip().startswith((\"```\", \"~~~\")):\n            in_fence = not in_fence\n        elif (not in_fence and _LIST_ITEM_RE.match(line)\n                and prev.strip()               # prev not blank\n                and not prev[0].isspace()      # prev not an indented\n                                               # item-continuation (keeps\n                                               # existing lists tight)\n                and not _BLOCK_START_RE.match(prev)):\n            out.append(\"\")\n        out.append(line)\n        prev = line\n    return \"\\n\".join(out)\n\n\n_TASK_MARK_RE = re.compile(r\"(<li>\\s*(?:<p>)?)(?:\\[(x|~| )\\]|(\u2611))\")\n_TASK_MARK_CLASS = {\"x\": \"x\", \"~\": \"tilde\", \" \": \"open\"}\n\n\ndef _task_mark_span(m):\n    \"\"\"Wrap a leading checklist marker in a styled span (display-only;\n    the marker text itself stays verbatim).\"\"\"\n    if m.group(3) is not None:  # \u2611 done \u2014 blue box, same size as [~]/[ ]\n        return m.group(1) + '<span class=\"tkm tkm-check\">\u2611</span>'\n    cls = _TASK_MARK_CLASS[m.group(2)]\n    return (m.group(1) + '<span class=\"tkm tkm-' + cls + '\">['\n            + m.group(2) + \"]</span>\")\n\n\ndef render_markdown(text):\n    \"\"\"Render markdown, protecting $...$ math spans for MathJax.\"\"\"\n    store = []\n\n    def stash(m):\n        store.append(m.group(0))\n        return f\"@@MATH{len(store) - 1}@@\"\n\n    protected = _MATH_RE.sub(stash, _restore_interrupted_lists(text))\n    html = markdown.markdown(\n        protected, extensions=[\"tables\", \"fenced_code\", \"sane_lists\"])\n    for i, s in enumerate(store):\n        html = html.replace(f\"@@MATH{i}@@\", s)\n    return _TASK_MARK_RE.sub(_task_mark_span, html)\n\n\n# ---------------------------------------------------------------- markdown collections\n\nMD_COLLECTIONS = {\n    \"results\": (RESEARCH / \"results\", \".md\"),\n    \"derivations\": (RESEARCH / \"derivations\", \".md\"),\n    \"graveyard\": (RESEARCH / \"graveyard\", \".md\"),\n    \"journal\": (RESEARCH / \"journal\", \".md\"),\n    \"resources\": (RESEARCH / \"resources\", \".txt\"),\n}\n\n_JOURNAL_TITLE_RE = re.compile(r\"^(Session\\s+\\S+)\\s*\\(([^)]+)\\)\")\n\n\ndef _journal_title(title):\n    \"\"\"Display-only normalization: 'Session 011 (2026-08-19) \u2014 \u2026' \u2192\n    'Session 011 \u2014 2026-08-19 \u2014 \u2026' so all journal rows read alike.\n    The archive files are never modified (RH-WEBSITE.md \u00a70); the detail\n    page body still renders the original heading verbatim.\"\"\"\n    return _JOURNAL_TITLE_RE.sub(\n        lambda m: m.group(1) + \" \u2014 \" + m.group(2), title, count=1)\n\n\ndef collection_list(kind):\n    folder, ext = MD_COLLECTIONS[kind]\n    out = []\n    for p in sorted(folder.glob(f\"*{ext}\")):\n        if p.name in (\"index.md\", \"index.txt\"):\n            continue\n        title = _first_heading(p) or p.stem\n        if kind == \"journal\":\n            title = _journal_title(title)\n        out.append({\n            \"name\": p.stem,\n            \"file\": p.name,\n            \"title\": title,\n            \"mtime\": _iso(p.stat().st_mtime),\n        })\n    return out\n\n\ndef _first_heading(path):\n    try:\n        for line in read_text(path).splitlines():\n            if line.startswith(\"# \"):\n                return line[2:].strip()\n            if line.strip():\n                break\n    except OSError:\n        pass\n    return None\n\n\ndef collection_item(kind, name):\n    \"\"\"Render one markdown file from a collection. Path-traversal safe:\n    security comes from the resolved-path containment check, not a regex.\"\"\"\n    folder, ext = MD_COLLECTIONS[kind]\n    path = (folder / (name + ext)).resolve()\n    if folder.resolve() not in path.parents or not path.exists():\n        return None\n    title = _first_heading(path) or name\n    if kind == \"journal\":\n        title = _journal_title(title)\n    return {\n        \"name\": name,\n        \"title\": title,\n        \"html\": render_markdown(read_text(path)),\n        \"mtime\": _iso(path.stat().st_mtime),\n    }\n\n\n# ---------------------------------------------------------------- experiments\n\ndef experiment_sidecar(exp_row):\n    \"\"\"Load the JSON metadata sidecar for an experiment row.\"\"\"\n    jf = exp_row.get(\"json_file\")\n    if not jf:\n        return None\n    path = (REPO / jf).resolve()\n    if REPO.resolve() not in path.parents or not path.exists():\n        return None\n    try:\n        return json.loads(read_text(path))\n    except (json.JSONDecodeError, OSError):\n        return None\n\n\ndef _csv_path(exp_row):\n    cf = exp_row.get(\"csv_file\")\n    if not cf:\n        return None\n    path = (REPO / cf).resolve()\n    if REPO.resolve() not in path.parents or not path.exists():\n        return None\n    return path\n\n\ndef csv_preview(exp_row, n=PREVIEW_ROWS):\n    path = _csv_path(exp_row)\n    if not path:\n        return None\n    with open(path, newline=\"\", encoding=\"utf-8\", errors=\"replace\") as fh:\n        rows = list(csv.reader(fh))\n    if not rows:\n        return None\n    return {\"header\": rows[0], \"rows\": rows[1:n + 1],\n            \"total\": max(0, len(rows) - 1)}\n\n\n# Chart configs: which CSV columns to plot per experiment.\n# y may be a list of column names; log_y switches the y axis to log scale.\nCHARTS = {\n    \"E-002\": {\"title\": \"First 10\u2074 zeta zero ordinates \u03b3\u2099\",\n              \"x\": \"n\", \"y\": [\"gamma_n\"]},\n    \"E-008\": {\"title\": \"Li coefficients \u03bb\u2099 (zero side, n \u2264 2000)\",\n              \"x\": \"n\", \"y\": [\"lambda_n\"]},\n    \"E-009b\": {\"title\": \"Galerkin spectrum \u03bb\u2c7c of Suzuki A_a (log scale)\",\n               \"x\": \"a\", \"y\": [\"lambda_j\"], \"log_y\": True},\n    \"E-011\": {\"title\": \"Li coefficients \u03bb\u2099 (arithmetic side, n \u2264 2000)\",\n              \"x\": \"n\", \"y\": [\"lambda_n\"]},\n    \"E-015\": {\"title\": \"Li coefficients \u03bb\u2099 (arithmetic side, n \u2264 3000)\",\n              \"x\": \"n\", \"y\": [\"lambda_n\"]},\n    \"E-017\": {\"title\": \"Thinning remainder |R_\u03c4| / |R\u2080| vs y (log scale)\",\n              \"x\": \"y\", \"y\": [\"ratio_Rtau_R0\"], \"log_y\": True},\n    \"E-018\": {\"title\": \"Descent profile |M| / |R\u2080| (log scale)\",\n              \"x\": \"x\", \"y\": [\"ratio_M_R0\"], \"log_y\": True},\n    \"E-021\": {\"title\": \"S\u221e(n) and S_f(n) curves\",\n              \"x\": \"n\", \"y\": [\"S_inf\", \"S_f\"]},\n    \"E-023\": {\"title\": \"Margin curve: traced vs measured constants\",\n              \"x\": \"n\", \"y\": [\"margin_traced\", \"margin_measured\"]},\n}\n\n\ndef chart_data(exp_row):\n    \"\"\"Return Plotly-ready series for an experiment, or None.\"\"\"\n    cfg = CHARTS.get(exp_row[\"id\"])\n    path = _csv_path(exp_row)\n    if not path:\n        return None\n    with open(path, newline=\"\", encoding=\"utf-8\", errors=\"replace\") as fh:\n        reader = csv.DictReader(fh)\n        fields = reader.fieldnames or []\n        if cfg is None:\n            nums = _numeric_columns(path, fields)\n            if len(nums) < 2:\n                return None\n            cfg = {\"title\": \"Data plot\", \"x\": nums[0], \"y\": nums[1:3]}\n        if cfg[\"x\"] not in fields:\n            return None\n        cols = {c: [] for c in [cfg[\"x\"], *cfg[\"y\"]]}\n        for row in reader:\n            for c in cols:\n                cols[c].append(row.get(c, \"\"))\n\n    n = len(cols[cfg[\"x\"]])\n    step = max(1, n // MAX_CHART_POINTS)\n    traces = []\n    for col in cfg[\"y\"]:\n        traces.append({\n            \"name\": col,\n            \"x\": _to_floats(cols[cfg[\"x\"]][::step]),\n            \"y\": _to_floats(cols[col][::step]),\n        })\n    return {\"title\": cfg.get(\"title\", \"Data plot\"),\n            \"traces\": traces,\n            \"log_y\": bool(cfg.get(\"log_y\")),\n            \"points\": n, \"shown\": len(traces[0][\"x\"]) if traces else 0}\n\n\ndef _numeric_columns(path, fields):\n    with open(path, newline=\"\", encoding=\"utf-8\", errors=\"replace\") as fh:\n        reader = csv.DictReader(fh)\n        sample = [row for _, row in zip(range(50), reader)]\n    nums = []\n    for f in fields:\n        if sample and all(_is_float(r.get(f, \"\")) for r in sample if r.get(f) != \"\"):\n            nums.append(f)\n    return nums\n\n\ndef _is_float(s):\n    try:\n        float(s)\n        return True\n    except (TypeError, ValueError):\n        return False\n\n\ndef _to_floats(values):\n    out = []\n    for v in values:\n        try:\n            out.append(float(v))\n        except (TypeError, ValueError):\n            out.append(None)\n    return out\n\n\n# ---------------------------------------------------------------- live runs / git\n\ndef run_logs():\n    out = []\n    for p in sorted(DATA.glob(\"*-run.log\")):\n        st = p.stat()\n        out.append({\"name\": p.name, \"size\": st.st_size,\n                    \"mtime\": st.st_mtime, \"mtime_iso\": _iso(st.st_mtime)})\n    return out\n\n\n_LOG_NAME = re.compile(r\"^[\\w-]+-run\\.log$\")\n\n\ndef tail_log(name, n=200):\n    \"\"\"Last n lines of a run log. Whitelisted to *-run.log inside DATA.\"\"\"\n    if not _LOG_NAME.match(name):\n        return None\n    path = (DATA / name).resolve()\n    if DATA.resolve() not in path.parents or not path.exists():\n        return None\n    lines = read_text(path).splitlines()\n    return {\"name\": name, \"lines\": lines[-n:], \"total\": len(lines),\n            \"mtime\": _iso(path.stat().st_mtime)}\n\n\ndef git_log(n=12):\n    try:\n        out = subprocess.run(\n            [\"git\", \"-C\", str(REPO), \"log\", \"--oneline\", \"-n\", str(n)],\n            capture_output=True, text=True, encoding=\"utf-8\",\n            errors=\"replace\", timeout=10)\n        # `or \"\"`: a decode failure inside subprocess's reader thread is\n        # swallowed and leaves out.stdout None \u2014 never 500 the page on that.\n        return [l for l in (out.stdout or \"\").splitlines() if l.strip()]\n    except (OSError, subprocess.SubprocessError):\n        return []\n\n\n# ---------------------------------------------------------------- agent conversation DB\n# Nguyen CLI conversation index. Deployed copy lives inside the app tree at\n# web/database/agent.db (user directive 2026-08-27); READ-ONLY like everything else.\n\nAGENT_DB = REPO / \"web\" / \"database\" / \"agent.db\"\n\n\ndef _agent_query(sql, params=()):\n    con = sqlite3.connect(f\"file:{AGENT_DB}?mode=ro\", uri=True)\n    try:\n        con.row_factory = sqlite3.Row\n        return [dict(r) for r in con.execute(sql, params)]\n    finally:\n        con.close()\n\n\ndef agent_available():\n    return AGENT_DB.exists()\n\n\ndef agent_sessions():\n    return _agent_query(\n        \"SELECT id, session_id, title, model, provider, message_count,\"\n        \" prompt_tokens, completion_tokens, total_cost_usd, created_at,\"\n        \" updated_at FROM sessions ORDER BY id\")\n\n\ndef agent_session(spk):\n    rows = _agent_query(\"SELECT * FROM sessions WHERE id = ?\", (spk,))\n    return rows[0] if rows else None\n\n\ndef _fmt_ts(ts):\n    if not ts:\n        return \"\"\n    ts = ts.replace(\"T\", \" \").replace(\"+00:00\", \" UTC\")\n    return ts[:23] + (\" UTC\" if ts.endswith(\"UTC\") and \"UTC\" not in ts[:23] else \"\")\n\n\ndef _decorate_message(row, tool_map=None):\n    \"\"\"Split a message row into display blocks (thinking / text / tool).\"\"\"\n    blocks = []\n    cj = row.get(\"content_json\") or \"\"\n    if cj:\n        try:\n            for b in json.loads(cj):\n                t = b.get(\"type\")\n                if t == \"thinking\":\n                    blocks.append({\"type\": \"thinking\",\n                                   \"text\": b.get(\"thinking\", \"\")})\n                elif t == \"text\":\n                    blocks.append({\"type\": \"text\",\n                                   \"text\": b.get(\"text\", \"\")})\n                elif t == \"tool_use\":\n                    call = (tool_map or {}).get(b.get(\"id\"))\n                    blocks.append({\n                        \"type\": \"tool\",\n                        \"name\": b.get(\"name\", \"?\"),\n                        \"tool_use_id\": b.get(\"id\", \"\"),\n                        \"input\": json.dumps(b.get(\"input\"), indent=2,\n                                            default=str),\n                        \"call\": call,\n                    })\n        except json.JSONDecodeError:\n            pass\n    if not blocks and row.get(\"content\"):\n        blocks.append({\"type\": \"text\", \"text\": row[\"content\"]})\n    return {\n        \"id\": row[\"id\"],\n        \"role\": row.get(\"role\") or \"?\",\n        \"created\": _fmt_ts(row.get(\"created_at\", \"\")),\n        \"model\": row.get(\"model\") or \"\",\n        \"prompt_tokens\": row.get(\"prompt_tokens\"),\n        \"completion_tokens\": row.get(\"completion_tokens\"),\n        \"blocks\": blocks,\n        \"kinds\": {b[\"type\"] for b in blocks},\n        \"raw_json\": cj,\n    }\n\n\ndef _tool_map(spk):\n    out = {}\n    for tc in _agent_query(\n            \"SELECT tool_use_id, tool_name, arguments_json, result_json,\"\n            \" success, error, started_at, completed_at FROM tool_calls\"\n            \" WHERE session_pk = ?\", (spk,)):\n        result = tc.get(\"result_json\") or \"\"\n        try:\n            parsed = json.loads(result) if result else {}\n            if isinstance(parsed, dict):\n                result = parsed.get(\"stdout\", \"\") or json.dumps(parsed, indent=2, default=str)\n            else:\n                result = str(parsed)\n        except json.JSONDecodeError:\n            pass\n        tc[\"result_text\"] = result\n        tc[\"args_text\"] = json.dumps(json.loads(tc[\"arguments_json\"]), indent=2) \\\n            if tc.get(\"arguments_json\") else \"\"\n        tc[\"started\"] = _fmt_ts(tc.get(\"started_at\", \"\"))\n        tc[\"completed\"] = _fmt_ts(tc.get(\"completed_at\", \"\"))\n        if tc.get(\"tool_use_id\"):\n            out[tc[\"tool_use_id\"]] = tc\n    return out\n\n\ndef agent_messages(spk, q=None, kind=None):\n    \"\"\"All messages of a session, decorated; optional FTS search + kind filter.\"\"\"\n    tmap = _tool_map(spk)\n    if q:\n        phrase = '\"' + q.replace('\"', '\"\"') + '\"'\n        try:\n            rows = _agent_query(\n                \"SELECT m.* FROM messages m\"\n                \" JOIN messages_fts f ON f.rowid = m.id\"\n                \" WHERE messages_fts MATCH ? AND m.session_pk = ?\"\n                \" ORDER BY m.id\", (phrase, spk))\n        except sqlite3.OperationalError:\n            rows = []\n    else:\n        rows = _agent_query(\n            \"SELECT * FROM messages WHERE session_pk = ? ORDER BY id\", (spk,))\n    out = [_decorate_message(r, tmap) for r in rows]\n    if kind in (\"user\", \"thinking\", \"text\", \"tool\"):\n        if kind == \"user\":\n            out = [m for m in out if m[\"role\"] == \"user\"]\n        else:\n            out = [m for m in out if kind in m[\"kinds\"]]\n    return out\n\n\ndef agent_message(spk, mid):\n    rows = _agent_query(\n        \"SELECT * FROM messages WHERE session_pk = ? AND id = ?\", (spk, mid))\n    if not rows:\n        return None\n    tmap = _tool_map(spk)\n    msg = _decorate_message(rows[0], tmap)\n    prev = _agent_query(\n        \"SELECT id FROM messages WHERE session_pk = ? AND id < ?\"\n        \" ORDER BY id DESC LIMIT 1\", (spk, mid))\n    nxt = _agent_query(\n        \"SELECT id FROM messages WHERE session_pk = ? AND id > ?\"\n        \" ORDER BY id ASC LIMIT 1\", (spk, mid))\n    pos = _agent_query(\n        \"SELECT COUNT(*) AS c FROM messages WHERE session_pk = ? AND id <= ?\",\n        (spk, mid))[0][\"c\"]\n    total = _agent_query(\n        \"SELECT COUNT(*) AS c FROM messages WHERE session_pk = ?\", (spk,))[0][\"c\"]\n    msg[\"prev_id\"] = prev[0][\"id\"] if prev else None\n    msg[\"next_id\"] = nxt[0][\"id\"] if nxt else None\n    msg[\"position\"] = pos\n    msg[\"total\"] = total\n    return msg\n\n\n# ---------------------------------------------------------------- global search\n\n_SEARCH_MAX_Q = 200\n_SEARCH_MAX_FILES = 100\n_SEARCH_MAX_SNIPPETS = 3\n_SEARCH_WINDOW = 90  # context chars each side of a match\n\n\ndef _snippets(text, terms):\n    \"\"\"Up to _SEARCH_MAX_SNIPPETS (line_no, before, match, after) raw-text\n    tuples around the first well-separated match positions. HTML-escaping\n    is the template's job (autoescape).\"\"\"\n    low = text.lower()\n    positions = []\n    for t in terms:\n        start = 0\n        while True:\n            i = low.find(t, start)\n            if i < 0:\n                break\n            positions.append((i, len(t)))\n            start = i + len(t)\n    positions.sort()\n    out, last_end = [], -10 ** 9\n    for i, ln in positions:\n        if i < last_end + _SEARCH_WINDOW:\n            continue\n        out.append((text.count(\"\\n\", 0, i) + 1,\n                    text[max(0, i - _SEARCH_WINDOW):i],\n                    text[i:i + ln],\n                    text[i + ln:i + ln + _SEARCH_WINDOW]))\n        last_end = i + ln\n        if len(out) >= _SEARCH_MAX_SNIPPETS:\n            break\n    return out\n\n\ndef search_archive(q):\n    \"\"\"Global case-insensitive search across the markdown collections\n    (RH-WEBSITE.md \u00a77 item 1 \u2014 index-free scan-on-query).\n\n    The query is split into whitespace terms; a file matches when EVERY\n    term appears in its text, title, or filename (AND semantics).\n    Results are grouped by collection; hits in ``results`` link to the\n    ledger detail page. Read-only; every file is opened 'r' per query.\n    \"\"\"\n    q = (q or \"\").strip()[:_SEARCH_MAX_Q]\n    if not q:\n        return None\n    terms = q.lower().split()\n    ledger_urls = {Path(r[\"file\"]).stem: r[\"id\"] for r in get_results()}\n    results, total, truncated = {}, 0, False\n    for kind, (folder, ext) in MD_COLLECTIONS.items():\n        hits = []\n        for p in sorted(folder.glob(f\"*{ext}\")):\n            if p.name in (\"index.md\", \"index.txt\"):\n                continue\n            text = read_text(p)\n            low = text.lower()\n            title = _first_heading(p) or p.stem\n            if not all(t in low or t in title.lower() or t in p.stem.lower()\n                       for t in terms):\n                continue\n            if kind == \"results\" and p.stem in ledger_urls:\n                url = f\"/ledger/{ledger_urls[p.stem]}/\"\n            else:\n                url = f\"/{kind}/{p.stem}/\"\n            hits.append({\"name\": p.stem, \"title\": title, \"url\": url,\n                         \"snippets\": _snippets(text, terms)})\n            total += 1\n            if total >= _SEARCH_MAX_FILES:\n                truncated = True\n                break\n        if hits:\n            results[kind] = hits\n        if truncated:\n            break\n    return {\"q\": q, \"terms\": terms, \"results\": results,\n            \"total\": total, \"truncated\": truncated}\n\n\n# ---------------------------------------------------------------- scripts & their data\n\nSCRIPTS_DIR = RESEARCH / \"numerics\" / \"scripts\"\nCSV_PER_PAGE = 500\n\n\ndef _script_data_files(stem, exp_rows):\n    \"\"\"Data files (research/numerics/data) belonging to a script: the\n    experiment-table links (authoritative) UNION exact-stem matches.\"\"\"\n    files, seen = [], set()\n\n    def add(path):\n        path = Path(path)\n        key = str(path).lower()\n        if key in seen or not path.exists():\n            return\n        seen.add(key)\n        files.append({\"name\": path.name, \"path\": path,\n                      \"kind\": path.suffix.lstrip(\".\"),\n                      \"size\": path.stat().st_size,\n                      \"mtime\": _iso(path.stat().st_mtime)})\n\n    for row in exp_rows:\n        for k in (\"csv_file\", \"json_file\"):\n            if row.get(k):\n                p = (REPO / row[k]).resolve()\n                if REPO.resolve() in p.parents:\n                    add(p)\n    for ext in (\".csv\", \".json\"):\n        for q in sorted(DATA.glob(stem + ext)):\n            add(q.resolve())\n    files.sort(key=lambda f: (f[\"kind\"] != \"csv\", f[\"name\"]))  # csv first\n    return files\n\n\ndef _experiments_by_script():\n    by = {}\n    for r in get_experiments():\n        if r.get(\"script\"):\n            by.setdefault(Path(r[\"script\"]).stem, []).append(r)\n    return by\n\n\n_IMPORT_RE = re.compile(r\"^\\s*(?:from|import)\\s+([A-Za-z0-9_]+)\", re.M)\n\n\ndef _script_import_graph():\n    \"\"\"Which script stems are imported as modules by other scripts\n    (e.g. prime_backend_v2). Used to badge non-experiment scripts.\"\"\"\n    stems = {p.stem for p in SCRIPTS_DIR.glob(\"*.py\")}\n    imported_by = {s: set() for s in stems}\n    for p in SCRIPTS_DIR.glob(\"*.py\"):\n        try:\n            src = p.read_text(encoding=\"utf-8\", errors=\"replace\")\n        except OSError:\n            continue\n        for mod in set(_IMPORT_RE.findall(src)):\n            if mod in stems and mod != p.stem:\n                imported_by[mod].add(p.stem)\n    return imported_by\n\n\ndef script_list():\n    by = _experiments_by_script()\n    imported_by = _script_import_graph()\n    out = []\n    for p in sorted(SCRIPTS_DIR.glob(\"*.py\")):\n        rows = by.get(p.stem, [])\n        role, role_note = None, \"\"\n        if not rows:\n            users = sorted(imported_by.get(p.stem, set()))\n            if users:\n                role, role_note = \"library\", \"imported by: \" + \", \".join(users)\n            else:\n                role, role_note = \"utility\", \"utility/diagnostic \u2014 not an experiment\"\n        out.append({\n            \"name\": p.stem, \"file\": p.name,\n            \"experiments\": [r[\"id\"] for r in rows],\n            \"role\": role, \"role_note\": role_note,\n            \"data_files\": [f[\"name\"] for f in _script_data_files(p.stem, rows)],\n            \"size\": p.stat().st_size,\n            \"mtime\": _iso(p.stat().st_mtime),\n        })\n    return out\n\n\ndef script_item(stem):\n    \"\"\"One script + its data files. Path-traversal safe via the resolved-\n    path containment check (same pattern as collection_item).\"\"\"\n    path = (SCRIPTS_DIR / (stem + \".py\")).resolve()\n    if SCRIPTS_DIR.resolve() not in path.parents or not path.exists():\n        return None\n    rows = _experiments_by_script().get(stem, [])\n    return {\"name\": stem, \"file\": path.name,\n            \"experiments\": rows,\n            \"files\": _script_data_files(stem, rows),\n            \"source\": read_text(path),\n            \"mtime\": _iso(path.stat().st_mtime)}\n\n\ndef csv_page(path, page, per=CSV_PER_PAGE):\n    \"\"\"One page of a CSV as a spreadsheet grid: header, numbered rows,\n    right-align flags for numeric columns.\"\"\"\n    with open(path, newline=\"\", encoding=\"utf-8\", errors=\"replace\") as fh:\n        rows = list(csv.reader(fh))\n    if not rows:\n        return None\n    header, body = rows[0], rows[1:]\n    total = len(body)\n    pages = max(1, -(-total // per))\n    page = min(max(1, page), pages)\n    chunk = body[(page - 1) * per: page * per]\n    numeric = []\n    for ci in range(len(header)):\n        vals = [r[ci] for r in chunk[:50] if ci < len(r) and r[ci] != \"\"]\n        numeric.append(bool(vals) and all(_is_float(v) for v in vals))\n    grid = [[{\"v\": cell, \"num\": ci < len(numeric) and numeric[ci]}\n             for ci, cell in enumerate(row)] for row in chunk]\n    return {\"header\": header, \"rows\": grid,\n            \"total\": total, \"page\": page, \"pages\": pages, \"per\": per,\n            \"first_line\": (page - 1) * per + 2}  # CSV line no. (header = 1)\n\n\ndef json_pretty(path, cap=200_000):\n    try:\n        text = json.dumps(json.loads(read_text(path)),\n                          indent=2, ensure_ascii=False)\n    except (json.JSONDecodeError, OSError):\n        return None\n    if len(text) > cap:\n        return text[:cap] + f\"\\n\u2026 (truncated at {cap:,} chars)\"\n    return text\n\n\n# ---------------------------------------------------------------- Lean formalization\n\nLEAN_ROOT = RESEARCH / \"lean\" / \"NguyenRH1\"\nLEAN_SRC = LEAN_ROOT / \"NguyenRH1\"\n\n_DECL_LINE_RE = re.compile(\n    r\"^(theorem|lemma|def|structure|class|instance|abbrev)\\s+(\\S+)\")\n_SORRY_RE = re.compile(r\"\\bby\\s+sorry\\b|:=\\s*sorry\\b\")\n\n\ndef _lean_decls(text):\n    out = []\n    for i, line in enumerate(text.splitlines(), 1):\n        m = _DECL_LINE_RE.match(line)\n        if m:\n            out.append({\"kind\": m.group(1), \"name\": m.group(2), \"line\": i})\n    return out\n\n\ndef lean_toolchain():\n    p = LEAN_ROOT / \"lean-toolchain\"\n    return read_text(p).strip() if p.exists() else \"\"\n\n\ndef _lean_file_row(p):\n    text = read_text(p)\n    return {\"name\": p.stem, \"file\": p.name,\n            \"lines\": text.count(\"\\n\") + 1,\n            \"decls\": len(_lean_decls(text)),\n            \"sorries\": len(_SORRY_RE.findall(text)),\n            \"mtime\": _iso(p.stat().st_mtime)}\n\n\ndef lean_files():\n    return [_lean_file_row(p) for p in sorted(LEAN_SRC.glob(\"*.lean\"))]\n\n\ndef lean_audits():\n    out = []\n    for p in sorted(LEAN_ROOT.glob(\"audit-session*-axioms.txt\")):\n        text = read_text(p)\n        out.append({\"name\": p.stem, \"file\": p.name,\n                    \"decls\": text.count(\"depends on axioms\"),\n                    \"sorries\": text.count(\"sorryAx\"),\n                    \"clean\": \"sorryAx\" not in text,\n                    \"mtime\": _iso(p.stat().st_mtime)})\n    return out\n\n\ndef lean_item(name):\n    \"\"\"One Lean source file + parsed declarations. Containment-checked.\"\"\"\n    path = (LEAN_SRC / (name + \".lean\")).resolve()\n    if LEAN_SRC.resolve() not in path.parents or not path.exists():\n        return None\n    text = read_text(path)\n    return {\"name\": name, \"file\": path.name, \"source\": text,\n            \"lines\": text.count(\"\\n\") + 1,\n            \"decls\": _lean_decls(text),\n            \"sorries\": len(_SORRY_RE.findall(text)),\n            \"mtime\": _iso(path.stat().st_mtime)}\n\n\ndef lean_audit_item(name):\n    path = (LEAN_ROOT / (name + \".txt\")).resolve()\n    if LEAN_ROOT.resolve() not in path.parents or not path.exists():\n        return None\n    text = read_text(path)\n    return {\"name\": name, \"file\": path.name, \"text\": text,\n            \"decls\": text.count(\"depends on axioms\"),\n            \"sorries\": text.count(\"sorryAx\"),\n            \"clean\": \"sorryAx\" not in text,\n            \"mtime\": _iso(path.stat().st_mtime)}\n\n\ndef lean_closed_source():\n    p = LEAN_SRC / \"LiClosed.lean\"\n    return read_text(p) if p.exists() else \"\"\n\n\n_LEAN_PERIMETER = [\n    (\"RHUpTo\", \"LiSkeleton\",\n     \"Platt\u2013Trudgian computational certificate: RH verified to height T\u2080 = 3\u00d710\u00b9\u00b2.\"),\n    (\"LiVerifiedUpTo\", \"LiSkeleton\",\n     \"Finite Li-coefficient verification (our tables to n = 3000 + Johansson 2015 \u00a7 4.2 to 10\u2075).\"),\n    (\"ZeroCountProp\", \"LiContour\",\n     \"Trudgian N(T)/S(T): unit-window zero count, multiplicity-weighted.\"),\n    (\"ZeroCountProp2\", \"LiContour\",\n     \"Trudgian two-unit window specialization.\"),\n    (\"ZeroCountGlobalProp\", \"LiContour\",\n     \"Trudgian global N(T) bound.\"),\n    (\"NoLowZeros\", \"LiContour\",\n     \"Platt-class zero-location certificate: no zeros with |\u03b3| < 14.\"),\n    (\"MZeroProp\", \"LiContour\",\n     \"M\u2080 interval certificate (the low-|t| gap bound).\"),\n]\n\n\ndef _extract_lean_def(file_stem, def_name):\n    \"\"\"The verbatim `def NAME` block (indented continuation lines included)\n    + its 1-based start line.\"\"\"\n    p = LEAN_SRC / (file_stem + \".lean\")\n    if not p.exists():\n        return None\n    lines = read_text(p).splitlines()\n    pat = re.compile(rf\"^(?:def|abbrev|structure|class)\\s+{re.escape(def_name)}\\b\")\n    for i, line in enumerate(lines):\n        if pat.match(line):\n            block = [line]\n            j = i + 1\n            while j < len(lines) and (not lines[j].strip()\n                                      or lines[j][0].isspace()):\n                block.append(lines[j])\n                j += 1\n            while block and not block[-1].strip():\n                block.pop()\n            return {\"text\": \"\\n\".join(block), \"line\": i + 1}\n    return None\n\n\ndef lean_perimeter():\n    out = []\n    for name, src, note in _LEAN_PERIMETER:\n        d = _extract_lean_def(src, name) or {\"text\": \"(not found)\", \"line\": None}\n        out.append({\"name\": name, \"file\": src + \".lean\", \"note\": note, **d})\n    return out\n\n\ndef summary_stats():\n    return {\n        \"results\": len(get_results()),\n        \"experiments\": len(get_experiments()),\n        \"derivations\": len(get_derivations()),\n        \"graveyard\": len(get_graveyard()),\n        \"sessions\": len(get_sessions()),\n        \"checklist\": parse_checklist(),\n    }\n",
  "structuredPatch": [
    {
      "oldStart": 167,
      "oldLines": 20,
      "newStart": 167,
      "newLines": 6,
      "lines": [
        "     return \"\\n\".join(out)",
        " ",
        " ",
        "-_TASK_MARK_RE = re.compile(r\"(<li>\\s*(?:<p>)?)(?:\\[(x|~| )\\]|(\u2611))\")",
        "-_TASK_MARK_CLASS = {\"x\": \"x\", \"~\": \"tilde\", \" \": \"open\"}",
        "-",
        "-",
        "-def _task_mark_span(m):",
        "-    \"\"\"Wrap a leading checklist marker in a styled span (display-only;",
        "-    the marker text itself stays verbatim).\"\"\"",
        "-    if m.group(3) is not None:  # \u2611 done \u2014 blue box, same size as [~]/[ ]",
        "-        return m.group(1) + '<span class=\"tkm tkm-check\">\u2611</span>'",
        "-    cls = _TASK_MARK_CLASS[m.group(2)]",
        "-    return (m.group(1) + '<span class=\"tkm tkm-' + cls + '\">['",
        "-            + m.group(2) + \"]</span>\")",
        "-",
        "-",
        " def render_markdown(text):",
        "     \"\"\"Render markdown, protecting $...$ math spans for MathJax.\"\"\"",
        "     store = []"
      ]
    },
    {
      "oldStart": 194,
      "oldLines": 7,
      "newStart": 180,
      "newLines": 7,
      "lines": [
        "         protected, extensions=[\"tables\", \"fenced_code\", \"sane_lists\"])",
        "     for i, s in enumerate(store):",
        "         html = html.replace(f\"@@MATH{i}@@\", s)",
        "-    return _TASK_MARK_RE.sub(_task_mark_span, html)",
        "+    return html",
        " ",
        " ",
        " # ---------------------------------------------------------------- markdown collections"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-003-finite-Gtilde.py",
  "old_string": "        print(f\"[{name}] tr/N={trG/Nf:.4f}  HS\u00b2/N={hs2/Nf:.4f} \"\n              f\"(R={R_expected[name]:.4f})  rank={rank_num}  \"\n              f\"min_ev={min_ev:.2e}  (4tr\u22122N\u2212HS\u00b2)/N={lb/Nf:.4f} \"\n              f\"({time.time()-t1:.0f}s)\", flush=True)",
  "new_string": "        print(f\"[{name}] tr/N={trG/Nf:.4f}  HS2/N={hs2/Nf:.4f} \"\n              f\"(R={R_expected[name]:.4f})  rank={rank_num}  \"\n              f\"min_ev={min_ev:.2e}  (4tr-2N-HS2)/N={lb/Nf:.4f} \"\n              f\"({time.time()-t1:.0f}s)\", flush=True)"
}

{
  "filePath": "D:\\Python\\Quantum\\NGUYEN.md",
  "oldString": "- [~] ii\u2032-6-DL F-D DOG-LEG REPAIR (ACTIVE, 2026-08-25, user directive;",
  "newString": "- [x] ii\u2032-6-DL F-D DOG-LEG REPAIR (COMPLETE, 2026-08-25, user directive;",
  "originalFile": "# PROJECT: NGUYEN-RH-1\n\n**The Riemann Hypothesis Challenge** \u2014 Autonomous Agent Research Blueprint\n\nCreated: [08-17-2026] | Status: ACTIVE | Version: 1.0\n\n## 1. MISSION STATEMENT\n\nProve (or make maximal rigorous progress toward) the Riemann\nHypothesis: all nontrivial zeros of \u03b6(s) satisfy Re(s) = 1/2.\nPrimary launchpad: the Anthropic paper proving \u2265 2/3 of zeros are\nsimple and on the critical line, unconditionally.\n\n## 2. RESOURCE MANIFEST\n\n| ID | Resource | Contents | Use |\n|----|----------|----------|-----|\n| R1 | notes.txt | RH Wikipedia link; Physics Hypertextbook (https://physics.info/ \u2014 all physics equations); full quantum-mechanics equation list (Schr\u00f6dinger eqs, commutators, uncertainty, angular momentum, Pauli matrices, hydrogen atom, harmonic oscillator, Heisenberg picture, Ehrenfest) | Track B spectral/Hilbert\u2013P\u00f3lya modeling |\n| R2 | Anthropic Riemann Hypothesis Paper.pdf | Theorems A & B (2/3 simple+on-line, 5/6 distinct); Weil-form compression G\u0303 = P + Q; rank\u2013trace inequality; Montgomery unconditional second moment; window theory R(\u03c8); sharpness analysis \u00a77.2; Lean 4 verification | Foundation for Track A; formal infra for Track D |\n| R3 | zeta-23-lean repo (tag v1.0) | Lean 4 formalization, counting functions vs Mathlib riemannZeta | Track D |\n| R4 | Cited literature ([Mon73]\u2026[GS26]) | Full method genealogy | All tracks |\n| R5 | Python stack (mpmath, sympy, numpy, scipy) | zetazero, numerical Weil forms, SDP | Numerics |\n| R6 | Compute resources | Local: Ryzen 9 7945HX 16c/32t, 64GB, RTX 4090 Laptop 16GB (CUDA 8.9). On request (ask user first, user provisions): Lambda AI multi-GPU cloud (SSH); IBM Quantum (no identified need as of 2026-08-17 \u2014 RH compute is classical) | Scaling numerics |\n| R7 | research/resources/ atlas (43 notes) | User-provided RH-equivalence atlas, step-by-step derivations of ~60 equations: all major RH criteria (Li, Lagarias, Robin, Nyman\u2013Beurling, Redheffer, Mertens, Riesz&H\u2013L, Salem, Volchkov, Franel\u2013Landau, Speiser, de Bruijn\u2013Newman, von Koch\u2013Schoenfeld, Hilbert\u2013P\u00f3lya), zero-counting/explicit formulas, RMT statistics, foundations. Index: research/resources/index.md | All tracks; cross-pollination reservoir (\u00a74A); D-037 direct inputs |\n\n## 3. KEY KNOWNS (inherited state of the art)\n\n- \u2265 2/3 zeros simple & on line; \u2265 5/6 distinct [R2, unconditional].\n- Montgomery\u2013Taylor window: 0.6725 / 0.83625; window-class optimum.\n- Bandwidth-one certificate ceiling \u2248 0.682 [R2 \u00a77.2].\n- Weil positivity on all of C\u00b2_c(\u211d) \u27fa RH [Weil, Bombieri].\n- Negative index of truncated Weil form counts off-line pairs [Bom00].\n- Obstruction map: X \u226b T needs prime-pair info; higher moments need\n  Rudnick\u2013Sarnak X^k \u2264 T^{2\u2212\u03b5}; HL*(\u221e) \u27f9 100% but not RH itself.\n- Any proof must FAIL for Davenport\u2013Heilbronn / Epstein zeta\n  (sanity gate \u2014 these violate RH-analogues).\n\n## 4. ATTACK TRACKS\n\n- **A. Certificate extension** (moments, windows, SDP, prime pairs)\n- **B. Spectral / Hilbert\u2013P\u00f3lya** (quantum formalism from R1; Gabor\n  frame \u2194 self-adjoint operator; Berry\u2013Keating; de Branges)\n- **C. Positivity criteria** (Weil growing support, Li coefficients,\n  de Bruijn\u2013Newman \u039b = 0)\n- **D. Formal verification** (Lean 4 skeletons for every lemma)\n\n## 4A. KNOWLEDGE INTEGRATION & EXTERNAL RESEARCH (STANDING ORDER)\n\nGoal reminder: solve RH by COMBINING all knowledge at our disposal.\n1. **Use the full equation inventory.** Every attack must actively consider\n   the complete toolset \u2014 quantum formalism (R1), analytic number theory\n   (R2, R4), spectral theory, random matrix theory, physics equations\n   (physics.info) \u2014 and seek cross-domain combinations, never stay inside\n   a single track by default.\n2. **Cross-pollination check.** Before abandoning any approach, ask: which\n   OTHER track's machinery could close this gap? Log cross-track ideas in\n   the session journal even when not pursued.\n3. **Web research before obstruction.** When knowledge is missing, research\n   the web (arXiv, surveys, MathOverflow, LMFDB, OEIS) BEFORE declaring a\n   dead end. Record every external source used \u2014 URL, what was taken, date \u2014\n   in the derivation/result file; paper-worthy sources go to references.bib.\n4. **Master tool index.** research/derivations/D-001 (built in Phase 0.1)\n   is the living index of all usable equations/tools; every newly\n   discovered tool is added there so no later session rediscovers it.\n5. **NO-BOUNDARIES RULE (user directive, 2026-08-17).** Do not merely\n   follow what has been done. The metric is success on the ultimate goal,\n   not fidelity to any tradition. Actively import ANY domain of human\n   knowledge that could crack a wall in the obstruction map (D-006 \u00a76) \u2014\n   no field is off-limits. Candidate reservoirs to sweep systematically:\n   random matrix theory & free probability; operator theory (de Branges,\n   Krein, canonical systems); harmonic analysis (uncertainty principles,\n   restriction theory, Beurling\u2013Malliavin); mathematical physics\n   (integrable systems, quantum chaos, scattering); probability (Gaussian\n   processes, determinantal point processes); algebraic geometry & finite\n   fields (Weil's proof for curves \u2014 the ONE case RH is proven); p-adic\n   and adelic methods; ergodic theory; information theory; optimization\n   (SDP/SOS hierarchies); machine-assisted discovery. At each phase\n   boundary, run a DOMAIN SWEEP: list the current walls, ask which\n   untouched field has machinery shaped like each wall, web-research the\n   top candidates (per \u00a74A.3), and log findings in D-001 Part III \u2014\n   including negative ones (a field that provably does not apply is\n   documented progress).\n\n## 5. PROJECT PLAN & CHECKLIST\n\n\u26a0 THE PLAN IS NOT CONCRETE. This is research: the plan and checklist may be\nupdated, extended, reordered, or pruned at ANY time as results demand.\nNever follow the checklist at the expense of the ultimate goal \u2014 solving\nthe Riemann Hypothesis. If a promising direction appears that is not in the\nplan, the plan changes, not the direction. All plan changes are committed\nto git with a one-line rationale.\n\n### \u2705 PHASE 0 \u2014 Initialization & Ingestion (COMPLETE 2026-08-17)\n\n- [x] 0.1 Parse notes.txt; index all quantum equations for Track B.\n      - \u2192 research/derivations/D-001 (living master tool index, Part I done)\n- [x] 0.2 Deep-read Anthropic paper; reproduce chain (1.2) line by line.\n      - \u2192 D-002 (statements/notation), D-003 (zero side), D-004 (prime side),\n      D-005 (linear algebra + chain), D-006 (sharpness/ceiling + Lean)\n- [x] 0.3 Reproduce Lemma 3.2 (rank\u2013trace) proof independently.\n      - \u2192 research/derivations/D-005 (all four loss-points mapped; equality case confirmed)\n- [x] 0.4 Verify R(\u03c8\u2080) = 4/3 and R(\u03c8_MT) = \u00bd + (1/\u221a2)cot(1/\u221a2) symbolically.\n      - \u2192 E-001 (sympy + mpmath, 60-digit): both PASS. Caught a hand-arithmetic\n      slip in D-004 (correct: R(\u03c8_MT) = 1.32749930, 2\u2212R = 0.67250070).\n- [x] 0.5 Clone/inspect zeta-23-lean structure; confirm axiom audit.\n      - \u2192 D-007 (cloned at v1.0=3635e74; static audit consistent with\n      AUDIT.md: 0 real axioms, sorries only in trusted challenge stubs;\n      full lake rebuild deferred to Track D)\n- [x] 0.6 Numerical sandbox: compute first 10\u2074 zeros; build finite G\u0303;\n        confirm tr, \u2016\u00b7\u2016\u00b2_HS, inertia predictions empirically.\n      - \u2192 E-002 (10\u2074 zeros @ dps 25, all checks pass), E-003 (finite G\u0303 at\n      T=1000/2000/4000, both windows: tr\u2248N to 0.1%, HS\u00b2/N tracks R(\u03c8)\n      with O(1/L) decay as Thm 5.7 predicts, PSD confirmed). Summary: D-008.\n\n### \u2705 PHASE 1 \u2014 Master the Ceiling (Track A groundwork) (COMPLETE 2026-08-20 \u2014 decision gate 1.5/D-013: NO within current data class, Track A \u2192 monitoring mode; 1.2 closed as deferred)\n\n- [x] 1.1 Re-derive the bandwidth-one ceiling \u2248 0.682; identify every\n        inequality that is not tight.\n      - \u2192 D-009 (ceiling re-derived from kernel-checked Lean; inventory:\n      4 chain losses, 4 ceiling losses, 3 structural gaps; zero-density\n      route RULED OUT with reason; new candidate: multiple-zero bounds\n      as extra chain constraint \u2014 not ceiling-constrained)\n- [x] 1.2 Test window families beyond C\u00b2[\u2212\u00bd,\u00bd]; SDP over certificates\n        (CGdL20 style) numerically. \u2192 CLOSED-DEFERRED by decision\n        (calibration value only; E-005 testbed already provides CMS\n        machinery; D-013 rationale)\n- [x] 1.3 Investigate third moment tr G\u0303\u00b3 paths: what fragment of\n        [Hej94, RS96] survives unconditionally?\n      - \u2192 ANSWER: none usefully. D-011 (wall: availability \u03bb\u22642/k vs cap \u03bb)\n      + E-005 (model-decisive) \u2192 G-002. Moment ladder CLOSED both sides.\n- [x] 1.4 Attempt any unconditional support-(1+\u03b4) form-factor result.\n      - \u2192 D-012: none exists; missing input located EXACTLY (prime pairs\n      at lag h \u2272 X/T). Literature logged (D-001 Part III).\n- [x] 1.5 DECISION GATE: is > 2/3 achievable in this framework? Document.\n      - \u2192 D-013: NO within current data class; 6-wall map (W1\u2013W6);\n      necessary conditions for any fix; routes ranked. Track A \u2192\n      monitoring mode; proceed to Tracks B/C.\n- [x] 1.6 \u03be\u2032-world bandwidth-one ceiling (LawN256 analogue) (NEW,\n        2026-08-18 regroup).\n      - \u2192 ANSWER: saturated. E-020b/D-030: window-class optimum for kernel\n      D\u2081 = 0.86864 to 1e-6 \u2014 the paper's quartic window IS optimal\n      (control recovers MT 1.32749930 to 1.7e-7). The perfect-square\n      node buys ~0 headroom beyond the paper's window; nothing transfers\n      to \u03be. Adversary-side LP (E-020) documented as machinery\n      limitation (finite pool can't realize the extremal adversary).\n- [x] 1.7 T4b scoping (NEW, 2026-08-18 regroup).\n      - \u2192 CLOSED with rationale (D-031): the mechanism iterates formally\n      (prime polynomial degree k \u2192 k nodes; \u03be\u2033 leading-order \u2248 0.94),\n      but (i) certificates certify \u03be\u207d\u1d4f\u207e zeros only, (ii) the G-001\n      substitution symmetry caps every \u03be\u207d\u1d4f\u207e data class below 100%, so\n      the Speiser/Levinson\u2013Montgomery route to RH is closed at every\n      derivative order, (iii) cost per derivative is high. Revival\n      condition noted (\u03be-side input route or Suzuki-line need).\n\n### \ud83d\udd36 PHASE 2 \u2014 Spectral Program (Track B) (MAPPED TO EXHAUSTION at current technology, 2026-08-19 \u2014 parked: 2.2/2.3/2.5 unprioritized; live remainder: 2.9 (L1, L3/L4 skeleton) \u2192 Paper B / post-publication)\n\nNOTE (2026-08-18 regroup): the Suzuki finite-interval operator program\n(spawned by 3.4c) IS the live realization of this phase \u2014 Suzuki's T_a is\na canonical-system / de Branges-type construction (2.4), its Galerkin\nrealization is a validated \u27e8\u03c8|\u0124|\u03c8\u27e9 model (2.1), and Suzuki Cor 1.6 gives\nan explicit RH-equivalent convergence target (success criterion #3).\nItems 2.6\u20132.8 are the active queue; 2.2/2.3 remain open, unprioritized.\n- [~] 2.1 Map Weil form W to candidate quadratic forms \u27e8\u03c8|\u0124|\u03c8\u27e9 using\n        R1 operator formalism (self-adjointness \u27fa real spectrum \u27fa RH).\n      - \u2192 PARTIAL: Suzuki A_a Galerkin = validated Weil-form operator\n      (ledger #1; E-009a/b, D-019). General \u0124 construction: open.\n- [ ] 2.2 Analyze Berry\u2013Keating \u0124 = \u00bd(x\u0302p\u0302+p\u0302x\u0302) with boundary\n        regularizations; compare counting function to N(T). (untouched)\n- [ ] 2.3 Exploit paper's Lemma 2.1 (Poisson\u2013Gabor, critical density\n        h = 2\u03c0/L, no aliasing) as a frame for an operator model. (untouched)\n- [~] 2.4 Examine de Branges space / canonical system reformulation.\n      - \u2192 ACTIVE via Suzuki line: Q-S2 (\u210b(T_a) as de Branges-type space,\n      D-019); W(a,\u03b8;z) all-real zeros (Thm 1.5) + exact interlacing\n      measured (E-014 H1, E-016 F1).\n- [ ] 2.5 DECISION GATE: any genuine self-adjoint realization? Document.\n- [x] 2.6 (Q-S3c remainder) Root-cause E-016 V3 Herglotz reconstruction\n        mismatch.\n      - \u2192 RESOLVED (E-016b/E-016c, D-025): TWO recon-side defects, analytic\n      side exact (V6: direct float64 vs dps-50 \u2264 4.4e-15 to y=40).\n      (i) Galerkin W has a double zero at z\u22480 (pair \u00b1i\u03b5, \u03b5~2\u20136e-9 \u2014\n      Galerkin artifact vs Thm 1.5; found by NEW winding-excess\n      diagnostic; explains D-024 F3 \"defect at the origin\"); (ii) EM\n      tail had a spurious factor y (predicts the y=20 deficit EXACTLY at\n      both a=4 and a=10). Candidates (a)/(c) refuted. V3 REPAIRED:\n      V3R 1.99e-5 (a=4), 1.46e-5 (a=10) vs 0.02 threshold. E-016 F1\u2013F4\n      stand. Remaining: small-y-weighted \u03b8-metric (folds into 2.8).\n- [x] 2.7 (Q-S3a, analytic) Prove/disprove v\u00b1(a,\u00b7) \u2192 A_\u221e^{\u22121}e^{\u00b1\u00b7} in a\n        norm that controls W on compacts.\n      - \u2192 ANSWERED STRUCTURALLY (D-026, R-003, E-017/D-027): the question\n      is REPLACED by an EXACT factorization W = F\u00b7(R\u2080 + R_\u03c4),\n      F = z\u00b2\u03be/\u03be\u2032, with R\u2080 = 2e^{a+i\u03b8/2}sin(az\u2212\u03b8/2) + o(e\u1d43) closed form.\n      Cor 1.6 \u27fa (\u2605): tail R_\u03c4 cancels the sine skeleton up to a\n      zero-free remainder \u2014 a finite-interval Wiener\u2013Hopf remainder\n      estimate on the symbol \u011d = z\u207b\u00b2\u03be\u2032/\u03be (RH-gated factorization).\n      Explains ALL measured phenomenology incl. the origin double zero.\n      E-017: (\u2605) already ~99.8% complete OFF the real axis at a=4; \u03b8=\u03c0\n      preferred quantitatively (4.7% vs 6.8%); transition = cancellation\n      descending to \u211d. Open content isolated: (\u2605) on \u211d.\n- [x] 2.8 (Q-S3b, numerics) Prime-sum backend redesign \u2192 a ~ 12\u201314;\n        track \u03b8=\u03c0 zero flow; test z\u2081\u00b7a \u2248 4.5 stiff law vs limit.\n      - \u2192 COMPLETE at a=12 (E-018/E-019, D-028/D-029): backend v2\n      (blockwise \u039b, e\u00b2\u2074, validated 2.2e-7) built; descent profile shows\n      (\u2605) strip-uniform (~5\u20137e-3); a=12 zero-flow: maximal lattice\n      (1145/1146), stiff law z\u2081\u00b7a = 4.495, lattice STIFFENS (gap CV \u2193),\n      origin pair persists (+2.0000 winding excess), no non-real zeros,\n      envelope stationary. NO transition at\n      a \u2264 12 \u2014 question answered; a=13+ deprioritized by evidence\n      (revivable in ~30 min via backend cache). Key structural gain\n      (D-028): the open content of Cor 1.6 is the zero set of M, not\n      its envelope. [ERRATUM 2026-08-19, D-043 \u00a7C: the \"\u03b3-proximity\n      chance-level\" claim is RETRACTED \u2014 wrong-direction metric;\n      correct metric shows quadratic positional locking ~0.65/a\u00b2.]\n- [~] 2.9 (\u2605) analytic attack (NEW, 2026-08-18; design D-034/D-035\n        complete). Resolvent-convergence route: prove v\u00b1(a)\u2192v\u00b1(\u221e) in\n        the Krein-space \u210b(T)-norm \u27f9 D_{a,\u03b8(a)} \u2192 D strong resolvent\n        (Krein formalism) \u27f9 \"Cor 1.6 \u27fa D has real spectrum\" (deliverable\n        D1, criterion-3-shaped). Wall mapped: W-1 index unknown, W-2\n        real-spectrum persistence = RH, W-3 factorization circular for\n        proofs. Sub-tasks 2.10/2.11 support.\n      - \u2192 D1 COMPLETE (session 008, D-041): Theorem D1 (deficiency\n      convergence \u27fa strong resolvent convergence) stated with proof\n      skeleton; reduction \"(1.12) \u27fa spec(D) \u2282 \u211d\" assembled (\u21d2 Suzuki\n      Cor 1.6; \u21d0 via L3/L4 WH literature assembly); lemma map\n      L0\u2013L4/W1\u2013W3; limit extension identified as the \u03c0/2 one (Suzuki\n      \u00a77.2\u20137.5); D-040 \u0394-constraint formalized as necessary conditions\n      N1\u2013N3 \u2014 the \u03b8(a) flow is obligatory, target the \u03c0/2-extension.\n      Remaining: L1 (unconditional embedding), L3/L4 (WH class\n      assembly), \u03b8(a) theory (\u2192 2.12).\n- [x] 2.10 (E-022/E-022b, D-040) Spectral-measure convergence numerics\n        (D-035 D2). COMPLETE (session 008): Clark/de Branges spectral\n        measures \u03bc_a = \u03a3 (1/K_a(z_k,z_k))\u03b4_{z_k} computed for a \u2264 12\n        (V0\u2013V3 pass). Findings: mass conservation (\u2248184, a-independent);\n        coarse weak metric FLAT; **K_a(z,z) has deep valleys exactly at\n        the true \u03b3's** (\u0394(a) = 2.16\u21922.94, corr(d,log K) \u2248 +0.4) \u2014 the\n        \u03b3-information flows through the WEIGHTS, not the positions\n        (within-z-bin + shifted-null controlled); mass within \u00b10.1 of\n        \u03b3's 63%\u219272.5%; **\u0394(a) \u2248 3.33 \u2212 4.76/a SATURATES at fixed \u03b8=\u03c0**\n        \u2014 fixed-\u03b8 ceiling; consolidation (\u0394\u2192\u221e) requires the \u03b8(a) flow\n        (new constraint on 2.9-D1). \u0394(a) is now the sharp, cheap\n        convergence probe for any candidate \u03b8(a).\n- [x] 2.11 (D-038) Transition-scale lower bound from skeleton + E-019\n        data: quantify the a-scale at which (\u2605)-consistent consolidation\n        must begin (D-035 D3). [NEW 2026-08-18]\n      - \u2192 COMPLETE (session 008, D-038): consolidation functional\n      R(a) = (aZ/\u03c0)e^{\u2212\u0394(a)} (validated 15% vs measured residual);\n      onset criterion \u0394\u2032(a) > 1/a; margin C(a) = \u0394 \u2212 log a decreasing\n      0.77 \u2192 0.46 (a = 4\u219212); **a* > 12**; fixed-\u03b8 consolidation\n      asymptotically IMPOSSIBLE (saturation ceiling vs log a growth).\n- [x] 2.12 (E-024, D-042) \u03b8-flow numerics. COMPLETE (session 008):\n      - **\u03b8-INDEPENDENCE proved numerically** (residual spread \u2264 2.2%,\n      valley masses \u2248 1.00 for all \u03b8; only lattice phase responds) \u2014\n      the \u03b8(a) flow CANNOT drive consolidation (de Branges prediction\n      confirmed); channel closed by evidence. **Linear-K law found**:\n      K_plateau \u2248 1.9a (\u2248 (6/\u03c0)a, 5 points to 0.3%), valley floor \u2248 1\n      (mass gauge m_\u03b3 = 1) \u27f9 residual \u2192 Z/6 \u2260 0 \u2014 the family\n      equilibrates EXACTLY at the consolidation boundary (margin\n      C(a) \u2192 0.4 const). Consolidation channel relocated to Suzuki's\n      own lever: \u03bb \u2192 \u03bb_a\u207b (ground-state regime, sister conjecture\n      (1.2)) \u2192 task 2.13. [ERRATUM 2026-08-19 (D-060): the 1.9a fit /\n      Z/6 residual are superseded by D-045 \u2014 plateau K/(2a) \u2192 1\n      (measured 0.973\u20130.997), residual \u2192 Z/(2\u03c0); the equilibrium\n      conclusion is unchanged.]\n- [x] 2.13 (E-025, D-043) \u03bb-flow numerics. COMPLETE (session 008):\n      (A) **discretization floor found**: pencil bottom crosses 0 at\n      a \u2248 5.2 (h=0.01), O(h) artifact \u2192 0; true \u03bb_a unresolvable for\n      a \u2273 3 \u2014 the \u03bb\u2192\u03bb_a\u207b experiment is machinery-limited (D-019 F1's\n      cliff tail = floor, upper bounds stand). (B) \u03bb-flow RESPONSE\n      confirmed qualitatively: near-singular T \u27f9 \u0394 deepens (2.2\u21927.0 at\n      a=4), residual drops 48\u219211 \u2014 but the approached mode at a \u2265 6 is\n      the artifact mode (sister corr \u2248 0). (C) **MAJOR CORRECTION**:\n      E-019's \"\u03b3-proximity chance-level\" was a wrong-direction metric;\n      correct direction shows **quadratic positional locking\n      ~0.65/a\u00b2**, improving through a=12 (D-029 erratum). Revised\n      picture: positions lock + weights concentrate; obstruction =\n      excess-zero outflow + residual \u2192 Z/6 (linear-K equilibrium).\n      - [ERRATUM 2026-08-19 (D-060): residual \u2192 Z/(2\u03c0) per D-045; the\n      obstruction conclusion is unchanged.]\n\n### \u2705 PHASE 3 \u2014 Positivity Criteria (Track C) (COMPLETE 2026-08-19 \u2014 3.1\u20133.8 all answered/closed, R-004 full tag; 3.1/3.2 closed by evidence, 3.5 fulfilled via 3.6\u20133.8)\n\n- [x] 3.1 Weil positivity on supports [\u2212a,a], push a beyond Yoshida.\n      - \u2192 ANSWERED/CLOSED by evidence: landscape mapped (D-014);\n      E-006/D-015: positivity horizon resolution-limited at 1e-10;\n      E-007/E-007b + D-017: floor decays ~e^{\u22121.65a}; pushing further\n      needs new conditioning machinery.\n- [x] 3.2 Li coefficients \u03bb_n: numerics to n ~ 10\u2075; asymptotic attack.\n      - \u2192 E-008: zero-side table certifies \u03bb_n > 0 for n \u2264 116 (explicit\n      tail bound). E-011/R-001: arithmetic side (BL Thm 2, zero-free,\n      flint Stieltjes + Arb \u03b6, dps 1000) \u03bb_n > 0 \u2200 n \u2264 2000,\n      cross-validated vs E-008; refined asymptotic ratio 1.00216 at\n      n = 2000. E-015 (session 005, detached): extended to n \u2264 3000,\n      ALL CHECKS PASS (dps 1450; \u03bb_3000 = 8617.2192; ratio 0.999845).\n      Next: asymptotic attack \u2192 task 3.5; further pushes (cost ~n\u2074:\n      n=4000 \u2248 9 h) only in support of 3.5 (e.g. ratio trend data).\n      CLOSED 2026-08-20: the n ~ 10\u2075 own-table target is superseded \u2014\n      R-004's finite verification uses our table to 3000 + (session-042\n      correction: Johansson 2015 \u00a7 4.2's rigorous ordinary-\u03bb_n table to\n      10\u2075, replacing the retracted Misguich\u2013Voros citation, which\n      concerned a deformed sequence), and 3.5's deliverable was\n      achieved via 3.6\u20133.8 (R-004).\n- [x] 3.3 de Bruijn\u2013Newman: study heat-flow dynamics of zeros; can the\n        paper's 2/3 density constrain \u039b?\n      - \u2192 ANSWER: NO \u2014 one-sided information (D-021): theorem lower-bounds\n      on-line fraction, \u039b needs an upper bound on the complex fraction;\n      plus extremal-vs-averaged (E-012: collision times span 4.5 orders,\n      two-body accurate to 4.8% vs full ODE) and asymptotic-vs-explicit.\n      Route \u2192 G-003 (do not retry with stronger density results).\n- [x] 3.4 Cross-pollinate: does 2/3-simplicity feed any criterion?\n      - \u2192 ANSWER: YES \u2014 it fed the Suzuki operator line, now the live\n      spectral program. 3.4a CLOSED (D-016, scale mismatch); 3.4b floor\n      decay (D-017); 3.4c COMPLETE (Suzuki operators: D-018, E-009a/b,\n      D-019 \u2014 \u03bb_a cliff; Galerkin Weil form validated 4.5e-6; E-010/\n      D-020 lattice law). Continuation moved to Phase 2 (2.6\u20132.8) as of\n      the 2026-08-18 regroup.\n- [x] 3.5 Li-coefficient asymptotic attack (NEW, 2026-08-18 regroup).\n      - \u2192 DESIGN COMPLETE (D-032/D-033, session 006 cont.7). Voros:\n      \"\u03bb_n > 0 \u2200 n \u2265 N\u2080\" \u27fa RH at ANY N\u2080 \u2014 no partial version exists.\n      ACHIEVABLE DELIVERABLE identified: EXPLICIT finite-height theorem\n      (\u03bb_n > 0 \u2200 n \u2264 N\u2081 from Lagarias Thm 6.1's bridge + Platt's\n      T\u2080 \u2248 3e12 + traced constants + finite verification) \u2014 nobody has\n      assembled this chain. Wall mapped: arithmetic-side triangle\n      bounds explode ((15/14)\u207f); the three-way cancellation IS RH.\n      Remaining work \u2192 tasks 3.6\u20133.8. COMPLETE 2026-08-19: 3.6\u20133.8 all\n      done \u2192 R-004 (finite-height theorem, ledger #6, full tag).\n- [x] 3.6 (D-036) Explicit |\u03be\u2032/\u03be| / |L\u2032/L| contour bounds for \u03b6 with\n        constants (Lagarias Lemma 6.1; Davenport Ch. 15) + explicit\n        N(T) bound (Backlund\u2013Rosser/Trudgian). [NEW 2026-08-18]\n      - \u2192 COMPLETE (session 006 cont.9; D-036). I_III dominant\n      ~4.7\u221an log n first estimate; constants A = 0.9, B\u2080 = 1.0\n      MEASURED by E-021 (D-036 \u00a76 updated).\n- [x] 3.7 (E-021) Exact S_\u221e(n) computation n \u2264 10\u2074 (Lagarias\n        T-function closed forms) \u2192 explicit O(1) constant; measure true\n        |S_f(n)| curve vs the traced bound. [NEW 2026-08-18]\n      - \u2192 COMPLETE (session 007, after 6-bug root-cause saga \u2014 mpmath\n      zeta ~58-digit ceiling, GAMMA_E float literal, 3\u00d7 parse-before-\n      dps, \u03c3-omission boundary (15/14)\u207f, float64 zeros; journal-007).\n      ALL CHECKS PASS: V1 \u03bb_n vs E-015 4.8e-25 (n \u2264 3000); V2\n      A = 0.9, B\u2080 = 1.0; V3 c\u2080 = \u22121/4 with exact correction 1/(24n).\n      |S_f(n)| max 13.52 at n = 3298 vs traced bound ~2280 (slack\n      ~170\u00d7). n = 10\u2074 rerun available via cache.\n- [x] 3.8 (D-037 + R-004) Assemble the finite-height theorem: N\u2081\n        explicit; finite verification table; adversarial review; tag\n        [PROVED-CONDITIONAL(computational RH-to-height-T\u2080)]. [NEW]\n      - \u2192 COMPLETE (session 008; D-037, R-004, E-023 ALL CHECKS PASS).\n      - **\u03bb_n > 0 for all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074** (T\u2080 = 3\u00d710\u00b9\u00b2\n      Platt\u2013Trudgian; conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9). N\u2080 = 5\u00d710\u2074\n      (margin 67 705, convex chain); finite verification ours to 3000 +\n      Misguich\u2013Voros to 5\u00d710\u2075 (10\u00d7 overlap). D-036 |t|<10 gap found and\n      closed (M\u2080 = 1.3352). Follow-ups: D-039 (digamma sub-bound proof),\n      E-023b (acb box cover).\n\n### \u2705 PHASE 4 \u2014 Synthesis Assault (COMPLETE 2026-08-19, session 009)\n\n- [x] 4.1 Combine strongest partial results from Phases 1\u20133.\n      - \u2192 D-052 (session 008): result inventory; T-1/T-2/T-3 final forms.\n- [x] 4.2 State best new theorem(s); classify [PROVED]/[CONDITIONAL].\n      - \u2192 D-052; classifications corrected by D-054 (session 009).\n- [x] 4.3 Adversarial gauntlet: Davenport\u2013Heilbronn/Epstein sanity gate;\n        independent-instance review; error-hunting pass.\n      - \u2192 4.3a D-053 (session 008): GATE PASSES structurally for T-1/T-2/T-3.\n      - \u2192 4.3b D-054 (session 009): four independent review instances;\n      ALL THREE TAGS downgraded after hand-verification \u2014 D-039 proof\n      broken (bound true), D-036 \u00a71 far-sum O(|t| log t) hole\n      (reference-point trick missing), D-049 B1/B3 lower bounds broken\n      (Lemma-D 1/g\u00b2 term dropped; sinc\u00b2 factor 2), \u03b4_crit one-direction,\n      T-2 \u21d0 skeleton, D-052 accounting fixes (C1\u2013C5). Theorem\n      STATEMENTS survive (margins dwarf the gaps). Repair map opened:\n- [x] 4.5a D-056 (session 009): reference-point R-bound PROVED\n      (A = 10.5, B\u2080 = 48, honest C\u2080 incl. log log term \u2014 D-036 \u00a70\n      erratum) + digamma remainder |r| \u2264 1.2/|w|\u00b2 PROVED + I_I\n      housekeeping. E-028 ALL CHECKS PASS (26\u00d7 slack); N\u2080 = 80 000,\n      overlap 6.25\u00d7, margin(N\u2081) = 2.458e26. R-004 tag RESTORED.\n- [x] 4.5b D-057 (session 009): margin convexity PROVED (chain-rule\n      reduction \u03c6(T(n))\u2033 = \u03c8[\u03c6](T)/4n + 11-block table with elementary\n      sign arguments + I_I direct bound). E-029 ALL CHECKS PASS.\n- [x] 4.5c D-058 (session 009): valley lower bounds repaired \u2014\n      B1\u2032(i) isolated zeros clean rate PROVED; B1\u2032(ii) general via\n      node-killing projection (Gram constant + annulus count E(\u03b3,a));\n      B3\u2032 sinc\u00b2((z\u2212\u03b3)a) fix; m_\u03b3 fix (K \u2264 1/m_\u03b3); detector\n      restatement three-level (bare/pencil/carrier).\n- [x] 4.5d D-059 (session 009): bookkeeping write-ups \u2014 (1.12)\n      punctured-compact reading; R_\u03c4 := W/F \u2212 R\u2080 + distributional\n      representation; Lemma FD (form-domain identification, flat\n      bumps admissible); L1 write-up (PWS step named).\n- [x] 4.4 Numerical stress test vs known zero data.\n      - \u2192 E-027 + D-055 (session 009, ALL CHECKS PASS): synthetic\n      off-line pair stress test of the T-3 detector \u2014 bare-form\n      negativity IMMEDIATE for any \u03b4 > 0 (no threshold; strict\n      Schwarz); tuned-carrier threshold \u03c0/(2a) EXACT (\u22640.9% at\n      a = 4, 8); T_a-pencil onset magnitude-limited (\u03b4 \u2248 0.11 at\n      a = 4, 0.038 at a = 8); negative directions localized at the\n      pair. D-050 erratum sharpened.\n\n### \u2b1c PHASE 5 \u2014 Verification & Write-up (Track D)\n\n- [~] 5.1 Lean 4 formalization of all new lemmas (build on zeta-23-lean).\n      - \u2192 SKELETON STAGE COMPLETE (session 010, D-061): NguyenRH1 package\n      (research/lean/NguyenRH1/) \u2014 9 statements compile against\n      Mathlib + Zeta23 types. **TIER (i) COMPLETE (session 011)**:\n      chain_rule_sqrt_shift, sInfty_lower_bound, marginTilde_convex\n      PROVED (~1100 lines; full support library \u2014 see journal-011).\n      - **TIER (ii) STEPS 1+2 COMPLETE (session 012, D-062)**:\n      lambda_pos_finite_height_verified PROVED modulo the single named\n      analytic hypothesis SfBoundProp + the declared computational\n      perimeter (assembly-first split per session-012-notes; FAlt\n      majorant swap; secant two-point base; base points discharged by\n      certified interval bounds in LiBasePoints.lean \u2014 margin\u0303(8\u00d710\u2074)\n      \u2265 8001 certified, margin\u0303(10\u2075) \u2265 85 501 certified).\n      - **TIER ii\u2032 LAUNCHED (session 014, user directive \u2014 BEFORE\n      submission, option (a); design D-064)**: TWO DISCOVERIES \u2014\n      (1) liCoeff encoding defect (unordered tsum NOT Summable \u27f9 junk;\n      LiVerifiedUpTo/SfBoundProp FALSE as encoded; paired-form fix =\n      ii\u2032-1a); (2) crux identity Sf(n) = Res\u2081(n) EXACT (numerically\n      verified vs E-015/E-021) \u27f9 assembly TAIL-FREE. Routes R1\u2013R5;\n      sub-stage map ii\u2032-1a..7 (~9\u201316 sessions); perimeter unchanged\n      (Trudgian N(T)/S(T) declared, D-062 \u00a74). Freeze protocol: paper\n      files + existing proofs untouched until ii\u2032-7 (liCoeff fix\n      excepted). Remaining after ii\u2032: (iii) valley, (iv) Suzuki.\n- [~] 5.2 `#print axioms` audit \u2014 only propext, Classical.choice,\n        Quot.sound permitted.\n      - \u2192 Inherited library VERIFIED LIVE (session 010, D-061 \u00a73): full\n      build (9010 jobs) + all comparator PrintAxioms scripts match\n      AUDIT.md verbatim. NguyenRH1: all proved declarations (tier (i),\n      session 011; tier (ii) steps 1+2 incl.\n      lambda_pos_finite_height_verified, session 012) show the 3\n      standard axioms ONLY; sorryAx remains only on the 5 skeleton\n      statements (1 Suzuki + 4 valley) by design. No new axioms\n      anywhere.\n- [x] 5.3 Full paper draft with proofs, numerics appendix, Lean appendix.\n      - \u2192 COMPLETE (session 010): all stubs written (Introduction,\n      Background, Formal verification), abstract refreshed with tags,\n      references resolve, MiKTeX compile clean (12 pp).\n- [x] 5.4 Final honesty audit: every claim tagged and justified.\n      - \u2192 COMPLETE (session 010, D-060): ~55 claims, 4 independent\n      audit instances; 0 unsupported; 10 draft corrections (critical:\n      (1.12)\u27fa split \u2014 converse is skeleton L3/L4); 7 archive errata\n      filed (D-036 sign, D-056 title, D-055/D-058 0.9% overclaim,\n      D-042/D-043 Z/6 supersession by D-045, R-004 post-repair).\n\n### \u2705 PHASE 5B \u2014 TIER ii\u2032: close SfBoundProp in Lean (COMPLETE 2026-08-26, session 041 \u2014 sfBoundProp PROVED + lambda_pos_finite_height_closed; design D-064)\n\nFREEZE PROTOCOL: paper files (paperA/paperB/draft/references.bib) and\nexisting Lean proofs are untouched until ii\u2032-7 \u2014 the ONLY exception is\nthe liCoeff correctness fix (ii\u2032-1a). Paper A stays submission-ready at\nevery sub-stage boundary (D-064 \u00a78). Perimeter (D-062 \u00a74 + the\nsession-035 additions, user-approved 2026-08-23): Platt\u2013Trudgian\nRHUpTo, LiVerifiedUpTo, Trudgian N(T)/S(T) [ZeroCountProp \u2014\nstrengthened to the mult-weighted form session 035, matching the\ndeclared source; PLUS ZeroCountProp2 (the two-unit specialization) and\nNoLowZeros (|\u03b3| \u2265 14, the Platt-class zero-location certificate),\nboth for 5f], M\u2080.\n- [x] ii\u2032-0 Design + capability inventory + identity chain.\n      - \u2192 COMPLETE (session 014, D-064). TWO DISCOVERIES: (1) liCoeff\n      encoding defect \u2014 unordered tsum NOT Summable \u27f9 junk 0;\n      LiVerifiedUpTo/SfBoundProp FALSE as encoded (theorems vacuous);\n      paired-form fix designed. (2) Crux identity Sf(n) = Res\u2081(n)\n      EXACT (Lagarias (4.10) summed binomially; verified numerically:\n      j=0 exact 15 digits, \u03bb\u2082 matches E-015 certified value, residue\n      theorem sides = \u03bb_n(T)+triv+Res\u2081 to 2e-21) \u27f9 assembly TAIL-FREE:\n      |Sf| \u2264 |\u03bb_n(T)| + |sides| + |triv| = B(n). All 8 planned Zeta23\n      dependencies axiom-checked live (3 standard axioms only).\n- [x] ii\u2032-1a liCoeff pairing fix + summability (D-064 \u00a71).\n      - \u2192 COMPLETE (session 015). liSummand = \u00bd\u00b7mult\u00b7(f \u03c1 + f \u03c1\u0304)\n      (manifestly real, liSummand_eq) replaces the junk tsum;\n      `liSummable` PROVED (re_li_summand_le |Re f(\u03c1)| \u2264 2n\u00b2/\u2016\u03c1\u2016\u00b2 tail\n      + normSq_gammaOf_le_mul_norm_sq (9/4) + liSummand_norm_le\n      (9/2)n\u00b2\u00b7mult/(1+\u2016\u03b3\u2016\u00b2) + Zeta23 zero_sum_inv_sq comparison +\n      finite ball via IsCompact.inter_riemannZetaZeros_finite).\n      Full rebuild GREEN (8741 jobs, zero downstream changes); axiom\n      audit: 3 standard axioms only on all new + main declarations.\n      LiVerifiedUpTo/SfBoundProp now TRUE statements (defect repaired).\n- [x] ii\u2032-1b R1 residue machinery: general finite-order residue\n      (MeromorphicNF), rectangle residue theorem extension beyond\n      HasSimplePolesOn, w=1 residue by Leibniz ((w\u22121)^{n+1}J =\n      [w\u207f\u2212(w\u22121)\u207f]h(w), h = (w\u22121)(\u2212\u03b6\u2032/\u03b6)), zero residues via vendored\n      logDerivResidue.\n      - \u2192 COMPLETE (sessions 016\u2013017): LiResidue.lean (zetaA/hLi\n      analytic at 1; lcoeff; A_iter; **ResW1_eq_sum** \u2014 the w=1 residue\n      = \u03a3_j C(n,j)\u00b7lcoeff(j\u22121) by iteratedDeriv_mul) + LiPrincipal.lean\n      (rectInt_deriv_eq_zero per-side FTC; **rectInt'_ppart** \u2014 principal\n      part integrates to ResW1 n on any rectangle with 1 interior) +\n      LiSides.lean (session 017: **rectInt'_Jlag** \u2014 RectangleIntegral'\n      (Jlag n) z w = ResW1 n + \u03a3_{\u03c1\u2208Sz} (zeroMult \u03c1)\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) on\n      rectangles with 1 interior, \u03b6 \u2260 0 on border; removable singularity\n      at 1 via Ffun\u2212TaylP order \u2265 n+1; logDeriv NF residues at zeros,\n      multiple zeros OK; vendored residueTheorem_finset; full build\n      GREEN 8745 jobs \u2014 root now imports all three files; 19 new decls,\n      3 standard axioms only). NOTE: zeroMult(\u22122) = 1 (trivial-zero\n      simplicity) deferred \u2014 zeroMult stays symbolic in the sum; the\n      Sz = {nontrivial} \u222a {\u22122} split is ii\u2032-4 territory.\n- [x] ii\u2032-2 R2(i)/(ii) elementary swaps: \u03bb_n = \u03a3_j(\u22121)^{j+1}C(n,j)\u03c3_j\n      (binomial + paired swap); S_\u221e = \u03a3_j C(n,j)\u03c4_{j\u22121} (odd-m tsum \u2194\n      binomial form, D-037 \u00a73 swap).\n      - \u2192 COMPLETE (session 018): LiSwaps.lean \u2014 **liCoeff_eq_sum_sigma**\n      (paired power sums \u03c3_j := sigmaP; per-slice summability cloned\n      from the ii\u2032-1a skeleton: j=1 via Re(1/\u03c1) = Re(\u03c1)/|\u03c1|\u00b2 exactness,\n      j\u22652 by |\u03c1|^{\u2212j} \u2264 |\u03c1|^{\u22122}, radius-2 finite ball; swap via\n      Summable.tsum_finsetSum + CommRing-polymorphic one_sub_one_sub_pow)\n      + **sInfty_eq_sum** (SInfty n = \u03a3_{j=1}^n (\u22121)^jC(n,j)\u00b7lagariasA j,\n      n \u2265 1; lagariasA encoded 1 + odd\u22653 tsum; oddSlice_summable by\n      p-series domination; \u03a3_{j=2}^n(\u22121)^jC(n,j) = n\u22121). Full build\n      GREEN (8746 jobs); 12 new decls, 3 standard axioms only.\n- [x] ii\u2032-3 R2(iii) Lagarias (4.10): \u03c4_j = c_j + (\u22121)\u02b2\u03c3_{j+1} \u2212 (\u22121)\u02b2\n      \u2014 LONG POLE. Sanity gate: j=0 is \u03a31/\u03c1 = 1 + \u03b3/2 \u2212 \u00bdlog 4\u03c0.\n      - \u2192 DESIGN COMPLETE (session 019, D-066): route **\u03b24** ADOPTED\n      (contour moments + coefficient split) \u2014 \u03b21 (Hadamard) ruled out\n      (Mathlib has no Weierstrass product/order theory;\n      extract_zeros_poles is finite-only), \u03b22 (EF reuse) ruled out\n      (moments not entire \u2014 outside the EF test class). Factorization:\n      (4.10-a) \u27fa (M) moments \u03c3_k = \u2212g^{(k\u22121)}(0)/(k\u22121)! [contour] +\n      (A) \u03c4_j = (\u22121)^{j+1}a_{j+1} [digamma] + (B) \u03b6-piece [done];\n      R-bound SHARED with ii\u2032-5 \u27f9 resequenced pipeline:\n      ii\u2032-3a (A+B) \u2192 ii\u2032-4 \u2192 ii\u2032-5 \u2192 ii\u2032-3b (moments) \u2192 ii\u2032-3c\n      (assembly \u2192 crux). Piece (B) PROVED (session 019,\n      LiZetaCoeff.lean: iteratedDeriv_hLiExt \u2014 Taylor coefficients of\n      1/s + \u03b6\u2032/\u03b6(1+s) at 0 are \u2212j!\u00b7lcoeff j; 6 decls axiom-clean;\n      build 8747 jobs green). Piece (A) next: \u03c4\u2080 via Mathlib\n      digamma_one_half; j \u2265 1 via digamma series from logGammaSeq.\n      - **ii\u2032-3a COMPLETE (session 020)**: piece (A) PROVED \u2014\n      LiArchimedean.lean + LiDigamma.lean (~1200 lines): the capstone\n      `iteratedDeriv_logDeriv_Gamma\u211d` \u2014 the archimedean Taylor\n      coefficients of logDeriv Gamma\u211d(1+s) at 0 are\n      (\u22121)^{j+1}\u00b7j!\u00b7lagariasA(j+1) for ALL j \u2265 0. Via: the Gamma\u211d\n      logDeriv split + \u03c4\u2080 (Mathlib digamma_one_half) + the digamma\n      partial-fraction series BUILT FROM SCRATCH (logGammaSeq \u2192 real\n      identity by deriv-limit interchange \u2192 complex series by\n      Weierstrass + identity principle \u2192 polygamma values at 1/2 by\n      iteratedDerivWithin_tsum \u2192 odd-m reindexing \u2192 2^{j+1} scaling).\n      Build GREEN (8749 jobs); 18 key decls audited: 3 standard axioms.\n      - **ii\u2032-3c COMPLETE (session 038)**: LiCrux.lean (~430 lines,\n      root-imported, full build GREEN 8771 jobs): the FE derivative\n      relation (gFun_one_sub_fun + iteratedDeriv_gFun_zero via the\n      UNCONDITIONAL iteratedDeriv_comp_const_sub), the shift expansion\n      (gFun_one_add_punctured/gFun_one_add_eventuallyEq), the\n      coefficient extraction (iteratedDeriv_gFun_one) \u27f9\n      - **`lagarias_4_10_a (hZC)` PROVED** (lcoeff (k\u22121) =\n      (\u22121)^k\u00b7(lagariasA k + sigmaP k) + (\u22121)^{k\u22121}, all k \u2265 1) \u27f9\n      - **THE CRUX `sf_eq_resW1 (hZC)` PROVED**: (ResW1 n).re = Sf n for\n      n \u2265 1 (ResW1_eq_sum + (4.10-a) + both ii\u2032-2 swaps + the binomial\n      sum \u03a3(\u22121)^{j\u22121}C(n,j) = 1). Audit session038b: 8 decls, 3\n      standard axioms only. **ii\u2032-3 (ALL of Lagarias (4.10)) COMPLETE \u2014\n      Sf(n) = Res\u2081(n) is Lean-proved modulo the declared perimeter.**\n      - **ii\u2032-3b COMPLETE (sessions 037\u2013038) \u2014 ROUTE REVISION (D-070)**:\n      the moments (M) came from 5e's partialFraction_identity by PURE\n      ALGEBRA + series calculus (no contours \u2014 the contour work was\n      5e's): gFun := logDeriv xiL = B + seriesFun at good points (xiL\n      entire via the \u039b\u2080 closed form; perimeter ZeroCountProp ONLY \u2014\n      5f's hZC2/hNLZ not needed). LiMoments.lean (~1020 lines,\n      root-imported, full build GREEN 8770 jobs): xiL + the\n      conj/reflect subtype equivs, (G) gFun_eq_momentB, evaluations\n      gFun_zero/gFun_one/gFun_one_eq_neg (FE sign), the summability\n      budget (master \u03a3 mult/\u2016\u03c1\u2016\u00b2 + AM-GM mixed bound), the reindex\n      machinery (sigmaP_eq_unpaired k \u2265 2, vTerm_tsum_eq_zero), k = 1\n      (sigmaP_one_eq_neg_gFun_zero), \u00a75 the termwise iterated\n      derivation at 0 (iteratedDeriv_zpow_neg_one,\n      iteratedDeriv_seriesTerm, the M-test\n      seriesTerm_deriv_summableLocallyUniformlyOn,\n      iteratedDeriv_seriesFun_zero \u2014 the LiDigamma:749\u2013785\n      iteratedDerivWithin_tsum pattern), \u00a76 gFun_eventuallyEq_zero +\n      - **THE CAPSTONE `sigmaP_eq_neg_iteratedDeriv_gFun_div (hZC :\n      ZeroCountProp)`: sigmaP k = \u2212gFun^{(k\u22121)}(0)/(k\u22121)! PROVED for\n      ALL k \u2265 1** (session 038, first-pass green). Audit session038:\n      23 decls, 3 standard axioms only. Remaining: ii\u2032-3c (the\n      (4.10-a) assembly; needs the FE derivative relation\n      gFun^{(k\u22121)}(0) = (\u22121)^k\u00b7gFun^{(k\u22121)}(1), small from\n      xiL_one_sub).\n- [x] ii\u2032-4 L3 zero-avoiding T (pigeonhole on perimeter C\u2080/FAlt) +\n      L1 kernel bounds (|k_n| \u2264 2, e\u2074+1, e^{\u221an/2}+1; trivial residue).\n      - \u2192 COMPLETE (session 021, LiContour.lean, ~400 lines): L3\n      `exists_zero_avoiding_T` \u2014 clearance 1/(3\u00b7C0hat(a+1)) in any unit\n      window [a, a+1], a \u2265 2, from the perimeter `ZeroCountProp`\n      (Trudgian N(T)/S(T) in \u0108\u2080 form) via the midpoint pigeonhole\n      `exists_avoiding_midpoint` (k+1 midpoints, injective-badness);\n      finiteness via Zeta23 zerosIn_finite. L1: `kFun_norm_le_two`\n      (re s \u2264 1/2), `kFun_shift_norm_le_exp_four_add_one` (horizontals,\n      re s \u2264 3, n \u2264 im\u00b2), `kFun_shift_norm_le_exp_sqrt_half_add_one`\n      (right vertical, 2\u221an \u2264 re s), `kFun_neg_two` + norm \u2264 1.\n      PLUS the deferred trivial-zero simplicity `zeroMult_neg_two`\n      (zeroMult(\u22122) = 1): local factorization \u03b6 = (s+2)\u00b7\u039b/Hfun with\n      Hfun = 4\u03c0^{\u2212s/2}\u0393(s/2+2)/s analytic, Hfun(\u22122) = \u22122\u03c0 \u2260 0,\n      \u039b(\u22122) = \u039b(3) = \u0393R(3)\u03b6(3) \u2260 0. Build GREEN (8751 jobs); 17 decls\n      audited: 3 standard axioms only.\n- [x] ii\u2032-5 R3 R-bound (D-056, A = 10.5, B\u2080 = 48) via LOCAL route:\n      Borel\u2013Carath\u00e9odory (Mathlib) + Jensen (Mathlib) + Blaschke\n      (StrongPNTPrefix); FE polynomial strip bound via\n      riemannZeta_one_sub + Stirling; digamma Lemma D.\n      - \u2192 DESIGN COMPLETE (session 022, D-067): route b\u2033 \u2014 Davenport disc\n      at 2+it (R = 5/2) + FE-reflection with EXACT zero-sum\n      cancellation; Stirling-free (Zeta23 digamma_stirling subsumes\n      Lemma D), Hadamard-free; geometry obstruction (every covering\n      disc dips left of \u03c3 = 0) resolved via one extra EM level.\n      - **ii\u2032-5b COMPLETE (session 022)**: LiRBound.lean \u2014 the level-2\n      Euler\u2013Maclaurin representation \u03b6(s) = 1/2 + 1/(s\u22121) \u2212\n      s(s+1)\u222b\u2081^\u221e B\u0303\u2082(x)x^{\u2212s\u22122}dx (re s > \u22121; b2Fun machinery, IBP\n      identity, parameter-integral analyticity, W\u00b1 convex-region\n      identity principle) + `norm_riemannZeta_le_disc`: \u2016\u03b6\u2016 \u2264 (3/4)|t|\u00b2\n      on B(2+it, 5/2), |t| \u2265 10. Build GREEN (8752 jobs); 27 decls\n      audited clean. **ROUTE REVISION (session 023, D-067 \u00a76)**: the\n      disc-only constants provably CANNOT reach the baked 10.5/48 (BC\n      derivative factor \u2265 16\u00d7 the M-coefficient; honest assembly ~270)\n      \u27f9 two-stage plan: loose disc bound as the GROWTH INPUT for the\n      partial-fraction identity (5e), tight constants from D-056's\n      analysis of the identity (5f). **ii\u2032-5c COMPLETE (sessions\n      023\u2013024)**: LiDisc.lean \u2014 zeroDiscFinset + zeroDisc_isNontrivial;\n      scaledZeta (unit-disc scaling) + F(0) = 1 via Zeta23\n      zeta_lower_bound_two (\u2016\u03b6(2+it)\u2016 \u2265 1/3, no \u03bc-series build); the\n      multiplicity-invariance chain (analyticOrderNatAt_riemannZeta_\n      affine/const_mul/scaledZeta); scaledZeta_jensen_count (ZerosBound,\n      \u2264 log((9/4)|t|\u00b2)/log(33/32)); **session 024 back half**: R-gap via\n      the \u00d710-rescaled midpoint pigeonhole (R_c \u2208 [2.3, 2.4], clearance\n      gapD = 1/(50(k+1))); g = Cf r_c F analytic + nonvanishing on\n      closedBall(0, r_c) (Zeta23 Cf/ZeroFactorization); |g| \u2264\n      (9/4)|t|\u00b2\u00b7gapD^{\u2212M_c} on the ball (max-modulus over the zero-free\n      sphere); LogOfAnalyticFunction + BorelCaratheodoryDeriv (450\u00b7M\n      factor); logDeriv chain + affine push-forward + near/extras split.\n      - **Capstone: logDeriv_riemannZeta_sub_nearZeros_le** \u2014 the LOOSE\n      R-bound \u2016\u03b6\u2032/\u03b6(s) \u2212 \u03a3_{|\u03b3\u2212t|<1} m/(s\u2212\u03c1)\u2016 \u2264 100000\u00b7(log|t|)\u00b2 on\n      \u03c3 \u2208 [1/2, 7/2], |t| \u2265 10, \u03b6 s \u2260 0 (no perimeter hypothesis \u2014\n      Jensen count input). Build GREEN (8753 jobs, LiDisc now root-\n      imported); 32 new decls audited: 3 standard axioms only.\n      - **ii\u2032-5d COMPLETE (session 025)**: LiReflect.lean (~640 lines, 26\n      decls audited clean) \u2014 `logDeriv_zeta_fe` (pointwise logDeriv FE:\n      logDeriv \u03b6 s = \u2212logDeriv \u03b6(1\u2212s) \u2212 [logDeriv \u0393R s +\n      logDeriv \u0393R(1\u2212s)]); `sum_nearZeros_neg_reflect` (the EXACT\n      zero-sum cancellation under \u03c1 \u21a6 1\u2212\u03c1: nearZeros(\u2212t) = image,\n      zeroMult invariant via analyticOrderAt_zeta_one_sub);\n      `logDeriv_Gamma\u211d_shift` (the +4 \u0393R shift putting both digamma\n      arguments in re > 0) + digamma_stirling \u27f9 \u0393R-bracket \u2264\n      4(log|t|)\u00b2; capstone\n      - **logDeriv_riemannZeta_sub_nearZeros_le_left** \u2264 200000\u00b7(log|t|)\u00b2\n      on \u03c3 \u2208 [\u22125/2, 1/2], |t| \u2265 10; PLUS the 5e input\n      - **norm_digamma_sub_log_le_of_two_le_abs_im** (\u2016\u03c8(w) \u2212 log w\u2016 \u2264 3\n      for 2 \u2264 |im w|, uniform in the shift chain: digamma_add_natCast\n      + first-order EM + arctan-FTC). Build GREEN (8761 jobs, LiReflect\n      root-imported). DEFERRED to session 026 first item:\n      zeroMult(\u22122n) = 1 for ALL n (5e's entirety at trivial zeros).\n- [x] ii\u2032-5e R3 partial-fraction identity (D-068 design; two-stage\n      plan's second stage). **COMPLETE session 034 \u2014 capstone\n      `partialFraction_identity` PROVED (perimeter ZeroCountProp only).**\n      - \u2192 DESIGN COMPLETE (session 026, D-068) with TWO CORRECTIONS to\n      D-067 \u00a76: (C1) the circle series bound is O((log R)\u00b3) via the\n      RADIAL split (\u03b3-gap only in the critical annulus [R\u00b12]; the\n      naive split gives O(R log R) \u2014 fatal, recorded with fix); (C2)\n      the near-axis left-plane digamma bound is a separate build.\n      - **5e-0 COMPLETE (session 026)**: LiTrivialZeros.lean \u2014\n      `gamma_mul_prod` (product-form \u0393 recurrence) + the `HfunT n`\n      cofactor + **zeroMult_neg_two_mul**: zeroMult(\u22122n) = 1 for ALL\n      n \u2265 1 (8 decls audited clean; build 8762 jobs, root-imported).\n      - **5e-i COMPLETE (session 027)**: LiGapCircles.lean \u2014\n      `exists_gapCircle_radius` (R \u2208 [4k+5/2, 4k+3], dist(R/2,\u2124) \u2265 1/4,\n      ordinate clearance 1/(16\u00b7C0hat(4k+9/2)); \u00d72-rescaled pigeonhole).\n      - **5e-ii COMPLETE (session 027)**: LiDigammaLeft.lean \u2014\n      `norm_digamma_le_of_two_le_re` (B: \u2016\u03c8\u2016 \u2264 20 log(2+\u2016w\u2016), re \u2265 2),\n      `digamma_recip_sum_le` (C: \u03a3\u2016(w+j)\u207b\u00b9\u2016 \u2264 2/c+2+2 log m),\n      `norm_digamma_le_of_dist_nat` (A: near-axis bound, re \u2264 2),\n      `logDeriv_Gamma\u211d_eq` (G: the general identity for im \u2260 0);\n      15 decls audited clean; build 8764 jobs.\n      - **5e-iii COMPLETE (session 028)**: LiSeries.lean \u2014 the zero-side\n      partial-fraction series `seriesFun s := \u2211' \u03c1, mult\u00b7(1/(s\u2212\u03c1)+1/\u03c1)`:\n      `seriesSummable` (unconditional, the ii\u2032-1a D-trick with the\n      (17/12)\u2016\u03c1\u2016\u00b2 comparison), `seriesFun_analyticOnNhd` off the\n      nontrivial zeros (three-case avoiding balls + the Weierstrass\n      M-test pattern), `nontrivialZero_isolated` (min-distance),\n      `seriesFunSub_analyticAt` + `seriesFun_sub_polar_analyticAt`\n      (series \u2212 mult/(s\u2212\u03c1\u2080) analytic AT \u03c1\u2080 \u2014 the 5e-iv residue\n      cancellation input); 22 decls audited clean; build 8765 jobs.\n      - **5e-iv COMPLETE (session 029)**: LiFEntire.lean \u2014 F ENTIRE via\n      the punctured-limit extension `Gentire s := limUnder (\ud835\udcdd[\u2260] s)\n      Fexpr` (no removable-singularity theorem in Mathlib; junk values\n      at the excluded points sidestepped by limUnder uniqueness):\n      principal-part-split witnesses at nontrivial zeros (NF +\n      seriesFun_sub_polar_analyticAt), at 1 (logDeriv zetaA), at 0 and\n      \u22122n (the digamma-series splits: digammaSeriesPart on ball(0,1/2),\n      digammaSeriesPartSub on ball(\u2212n,1/2), both M-test); supporting\n      `zeta_zero_classification` (zeros = nontrivial \u222a {0} \u222a {\u22122n}) +\n      `analyticAt_digamma` (off {0}\u222a\u2212\u2115). Capstone\n      `gentire_analyticAt_and_eq`: (\u2200 s, AnalyticAt \u2102 Gentire s) \u2227\n      (\u2200 s good, Gentire s = Fexpr s); 30 decls audited clean; build\n      8766 jobs. **5e-v-b + 5e-v-c COMPLETE (sessions 030\u2013033)**:\n      LiCircleBound.lean (~3928 lines) \u2014 count bridges (A0count from\n      Zeta23's RvM local count, mult-weighted, all t, unconditional),\n      the Dirichlet bound \u2016\u03b6\u2032/\u03b6\u2016 \u2264 dirichletC2 (re \u2265 2),\n      tsum_split_finset, lowZeroConst, the far-tail bound\n      zero_tail_inv_sq_le (\u03a3_{|\u03b3|>X} m/(1+\u03b3\u00b2) \u2264 16\u00b7A\u2080\u00b7log X/X,\n      X \u2265 200 \u2014 the dyadic fiber machine + ENNReal.tsum_fiberwise),\n      - **the series circle bound seriesFun_norm_le_gapCircle**\n      (\u2016seriesFun s\u2016 \u2264 2\u00b7lowZeroConst + 2900\u00b7A\u2080\u00b7\u0108\u2080(4k+9/2)\u00b7(log R)\u00b2\n      on the \u03b3-gap circle, k \u2265 4000), and **the Fexpr circle bound\n      Fexpr_circle_le** (\u2016Fexpr s\u2016 \u2264 2\u00b7lowZeroConst + dirichletC2 +\n      400000\u00b7A\u2080\u00b7\u0108\u2080(R+2)\u00b7(log R)\u00b2): three-region logDeriv assembly\n      (Dirichlet / 5c+5d capstones + the near sum via gapCircle_sep /\n      FE + \u0393R bracket), digamma_circle_le (uniform \u03c8 bound, left\n      near-axis via the \u2124-clearance), and\n      - **logDeriv_Gamma\u211d_eq_of_not_neg_nat** (the (G) formula at any\n      non-pole point incl. s = \u2212R \u2014 direct logDeriv_mul, no\n      continuity). **5e-v-d COMPLETE (session 034) \u2014 ii\u2032-5e DONE**:\n      LiSqueeze.lean (~330 lines, 5 decls audited clean; LiCircleBound\n      + LiSqueeze root-imported; full build GREEN) \u2014 the Schwarz\n      squeeze (`gentire_const`: max-modulus + ball-form Schwarz on the\n      \u03b3-gap circles, growth (log R)\u00b3/R \u2192 0 via Q := R^{1/4} \u27f9\n      Gentire \u2261 Gentire 0 =: B) and **THE CAPSTONE\n      `partialFraction_identity` (hZC : ZeroCountProp)**: \u2203 B : \u2102,\n      \u03b6\u2032/\u03b6(s) = B + seriesFun s \u2212 1/s \u2212 1/(s\u22121) + \u00bdlog \u03c0 \u2212 \u00bd\u03c8(s/2)\n      off the excluded set \u2014 the partial-fraction identity Lean-proved\n      modulo ONLY the declared perimeter. Remaining: 5f (tight\n      constants 10.5/48 from D-056's two-point analysis).\n- [x] ii\u2032-5f R3 tight constants (D-056's Theorem R: |R(s)| \u2264 10.5\u00b7log\n      (|t|+2) + 48). \u2192 COMPLETE (sessions 035\u2013036, LiTightR.lean ~4300\n      lines). **Perimeter repair** (user-approved): ZeroCountProp\n      strengthened to the mult-weighted form (the second ii\u2032-1a-class\n      encoding defect \u2014 the unweighted set-card under-captured the\n      declared Trudgian N(T) source; `one_le_zeroMult` bridge;\n      consumers adapted; full build green, audit clean). **P1/P2\n      perimeter additions** (user-approved, D-069): ZeroCountProp2\n      (two-unit count 0.6\u00b7L + 0.886\u00b7LL + 2.7) + NoLowZeros (|\u03b3| \u2265 14).\n      - **D-069 Finding 1**: D-056's piece 2 charges the near sum one\n      C\u2080(t) for a TWO-unit window \u2014 the honest two-unit Trudgian form\n      makes the assembly fit 10.5/48 (pinch margin \u2248 1.9). **Finding\n      2** (ii\u2032-6 repair map): H(T)'s near sum has a clearance-coverage\n      gap (honest \u2248 7\u00b7\u0108\u2080\u00b2 vs baked 3\u00b7\u0108\u2080\u00b2; margin survives, crossover\n      moves). 5f-i COMPLETE (Rexpr_decomp + pieces 1 dirichletC2_le_one,\n      2 near_sum_refPoint_le, 4/5 one_div_diff_le); 5f-ii piece 6\n      COMPLETE (digamma_diff_le \u2264 6/t) + **piece 3 COMPLETE (session\n      036)**: the far interval machine \u2014 certified numerics, farW +\n      S\u2083 \u2264 1.3476, six tail bricks (RW\u2080/1/2 = 0.1/0.3303/0.1216,\n      LA\u2080/1/2 = 1/23/0.1687/0.0621), C0hat bridges (2k+1/j+1/2t+1),\n      zeroMult_conj machinery, farG + norm reduction, main bucket\n      machine (unit_family_le + main_bucket_count + farG_main_le), two\n      tail machines (farGLeft_le \u2264 1.1729, farGRight_le \u2264 2.7343),\n      far_series_le \u2264 12.1284\u00b7C\u2080 + 7.2425. **5f-iii COMPLETE (session\n      036)**: pinch lemma pinch_tight_R (11.6318\u00b7LL \u2212 4.6484\u00b7L \u2264\n      0.397094 for L \u2265 log 12, concave tangent at the certified\n      critical point 2.5024, f(2.5024) \u2264 \u22120.96231) + the C0hat L/LL\n      conversion + **THE CAPSTONE\n      `logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC) (hZC2)\n      (hNLZ)`: \u2016logDeriv \u03b6 s \u2212 \u03a3_{near} m/(s\u2212\u03c1)\u2016 \u2264 10.5\u00b7log(t+2) +\n      48 PROVED** (six-piece assembly; fold 5.8516L + 11.6318LL +\n      47.6029 \u2264 10.5L + 48 via the pinch). Audits session036/036b:\n      33 decls, 3 standard axioms only; full build GREEN (8762 jobs).\n- [x] ii\u2032-6 L0 assembly: sides identity + bridge |\u03bb_n(T)| \u2264 4\u00b7FAlt(T)\n      (hRH, BOTH-signs correction F-A) + |Sf n| \u2264 Bn FAlt n on [10\u2075, N\u2081].\n      - \u26a0 **FINDING F-D (session 038, D-072)**: the (6.12) stepping in\n      Lagarias's Thm 6.1 is broken at T = \u221an (right-tail ~e^{0.066\u221an},\n      ~5.9\u00d710\u00b9\u2070 envelope at n = 10\u2075 measured by E-031); D-036/D-037/\n      R-004's B(n) inherits it (charge \"3.3\" off by ~10\u2077\u00d7; margin\n      collapses for n \u2273 3\u00d710\u2074). Theorem statement survives (verified\n      to 5\u00d710\u2075; sides cancel by conjugation + phase winding); all\n      Lean work to date survives. **REPAIR ROUTE CHOSEN (2026-08-25,\n      user directive): the D-074 zero-free dog-leg (entry below) \u2014\n      keeps T_cut = \u221an and the ORIGINAL N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9\u00d710\u00b2\u2074; the\n      horizontal right-tail piece of ii\u2032-6-c now comes from ii\u2032-6-DL.**\n      The T = c\u221an global repair (D-073: N\u2081 \u2192 (T\u2080/c)\u00b2) is the PAUSED\n      fallback (c = 1.5 WIP on branch wip/c-1.5-margin-redo, 642d47a).\n      - \u2192 ii\u2032-6-0 DESIGN COMPLETE (session 038, D-071 + E-030 ALL CHECKS\n      PASS): THREE findings \u2014 F-A bridge factor-2 (both-signs sum with\n      one-sign N(T) in D-036/D-037/E-023; R-004 unaffected, paper\n      erratum at ii\u2032-7), F-B I_III two-unit count ((2/3)Z2 honest),\n      F-C baked Bn unprovable beyond ~5\u00d710\u2077. USER-APPROVED (8-step\n      protocol): redefine Bn honestly (2F \u2192 4F, (2/3)\u0108\u2080 \u2192 (2/3)Z2hat);\n      fold validated (E-030 V2/V3/V4). Perimeter additions approved:\n      ZeroCountGlobalProp (global Trudgian N(T) \u2264 FAlt) + MZeroProp\n      (M\u2080 \u2264 1.3352). Sub-stages: 6-a (Bn redefinition + convexity\n      re-proof + base-point re-certification) \u2192 6-b (perimeter Props +\n      extended pigeonhole + sides identity + bridge) \u2192 6-c (four side\n      bounds; horizontals = segment-integral machine) \u2192 6-d (fold \u27f9\n      sfBoundProp).\n- [x] ii\u2032-6-R F-D REPAIR SIDE THREAD (COMPLETE, 2026-08-25, session\n      039): focused re-proof of ONLY the right part of the horizontal\n      segments in Lagarias Thm 6.1 (the broken (6.12) stepping).\n      - \u2192 6-R-0 (E-032 diagnostic, ALL CHECKS PASS): TRUE complex\n        I_right at T = \u221an by direct quadrature (Dirichlet series\n        certified-tail primary, mpmath validated 6e-10, dps 50) \u2014\n        verdict **HIDDEN CANCELLATION, decisive**: |I_right| =\n        7.2/16.7/26.2 vs envelope 5.1e1/1.0e4/4.7e10 (n = 10\u00b3/10\u2074/10\u2075),\n        ratio collapsing to 5.6e-10; the per-side claim |I_II| = O(\u221an)\n        is empirically TRUE (|I_II|/\u221an decreasing 0.235 \u2192 0.098) but\n        envelope-unprovable at T = \u221an; mid-segment honest (ratio\n        0.7\u20130.95); repair heights honest (ratio \u2248 1, envelope\n        collapses). STOP-rule reported; user direction: repair only,\n        salvage parked (open question, D-073 \u00a78 D4).\n      - \u2192 6-R-1 (D-073 \u00a7\u00a73\u20137, repaired proof): dependency audit (only\n        the stepping is proof-breaking; the (1+4/(16+n))\u207f intermediate\n        is a harmless looseness, e\u2074+1 valid); **Lemma 4.1 corrected\n        stepping + Cor 4.2 explicit R(c) = |\u03b6\u2032/\u03b6(2)|\u00b7[e^{4/c\u00b2}/\n        (4(1\u2212q)log 2) + 1/(2 log 2)], q = e^{1/c\u00b2}/2 [PROVED,\n        elementary]**; AUDIT CORRECTION \u2014 recommend **c = 1.5**\n        (reverses D-072's \"2 margin/1.5 range\": the fold is\n        I_III-length-dominated, c = 1.5 wins BOTH base margins\n        (181 256 vs 109 370 at 10\u2075) AND range (N\u2081 = 4\u00d710\u00b2\u2074); c = 2 the\n        ultra-conservative option, R = 1.97 < broken 3.3); consequence\n        audit (Thm 6.1 statement unchanged, O-constant c-dependent;\n        Thm 1.1 height ((T\u2080\u22121)/c)\u00b2; no new perimeter); E-033 ALL\n        CHECKS PASS (Z\u2080 certified [0.5699210, 0.5703661], R covers\n        E-032 measured 3.2\u20136.3\u00d7, kernel charge, fold fit \u2264 0.40,\n        margins > 0 to N\u2081, full fold).\n      - \u2192 6-R-2 (D-073 \u00a78, drafts only, correspondence untouched):\n        D3 letter repair paragraph + D4 T = \u221an per-side verdict\n        paragraph (open question: the hidden-cancellation mechanism).\n      - THEN: main line executes repair (R) \u2014 8-step protocol re-run at\n      - **c = 1.5** (ii\u2032-6-a redo: Bn_c(n) := 4F + 4T[(2/3)Z2 + 10.5 log\n      + 48] + 40\u00b71.3352 + 2(e^{16/9}+1)(7H\u0302 + 5.94) + IIMaj_c + 1,\n      T = 1.5\u221an+1; convexity re-proof + base-point re-certification,\n      values IMPROVE) \u2192 ii\u2032-6-c with the fixed stepping.\n      - [SUPERSEDED as the main route 2026-08-25 by ii\u2032-6-DL (user\n      directive: the goal is the ORIGINAL N\u2081 = 9\u00d710\u00b2\u2074); preserved as\n      the PAUSED FALLBACK \u2014 WIP on branch wip/c-1.5-margin-redo\n      (642d47a, resume map in its commit message).]\n- [~] ii\u2032-6-DL F-D DOG-LEG REPAIR (ACTIVE, 2026-08-25, user directive;\n      directive file **PROJECT_DIRECTIVE_D-074.txt**; design/progress\n      anchor **D-074**; route to the ORIGINAL N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9\u00d710\u00b2\u2074).\n      Design: keep T_cut = \u221an (residues/bridge/\u03bb_n(T_cut) UNCHANGED);\n      replace ONLY the broken right horizontal tail [3, 2\u221an] by a\n      zero-free dog-leg: lift \u03c3 = 3 from T_cut to U = (3/2)\u221an\n      (V_left \u2264 (\u221an/2)(e^{5/2}+1)\u00b7C_zeta3 \u2248 1.07\u221an explicit), traverse\n      at U (H_high = D-073's R(1.5) = 5.94, q = e^{4/9}/2 < 1\n      certified), drop at X_R = 2\u221an (V_right exponentially tiny);\n      the dog-leg rectangle is entirely in Re w \u2265 3 \u2014 \u03b6 zero-free +\n      no pole UNCONDITIONALLY (no new perimeter, no RH above T_cut).\n      Mid-segment [\u22125/2, 3] at T_cut untouched (honest, E-032).\n      Bn impact \u2248 +2.2\u221an; the dog-leg charge decomposes into existing\n      margin-block shapes (convexity re-proves at coefficient level).\n      Sub-stages (crash-safe, commit per sub-stage; D-074 \u00a71 log):\n      - \u2192 DL-0 COMPLETE (session 040): \u00a72 audit (Lean contour matches;\n        Jlag n s = (s/(s\u22121))\u207f\u22121\u00b7(\u2212\u03b6\u2032/\u03b6 s), CCW orientations pinned);\n        \u00a73 derivation (identity H_low = H_high \u2212 V_right + V_left;\n        analyticity unconditional at Re \u2265 3); \u00a74 constants (C_zeta3 =\n        0.165 certified \u2014 hand-estimate 0.150 caught wrong by smoke\n        test; e^{5/2}+1 \u2264 13.19; q = 0.7798; HHigh = 5.94; VRight =\n        IIMaj/4); **E-034 ALL CHECKS PASS** (identity exact to 2\u20135e-5;\n        piece slack 4\u201313\u00d7; margins 14 419 / 90 317 / 2.458e26 at\n        8\u00d710\u2074 / 10\u2075 / N\u2081 = (3\u00d710\u00b9\u00b2\u22121)\u00b2 \u2014 ORIGINAL endpoint restored;\n        fold fit \u2264 0.399); \u00a77 A\u2013L report \u2014 **AWAITING USER GATE\n        before DL-1 (Lean)**.\n      - \u2192 DL-1 COMPLETE (session 040, LiDogLeg.lean, build 8773 jobs,\n        audit clean): Jlag_differentiableAt_dogleg +\n        holomorphicOn_Jlag_dogleg (Re \u2265 3 zero-free via Mathlib, NO\n        perimeter), rectangleIntegral(_')_Jlag_dogleg_eq_zero (Cauchy),\n        **upper_right_horizontal_eq_dogleg** (the exact identity (\u2605)\n        PROVED), kFun_conj/Jlag_conj (lower-side machinery).\n      - \u2192 DL-2 COMPLETE (session 040, LiDogLeg.lean +~250 lines, build\n        8773, audit clean): kFun_three_add_it_norm_le_exp_five_halves_add_one\n        (kernel \u2264 e^{5/2}+1), dirichletC3 \u2264 1/2 (termwise 3-vs-2\n        comparison + dirichletC2 \u2264 1 \u2014 C_zeta3 charged 0.5, fold-\n        indifferent; 0.165/0.17 tightening path documented),\n        norm_logDeriv_zeta_le_half (\u2016\u03b6\u2032/\u03b6\u2016 \u2264 1/2, re \u2265 3),\n        **vIntegral_Jlag_three_norm_le**: \u2016V_left\u2016 \u2264\n        (U\u2212T)(e^{5/2}+1)/2. E-034 re-validated at C = 0.5: ALL CHECKS\n        PASS (margins 13 165/88 916/2.458e26).\n      - \u2192 DL-3 COMPLETE (session 040, LiDogLeg.lean +~430 lines, build\n        8773, audit clean): norm_term/norm_logDeriv_zeta_le_two_pow\n        (zeta halving 2^{\u2212(\u03c3\u22122)}\u00b7dirichletC2),\n        one_add_div_pow_norm_le_exp_four_ninths (kernel envelope\n        e^{(4/9)\u03c3} \u2014 single-exponential, no geometric series),\n        Jlag_dogleg_norm_le_envelope (dirichletC2\u00b7(4e^{\u2212c\u03c3}+4\u00b72^{\u2212\u03c3})),\n        integral_exp_neg_le (FTC machine), cdog_gt (c \u2265 0.2487),\n        exp_four_thirds_le (e^{4/3} \u2264 3.8073),\n        **hIntegral_Jlag_dogleg_norm_le \u2264 8.38** (charged with\n        dirichletC2 \u2264 1; tight R(1.5) = 5.94 = documented tightening\n        path). E-034 re-validated at Lean constants: ALL CHECKS PASS\n        (margins 13 160/88 911/2.458e26).\n      - \u2192 DL-4 COMPLETE (session 040, LiDogLeg.lean +~160 lines, build\n        8773, audit clean): kFun_right_vertical_norm_le_exp_sqrt_half_add_one\n        (w = 2\u221an kernel variant, e^{\u221an/2}+1),\n        **vIntegral_Jlag_right_norm_le** \u2264 (U\u2212T)(e^{\u221an/2}+1)\n        2^{\u2212(2\u221an\u22122)}\u00b7dirichletC2 \u2014 exponentially tiny; VRightBound\n        charged IIMaj/2 (provable with dirichletC2 \u2264 1; IIMaj/4 =\n        tightening path).\n      - \u2192 DL-5 COMPLETE (session 040, LiDogLeg.lean +~210 lines, build\n        8773, audit clean): **hIntegral_Jlag_low_le_dogLegUpper** +\n        **hIntegral_Jlag_low_neg_norm_le_dogLegUpper** (both \u2264\n        ((\u221an+1)/2)(e^{5/2}+1)/2 + 8.38 + IIMaj/2 for T \u2208 [\u221an, \u221an+1],\n        U = (3/2)T) + dogLegUpper_two_sides \u2014 the full dog-leg PROVED\n        in Lean, no perimeter, nothing above T_cut.\n      - \u2192 DL-6 COMPLETE (session 040, LiDogLeg.lean +~350 lines, build\n        8773, audit clean): the direct Dirichlet bound at re = 2\u221an \u2014\n        **norm_logDeriv_zeta_le_iimZeta \u2264 0.57\u00b72^{\u2212(2\u221an\u22122)} (n \u2265 5),\n        NO dirichletC2 \u2264 0.57 needed** (log2-leading + 3^{\u2212(2\u221an\u22122)}\n        tail with dirichletC2 \u2264 1); **V_right \u2264 IIMaj/4 EXACTLY**;\n        DL-5 upgraded to the quarter charge (dogLegUpper = VLeft +\n        8.38 + IIMaj/4 per side \u27f9 1.5\u00b7IIMaj total in Bn, the\n        convexity-safe coefficient). E-034 re-validated at IIMaj/4:\n        ALL CHECKS PASS.\n      - \u2192 ii\u2032-6-a2 COMPLETE (session 040): DogLegRight def + Bn\n        redefined (horizontal share 2(e\u2074+1)(7H\u0302) + 2\u00b7DogLegRight,\n        T = \u221an+1 UNCHANGED \u2014 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9\u00d710\u00b2\u2074 PRESERVED);\n        margin lockstep at coefficient level; 4/3-bracket strengthening\n        cherry-picked onto master (e11ad95); marginTilde_convex\n        re-proved (1.5\u00b7IIMaj, strict); base points re-certified\n        (Bn(8e4) \u2208 [273k, 332k], Bn(10\u2075) \u2264 352k \u27f9 margin(8e4) \u2265\n        4 001, hbase2 66 001 < 80 501); endpoints UNCHANGED; build\n        GREEN (8773 jobs); audit: 41 decls, 3 standard axioms, 0 sorryAx.\n      - THEN THE ORIGINAL PLAN RESUMES (D-074 \u00a78 return map): ii\u2032-6-c\n      (four side bounds with the repaired horizontal) \u2192 ii\u2032-6-d (fold\n      \u27f9 sfBoundProp) \u2192 ii\u2032-7 (closure at the ORIGINAL N\u2081 \u2248 9\u00d710\u00b2\u2074).\n      Fallbacks: (a) c = 1.5 paused branch (N\u2081 = 4\u00d710\u00b2\u2074); (b) c = 2\n      (N\u2081 = 2.25\u00d710\u00b2\u2074); (c) T = \u221an hidden-cancellation open question\n      (D-073 \u00a78 D4).\n      - \u2192 **ii\u2032-6-c STARTED (session 040 block B)**: FINDING F-E (D-074\n      \u00a79) \u2014 the I_I kernel charge e^{\u221an/2}+1 is off by one at\n      re w = 2\u221an near t = 0 (true value e^{\u221an/2+1/8}; latent in the\n      original D-036 charge); REPAIR ADOPTED: I_I charged honestly as\n      e^{1/3}\u00b7IIMaj (uniform kernel \u2264 e^{\u221an/2+1/3}+1, n \u2265 4), the\n      overrun absorbed by the fold's free dropped 2\u03c0 (e^{1/3} \u2264 1.4 \u2264\n      2\u03c0) \u2014 NO change to Bn/IIMaj/convexity/pinch/base points\n      (fatten-IIMaj rejected: iimaj_bracket_bound's 4.56 is linear).\n      - **6-c-i COMPLETE (a8c5b1e)**: LiSideBounds.lean scaffolding\n      (Z2hat_mono, nearZerosSub_mult_sum_le, logDeriv continuity,\n      Jlag_norm_eq, both zero-freeness lemmas, rectangle side\n      decomposition, VIntegral/HIntegral machinery, even symmetry).\n      - **ii\u2032-6-c..6-d COMPLETE (session 041)**: 6-c-ii I_III\n      (vIntegral_Jlag_left_norm_le, 6e5a98f), 6-c-iii I_I F-E form\n      (vIntegral_Jlag_right_le_exp_third_IIMaj, 9bd8ba9), 6-c-iv the\n      mid-horizontal segment machine (arcsinh-FTC from scratch \u2014\n      integral_one_div_sqrt_sq_add_sq + endpoints + per-zero \u2264\n      2\u00b7log(16.5/\u03b4) by pure log-mono, 1fed1df), 6-c-v the horizontal\n      assembly (mid + DL-5 tails both sides, 5d3dc0a), and **6-d THE\n      FOLD (774fec5): `sfBoundProp : SfBoundProp` PROVED** \u2014 |Sf n| \u2264\n      Bn FAlt n on [10\u2075, N\u2081] from EXACTLY the six declared perimeter\n      hypotheses (RHUpTo, ZeroCountProp, ZeroCountProp2,\n      ZeroCountGlobalProp, NoLowZeros, MZeroProp); the pinch NI + 5.5R\n      \u2264 7\u00b7H\u0302 discharged by a fully elementary log-mono chain (no\n      certified log numerics); the bridge cloned at T \u2264 3\u00b710\u00b9\u00b2 (the\n      range actually used \u2014 T \u2264 \u221an+1 holds exactly incl. n = N\u2081).\n      - **ii\u2032-6 COMPLETE.**\n- [x] ii\u2032-7 Closure: theorem sfBoundProp : SfBoundProp; final\n      lambda_pos_finite_height_closed (3 perimeter hypotheses only);\n      full axiom audit; paper Appendix B + tag upgrade (D-062 \u00a74\n      endpoint); archive closure + D-037 line-63 erratum pointer.\n      - \u2192 COMPLETE (session 041): **lambda_pos_finite_height_closed\n      PROVED** (a0943a6, LiClosed.lean) \u2014 \u03bb_n > 0 for ALL 1 \u2264 n \u2264\n      N\u2081 = (3\u00d710\u00b9\u00b2\u22121)\u00b2 from EXACTLY SEVEN declared hypotheses (the two\n      computational certificates + the five analytic perimeter Props);\n      full axiom audit (AuditSession041: 29 decls incl. the closed\n      chain \u2014 3 standard axioms only, 0 sorryAx); Paper A closure\n      (b64a839 + the session-042 review revision, compiles clean\n      11 pp \u2014 Appendix B rewritten: second tier COMPLETE + the\n      verbatim signature + the instantiation list + the dependency\n      chain; the B(n) display corrected + the F-A/F-B/F-E\n      correction-note footnote + the F-D dog-leg promoted to \u00a73.1;\n      abstract/intro to the seven-hypotheses headline; hedged novelty\n      (Oesterl\u00e9's unpublished precursor noted); AI Contribution\n      Statement factual refresh); archive closure (D-037 erratum\n      block + addendum, R-004 Lean-closure status, NGUYEN.md,\n      STATE.md, journals 041\u2013042). **SESSION-042 REVIEW REVISION\n      (user review)**: the finite-verification certificate\n      Misguich\u2013Voros (deformed sequence, private communication) was\n      RETRACTED and replaced by Johansson 2015 \u00a7 4.2 (rigorous\n      ordinary-\u03bb_n to 10\u2075); LiVerifiedUpTo reduced (5\u00b710\u2075) \u2192 (10\u2075)\n      (79c96f2, matches the checkable evidence \u2014 the assembly's\n      hfinite branch uses exactly n < 10\u2075).\n\n## 6. GRAVEYARD (documented dead ends \u2014 REQUIRED logging)\n\n| # | Attempt | Track | Obstruction found | Date |\n|---|---------|-------|-------------------|------|\n| G-001 | Multiple-zero bounds as chain constraint (Idea C) | A | s\u2082/p substitution symmetry (depth\u21920 pairs = doubles in all 2-moment data) | 2026-08-17 |\n| (A) | Zero-density input into chain (D-009 Idea A) | A | depth\u21920 off-line pairs invisible to N(\u03c3,T) bounds | 2026-08-17 |\n| G-002 | Moment-ladder certificates (tr G\u0303\u1d4f, k\u22653; oversampled grids) | A | RS availability \u03bb\u22642/k bites before usefulness; caps 0.607N (k=3, \u03bb=2/3) and 0.502N (k=4, \u03bb=1/2) both < 2/3; n\u208a q-invariant (E-005) | 2026-08-17 |\n| G-003 | Density certificates \u2192 de Bruijn\u2013Newman \u039b (task 3.3) | C | one-sided information: density theorems lower-bound the on-line fraction, \u039b needs an upper bound on the complex fraction; extremal vs averaged (E-012); asymptotic vs explicit | 2026-08-17 |\n| G-004 | \u03bb \u2192 \u03bb_a\u207b ground-state channel (task 2.13 follow-up) | B | disjoint feasibility windows: ground-state resolution needs a \u2272 1.3 (\u03bb_a superexponential), zero resolution needs a \u2273 4\u20136; discretization floor out-ranks \u03bb_a; D-046 sizing | 2026-08-19 |\n\n## 7. RESULT LEDGER\n\n| # | Claim | Status tag | Location |\n|---|-------|-----------|----------|\n| 0 | \u22652/3 simple on-line (inherited) | [PROVED] (R2) | Paper Thm A |\n| 1 | Galerkin realization of Suzuki's Weil-form operator A_a validated to 4.5e-6 against the zero-side explicit formula; Weil formula conventions machine-verified (Gaussian test, 9e-16) | [NUMERICAL-VALIDATED] | E-009a/b, D-019 \u00a71 |\n| 2 | \u03bb_a (bottom of Weil-form spectrum) positive at a = 0.25..5 with steep cliff (0.414 \u2192 \u22641.7e-12), consistent with Yoshida \u03bb_a>0 \u2200a \u27fa RH; independently matches Kim et al. superexponential decay report | [NUMERICAL] (upper bounds; conforming Galerkin) | E-009b, D-019 F1 |\n| 3 | Li coefficients \u03bb_n > 0 for all n \u2264 3000 computed from the arithmetic side (BL Thm 2, zero-free; flint Stieltjes + Arb \u03b6, dps 1000\u20131450), cross-validated vs E-008 zero side; \u03bb_1 to 102 digits; refined asymptotic ratio 1.00216 at n=2000, 0.999845 at n=3000 | [NUMERICAL-VALIDATED] | E-011, E-015, R-001 |\n| 4 | \u03be\u2032-certificate strength mechanism: perfect-square node in the diagonal law D\u2081 \u2248 s(1\u22122s)\u00b2 (prime-scale cancellation p ~ \u221a(T/2\u03c0)); Remark 7.1 constants reproduced to 5e-6; s\u2082/p symmetry does NOT break; gain not portable to \u03be | [NUMERICAL-VALIDATED] | E-013, R-002, D-022 |\n| 5 | Exact factorization W(a,\u03b8;z) = F\u00b7(R\u2080+R_\u03c4), F = z\u00b2\u03be/\u03be\u2032, with R\u2080 = 2e^{a+i\u03b8/2}sin(az\u2212\u03b8/2)+o(e\u1d43) closed form; Suzuki Cor 1.6 \u27fa (\u2605) tail-cancellation (Wiener\u2013Hopf remainder, RH-gated); W(a,\u03b8;0) = 0 double \u2200a,\u03b8; explains full E-010\u2013E-016 phenomenology | [PROVED (modulo std tempered-FT bookkeeping)] + [NUMERICAL-VALIDATED] (E-017: skeleton 3.7%\u21920.009%, off-axis cancellation 99.8%, \u03b8=\u03c0 preferred) | R-003, D-026, D-027, E-017 |\n| 6 | Explicit finite-height Li theorem: \u03bb_n > 0 for all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074 (T\u2080 = 3\u00d710\u00b9\u00b2 Platt\u2013Trudgian); conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9; explicit assembled chain (S_\u221e elementary lower bound + traced contour constants + margin convexity + finite verification; statement-level precursor Oesterl\u00e9 2000 unpublished, published weaker window Lagarias 2007). **FULLY MACHINE-PROVED 2026-08-26 (tier ii\u2032 complete): `LiSideBounds.sfBoundProp` + `LiClosed.lambda_pos_finite_height_closed` from exactly 7 declared hypotheses (2 computational certificates + 5 analytic perimeter Props); axiom audit on the full chain: 3 standard axioms only, 0 sorryAx; B(n) corrected in 4 places during the closure (F-A/F-B/F-D/F-E, D-037 erratum block + Paper A \u00a73 Step-2 footnote), statement unchanged; finite-verification certificate corrected session 042 (Misguich\u2013Voros RETRACTED \u2014 deformed sequence \u2014 \u2192 Johansson 2015 \u00a7 4.2 rigorous ordinary \u03bb_n to 10\u2075; LiVerifiedUpTo (5\u00b710\u2075) \u2192 (10\u2075))** | [PROVED-CONDITIONAL(computational RH-to-T\u2080; finite verification)] \u2014 R-bound fully traced D-056 (A = 10.5, B\u2080 = 48, honest C\u2080; E-028 verified, 26\u00d7 slack); N\u2080 = 80 000; margin convexity PROVED D-057 (E-029) | R-004, D-037, D-056, D-057, E-023, E-028; Lean: LiSideBounds.sfBoundProp, LiClosed.lambda_pos_finite_height_closed |\n\n## 8. SESSION PROTOCOL & RESEARCH ARCHIVE (MANDATORY)\n\nMulti-stage project: computer is shut down between stages. NOTHING may live\nonly in conversation. The archive below is the single source of truth.\n\n### 8.1 Archive map\n\n```\nSTATE.md                    \u2b50 resume point \u2014 READ FIRST every session\nresearch/\n\u251c\u2500\u2500 journal/session-NNN.md  per-session narrative log\n\u251c\u2500\u2500 results/R-NNN-*.md      one file per result (+ index.md ledger)\n\u251c\u2500\u2500 graveyard/G-NNN-*.md    one file per dead end (+ index.md)\n\u251c\u2500\u2500 derivations/D-NNN-*.md  worked derivations (+ index.md)\n\u251c\u2500\u2500 numerics/scripts/       deterministic experiment scripts\n\u251c\u2500\u2500 numerics/data/          E-NNN-*.csv + E-NNN-*.json metadata sidecars\n\u251c\u2500\u2500 research.db             SQLite catalog (sessions, results, graveyard,\n\u2502                           derivations, experiments) \u2014 schema in\n\u2502                           numerics/scripts/schema.sql, CLI: db.py\n\u2514\u2500\u2500 paper/                  paperA.tex (Paper A, split 2026-08-20),\n                            paperB.tex (research-note skeleton),\n                            draft.tex (FROZEN pre-split combined copy),\n                            references.bib\n```\n\n### 8.2 Storage conventions\n\n- Results/derivations/graveyard: plain Markdown, honesty tag on every claim.\n- Numerics: DUAL storage \u2014 CSV+JSON sidecar (human/paper-readable) AND\n  SQLite registration (queryable), written together via db.py.\n- Data is cached; scripts never recompute unless --force.\n- Paper assembled only from tagged files in results/.\n\n### 8.3 Session START protocol\n\n1. Read STATE.md \u2192 resume point, next action, open threads, blockers.\n2. Skim latest journal entry + results/index.md.\n\n### 8.4 Session END protocol (before any shutdown \u2014 no exceptions)\n\n1. Write journal/session-NNN.md (work, decisions, outcomes).\n2. File every result/dead end/derivation in its own file; update index.md\n   files; register in research.db.\n3. Update NGUYEN.md checklist (\u00a75), Graveyard (\u00a76), Result Ledger (\u00a77).\n4. Update STATE.md LAST with an explicit \"NEXT ACTION:\" line.\n5. git add + commit with session number in the message.\nNOTE: save artifacts IMMEDIATELY when produced (crash-safe), not batched.\n\n### 8.4a FORK RULE (user directive, 2026-08-17)\n\nWhen the path FORKS (multiple candidate directions), do ALL of them \u2014\none by one \u2014 then pause to gather thoughts and evaluate the next step\ntogether. No path is dropped at a fork by choice alone; paths are only\nclosed by documented obstruction (Graveyard) or deprioritized by\nevidence after all forks are explored.\n\n### 8.5 PACING & SUB-STAGES (user directive, 2026-08-17)\n\n- NO RUSH. This is long-term research; correctness and rigor outrank speed.\n  Take whatever time a stage needs to be done right.\n- SUB-STAGE RULE: if a stage will take a few hours, break it into smaller\n  sub-stages, each ending in a clean, committed, resumable state (per \u00a78.4).\n  Record sub-stage breakdowns in STATE.md.\n- BREAK PROMPT: if work is running long \u2014 ESPECIALLY approaching 5:00 PM\n  local time \u2014 pause and ASK the user whether to continue, take a break,\n  or log off (run \u00a78.4 end protocol before stopping).\n\n### 8.6 SESSION LOG (summary; details in research/journal/)\n\n- Session 001 (2026-08-17): Blueprint + mission prompt ingested; research\n  archive installed (git + SQLite + LaTeX skeleton). \u2192 Begin Phase 0.\n- Session 002 (2026-08-17): Phase 0 + Phase 1 complete (Track A \u2192\n  monitoring mode, D-013); Track C begun (3.1 D-014, E-006\u2013E-008, 3.4a/b,\n  D-018 Suzuki scoping).\n- Session 003 (2026-08-17): Q-3.4c complete \u2014 E-009a (Suzuki g validated),\n  E-009b (Galerkin A_a, validated vs zero side 4.5e-6; \u03bb_a cliff),\n  D-019 (analysis; Q-S1 verdict; E-010 proposed). Weil explicit-formula\n  conventions machine-verified (D-001 NT-1).\n- Session 004 (2026-08-17): recovered killed session (E-011 orphaned\n  mid-edit); paper archive reorg; E-010 extended (a\u22648, \u03bb=\u22121); ALL 4 FORKS\n  COMPLETE \u2014 E-010 (fork 1, session 003); E-011/R-001 (fork 2: Li \u03bb_n > 0,\n  n \u2264 2000, arithmetic side); 3.3 answered NO (fork 3: D-021 \u2192 G-003,\n  E-012); T4 CLOSED (fork 4: D-022/R-002 \u2014 \u03be\u2032 strength = perfect-square\n  node in D\u2081, not portable to \u03be; T4b opened). Q-S3 attacked (D-023,\n  E-014): Cor 1.6 density wall mapped to a=10 (maximal lattice,\n  interlacing exact, no thinning \u2014 scale limitation, not a wall);\n  \u03b8=\u03c0 candidate found; Q-S3a/b/c queued. Detached-run machinery\n  established.\n- Session 005 (2026-08-18): user approved do-all-one-by-one plan\n  (A3\u2192A1\u2192A2\u2192C\u2192B, D in background). D launched: E-015 Li n\u22643000\n  detached (in progress at stop; sandbox blocks multiprocessing spawn \u2014\n  detached launches need sandbox disabled). A3 done: E-016 + D-024 \u2014\n  Herglotz \u03c1_W at \u03b8=\u03c0 vs \u03c1_F; V1/V2/V4 pass, V3 (zero-Poisson\n  reconstruction) fails rel ~0.3, root cause open; findings: \u03b8=\u03c0 zeros\n  real, z\u2081(\u03c0)\u00b7a\u22484.5 stiff law, no \u03b8=\u03c0 zero in (0,\u03c0/a), raw-L2 \u03b8=\u03c0\u2248\u03b8=0\n  (plateau-dominated metric). Stopped mid-V3-root-cause (user break;\n  3 network dropouts, no state loss).\n- Session 006 (2026-08-18): REGROUP (user-requested). Full archive audit:\n  all 16 experiments have CSV+JSON sidecars and db registrations; fixed\n  db hygiene (sessions 3\u20135 registered; row_counts corrected for E-010\u2013\n  E-016). Checklist revised: Phase 2 restructured \u2014 Suzuki/Cor 1.6 line\n  recognized as the live spectral program (2.1 partial, 2.4 active; new\n  tasks 2.6 V3-root-cause, 2.7 Q-S3a analytic, 2.8 Q-S3b backend);\n  3.4 checked off (answered YES); NEW tasks 3.5 (Li asymptotic attack \u2014\n  most direct criterion-#1 path), 1.6 (\u03be\u2032-world ceiling), 1.7 (T4b\n  scoping). Active order confirmed: 2.6 \u2192 2.7 \u2192 2.8 \u2192 1.6 \u2192 1.7, with\n  3.5 as standing high-value background thread.\n- Session 006 cont. (2026-08-18): task 2.6 COMPLETE \u2014 E-016 V3\n  root-caused (E-016b: winding-excess diagnostic finds double zero at\n  origin, \u00b1i\u03b5 pair; EM-tail factor-y bug found + confirmed quantitatively)\n  and REPAIRED (E-016c: V5 1.75e-16, V6 \u22644.4e-15, V3R 1.5\u20132.0e-5, ALL\n  CHECKS PASS); D-025 filed; E-016 F1\u2013F4 stand.\n- Session 006 cont.2 (2026-08-18): task 2.7 COMPLETE \u2014 **breakthrough\n  reduction**: W(a,\u03b8;z) = F\u00b7(R\u2080+R_\u03c4) EXACT (F = z\u00b2\u03be/\u03be\u2032, R\u2080 closed-form\n  sine skeleton); Cor 1.6 \u27fa (\u2605) tail-cancellation (Wiener\u2013Hopf remainder,\n  RH-gated). R-003 promoted to ledger (#5). E-017: off-axis cancellation\n  already 99.8% at a=4; \u03b8=\u03c0 preferred; open content isolated to \u211d.\n- Session 006 cont.3 (2026-08-18): task 2.8(i) complete \u2014 E-018 descent\n  profile: (\u2605) cancellation strip-uniform (median |M|/|R\u2080| ~5\u20137e-3,\n  y\u2080\u2208[0.1,1]); open content = zero set of M only; \u03b8-preference found\n  metric-dependent. D-028.\n- Session 006 cont.4 (2026-08-18): task 2.8(ii) complete \u2014 backend v2\n  (blockwise \u039b to e\u00b2\u2074, validated 2.2e-7/4.4e-8) + E-019 at a=12: NO\n  transition (maximal lattice, z\u2081\u00b7a=4.495, gap CV \u2193, origin pair +2.0000\n  winding excess, \u03b3-proximity chance-level, envelope stationary). 2.8\n  CLOSED; a=13+ deprioritized by evidence (D-029). \u2192 Next: 1.6\n  (\u03be\u2032-world ceiling).\n- Session 006 cont.5 (2026-08-18): task 1.6 COMPLETE \u2014 E-020b window\n  optimum for kernel D\u2081 = 0.86864 to 1e-6 (quartic window IS the\n  optimum; control recovers MT); \u03be\u2032-world saturated, nothing transfers\n  to \u03be; E-020 adversary-pool limitation documented (D-030). User\n  decision: do 1.6 then 1.7 as queued (option #1). \u2192 Next: 1.7 (T4b\n  scoping).\n- Session 006 cont.6 (2026-08-18): task 1.7 COMPLETE \u2014 T4b CLOSED\n  (D-031): node mechanism iterates formally (\u03be\u2033 \u2248 0.94 leading-order)\n  but G-001 symmetry caps every \u03be\u207d\u1d4f\u207e data class below 100%; Speiser/\n  Levinson\u2013Montgomery route to RH closed at every order; revival\n  condition noted. Session-005 queue (A3\u2192A1\u2192A2\u2192C\u2192B) NOW FULLY DONE.\n  \u2192 Next: 3.5 (Li asymptotic attack) or (\u2605) analytic attack.\n- Session 006 cont.7 (2026-08-18): task 3.5 DESIGN COMPLETE (user\n  directive: do 3.5 then (\u2605), then analyze for next stage). D-032\n  literature map: Voros \u2014 \"\u03bb_n>0 \u2200n\u2265N\u2080\" \u27fa RH at ANY N\u2080; Lagarias\n  Thm 6.1 finite-height bridge is the exploitable skeleton. D-033:\n  achievable deliverable = EXPLICIT finite-height theorem (\u03bb_n>0 \u2200n\u2264N\u2081\n  \u2248 10\u00b2\u2070\u201310\u00b2\u2074 from Platt T\u2080 + traced constants + finite verification);\n  wall = three-way arithmetic cancellation (triangle bounds explode).\n  New tasks 3.6/3.7/3.8 (D-036 constants, E-021 S_\u221e, D-037 assembly).\n- Session 006 cont.8 (2026-08-18): task (\u2605) DESIGN COMPLETE. D-034:\n  WH factorization + RH is unexplored territory (26 arXiv hits all\n  Riemann\u2013Hilbert); Krein/Gohberg\u2013Feldman/de Branges\u2013Krein machinery\n  exists. D-035: resolvent-convergence route \u2014 D_{a,\u03b8(a)}\u2192D in Krein\n  space; Cor 1.6 \u27fa D has real spectrum (deliverable D1); three-layer\n  wall (index/persistence=RH/circularity); off-axis 99.8% cancellation\n  is TAUTOLOGICAL (entirety of W forces it), the \u211d-envelope is the\n  whole problem. New tasks 2.9/2.10/2.11.\n- Session 007 (2026-08-18/19): task 3.6 marked done; task 3.7 (E-021)\n  COMPLETE after 6-bug root-cause saga (mpmath zeta ~58-digit ceiling,\n  GAMMA_E float literal, 3\u00d7 parse-before-dps, \u03c3-omission boundary\n  (15/14)\u207f, float64 zeros). E-021 ALL CHECKS PASS: V1 4.8e-25 vs\n  E-015; A = 0.9, B\u2080 = 1.0 measured; c\u2080 = \u22121/4 (+1/(24n) correction);\n  |S_f| max 13.52 at n = 3298 vs traced bound ~2280 (~170\u00d7 slack).\n  Resources folder (29 RH-equivalence notes) read in full. Next: 3.8\n  (D-037 \u2192 R-004 finite-height theorem assembly).\n- Session 008 (2026-08-19): REGROUP + R7 registration (resources atlas\n  indexed: resources/index.md, manifest R7, D-001 Part III pointer).\n  Task 3.8 COMPLETE \u2014 **R-004 finite-height Li theorem**: \u03bb_n > 0 for\n  all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074 (T\u2080 = 3\u00d710\u00b9\u00b2 Platt\u2013Trudgian);\n  conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9. E-023 support computation ALL\n  CHECKS PASS: D-036 |t|<10 gap found + closed (M\u2080 = 1.3352), S_\u221e\n  elementary lower bound validated vs exact (min slack 9.52), N\u2080 =\n  5\u00d710\u2074 adopted (crossover 32 871 traced / 30 217 measured), margin\n  convex, margin(N\u2081) = 2.46\u00d710\u00b2\u2076. Ledger #6. Criterion-3 deliverable \u2014\n  the maximal content of the Li route short of RH. Task 2.10 COMPLETE\n  same session: E-022/E-022b + D-040 \u2014 spectral measures \u03bc_a (Clark\n  weights 1/K_a(z_k,z_k)) for a \u2264 12; **valley observable**: K_a(z,z)\n  dips exactly at the true \u03b3's, \u0394(a) \u2248 3.33 \u2212 4.76/a saturating at\n  fixed \u03b8=\u03c0; \u03b3-information flows through weights, not positions; mass\n  within \u00b10.1 of \u03b3's 63\u219272.5%; new constraint on 2.9-D1 (\u03b8(a) must\n  drive \u0394 \u2192 \u221e). Next: 2.9-D1, 2.11 (D-038); optional D-039 digamma\n  upgrade.\n- Session 009 (2026-08-19): **PHASE 4 COMPLETE.** Session-008 leftovers\n  (D-052 4.1/4.2, D-053 4.3a gate PASS) committed. 4.3b (D-054): four\n  independent-instance reviews + hand-verification \u2014 ALL THREE TAGS\n  downgraded (D-039 proof broken/bound true; D-036 \u00a71 far-sum\n  O(|t| log t) hole \u2014 reference-point trick missing; D-049 B1/B3 lower\n  bounds broken; \u03b4_crit one-direction; T-2 \u21d0 skeleton; D-052 accounting\n  fixes). Theorem statements survive (margins robust); repair map\n  4.5a\u20134.5d opened. 4.4 (E-027 + D-055, ALL CHECKS PASS): detector\n  stress test \u2014 bare-form negativity immediate for any \u03b4 > 0 (no\n  threshold); tuned-carrier threshold \u03c0/(2a) exact (\u22640.9%); pencil\n  onset magnitude-limited (0.11@a=4, 0.038@a=8); directions localized\n  at the pair. **Repairs 4.5a\u20134.5d COMPLETE same day**: D-056 (R-bound\n  reference-point proof, A = 10.5/B\u2080 = 48, honest C\u2080) + E-028 (N\u2080 =\n  80 000, 26\u00d7 slack); D-057 (convexity proved) + E-029; D-058 (valley\n  lower bounds via node-killing; B3/m_\u03b3/detector fixes); D-059\n  (bookkeeping: punctured compacts, R_\u03c4, Lemma FD, L1). R-004 tag\n  fully restored with the analytic chain proved end-to-end. Paper\n  updated (R-004 constants, valley theorem corrected form, E-027\n  appendix item). Next: Phase 5 / paper finalization.\n- Session 010 (2026-08-19): **PHASE 5: 5.3 + 5.4 COMPLETE; 5.1/5.2 at\n  skeleton stage.** 5.3: paper draft fully written (Introduction,\n  Background, Formal verification; abstract retagged; clean 12 pp\n  MiKTeX compile). 5.4 (D-060): full honesty audit \u2014 4 independent\n  instances, ~55 claims, 0 unsupported; 10 draft corrections\n  (critical: (1.12)\u27faspec(D)\u2282\u211d split \u2014 converse is SKELETON L3/L4;\n  flat-window fix; B(n) explicit remainders); 7 archive errata filed\n  (D-036 \u22121/(24n) sign, D-056 title constants, D-055/D-058 \"0.9%\" \u2192\n  0.02\u20132.3%, D-042/D-043 Z/6 \u2192 Z/(2\u03c0) supersession by D-045, R-004\n  post-repair update). 5.1/5.2 (D-061): elan + v4.33.0-rc2 installed;\n  zeta-23-lean FULL BUILD green (9010 jobs \u2014 D-007 rebuild done);\n  5.2 verified LIVE (all comparator PrintAxioms = 3 standard axioms,\n  verbatim AUDIT.md match); NguyenRH1 skeleton package created\n  (research/lean/NguyenRH1/, 9 statements compile, path-requires to\n  the vendored repo, no new axioms, sorryAx-marked). Next: prove the\n  elementary Lean tier (sInfty_lower_bound, marginTilde_convex) or\n  optional numerics (E-023b, E-021 n=10\u2074).\n- Session 011 (2026-08-19): **Lean tier (i) COMPLETE** (journal-011;\n  ~1100 lines, 10 commits; user machine crashed mid-session, zero work\n  lost). chain_rule_sqrt_shift, sInfty_lower_bound (Bernoulli truncation\n  + \u03b3-shifted harmonic bounds, parity algebra, tsum summability\n  discharged), marginTilde_convex (8-block \u03c8-table + analytic IIMaj\u2033\n  bound \u2264 1.316 < 2 via factor monotonicity; convexOn_of_deriv2_nonneg)\n  all PROVED, PrintAxioms = 3 standard axioms only. End-of-session user\n  directive: read session-012-notes.txt before Session 012.\n- Session 012 (2026-08-20): **Lean tier (ii) STEP 1 COMPLETE** (option\n  (a) per session-012-notes.txt, assembly-first split).\n  lambda_pos_finite_height PROVED modulo the single named analytic\n  hypothesis SfBoundProp (\u2200 n \u2208 [10\u2075, N\u2081], |Sf n| \u2264 Bn FAlt n) +\n  perimeter (RHUpTo, LiVerifiedUpTo) + 2 elementary margin evaluations\n  (hbase/hbase2). No sorryAx in LiSkeleton.lean. Design: FAlt majorant\n  swap (true F+S_b has \u03c8 > 0 on [5.47,~16] \u2014 caught pre-instantiation;\n  negative-weight term dropped, cost 0.9\u221an); secant two-point base\n  (pos_of_convex_of_two_points); margin regularity \u2192 ContDiffOn (Ioi 1).\n  D-062: SfBoundProp triage (layers L0\u2013L7) + PERIMETER DECISION \u2014\n  Trudgian 2014 N(T)/S(T) inside the trusted perimeter, declared in the\n  paper appendix (compile clean, 12 pp). D-062 \u00a75: base-point discharge\n  plan validated at dps 40 (plan bounds margin(8\u00d710\u2074) > 9 960;\n  margin(10\u2075) > margin(8\u00d710\u2074) by \u2265 2.2\u00d710\u2074 slack). CONTINUATION same\n  day (session-012-end-notes.txt, mathematician review actioned):\n  **tier (ii) STEP 2 COMPLETE** \u2014 LiBasePoints.lean (~560 lines)\n  discharges both margin evaluations by certified rational interval\n  bounds (exp \u2264 (1\u2212x/16)\u207b\u00b9\u2076 trick, partial sums, d9/d20 rationals);\n  **lambda_pos_finite_height_verified** = R-004 modulo SfBoundProp +\n  perimeter ONLY (3 hypotheses), PrintAxioms clean. Paper reconciled:\n  margin trail footnote (16 020 \u2192 15 764 \u2192 \u2265 8 001 certified),\n  formal-status paragraph at 3 hypotheses; compile clean 12 pp.\n  Review guidance adopted: tier ii\u2032 (contour interior) is\n  post-publication; Paper A ready to split/finish.\n- Session 013 (2026-08-20): **PAPER SPLIT EXECUTED** (user \"go go\"\n  after the minor-items assessment). paperA.tex (8 pp, clean): the\n  self-contained finite-height Li artifact \u2014 retargeted abstract/intro\n  with the three-named-hypotheses Lean headline, \u00a73 R-004 with the\n  reconciled margin-trail footnote, obstruction context, Li numerics\n  appendix, formal-verification appendix. paperB.tex (6 pp skeleton):\n  spectral-line note opening with the \u00a70 standing-items box (trace-or-\n  demote R-003's FT bookkeeping/o(e\u1d43); L3/L4; authorship policy).\n  draft.tex FROZEN (pre-split combined archive copy). Minor item 1\n  (number-trail note) filed at 10fdda6 before the split. Author block\n  carried verbatim except one typo fix (\"fromAnthropic\" \u2192 \"from\n  Anthropic\"); authorship itself untouched (user's call). Also\n  repaired: the \u00a79 header accidentally eaten by the session-011/012\n  log edit. CONTINUED same day: authorship set to sole author Dan T\n  Nguyen, Research Ai (user directive; both papers + frozen draft);\n  AI Contribution Statement + title footnote + one-line\n  Acknowledgments added to both papers (user directive, review\n  template); voros2017li reference corrected (real: Exp. Math. 29(4)\n  2020); submission documents written (cover-letter.md targeting\n  Experimental Mathematics + referee-list.md); **pre-submission audit\n  of NguyenRH1 ALL CHECKS PASS (D-063)**: clean-room rebuild green,\n  exhaustive axiom sweep of all 139 declarations (134 standard-only +\n  5 intended skeletons), statement-to-paper correspondence exact,\n  inherited comparators verbatim. Paper A is submission-ready pending\n  the user's read-through. Paper B assessment: more experiments NOT\n  needed (evidence ceiling documented); queued Task 1 = R-003\n  tempered-FT bookkeeping trace (\u2192 D-064) as next research action.\n- Session 014 (2026-08-21): **TIER ii\u2032 LAUNCHED** (user decision:\n  option (a) \u2014 close SfBoundProp in Lean BEFORE submission; Paper A\n  frozen/submittable throughout). Sub-stage ii\u2032-0 COMPLETE (D-064\n  design doc). TWO DISCOVERIES: (1) **liCoeff encoding defect** \u2014\n  unordered tsum NOT Summable (junk 0) \u27f9 LiVerifiedUpTo/SfBoundProp\n  FALSE as encoded, session-012 theorems vacuous; paired-form fix\n  designed (ii\u2032-1a, next). (2) **Crux identity Sf(n) = Res\u2081(n) EXACT**\n  (Sf := S_\u221e+1\u2212\u03bb_n = the w=1 residue \u03a3_j C(n,j)c_{j\u22121}) \u2014 numerically\n  verified: (4.10) j=0 exact 15 digits; \u03bb\u2082 prediction matches E-015\n  certified value; residue theorem sides = \u03bb_n(T)+triv+Res\u2081 verified\n  2e-21. Assembly TAIL-FREE: |Sf| \u2264 |\u03bb_n(T)|+|sides|+|triv| = B(n).\n  Routes R1\u2013R5 decided (R2(iii) (4.10) = long pole: EF-reuse first,\n  Hadamard fallback); sub-stage map ii\u2032-1a..7 (~9\u201316 sessions); all 8\n  planned Zeta23 dependencies axiom-checked live (clean). NOTE: the\n  R-003 bookkeeping doc is renumbered D-065 (D-064 taken by this\n  design doc). Freeze protocol in force.\n- Session 015 (2026-08-21): **ii\u2032-1a COMPLETE** \u2014 liCoeff encoding\n  defect repaired: paired symmetric liSummand (\u00bd\u00b7mult\u00b7(f \u03c1 + f \u03c1\u0304),\n  manifestly real) replaces the junk tsum; `liSummable` PROVED\n  (~340 lines LiSkeleton \u00a71: geometric-sum tail bound |Re f| \u2264 2n\u00b2/\u2016\u03c1\u2016\u00b2,\n  (9/4)\u2016\u03c1\u2016\u00b2 comparison, (9/2)n\u00b2\u00b7mult/(1+\u2016\u03b3\u2016\u00b2) dominator, Zeta23\n  zero_sum_inv_sq + finite ball); full rebuild GREEN (8741 jobs, zero\n  downstream changes); axiom audit 3 standard axioms only.\n  LiVerifiedUpTo/SfBoundProp are now TRUE statements. Phase 5B\n  checklist installed (commit 7a395b2). Next: ii\u2032-1b residue machinery.\n- Session 016 (2026-08-21): **ii\u2032-1b(i)+(ii) COMPLETE** \u2014 LiResidue.lean\n  (zetaA = (w\u22121)\u03b6 analytic at 1 via removable singularity; hLi analytic,\n  value 1, punctured agreement; lcoeff; A_iter; **ResW1_eq_sum**: the\n  w=1 residue = \u03a3_{j=1}^n C(n,j)\u00b7lcoeff(j\u22121) by iteratedDeriv_mul\n  Leibniz) + LiPrincipal.lean (rectInt_deriv_eq_zero per-side FTC;\n  Acoeff/ppart/Gprim; **rectInt'_ppart**: principal part integrates to\n  ResW1 n on any rectangle with 1 interior). 3 standard axioms only.\n- Session 017 (2026-08-21): **ii\u2032-1b(iii) COMPLETE \u2014 ii\u2032-1b FULLY\n  DONE** \u2014 LiSides.lean (~460 lines): **rectInt'_Jlag**, the rectangle\n  residue theorem for the Lagarias-kernel integrand:\n  RectangleIntegral' (Jlag n) z w = ResW1 n + \u03a3_{\u03c1\u2208Sz} (zeroMult\n  \u03c1)\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) (1 interior, \u03b6 \u2260 0 on border, Sz = zeros inside,\n  supplied form). Removable singularity at 1 via Taylor-remainder order\n  \u2265 n+1 (Ffun\u2212TaylP); logDeriv-NF residues at zeros (multiple zeros\n  OK); zeta_order_ne_top_of_ne via the entire zetaA (identity\n  principle on univ, no punctured-plane connectedness needed; zetaA 1\n  = 1 makes \u03b6(1)'s junk value irrelevant). Root NguyenRH1.lean now\n  imports LiResidue/LiPrincipal/LiSides; full build GREEN (8745 jobs);\n  19 new decls, 3 standard axioms only. Deferred: zeroMult(\u22122) = 1\n  (trivial-zero simplicity) \u2014 ii\u2032-4. Next: ii\u2032-2 elementary swaps.\n- Session 018 (2026-08-21): **ii\u2032-2 COMPLETE** \u2014 LiSwaps.lean: the two\n  elementary swaps. R2(i) `liCoeff_eq_sum_sigma`: \u03bb_n = \u03a3_{j=1}^n\n  (\u22121)^{j+1}C(n,j)\u03c3_j with paired power sums (per-slice summability via\n  the ii\u2032-1a skeleton; j=1 paired exactness Re(1/\u03c1) = Re(\u03c1)/|\u03c1|\u00b2).\n  R2(ii) `sInfty_eq_sum`: S_\u221e(n) = \u03a3_{j=1}^n (\u22121)^jC(n,j)a_j (n \u2265 1;\n  oddSlice p-series domination; the j=1 \u2212n/m + n/m exact cancellation;\n  \u03a3_{j=2}^n(\u22121)^jC(n,j) = n\u22121). 12 new decls, 3 standard axioms only;\n  full build GREEN (8746 jobs). Next: ii\u2032-3 (4.10), the long pole.\n- Session 019 (2026-08-21): **ii\u2032-3 DESIGN (D-066) + piece (B)\n  PROVED**. Route investigation: \u03b21 (Hadamard) OUT \u2014 Mathlib lacks\n  Weierstrass/order machinery (extract_zeros_poles is finite-only);\n  \u03b22 (EF reuse) OUT \u2014 moment kernels not entire. **Route \u03b24 ADOPTED**:\n  contour moments (ii\u2032-1b machinery) + coefficient split; R-bound\n  identified as shared with ii\u2032-5 \u27f9 resequenced pipeline ii\u2032-3a \u2192\n  ii\u2032-4 \u2192 ii\u2032-5 \u2192 ii\u2032-3b \u2192 ii\u2032-3c. Mathlib inventory verified live\n  (digamma_one_half \u2713, Weierstrass-convergence \u2713, LSeries vonMangoldt\n  \u2713, logGammaSeq \u2713; completedRiemannZeta\u2080 noted as the wrong \u03be).\n  Piece (B): LiZetaCoeff.lean \u2014 iteratedDeriv_hLiExt (coefficients of\n  1/s + \u03b6\u2032/\u03b6(1+s) at 0 are \u2212j!\u00b7lcoeff j); 6 decls, 3 standard axioms;\n  build 8747 green. Next: piece (A) archimedean \u03c4-evaluation.\n- Session 020 (2026-08-21/22): **ii\u2032-3a COMPLETE** \u2014 piece (A) PROVED:\n  `iteratedDeriv_logDeriv_Gamma\u211d` (the archimedean Taylor coefficients\n  are (\u22121)^{j+1}\u00b7j!\u00b7a_{j+1}, all j \u2265 0). The digamma partial-fraction\n  series built from scratch (logGammaSeq \u2192 deriv-limit interchange \u2192\n  Weierstrass + identity principle \u2192 iteratedDerivWithin_tsum termwise\n  values \u2192 odd-m reindexing \u2192 2^{j+1} scaling); LiDigamma.lean +\n  LiArchimedean.lean. Build GREEN (8749 jobs); 18 decls audited clean.\n  Two elaboration gotchas banked (bare \u03c0 auto-binds; bare \u2191 drops coe).\n  Next: ii\u2032-4 (L3 zero-avoiding T + L1 kernel bounds).\n- Session 021 (2026-08-22): **ii\u2032-4 COMPLETE** (LiContour.lean, ~400\n  lines, three sub-stage commits). L3 `exists_zero_avoiding_T` (midpoint\n  pigeonhole on the perimeter `ZeroCountProp`; clearance\n  1/(3\u00b7C0hat(a+1))). L1 kernel bounds (`kFun_norm_le_two`,\n  `kFun_shift_norm_le_exp_four_add_one`,\n  `kFun_shift_norm_le_exp_sqrt_half_add_one`, `kFun_neg_two` \u2264 1) via the\n  normSq core `norm_one_add_one_div_le`. Trivial-zero simplicity\n  `zeroMult_neg_two` (zeroMult(\u22122) = 1) via \u03b6 = (s+2)\u00b7\u039b/Hfun near \u22122,\n  Hfun = 4\u03c0^{\u2212s/2}\u0393(s/2+2)/s, Hfun(\u22122) = \u22122\u03c0 \u2260 0, \u039b(\u22122) = \u039b(3) \u2260 0.\n  Build GREEN (8751 jobs); 17 decls audited: 3 standard axioms only.\n  Also (website, non-research): fixed /dashboard/ 500 (git_log cp1252\n  decode) + Roadmap Phase 2/5B list rendering (python-markdown list\n  interruption) \u2014 web/ only, logged in RH-WEBSITE.md \u00a77. Next: ii\u2032-5\n  (R-bound, the long pole).\n- Session 022 (2026-08-22): **ii\u2032-5a DESIGN (D-067) + ii\u2032-5b COMPLETE**.\n  D-067: route b\u2033 for the R-bound \u2014 Davenport disc at 2+it (R = 5/2)\n  + FE-reflection with exact zero-sum cancellation; Stirling-free\n  (digamma_stirling subsumes Lemma D), Hadamard-free; the \"every disc\n  dips left of \u03c3 = 0\" obstruction resolved by one extra EM level.\n  ii\u2032-5b (LiRBound.lean, ~640 lines): b2Fun machinery (comp_fract''\n  continuity trick), the level-2 IBP identity integral_b1_cpow_eq,\n  parameter-integral analyticity (re > \u22121), the level-2 \u03b6\n  representation via the convex W\u00b1 regions (sidesteps the\n  punctured-halfplane connectedness grind), and norm_riemannZeta_le_disc\n  (\u2016\u03b6\u2016 \u2264 (3/4)|t|\u00b2 on B(2+it, 5/2), |t| \u2265 10). Build GREEN (8752\n  jobs); 27 decls axiom-clean. Next: ii\u2032-5c (Davenport disc argument).\n- Session 023 (2026-08-22, HALT BY USER at a clean boundary): **ROUTE\n  REVISION (D-067 \u00a76)** \u2014 the disc-only BC constants provably cannot\n  reach the baked 10.5/48 (factor \u2265 16\u00d7 the M-coefficient) \u27f9 two-stage\n  plan: loose disc bound = growth input for the partial-fraction\n  identity (5e), then D-056's tight analysis of the identity (5f).\n  **ii\u2032-5c HALF** (LiDisc.lean, green): zeroDiscFinset +\n  zeroDisc_isNontrivial (re \u2265 1 via Mathlib's one_le_re nonvanishing;\n  re \u2264 0 via \u0393R-pole/FE); scaledZeta + F(0) = 1 (Zeta23\n  zeta_lower_bound_two, no \u03bc-series build); the multiplicity-invariance\n  chain (affine/const-mul/scaled); scaledZeta_jensen_count\n  (ZerosBound). Next: 5c back half \u2014 R-gap, g analytic+nonvanishing,\n  BC assembly.\n- Session 024 (2026-08-22): **ii\u2032-5c COMPLETE** (commit c7cbae5;\n  LiDisc.lean +~1000 lines, 32 new decls, all audited: 3 standard\n  axioms only). R-gap selection by the \u00d710-RESCALE TRICK (zero new\n  pigeonhole code: exists_avoiding_midpoint at a = 23 on the \u00d710\n  zero-norm image, \u00f710 \u27f9 R_c \u2208 [2.3, 2.4], clearance gapD =\n  1/(50(k+1))); the Blaschke quotient g = Cf r_c F built entirely on\n  Zeta23's Cf API (CfAnalytic/ZeroFactorization; nonvanishing on\n  closedBall(0, r_c) \u2014 the gap makes the sphere zero-free); |g| \u2264\n  (9/4)|t|\u00b2\u00b7gapD^{\u2212M_c} by max-modulus; center log|g(0)| \u2265 0;\n  LogOfAnalyticFunction (r = 3/5, R = r_c) + BorelCaratheodoryDeriv\n  (16M\u00b7r_c\u00b2/(r_c\u22123/5)\u00b3 \u2264 450M); logDeriv chain (div/prod/pow/comp) +\n  the affine push-forward (sum_image + order invariance) + the\n  near/extras split (extras \u2264 Jensen count via |s\u2212\u03c1| \u2265 |t\u2212\u03b3| \u2265 1).\n  **Capstone `logDeriv_riemannZeta_sub_nearZeros_le`**: the LOOSE\n  R-bound \u2264 100000\u00b7(log|t|)\u00b2 on \u03c3 \u2208 [1/2, 7/2], |t| \u2265 10, \u03b6 s \u2260 0 \u2014\n  no perimeter hypothesis (Jensen count, not ZeroCountProp). Constant\n  fold: log(33/32) \u2265 1/33 (log x \u2265 1\u22121/x), log 4150 \u2264 9 (e > 2.71),\n  M_bound \u2264 420L\u00b2. Build GREEN (8753 jobs; LiDisc now root-imported).\n  Next: ii\u2032-5d (FE-reflection + left digamma bound).\n- Session 025 (2026-08-22): **ii\u2032-5d COMPLETE** (LiReflect.lean, ~640\n  lines, 26 new decls, all audited: 3 standard axioms only). The FE\n  logDeriv identity `logDeriv_zeta_fe` (via \u039b =\u1da0 \u0393R\u00b7\u03b6 near good points\n  + the \u039b(1\u2212z) = \u039b(z) chain-rule negation); the EXACT zero-sum\n  cancellation `sum_nearZeros_neg_reflect` (nearZeros(\u2212t) = image under\n  \u03c1 \u21a6 1\u2212\u03c1 by the symmetric ball estimate (1+\u03c1.re)\u00b2+(\u03c1.im\u2212t)\u00b2 \u2264 5;\n  zeroMult invariant by analyticOrderAt_zeta_one_sub); the \u0393R +4 shift\n  `logDeriv_Gamma\u211d_shift` (Gamma\u211d_def + Gamma_add_one twice + exp-form\n  cpow arithmetic) putting both digamma arguments in re > 0, then\n  StirlingVert digamma_stirling \u27f9 \u0393R-bracket \u2264 4(log|t|)\u00b2. **Capstone\n  `logDeriv_riemannZeta_sub_nearZeros_le_left`**: the loose R-bound\n  \u2264 200000\u00b7(log|t|)\u00b2 on \u03c3 \u2208 [\u22125/2, 1/2], |t| \u2265 10. PLUS the 5e input\n  `norm_digamma_sub_log_le_of_two_le_abs_im`: \u2016\u03c8(w) \u2212 log w\u2016 \u2264 3 for\n  2 \u2264 |im w|, uniform in the shift chain (digamma_add_natCast +\n  first-order EM `sum_eq_integral_add_integral_deriv` + arctan-FTC\n  \u222bdx/((x+a)\u00b2+c\u00b2) \u2264 \u03c0/c \u2014 no full-line integral needed). Build GREEN\n  (8761 jobs; LiReflect root-imported). Banked gotchas: this Mathlib's\n  add_le_add_left/right are swapped vs classic; push_cast EM\n  conclusions before linear_combination; single-cast sum families.\n  Next: ii\u2032-5e (partial-fraction identity), first item zeroMult(\u22122n)\n  = 1 for all n (generalize ii\u2032-4c).\n- Session 026 (2026-08-22): **ii\u2032-5e PREP + DESIGN COMPLETE** (commit\n  0d9887a). LiTrivialZeros.lean (~290 lines, 8 decls audited clean):\n  `gamma_mul_prod` (product-form \u0393 recurrence by induction on\n  Gamma_add_one) + the `HfunT n` cofactor (analytic/nonzero at \u22122n)\n  + **zeroMult_neg_two_mul**: zeroMult(\u22122n) = 1 for ALL n \u2265 1 (the\n  ii\u2032-4c pattern via analyticOrderAt_eq_natCast). D-068 (5e design):\n  F entire via principal-part splits (no removable-singularity\n  theorem, no Hadamard); TWO CORRECTIONS to D-067 \u00a76 \u2014 (C1) circle\n  series bound O((log R)\u00b3) via the RADIAL split (the naive annulus\n  split gives O(R log R) \u2014 fatal); (C2) near-axis left-plane digamma\n  bound separate (recurrence + separated reciprocal sum). Sub-stage\n  map 5e-i..v. Banked: DifferentiableAt.analyticAt does NOT exist\n  (use fun_prop); Gamma\u211d_eq_zero_iff gives \u2212(2*\u2191m); lt_trichotomy\n  exists / le_or_lt does NOT. Next: ii\u2032-5e-i (\u03b3-gap circles).\n- Session 027 (2026-08-22): **ii\u2032-5e-i + 5e-ii COMPLETE** (commits\n  e28eff6, 0e9336e, ec13029; two new files, 17 decls, all audited:\n  3 standard axioms only). 5e-i (LiGapCircles.lean):\n  `exists_gapCircle_radius` \u2014 R \u2208 [4k+5/2, 4k+3] with dist(R/2,\u2124) \u2265 1/4\n  and ordinate clearance \u2265 1/(16\u00b7C0hat(4k+9/2)) (the \u00d72-rescaled\n  midpoint pigeonhole + C0hat_mono). 5e-ii (LiDigammaLeft.lean): the\n  telescope tail + **norm_digamma_le_of_two_le_re** (B: Weierstrass\n  split, harmonic head + telescoping tail, integers via\n  digamma_natCast_eq) + **digamma_recip_sum_le** (C: the V-split\n  separated reciprocal sum) + **norm_digamma_le_of_dist_nat** (A: the\n  near-axis bound via digamma_add_natCast\u2032 \u2014 pole-avoidance form,\n  covering real points) + **logDeriv_Gamma\u211d_eq** (G: logDeriv \u0393R s =\n  \u2212(log \u03c0)/2 + \u00bd\u03c8(s/2) for im \u2260 0, the m-fold shift). Build GREEN\n  (8764 jobs). Banked: ascribe cast haves (stuck typeclasses else);\n  pin \u2115-sub casts (Nat.cast_sub before push_cast; elaborator lifts\n  Real.log (m\u2212k) to real-sub); sum_add_tsum_nat_add's shifted terms\n  are beta-redexes (state goals in redex form); prod_range_succ's f\n  explicit-first. Next: ii\u2032-5e-iii (the zero series).\n- Session 028 (2026-08-23): **ii\u2032-5e-iii COMPLETE** (LiSeries.lean,\n  ~600 lines, 22 decls, all audited: 3 standard axioms only). The\n  zero-side partial-fraction series `seriesFun s := \u2211' \u03c1 : nontrivial\n  zeros, mult\u00b7(1/(s\u2212\u03c1)+1/\u03c1)`: `seriesSummable` at every s (the ii\u2032-1a\n  D-trick; tail 2\u2016s\u2016/\u2016\u03c1\u2016\u00b2 via 1/(s\u2212\u03c1)+1/\u03c1 = s/(\u03c1(s\u2212\u03c1)); the (17/12)\u2016\u03c1\u2016\u00b2\n  \u03b3-comparison; Zeta23 zero_sum_inv_sq dominator); `seriesFun_analyticAt`\n  + `seriesFun_analyticOnNhd` off the nontrivial zeros (the three-case\n  avoiding balls: \u03b6\u22600 continuity / \u03b6=0 order normal form / s\u2080=1 zetaA;\n  the Weierstrass M-test `of_norm_le_summable_eventually` + the\n  journal-020/021 TendstoLocallyUniformlyOn\u2192differentiableOn\u2192\n  analyticOnNhd pattern); `nontrivialZero_isolated` (finite unit-ball\n  min-distance); `seriesFunSub_analyticAt` (the \u03c1\u2080-term-zeroed series\n  analytic AT \u03c1\u2080); `seriesFun_sub_term` (the everywhere split\n  seriesFun = seriesFunSub + the \u03c1\u2080-term); capstone\n  `seriesFun_sub_polar_analyticAt` (series \u2212 mult/(s\u2212\u03c1\u2080) analytic at\n  \u03c1\u2080) \u2014 the 5e-iv residue-cancellation input. Build GREEN (8765 jobs,\n  LiSeries root-imported). Banked: redex-RHS show-before-rw; no rw at\n  set-var-dependent hypotheses (standalone membership iff route);\n  obtain-rfl needs a variable RHS; if_pos/if_neg under binders via\n  simp only; Finset.image lambda type-pinning; file ends `end\n  NguyenRH1` then `end`; push_neg/Set.mem_setOf_eq deprecated. Next:\n  ii\u2032-5e-iv (F entire by the principal-part splits).\n- Session 029 (2026-08-23): **ii\u2032-5e-iv COMPLETE** (commits 58e03e2 +\n  closure; LiFEntire.lean, ~1130 lines, 30 decls, all audited: 3\n  standard axioms only). F ENTIRE: the difference Fexpr = logDeriv \u03b6 \u2212\n  seriesFun + 1/s + 1/(s\u22121) \u2212 (log \u03c0)/2 + \u03c8(s/2)/2 extends via the\n  punctured limit `Gentire s := limUnder (\ud835\udcdd[\u2260] s) Fexpr` (Mathlib has\n  no general removable-singularity theorem; the junk point-values are\n  sidestepped by limUnder uniqueness + per-bad-point analytic\n  witnesses). Witnesses: nontrivial zeros (the NF logDeriv witness +\n  5e-iii polar subtraction), s = 1 (logDeriv zetaA), s = 0\n  (digamma-series split, \u03c8(s/2)/2 + 1/s = \u2212\u03b3/2 + \u00bd\u00b7series), s = \u22122n\n  (NF + zeroMult_neg_two_mul + the dropped-term series H_n). Support:\n  `zeta_zero_classification` (every zero is nontrivial/0/\u22122n \u2014 the\n  LiDisc argument globalized via completedRiemannZeta_eq_zero_iff +\n  Gamma\u211d_eq_zero_iff), `analyticAt_digamma` (off {0}\u222a\u2212\u2115). Capstone\n  `gentire_analyticAt_and_eq`: Gentire analytic everywhere AND equal\n  to Fexpr at every good point. Build GREEN (8766 jobs, LiFEntire\n  root-imported). Banked: AnalyticAt.comp HOU pin (f := ...); the\n  (\u22122\u2191n)/2 non-defeq value-normalization; cast-leaf vs single-cast\n  pinning (((x:\u2124):\u2102) forms); abs_re_le_norm as the robust\n  norm-of-cast-expr route; eventually_ne's implicit target pinned by\n  ascription; EventuallyEq wrapper vs raw \u2200\u1da0 (show-bridges); subst\n  eliminating the wrong local. Next: ii\u2032-5e-v (the circle bound\n  O((log R)\u00b3) + the max-modulus squeeze \u27f9 \u2203 B capstone).\n- Session 030 (2026-08-23): **ii\u2032-5e-v STARTED \u2014 5e-v-a + 5e-v-b\n  chunk 1 COMPLETE** (commits 5d24756, e6a654b; LiCircleBound.lean,\n  ~340 lines so far, clean elaboration, not yet root-imported). 5e-v-a:\n  `isNontrivialZero_conj`; the count bridges \u2014 `A0count` from Zeta23's\n  RvM `zeta_local_zero_count` (mult-weighted, two-sided, ALL t,\n  unconditional \u2014 the series-bound count input) + `Ncount_window_le` /\n  `Ncount_add_of_le` / `Ncount_chain_le` / `Ncount_le_of_interval` /\n  `Ncount_le_of_interval_gen`; `norm_logDeriv_zeta_le_dirichlet`\n  (\u2016\u03b6\u2032/\u03b6\u2016 \u2264 dirichletC2 for re \u2265 2, the LSeries vonMangoldt pattern\n  from ZetaBounds); 5e-v-b chunk 1: `tsum_split_finset` (tsum =\n  finset sum + if-zeroed tail via tsum_eq_sum) + `lowZeros`/\n  `lowZeroConst`. Full remaining design (tail bound via\n  ENNReal.tsum_fiberwise + the key machinery; the one-split series\n  bound; logDeriv/elem assembly; Schwarz squeeze; \u2203 B capstone) in\n  journal-030. Banked: le_or_gt (le_or_lt absent); finsum_mem_union/\n  finsum_mem_empty/tsum_eq_sum forms; Nat.cast_nonneg ascription;\n  Ncount_add_of_le endpoint pinning; nested calc-by parser fragility;\n  positivity vs Classical.choose defs; [DecidableEq \u03b9] for\n  statement-level ifs; _root_.riemannZeta_conj. Next: 5e-v-b chunk 2\n  (the tail bound + the main series circle bound).\n- Session 031 (2026-08-23): **ii\u2032-5e-v-b chunk 2 COMPLETE** (commits\n  c26241c, f984afc, closure 8f16424; LiCircleBound.lean ~830 lines,\n  clean). The far-tail bound `zero_tail_inv_sq_le`: \u03a3_{|\u03b3|>X}\n  m/(1+\u03b3\u00b2) \u2264 16\u00b7A0count\u00b7log X / X for X \u2265 200 \u2014 the dyadic fiber\n  machine: `dyadClass` (Nat.log-2 classes) + lower/upper bounds,\n  `dyadClass_fiber_finite`, `fiber_mult_count` (the two-window cover\n  via Ncount_le_of_interval_gen), `fiber_tail_le` (per-fiber bound via\n  tsum_subtype + tsum_eq_sum + filter split), `tsum_dyadic_log`\n  (closed form 10 log 2 + 2 log X via hasSum_coe_mul_geometric) and\n  the ENNReal.tsum_fiberwise + ofReal_tsum_of_nonneg assembly.\n  Banked: coercion-lambda type-pinning in Finset.image/filter/\n  sum_subtype (use Subtype.val); the unary-minus precedence\n  (-(2^(j+1) * X) parenthesization + abs_neg/neg_mul);\n  Finset.disjoint_left; tsum_subtype explicit args; indicator_of_notMem\n  camelCase; of_norm_bounded's norm-kept goal; rw-pow_succ' rfl-close\n  (no trailing ring); nlinarith can't multiply hypotheses by factors \u2014\n  rw the pow identity at goal+haves first. Next: 5e-v-b chunk 3 (the\n  main seriesFun circle bound).\n- Session 032 (2026-08-23): **ii\u2032-5e-v-b chunk 3 COMPLETE** (commits\n  787b9c0, 727f656, d2bfde6, 222d65d + capstone; LiCircleBound.lean\n  ~2867 lines, clean, zero warnings; audit-session032-axioms.txt: 19\n  decls, 3 standard axioms only). The series circle bound\n  `seriesFun_norm_le_gapCircle`: \u2016seriesFun s\u2016 \u2264 2\u00b7lowZeroConst +\n  2900\u00b7A\u2080\u00b7\u0108\u2080(4k+9/2)\u00b7(log R)\u00b2 on the \u03b3-gap circle (k \u2265 4000). Pieces:\n  3a `gapCircle_threshold` (416\u00b7\u0108\u2080 \u2264 4k+5/2, explicit exp/log\n  arithmetic) + `not_isNontrivialZero_on_gapCircle`; 3b\n  `seriesTerm_norm_eq_div`, `circleZeros R`, the count brick\n  `sum_zeroMult_le_of_im_band` (band [a,b] + sign-separation c \u27f9\n  3\u00b7A\u2080\u00b7(b\u2212a+2)\u00b7log(3\u00b7max|a||b|+5) via the (M\u22121,b] \u222a (\u2212b\u22121,\u2212M]\n  two-window cover), `series_tail_le` (91\u00b7A\u2080\u00b7log R),\n  `seriesFun_norm_le_split`; 3c `dyadic_family_le` (generic machine\n  via Finset.sum_fiberwise_of_maps_to with t := Ico 1 (J+1) \u2014 avoids\n  the Fintype-\u2115 gap), `shell_low` (2\u00b7lowZeroConst),\n  `shell_inlo`/`shell_inhi` (60\u00b7A\u2080L\u00b2), `shell_up` (45\u00b7A\u2080L\u00b2, dyadic\n  class reaches J+1), `shell_crit` (2688\u00b7\u0108\u2080A\u2080L: uniform separation\n  1/(32\u0108\u2080) \u2014 strip arcs |t\u2212\u03b3| \u2265 1/(32\u0108\u2080) via the \u03b3-gap (conj for\n  \u03b3 < 0) + the threshold; near-axis |s\u2212\u03c1| \u2265 \u221a13\u22121), and the five-way\n  partition assembly. Banked: linarith can't relate distinct\n  reciprocal atoms (bridge P = 2Q by field_simp first);\n  sum_fiberwise needs Fintype (use sum_fiberwise_of_maps_to);\n  sum_image's f is auto-bound (pin (f := ...));\n  Finset.eq_empty_iff_forall_notMem; div_le_div_of_nonneg_right\n  exists / div_le_div_right does NOT; floor-integrality must route\n  through \u2115 +1-cast before linarith; filter-conjunction nesting\n  \u27e8hF, pred\u27e9; lt_of_not_le does NOT exist (lt_of_not_ge). Next:\n  5e-v-c (logDeriv/elem assembly \u27f9 \u2016Fexpr\u2016 \u2264 C(log R)\u00b3).\n- Session 033 (2026-08-23): **ii\u2032-5e-v-c COMPLETE** (commits 1c76576,\n  5da957c + capstone; LiCircleBound.lean ~3928 lines, clean, zero\n  warnings; audit-session033-axioms.txt: 14 decls, 3 standard axioms\n  only). The Fexpr circle bound `Fexpr_circle_le`: \u2016Fexpr s\u2016 \u2264\n  2\u00b7lowZeroConst + dirichletC2 + 400000\u00b7A\u2080\u00b7\u0108\u2080(R+2)\u00b7(log R)\u00b2 on the\n  \u03b3-gap circle (k \u2265 4000). Pieces: c-i\n  `differentiableAt_Gamma\u211d_of_not_neg_nat` +\n  **`logDeriv_Gamma\u211d_eq_of_not_neg_nat`** (the (G) formula at ANY\n  non-pole point incl. s = \u2212R \u2014 direct logDeriv_mul on Gamma\u211d_def,\n  digamma := logDeriv \u0393 by def, no continuity argument) +\n  `gapCircle_sep` (standalone \u03b3-gap separation) +\n  `nearZeros_count_le` + `gapCircle_sep_of_mem_nearZeros`; c-ii\n  `digamma_right_le` (48+23\u00b7log) + `digamma_circle_le` (uniform\n  62+23\u00b7log(2+R/2): strip sub-log, right_le, left near-axis via\n  5e-ii (A) c = 1/8 from the \u2124-clearance \u2014 the R+re s = im\u00b2/(R\u2212re s)\n  identity, no square roots) + elems; c-iii `logDeriv_circle_le`\n  (three regions: Dirichlet / 5c+5d capstones + near sum \u2264\n  32\u0108\u2080\u00b7count / FE `logDeriv_zeta_fe` with all 10 hyps discharged +\n  Dirichlet at 1\u2212s + \u0393R bracket) and the six-norm-chain assembly.\n  Banked: riemannZeta_ne_zero_of_one_le_re takes ONLY re;\n  div_lt_iff\u2080 is a/c<b here (lt_div_iff\u2080 for a<b/c);\n  add_le_add_left/right SWAPPED (use per-step norm haves + linarith);\n  rw [X = 1*X] rewrites everywhere (use calc); linear_combination -h\n  for the 1\u2212s bridges; congrArg Complex.re + simp for cast-bridges;\n  left-assoc products through every calc; Real.pi_lt_d2 : \u03c0 < 3.15;\n  abs_one/abs_neg for |x\u00b11|; one_div_le_one_div_of_le takes the small\n  side's positivity first. Next: 5e-v-d (Schwarz squeeze \u27f9 \u2203 B\n  capstone partialFraction_identity).\n- Session 034 (2026-08-23): **ii\u2032-5e-v-d COMPLETE \u2014 ii\u2032-5e DONE**\n  (commit 5a262a1; new file LiSqueeze.lean, ~330 lines, clean, zero\n  warnings; LiCircleBound + LiSqueeze root-imported; full build GREEN;\n  audit-session034-axioms.txt: 5 decls, 3 standard axioms only).\n  `C0hat_add_two_le` (\u0108\u2080(R+2) \u2264 5\u00b7log R, R \u2265 16002);\n  `not_badPoint_on_gapCircle` (every gap-circle point good);\n  `gentire_circle_le` (the circle bound transfers to Gentire);\n  **`gentire_const`** (the Schwarz squeeze: max-modulus via Zeta23's\n  AnalyticOn.norm_le_of_norm_le_on_sphere + the ball-form Schwarz lemma\n  on the \u03b3-gap circle sequence; growth RB \u2264 C\u2080\u2032 + 64\u00b7C\u2081\u00b7Q\u00b3 with\n  Q := R^{1/4}, R = Q\u2074 (Real.log_le_rpow_div + pow_le_pow_left\u2080 +\n  rpow_inv_natCast_pow), radius choice Q \u2265 2 + (128\u00b7C\u2081+2\u00b7C\u2080\u2032)\u00b7\u2016z\u2080\u2016/\u03b5\n  \u27f9 dist \u2264 \u03b5 \u27f9 Gentire \u2261 Gentire 0); **THE CAPSTONE\n  `partialFraction_identity (hZC : ZeroCountProp)`**: \u2203 B : \u2102, \u2200 s\n  good, logDeriv riemannZeta s = B + seriesFun s \u2212 1/s \u2212 1/(s\u22121) +\n  (log \u03c0)/2 \u2212 \u03c8(s/2)/2 \u2014 the partial-fraction identity Lean-proved\n  modulo ONLY the declared perimeter (first perimeter use in the 5e\n  chain: the \u03b3-gap circles need ZeroCountProp). Banked: le_or_lt\n  absent (le_or_gt + the dist/2 contradiction closes the squeeze);\n  set-Q + rw [\u2190 hQ] after push_cast for the rpow_inv_natCast_pow\n  bridge; log_le_rpow_div's exponent-hypothesis form. Next: ii\u2032-5f\n  (D-056's tight constants 10.5/48 from the identity) \u2192 ii\u2032-3b \u2192\n  ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.\n- Session 035 (2026-08-23/24): **ii\u2032-5f STARTED \u2014 5f-0 + 5f-i + piece\n  6 COMPLETE** (commits 75172e6, f850d9a, 0cca091, d808f52, 1eeda9b,\n  c9c1362, b5e3f53). **Perimeter repair** (user-approved): ZeroCountProp\n  strengthened to the mult-weighted form (the second ii\u2032-1a-class\n  encoding defect \u2014 the unweighted set-card under-captured the declared\n  Trudgian N(T) source; `one_le_zeroMult` bridge via\n  analyticOrderAt_ne_zero + ENat.toNat_pos; exists_zero_avoiding_T +\n  exists_gapCircle_radius adapted via card \u2264 \u03a3 mult; full build GREEN;\n  audit-session035-axioms.txt: 5 decls, 3 standard axioms only).\n  **P1/P2 perimeter additions** (user-approved, D-069): ZeroCountProp2\n  (the two-unit Trudgian specialization 0.6\u00b7L + 0.886\u00b7LL + 2.7) +\n  NoLowZeros (|\u03b3| \u2265 14, Platt-class zero-location certificate).\n  **D-069 Finding 1**: D-056's piece-2 one-C\u2080 usage is for a TWO-unit\n  window \u2014 the honest two-unit form makes the assembly fit 10.5/48\n  (margin \u2248 1.9). **Finding 2** (ii\u2032-6 map): H(T) clearance coverage\n  (honest \u2248 7\u00b7\u0108\u2080\u00b2 vs baked 3\u00b7\u0108\u2080\u00b2). **5f-i** (LiTightR.lean, new file):\n  tsum_split_finset_complex, nearZerosSub, seriesDiffTerm +\n  seriesFun_sub_seriesFun, **Rexpr_decomp** (the six-piece\n  reference-point decomposition; B cancels; linear_combination\n  hsid \u2212 hs\u2080id + hdiff + hsplit + hnear), piece 1\n  `dirichletC2_le_one` (the level-2 integral machinery:\n  hasDerivAt_neg_log_add_one_div + integral_Ioi_of_hasDerivAt_of_tendsto'\n  + AntitoneOn.tsum_comp_add_le_integral + the log2/log3 numeric fold),\n  piece 2 `near_sum_refPoint_le`, pieces 4/5 `one_div_diff_le` (\u2264\n  0.045). **5f-ii piece 6**: `log_diff_le` (the segment-FTC log\n  bound \u2264 5/t) + `digamma_diff_le` (\u2016(\u03c8(s/2)\u2212\u03c8(s\u2080/2))/2\u2016 \u2264 6/t via the\n  +2 shift + StirlingVert.digamma_stirling + digamma_add_natCast). The\n  sharp Lemma-D remainder turned out UNNECESSARY (digamma_stirling's\n  3/im\u00b2 suffices; piece 3's sharper interval sum freed the budget).\n  Banked: the real-cast-first ((t/2 : \u211d) : \u2102)\u00b7I form; re/im ext-goals\n  via explicit per-component rw chains; field_simp can close the goal;\n  Summable.sum_add_tsum_nat_add method form; cpow_natCast's (2:\u2102) =\n  ((2:\u2115):\u2102) bridge. Next: piece 3 (the far-sum interval machine) \u2192\n  5f-iii (assembly + pinch + capstone) \u2192 ii\u2032-3b \u2192 ii\u2032-3c \u2192 ii\u2032-6 \u2192\n  ii\u2032-7.\n- Session 036 (2026-08-24): **ii\u2032-5f COMPLETE** (commits 79c506b,\n  0829421, 7a2af96, 642b851, 22b98c9, b347559, 52bb2cb, e6d57e1).\n  **Piece 3** (LiTightR.lean sections 9\u201319, ~2700 lines): certified\n  numerics (integral-comparison log machines + all certified log/exp/\n  sqrt bounds), the farW weight with S\u2083 \u2264 1.3476 (4 exact sqrt-rational\n  terms + telescope 1/4), the six tail bricks via the antitone-integral\n  machine (RW\u2080/1/2 = 0.1/0.3303/0.1216 with the loglog \u2264 (1/e)log\n  trick; LA\u2080/1/2 = 1/23/0.1687/0.0621 with the \u2212log x/(x+10) +\n  (1/10)log(x/(x+10)) antiderivative), the C0hat bridges (2k+1/j+1/\n  2t+1 + C0hat(2t+1) \u2264 C0hat(t+1)+0.55), the conj machinery\n  (hasDerivAt_conj_of_conj_eq \u2192 iteratedDeriv_riemannZeta_conj \u2192\n  analyticOrderAt_riemannZeta_conj \u2192 zeroMult_conj), farG + summability\n  + the per-term bound + norm reduction, the main bucket machine\n  (unit_family_le + main_bucket_count + farG_main_le), the two tail\n  machines (farGLeft_le \u2264 1.1729, farGRight_le \u2264 2.7343, ENNReal\n  fiberwise cloned from LiCircleBound), the tail split farG_tail_eq,\n  and **far_series_le \u2264 12.1284\u00b7C\u2080 + 7.2425**. **5f-iii** (sections\n  20\u201321, ~550 lines): the pinch lemma pinch_tight_R (11.6318\u00b7LL \u2212\n  4.6484\u00b7L \u2264 0.397094 for L \u2265 log 12 \u2014 concave tangent at the certified\n  critical point 2.5024, f\u2032 antitone, FTC both directions, f(2.5024) \u2264\n  \u22120.96231 certified), the supporting bounds (log 12 = 4 log 2 \u2212\n  log(4/3) \u2265 2.4848 via the 4-term neg_log machine, log 12 \u2264 2.5024,\n  log 3 \u2264 1.0987, log 2.5024 \u2264 0.9173), the C0hat L/LL conversion, and\n  **THE CAPSTONE `logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC)\n  (hZC2) (hNLZ)`: \u2016logDeriv \u03b6 s \u2212 \u03a3_{near} m/(s\u2212\u03c1)\u2016 \u2264 10.5\u00b7log(t+2) +\n  48 PROVED** (six-piece assembly: dirichletC2 \u2264 1 + near two-unit\n  0.6L+0.886LL+2.7 + far 12.1284\u00b7C\u2080+7.2425 + 2\u00d70.045 + 6/t \u2264 0.6;\n  fold 5.8516L + 11.6318LL + 47.6029 \u2264 10.5L + 48 via the pinch).\n  Audits session036/036b: 33 decls, 3 standard axioms only; full build\n  GREEN (8762 jobs). Banked: `a * b / c` parses as `(a\u00b7b)/c` (write\n  `c * (b / d)` with parens or isDefEq explodes); Float-literal pinning;\n  rw first-unifier-only; x\u207b\u00b9 vs 1/x; div/mul_le_mul signatures;\n  pow_nonneg for odd powers; Summable.mul_left/add lambda forms;\n  tsum_add beta-rfl bridges; two_le_C0hat for C0hat nonnegativity;\n  pinch coefficient-exactness (mixed-sign rounding breaks large L).\n  Next: ii\u2032-3b (moments) \u2192 ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.\n- Session 037 (2026-08-24, HALT at a clean boundary \u2014 user log-off):\n  **capstone dependency audit** (user-requested, pre-ii\u2032-3b):\n  AuditSession037.lean + audit-session037-axioms.txt \u2014 `#print axioms\n  logDeriv_riemannZeta_sub_nearZeros_le_tight` = [propext,\n  Classical.choice, Quot.sound] ONLY; the exact perimeter recorded\n  verbatim (ZeroCountProp unit-window mult-weighted \u2264 \u0108\u2080(t+1);\n  ZeroCountProp2 two-unit 0.6L+0.886LL+2.7; NoLowZeros |\u03b3| \u2265 14;\n  nearZerosSub/Zeta23.zeroMult/zeroAbsWindow constructs).\n  **ii\u2032-3b STARTED \u2014 ROUTE REVISION (D-070)**: the moments (M) come\n  from 5e's partialFraction_identity by pure algebra + series calculus\n  (NO contours \u2014 the contour work was 5e's): gFun := logDeriv xiL =\n  B + seriesFun at good points; xiL entire via the \u039b\u2080 closed form;\n  perimeter ZeroCountProp ONLY (5f's hZC2/hNLZ not needed).\n  **LiMoments.lean \u00a71\u2013\u00a74 COMPLETE, build GREEN** (~730 lines): xiL +\n  conj/reflect subtype equivs, (G) gFun_eq_momentB, evaluations\n  gFun_zero/gFun_one/gFun_one_eq_neg (FE sign), the summability budget\n  (master \u03a3 mult/\u2016\u03c1\u2016\u00b2 + AM-GM mixed bound), the reindex machinery\n  (sigmaP_eq_unpaired k \u2265 2 via the conj reindex, vTerm_tsum_eq_zero\n  via V = W = \u2212V), **k = 1 PROVED: sigmaP_one_eq_neg_gFun_zero**\n  (2\u03c3\u2081 = seriesFun 1 = \u22122\u00b7gFun 0 by the FE sign). \u00a75/\u00a76 fully\n  designed + Mathlib-probed (iteratedDerivWithin_tsum/\n  SummableLocallyUniformlyOn_of_locally_bounded/iteratedDeriv_neg/\n  AnalyticAt.contDiffAt/Equiv.tsum_eq/Summable.tsum_add signatures all\n  confirmed); skeleton banked in journal-037. Banked: SummationFilter\n  refactor (tsum_add/tsum_sub are method-form Summable.tsum_add only;\n  tsum_neg/tsum_zero/tsum_congr/tsum_mul_left plain);\n  eq_zero_of_neg_eq needs LinearOrder (\u2102 N/A \u2192 2V = 0 route);\n  Complex.norm_conj takes starRingEnd directly; ascribe EVERY tsum\n  binder (zeroMult \u03c1 coerces \u03c1 to \u2102 otherwise); beta-redex\n  show-before-rw; deriv_comp's point arg explicit; field_simp's\n  trailing-ring errors \u00d73. Housekeeping: Scratch.lean (old session-029\n  audit script) overwritten with the lemma probe \u2014 session-029 audit\n  results preserved in audit-session029-axioms.txt. Next: LiMoments \u00a75\n  (termwise iterated derivation at 0, k \u2265 2) \u2192 \u00a76 (capstone\n  sigmaP_eq_neg_iteratedDeriv_gFun_div) \u2192 root import (with LiTightR)\n  \u2192 audit \u2192 ii\u2032-3c.\n- Session 038 (2026-08-24): **ii\u2032-3b COMPLETE** (LiMoments.lean \u00a75/\u00a76,\n  ~290 new lines, file now ~1020 lines). \u00a75: iteratedDeriv_zpow_neg_one,\n  iteratedDeriv_seriesTerm, seriesTerm_deriv_summableLocallyUniformlyOn\n  (the M-test on ball(0, \u03b4/2); dominator j!\u00b72^{j+1}\u00b7(1/\u03b4)^{j\u22121}\u00b7mult/\u2016\u03c1\u2016\u00b2;\n  the h1/h2/h3 one_div/div_pow/pow_add chain), iteratedDeriv_seriesFun_zero\n  (the LiDigamma:749\u2013785 iteratedDerivWithin_tsum pattern verbatim; local\n  pole_free via norm_sub_norm_le + norm_sub_rev). \u00a76:\n  gFun_eventuallyEq_zero (eventually_nhdsWithin_iff + point values) +\n  **THE CAPSTONE `sigmaP_eq_neg_iteratedDeriv_gFun_div (hZC :\n  ZeroCountProp)`: sigmaP k = \u2212(iteratedDeriv (k\u22121) gFun 0)/(k\u22121)!\n  PROVED for ALL k \u2265 1** (k=1: \u00a74 reindex; k\u22652: (G) + \u00a75 + per-term\n  sign algebra (\u22121)^k\u00b7(\u22121)^{k+1} = \u22121 + \u2190 sigmaP_eq_unpaired +\n  field_simp k! \u2260 0 \u2014 FIRST-PASS GREEN). Perimeter: ZeroCountProp ONLY.\n  Closure: LiTightR + LiMoments root-imported; full build GREEN (8770\n  jobs); AuditSession038.lean + audit-session038-axioms.txt \u2014 23 decls,\n  [propext, Classical.choice, Quot.sound] ONLY, 0 sorryAx. Banked:\n  factorial `!` needs `open scoped Nat` (the parse error looks like\n  spacing); Summable.mul_left dominators CONSTANT-FIRST (D \u03c1 * C\n  whnf-loops the refine); rw [seriesFun] fails UNAPPLIED (show\n  beta-expansion); norm_sub_norm_le has no abs on the LHS here;\n  simpa-only a copy of memberships before rw-ing them away;\n  (neg_neg _).symm funext direction; simp only [neg_mul, neg_neg] for\n  buried negs; iteratedDeriv_add needs the Pi.add bridge (hsplit :=\n  rfl); calc reassociation via trailing mul_assoc. CONTINUED same day:\n  **ii\u2032-3c COMPLETE** (LiCrux.lean, ~430 lines, root-imported) \u2014 the FE\n  relation (gFun_one_sub_fun + iteratedDeriv_gFun_zero via the\n  unconditional iteratedDeriv_comp_const_sub), the shift expansion\n  (gFun_one_add_punctured/eventuallyEq), iteratedDeriv_gFun_one \u27f9\n  **lagarias_4_10_a (hZC) PROVED** (all k \u2265 1) \u27f9 **THE CRUX\n  sf_eq_resW1 (hZC) PROVED: (ResW1 n).re = Sf n for n \u2265 1** \u2014 Sf(n) =\n  Res\u2081(n) in Lean, perimeter ZeroCountProp only. Full build GREEN\n  (8771 jobs); audit session038b: 8 decls, 3 standard axioms only.\n  **ii\u2032-3 (ALL of (4.10)) DONE.** Banked: ContDiffAt.congr_of_eventuallyEq\n  takes hev NOT hev.symm; Finset.sum_add RENAMED Finset.sum_add_distrib;\n  succ-normalize via Nat.succ_eq_add_one before Nat.add_sub_cancel;\n  `simp using X.deriv` silently derails (use the direct .deriv term);\n  ContinuousAt.comp numerals not kernel-defeq (add_zero-rw hg FIRST);\n  show-statements ASCII-only (U+2212 breaks the parser); \u2190 hS direction\n  after sum-splits; mul_div_cancel_left\u2080 for (s\u00b7X)/s; div_add_div +\n  div_eq_div_iff + ring as the always-works fraction pattern. CONTINUED:\n  **ii\u2032-6-0 DESIGN COMPLETE (D-071 + E-030 ALL CHECKS PASS)** \u2014 THREE\n  findings: F-A bridge factor-2 (\u03bb_n(T) both-signs \u27f9 honest 4\u00b7FAlt vs\n  baked 2\u00b7FAlt; R-004 unaffected, paper erratum at ii\u2032-7), F-B I_III\n  two-unit count ((2/3)Z2 vs (2/3)\u0108\u2080 \u2014 D-069 Finding 2 exact), F-C\n  baked Bn unprovable beyond ~5\u00d710\u2077 (killers T\u00b7log T outgrow (log T)\u00b2\n  slack: 0.656 at 10\u2075 \u2192 1.012 at 10\u00b9\u00b2). USER-APPROVED 8-step protocol:\n  redefine Bn honestly (4F, (2/3)Z2hat); convexity re-proof; base\n  points re-certification (values improve); endpoint margins re-run;\n  ii\u2032-6 against corrected Bn; paper correction note at ii\u2032-7; audit\n  history preserved (E-030). Perimeter additions approved:\n  ZeroCountGlobalProp + MZeroProp. CONTINUED: **ii\u2032-6-a COMPLETE** \u2014\n  Bn redefined honestly (4F, (2/3)Z2hat); marginTilde_convex re-proved\n  (\u03c8-row literals + norm_num; Z2hat added to the eq_expanded unfold\n  list; a hardcoded const_mul fixed); base points re-certified\n  (329,000/350,000; margins \u2265 7,001/82,501); endpoint margins re-run\n  (14,682/90,653/2.458\u00d710\u00b2\u2076); full build GREEN (8771 jobs); audit\n  session038c: 3 standard axioms only. Banked: lake env lean uses the\n  STALE olean \u2014 lake build the dependency first; re-check certified\n  constants at 1e-4 (114.0655 vs 114.06553 linarith catch).\n  CONTINUED: **ii\u2032-6-b COMPLETE** \u2014 perimeter Props ZeroCountGlobalProp\n  + MZeroProp declared; wide pigeonhole exists_zero_avoiding_T_wide;\n  LiAssembly.lean NEW (sides identity + bridge \u2016\u03a3\u2016 \u2264 4\u00b7FAlt + 1);\n  build GREEN (8772 jobs); audit session038d: 3 standard axioms only.\n  Banked: RectangleBorder-rcases trap (rw + simp only + tauto route);\n  Finset.image plain-function + Set.InjOn; set-x breaks mem_toFinset;\n  linarith proves \u2260; projections for IsNontrivialZero; sq_eq_sq\u2080;\n  pow_le_one\u2080 implicit n. CONTINUED to ii\u2032-6-c design-check \u2014\n  **FINDING F-D (D-072, session end, user paused to think)**: the\n  (6.12) stepping in Lagarias's Thm 6.1 is broken at T = \u221an (product\n  ratio e/2 > 1; right-tail ~e^{0.066\u221an}, ~5.9\u00d710\u00b9\u2070 envelope at\n  n = 10\u2075 measured by E-031); D-036/D-037/R-004's B(n) inherits it\n  (charge \"3.3\" off by ~10\u2077\u00d7; margin collapses for n \u2273 3\u00d710\u2074). The\n  theorem statement survives (verified to 5\u00d710\u2075; sides cancel by\n  conjugation + phase winding); all Lean work to date survives (the\n  bug is in the horizontal piece, not yet built). Repair path (R)\n  verified numerically: T = c\u221an with c > 1.2012 \u27f9 the stepping works\n  (monotone decrease at c = 1.5, 2); N\u2081 \u2192 (T\u2080/c)\u00b2 \u2248 2.25\u20134\u00d710\u00b2\u2074.\n  Literature: no erratum found. Session ends at a clean committed\n  boundary with the direction OPEN.\n\n## 9. SUCCESS CRITERIA (ordered)\n\n1. \ud83c\udfc6 Full proof of RH (formally verified).\n2. \ud83e\udd47 Unconditional improvement past 2/3 (or past 0.6725 / 5/6).\n3. \ud83e\udd48 New equivalence, reduction, or removal of a known obstruction.\n4. \ud83e\udd49 Rigorously documented obstruction map advancing the field.\n",
  "structuredPatch": [
    {
      "oldStart": 805,
      "oldLines": 7,
      "newStart": 805,
      "newLines": 7,
      "lines": [
        "       directive: the goal is the ORIGINAL N\u2081 = 9\u00d710\u00b2\u2074); preserved as",
        "       the PAUSED FALLBACK \u2014 WIP on branch wip/c-1.5-margin-redo",
        "       (642d47a, resume map in its commit message).]",
        "-- [~] ii\u2032-6-DL F-D DOG-LEG REPAIR (ACTIVE, 2026-08-25, user directive;",
        "+- [x] ii\u2032-6-DL F-D DOG-LEG REPAIR (COMPLETE, 2026-08-25, user directive;",
        "       directive file **PROJECT_DIRECTIVE_D-074.txt**; design/progress",
        "       anchor **D-074**; route to the ORIGINAL N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9\u00d710\u00b2\u2074).",
        "       Design: keep T_cut = \u221an (residues/bridge/\u03bb_n(T_cut) UNCHANGED);"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-003-finite-Gtilde.py",
  "offset": 185,
  "limit": 80
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\RH-WEBSITE.md",
    "content": "### 6.5 Lock-safety guarantees (verified 2026-08-19, web/lockcheck.py)\n- Text/md/CSV/log reads use Python 'r' handles (Windows share mode allows\n  concurrent writers) and close immediately after each read.\n- research.db / agent.db opened SQLite mode=ro per query, closed in finally;\n  shared read lock exists only for the duration of each SELECT (ms).\n- Server runs --noreload: no autoreload file watchers held open.\n- git log is read-only plumbing (no index lock).\n- Empirical: 24 s of 4-thread HTTP load across all heavy pages while taking\n  120 DB write locks (BEGIN IMMEDIATE/ROLLBACK) + 360 write-intent file\n  opens on STATE.md, NGUYEN.md, CSVs, run-logs \u2014 zero conflicts, zero stalls.\n\n## 7. IMPROVEMENT BACKLOG (standing order \u2014 review each session)\n\u26d4 DELIBERATE EXCLUSION (user directive, 2026-08-27):\n`research/correspondence/` (the Lagarias F-D package) is PRIVATE until",
    "numLines": 14,
    "startLine": 164,
    "totalLines": 285
  }
}

{
  "command": "cd /d/Python/Quantum/zeta-23-lean && ls Zeta23/PairCeiling/ && wc -l Zeta23/PairCeiling/*.lean | tail -5",
  "description": "List PairCeiling directory contents and file sizes"
}

SUCCESS: The process with PID 44440 has been terminated.
server spawned pid 13064
/                         200 topbar-search: True
/dashboard/               200 topbar-search: True
/lean/                    200 topbar-search: True
/scripts/                 200 topbar-search: True
/search/?q=margin         200 topbar-search: True prefilled: True
healthy � 27 routes OK

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\index.md"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\web\\dashboard\\templates\\dashboard\\collection_item.html",
    "content": "{% extends \"dashboard/base.html\" %}\n{% block title %}{{ item.title }}{% endblock %}\n{% block nav_derivations %}{% if kind == \"derivations\" %}active{% endif %}{% endblock %}\n{% block nav_graveyard %}{% if kind == \"graveyard\" %}active{% endif %}{% endblock %}\n{% block nav_journal %}{% if kind == \"journal\" %}active{% endif %}{% endblock %}\n{% block nav_resources %}{% if kind == \"resources\" %}active{% endif %}{% endblock %}\n{% block content %}\n<p><a href=\"/{{ kind }}/\">\u2190 {{ kind|capfirst }}</a></p>\n<p class=\"muted\">Updated {{ item.mtime }}</p>\n<article class=\"card md\">{{ item.html|safe }}</article>\n{% endblock %}",
    "numLines": 11,
    "startLine": 1,
    "totalLines": 11
  }
}

{
  "questions": [
    {
      "header": "Next stage",
      "options": [
        {
          "description": "Literature check on unconditional multiple-zero bounds + quantify what s\u2082 \u2264 \u03baN buys in the chain. Fast, decisive, not ceiling-constrained.",
          "label": "(b) Idea C first (Recommended)"
        },
        {
          "description": "Build SDP infrastructure and numerically map the 0.6725\u21920.682 room. Tooling payoff; outcome mostly predetermined by the ceiling theorem.",
          "label": "(a) SDP numerics first"
        },
        {
          "description": "I work on (b) now; queue (a) immediately after without asking again.",
          "label": "Do (b), then auto-continue to (a)"
        }
      ],
      "question": "Which direction for the next sub-stage?"
    }
  ]
}

User has answered your questions: "Which direction for the next sub-stage?"="(b) Idea C first (Recommended)". You can now continue with the user's answers in mind.

{
  "file_path": "D:\\Python\\Quantum\\research\\graveyard\\G-001-multiple-zero-bounds.md",
  "content": "# G-001 \u2014 Multiple-zero density bounds as extra chain constraint (\"Idea C\")\nDate: 2026-08-17 | Session: 001 | Track: A | Tag: [FAILED-ATTEMPT(obstruction below)]\nOpened: D-009 \u00a74 (Idea C), thread T5. Killed: same day, before literature\ninvestment \u2014 the obstruction is unconditional on any s\u2082 bound.\n\n## Attempt\nFeed an unconditional upper bound on on-line multiple zeros (s\u2082 \u2264 \u03baN,\nLevinson/CGG-style input) into the chain as an extra constraint, hoping to\nbeat 2 \u2212 R(\u03c8). Rationale at opening: the 0.682 ceiling theorem constrains\nonly 2-moment certificates; multiplicity bounds are a different data class.\n\n## Obstruction (the s\u2082/p substitution symmetry)\nOn-line doubles and off-line pairs play IDENTICAL roles in the chain:\nboth cost 2 in N(I\u2032), both occupy the Q\u2032 positive-index budget at the\nflat charge 4 (D-005). Replace each on-line double at ordinate \u03b3 by an\noff-line pair {\u00bd+\u03b4+i\u03b3, \u00bd\u2212\u03b4+i\u03b3}. In every bandwidth-one two-moment datum:\n  e^{2\u03c0ij(\u03b3+i\u03b4)/N} + e^{2\u03c0ij(\u03b3\u2212i\u03b4)/N} = 2e^{2\u03c0ij\u03b3/N} + O(\u03b4)  (\u03b4\u21920),\nwhich equals the double's contribution m=2. Hence the adversary moves all\nmultiple mass into depth\u21920 off-line pairs leaving every usable measurement\nunchanged; any s\u2082-bound is vacuous against this configuration.\n- For A(i): extremal realizable with s\u2082 = 0 \u27f9 no gain from bounding s\u2082.\n- For A(ii): pairs are distinct zeros \u27f9 substitution only RAISES N_d.\nSame invisibility that killed zero-density input (D-009 Idea A); paper\nalready flags it (\u00a77.2(b): \"off-line pairs of depth\u21920, spectrally the\nsame\"; \u00a71.4 insensitivity to o(N) off-line zeros).\n\n## Lesson\nThe binding wall is not moments, windows, or multiplicities \u2014 it is that\nOFF-LINE-PAIR MASS at shallow depth is invisible to every unconditional\ndata class in the method. Any certificate improvement must either\n(1) see depth directly (needs prime-pair/support>1 data \u2014 walls S1/S2,\nD-006 \u00a76), or (2) constrain p by new unconditional input \u2014 and p-bounds\nare essentially RH-strength (the D\u2013H/Epstein gate). Multiplicity-side\ninputs (s\u2082) are provably useless within this framework.\n\n## Salvage\n- The substitution argument itself is a clean, quotable lemma for the\n  paper's obstruction-map section (\"no multiplicity-side input can\n  improve the certificate\").\n- Cross-track value: confirms that the \u03be\u2032-analogue (Remark 7.1, thread\n  T4) works BECAUSE \u03be\u2032-zeros behave differently \u2014 worth understanding\n  precisely why (the extra derivative breaks the s\u2082/p symmetry there?).\n  \u2192 keep thread T4 open with this sharper question.\n"
}

{
  "type": "create",
  "filePath": "D:\\Python\\Quantum\\research\\graveyard\\G-001-multiple-zero-bounds.md",
  "content": "# G-001 \u2014 Multiple-zero density bounds as extra chain constraint (\"Idea C\")\nDate: 2026-08-17 | Session: 001 | Track: A | Tag: [FAILED-ATTEMPT(obstruction below)]\nOpened: D-009 \u00a74 (Idea C), thread T5. Killed: same day, before literature\ninvestment \u2014 the obstruction is unconditional on any s\u2082 bound.\n\n## Attempt\nFeed an unconditional upper bound on on-line multiple zeros (s\u2082 \u2264 \u03baN,\nLevinson/CGG-style input) into the chain as an extra constraint, hoping to\nbeat 2 \u2212 R(\u03c8). Rationale at opening: the 0.682 ceiling theorem constrains\nonly 2-moment certificates; multiplicity bounds are a different data class.\n\n## Obstruction (the s\u2082/p substitution symmetry)\nOn-line doubles and off-line pairs play IDENTICAL roles in the chain:\nboth cost 2 in N(I\u2032), both occupy the Q\u2032 positive-index budget at the\nflat charge 4 (D-005). Replace each on-line double at ordinate \u03b3 by an\noff-line pair {\u00bd+\u03b4+i\u03b3, \u00bd\u2212\u03b4+i\u03b3}. In every bandwidth-one two-moment datum:\n  e^{2\u03c0ij(\u03b3+i\u03b4)/N} + e^{2\u03c0ij(\u03b3\u2212i\u03b4)/N} = 2e^{2\u03c0ij\u03b3/N} + O(\u03b4)  (\u03b4\u21920),\nwhich equals the double's contribution m=2. Hence the adversary moves all\nmultiple mass into depth\u21920 off-line pairs leaving every usable measurement\nunchanged; any s\u2082-bound is vacuous against this configuration.\n- For A(i): extremal realizable with s\u2082 = 0 \u27f9 no gain from bounding s\u2082.\n- For A(ii): pairs are distinct zeros \u27f9 substitution only RAISES N_d.\nSame invisibility that killed zero-density input (D-009 Idea A); paper\nalready flags it (\u00a77.2(b): \"off-line pairs of depth\u21920, spectrally the\nsame\"; \u00a71.4 insensitivity to o(N) off-line zeros).\n\n## Lesson\nThe binding wall is not moments, windows, or multiplicities \u2014 it is that\nOFF-LINE-PAIR MASS at shallow depth is invisible to every unconditional\ndata class in the method. Any certificate improvement must either\n(1) see depth directly (needs prime-pair/support>1 data \u2014 walls S1/S2,\nD-006 \u00a76), or (2) constrain p by new unconditional input \u2014 and p-bounds\nare essentially RH-strength (the D\u2013H/Epstein gate). Multiplicity-side\ninputs (s\u2082) are provably useless within this framework.\n\n## Salvage\n- The substitution argument itself is a clean, quotable lemma for the\n  paper's obstruction-map section (\"no multiplicity-side input can\n  improve the certificate\").\n- Cross-track value: confirms that the \u03be\u2032-analogue (Remark 7.1, thread\n  T4) works BECAUSE \u03be\u2032-zeros behave differently \u2014 worth understanding\n  precisely why (the extra derivative breaks the s\u2082/p symmetry there?).\n  \u2192 keep thread T4 open with this sharper question.\n",
  "structuredPatch": [],
  "originalFile": null
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\graveyard\\index.md",
  "old_string": "## Index\n| # | Attempt | Track | Obstruction | Date |\n|---|---------|-------|-------------|------|\n| \u2014 | (empty) | | | |",
  "new_string": "## Index\n| # | Attempt | Track | Obstruction | Date |\n|---|---------|-------|-------------|------|\n| G-001 | Multiple-zero bounds (s\u2082 \u2264 \u03baN) as extra chain constraint (\"Idea C\") | A | s\u2082/p substitution symmetry: depth\u21920 off-line pairs mimic doubles in all 2-moment data; any s\u2082 bound is vacuous | 2026-08-17 |"
}

{
  "filePath": "D:\\Python\\quantum-deploy\\probe5.cgi",
  "oldString": "    out(\"step 3: environ mangled\")\n    out(\"PATH_INFO raw:\", repr(os.environ.get(\"PATH_INFO\")))\n    out(\"SCRIPT_URL raw:\", repr(os.environ.get(\"SCRIPT_URL\")))\n\n    req = WSGIRequest(environ)",
  "newString": "    out(\"step 3: environ mangled\")\n    out(\"PATH_INFO raw:\", repr(os.environ.get(\"PATH_INFO\")))\n    out(\"SCRIPT_URL raw:\", repr(os.environ.get(\"SCRIPT_URL\")))\n\n    import io\n    environ.setdefault(\"wsgi.input\", io.BytesIO(b\"\"))\n    environ.setdefault(\"wsgi.errors\", sys.stderr)\n    req = WSGIRequest(environ)",
  "originalFile": "#!/opt/alt/python311/bin/python3.11\n\"\"\"One-off diagnostic: build a WSGIRequest from the real CGI environ and\nshow what the URL resolver sees/captures. DELETE AFTER USE.\"\"\"\nimport os\nimport sys\nimport traceback\n\nDOCROOT = os.path.dirname(os.path.abspath(__file__))\nAPP = os.path.join(DOCROOT, \"app\")\nsys.path.insert(0, os.path.join(APP, \"vendor\"))\nsys.path.insert(0, os.path.join(APP, \"web\"))\nos.environ.setdefault(\"DJANGO_SETTINGS_MODULE\", \"rhweb.settings\")\nos.environ[\"SCRIPT_NAME\"] = \"\"\n\n\ndef out(*a):\n    print(*a)\n    sys.stdout.flush()\n\n\nout(\"Content-Type: text/plain; charset=utf-8\")\nout()\n\ntry:\n    out(\"step 1: importing django\")\n    import django\n    django.setup()\n    out(\"step 2: django up\", django.get_version())\n    from django.core.handlers.wsgi import WSGIRequest\n    from django.urls import resolve, Resolver404\n\n    environ = dict(os.environ)\n    for key in (\"PATH_INFO\", \"SCRIPT_URL\", \"REDIRECT_URL\"):\n        v = environ.get(key)\n        if v:\n            environ[key] = v.encode(\"utf-8\", \"surrogateescape\") \\\n                             .decode(\"latin-1\")\n    out(\"step 3: environ mangled\")\n    out(\"PATH_INFO raw:\", repr(os.environ.get(\"PATH_INFO\")))\n    out(\"SCRIPT_URL raw:\", repr(os.environ.get(\"SCRIPT_URL\")))\n\n    req = WSGIRequest(environ)\n    out(\"path       :\", repr(req.path))\n    out(\"path_info  :\", repr(req.path_info))\n    try:\n        match = resolve(req.path_info)\n        out(\"resolved   :\", match.func.__module__ + \".\" + match.func.__name__)\n        out(\"kwargs     :\", match.kwargs)\n    except Resolver404 as e:\n        out(\"Resolver404:\", e)\nexcept BaseException:\n    out(\"TRACEBACK:\")\n    out(traceback.format_exc())\n",
  "structuredPatch": [
    {
      "oldStart": 39,
      "oldLines": 6,
      "newStart": 39,
      "newLines": 9,
      "lines": [
        "     out(\"PATH_INFO raw:\", repr(os.environ.get(\"PATH_INFO\")))",
        "     out(\"SCRIPT_URL raw:\", repr(os.environ.get(\"SCRIPT_URL\")))",
        " ",
        "+    import io",
        "+    environ.setdefault(\"wsgi.input\", io.BytesIO(b\"\"))",
        "+    environ.setdefault(\"wsgi.errors\", sys.stderr)",
        "     req = WSGIRequest(environ)",
        "     out(\"path       :\", repr(req.path))",
        "     out(\"path_info  :\", repr(req.path_info))"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "## 6. GRAVEYARD (documented dead ends \u2014 REQUIRED logging)\n| # | Attempt | Track | Obstruction found | Date |\n|---|---------|-------|-------------------|------|\n| \u2014 | (empty) | | | |",
  "new_string": "## 6. GRAVEYARD (documented dead ends \u2014 REQUIRED logging)\n| # | Attempt | Track | Obstruction found | Date |\n|---|---------|-------|-------------------|------|\n| G-001 | Multiple-zero bounds as chain constraint (Idea C) | A | s\u2082/p substitution symmetry (depth\u21920 pairs = doubles in all 2-moment data) | 2026-08-17 |\n| (A) | Zero-density input into chain (D-009 Idea A) | A | depth\u21920 off-line pairs invisible to N(\u03c3,T) bounds | 2026-08-17 |"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\journal\\session-012.md",
  "oldString": "## State at stop\nTier (ii) step 1 COMPLETE and committed. Next: tier (ii) step 2 \u2014\ndischarge hbase/hbase2 per the D-062 \u00a75 plan (validated), then the long\npole: SfBoundProp layers L0\u2013L3 (contour formalization), with L4\nperimeter decided. Optional hygiene: E-023b (M\u2080 acb certificate).",
  "newString": "## State at stop\nTier (ii) step 1 COMPLETE and committed. Next: tier (ii) step 2 \u2014\ndischarge hbase/hbase2 per the D-062 \u00a75 plan (validated), then the long\npole: SfBoundProp layers L0\u2013L3 (contour formalization), with L4\nperimeter decided. Optional hygiene: E-023b (M\u2080 acb certificate).\n\n---\n\n## Continuation (same day): mathematician's review notes + tier (ii) STEP 2 COMPLETE\n\nRead `session-012-end-notes.txt` (mathematician's comment; user\ndirective: use good advice). Directives extracted:\n1. **Discharge hbase/hbase2 next** (cheap, pre-verified) \u2014 DONE (below).\n2. **Reconcile the margin-number trail** (16 020 \u2192 15 764 \u2192 certified\n   bound) in the main text with a footnote \u2014 DONE (draft.tex Step 4\n   footnote + numerics bullet + Step 5 overlap factor 5 at the 10\u2075\n   split).\n3. Hold the paper's formal-status paragraph until the discharge lands \u2014\n   it landed; paragraph finalized at THREE hypotheses.\n4. Tier ii\u2032 (rectangle-contour interior of SfBoundProp) = POST-\n   PUBLICATION work; don't let it delay Paper A. Part-2 objections\n   (Theorem 3's tempered-FT bookkeeping + o(e\u1d43) in its statement,\n   L3/L4, authorship policy) standing, unchanged \u2014 no action this\n   session.\n\n### Tier (ii) step 2: base points DISCHARGED (commit fc2e55e)\nNew file `NguyenRH1/LiBasePoints.lean` (~560 lines, clean compile):\n- Machinery: `exp_le_inv_sub_sixteen` (exp x \u2264 (1\u2212x/16)\u207b\u00b9\u2076 from\n  Real.add_one_le_exp), exp_one_pow_le/ge (d9 rational powers),\n  exp_eleven/five/four (Real.exp_nat_mul), certified log bounds\n  (log 80000 \u2208 [11.263, 11.3], log 100000 \u2265 11.5, log \u03c0 \u2208 [1.14,\n  1.15]), sqrt bounds (sqrt_le_left/le_sqrt).\n- sInftyLower_eq' (\u03b3 cancels at point level, ring) + three evaluated\n  bounds; Bn evaluations (three: two-sided at 8\u00d710\u2074, upper at 10\u2075)\n  with full mul_le_mul chains through FAlt/\u0108\u2080/H\u0302/bracket/e\u2074/IIMaj.\n- `marginTilde_FAlt_80000_pos` (\u2265 8001; true 15 764),\n  `marginTilde_FAlt_80000_lt_100000` (65 001 < 85 501),\n  **`lambda_pos_finite_height_verified`**: R-004 modulo SfBoundProp +\n  perimeter ONLY. PrintAxioms: 3 standard axioms, no sorryAx.\n- Lean caught a real 3\u00d710\u207b\u2076 rounding slip (110.34987 \u2192 110.3498) \u2014\n  methodology working as intended.\n- LiSkeleton gained public IIMaj_le_two_mul / IIMaj_nonneg (psiTilde is\n  private there; the base-point file consumes the public wrappers).\n\n### Paper (reconciled, compile clean 12 pp)\n- \u00a73.1 Step 4: main-text number now 15 764 (the Lean-consumed FAlt\n  majorant value) + footnote with the full trail (16 020 E-028 \u2192\n  15 764 FAlt \u2192 \u2265 8 001 certified interval bound) + secant argument.\n- Step 5: overlap factor 5 at the 10\u2075 split (6.25\u00d7 at N\u2080 = 8\u00d710\u2074\n  retained).\n- Numerics bullet: 16 020 annotated with the 15 764 cross-reference.\n- Formal verification appendix: headline now THREE named hypotheses\n  (lambda_pos_finite_height_verified); the margin evaluations declared\n  discharged in LiBasePoints.lean.\n\n### Docs\nD-062 \u00a75 EXECUTED note (executed targets vs plan; the rounding swap\nlog \u03c0 \u2264 1.15 for 1.1448; 1/(2\u03c0) \u2264 1/6 for 0.1592; the 110.3498 slip).\nSTATE.md + NGUYEN.md + db updated; session-012-end-notes.txt archived.\n\n## State at stop (final)\n**Tier (ii) steps 1+2 COMPLETE.** R-004 is machine-verified modulo one\nnamed analytic hypothesis (SfBoundProp) + the declared computational\nperimeter \u2014 the mathematician's \"headline claim\" moment reached. Paper\nA's formal-verification story is complete pending publication split.\nRemaining: tier ii\u2032 (SfBoundProp layers L0\u2013L3 contour formalization \u2014\npost-publication per the review), tiers iii/iv skeletons, optional\nE-023b. Paper-B (\u2605) workstream stays separate.",
  "originalFile": "# Session 012 \u2014 2026-08-20 \u2014 Lean tier (ii) step 1: assembly modulo SfBoundProp\n\n## Directive\nsession-012-notes.txt (read at session start per the session-011 user\ndirective): pick option (a) Lean tier (ii), but SPLIT it first \u2014\nassembly-first with the finite-part bound as a named hypothesis, then\ntriage. User confirmed option (a) at session start.\n\n## What happened\n\n### Step 1: assembly-first (COMPLETE, two commits)\nRead LiSkeleton.lean (tier-(i) state) + D-037/D-056/D-057 for the exact\nassembly chain: \u03bb_n = S_\u221e \u2212 S_f + 1 (BL Thm 2) \u27f9 \u03bb_n \u2265 S(n) \u2212 B(n) + 1\n= margin(n), convexity + base point \u27f9 margin > 0 on the range, finite\nverification below.\n\nKey design decisions (all in D-062):\n1. **Sf := SInfty n + 1 \u2212 (liCoeff n).re** \u2014 BL Thm 2 holds by\n   construction; the D-036 contour argument proves identity + bound in\n   one stroke, so no separate BL formalization is needed downstream.\n2. **FAlt majorant swap** \u2014 discovered during design: the true Trudgian\n   F + S_b has \u03c8 > 0 on [5.47, ~16] (negative-weight \u2212(log 2\u03c0e/2\u03c0)T\n   term against the negative-\u03c8 T-block), which would FALSIFY the\n   marginTilde_convex hypothesis h\u03c8 for the explicit majorant. Dropped\n   the negative-weight term: FAlt \u2265 F + S_b pointwise, all four blocks\n   provably \u03c8 < 0 (D-057 rows #1/#3/#4), margin cost \u2248 0.9\u221an = 256 at\n   n = 8\u00d710\u2074 vs margin 15 764 \u2014 negligible. (Caught by hand-computing\n   \u03c8[F+S_b](5.47) = \u22120.0006 \u2014 barely negative \u2014 before attempting the\n   Lean instantiation.)\n3. **Two-point base (secant)** instead of the derivative base point:\n   pos_of_convex_of_two_points (ConvexOn.slope_mono_adjacent) \u2014 the\n   remaining numeric obligations are two PLAIN evaluations of the\n   explicit margin function, no deriv machinery. Caveat found: convex +\n   two points does NOT give positivity between the points (convex can\n   dip), so the regime split moved to n = 10\u2075 (second point), with\n   finite verification covering below.\n4. Refactor: margin regularity ContDiff \u211d 2 F \u2192 ContDiffOn (Ioi 1)\n   (FAlt log-singularities at 0, 1); chain_rule_sqrt_shift_on\n   generalized to c \u2264 1; unused hmaj dropped from marginTilde_convex.\n\nResult: `lambda_pos_finite_height` PROVED from 5 named hypotheses\n(hRH perimeter, hfinite perimeter, hbase, hbase2, hSf : SfBoundProp).\nPrintAxioms = [propext, Classical.choice, Quot.sound] \u2014 NO sorryAx.\nLiSkeleton.lean is now sorry-free; sorryAx remains only on the 4 valley\nstatements + R003 skeleton (tiers iii/iv) by design.\n\nCommits: 741d2c5 (step 1), f39499a (two-point variant).\n\n### Step 2 design: triage + perimeter decision (COMPLETE, D-062)\nDecomposed SfBoundProp into layers L0\u2013L7 with tractability verdicts:\n- Mathlib-tractable: kernel bounds, R-bound (mod N(T)), zero-avoidance.\n- Main lift: L0 rectangle-contour/residue machinery (thin in Mathlib).\n- DECISION (declared, per the notes' instruction to decide\n  deliberately): Trudgian 2014 explicit N(T)/S(T) \u2192 INSIDE the trusted\n  perimeter, same footing as Platt\u2013Trudgian. Rationale: published\n  refereed infrastructure; formalizing it is Backlund\u2013Rosser-class\n  (larger than everything done so far) with zero insight into R-004's\n  actual content. Paper appendix updated to declare exactly this.\n- M\u2080 \u2192 computational perimeter after E-023b (acb certificate).\n\n### Step 2 prep: base-point discharge plan VALIDATED (D-062 \u00a75)\nFull rational-interval bound chain pre-verified at dps 40: log 80000 \u2208\n[11.263, 11.3], log 100000 \u2265 11.5, log T \u2264 5.7/5.8, log log \u2264 1.75/1.77,\nlog 285 \u2265 5.6, log \u03c0 \u2208 [1.14, 1.1448] (upper link 0.007% \u2014 tightest),\ne\u2074 \u2208 [54.5978, 54.6015], IIMaj \u2264 4.56(s+1)\u00b72. Certified outcome:\nmargin(8\u00d710\u2074) \u2208 [9 960\u00b7slack, 63 989], margin(10\u2075) \u2265 86 220 \u2014\nhbase and hbase2 both comfortably provable (~400\u2013600 lines of interval\ngrind along block_range_bounds/iimaj_bracket_bound patterns).\n\n### Paper\ndraft.tex Formal verification appendix: new paragraph (tier (ii)\nassembly form, five named hypotheses, Trudgian perimeter declaration,\nFAlt note) + remaining-tiers paragraph updated (ii \u2192 ii\u2032 inside\nSfBoundProp). MiKTeX compile clean, 12 pp. Audit note (D-060 \u00a75 rule):\nthe edited lines are exactly the new/updated paragraphs; claims match\nthe Lean state verbatim (hypothesis list, axiom profile).\n\n## Files\n- research/lean/NguyenRH1/NguyenRH1/LiSkeleton.lean (+~470 lines:\n  FAlt/Bn/Sf/SfBoundProp defs, marginTilde_eq_sub, \u03c8-blocks #1/#3/#4,\n  contDiffOn_FAlt, FAlt_psi_neg, pos_of_convex_of_base/two_points,\n  lambda_pos_finite_height; refactor of margin regularity)\n- research/lean/NguyenRH1/PrintAxioms.lean (new declarations added)\n- research/derivations/D-062-SfBound-triage.md (NEW)\n- D-061 \u00a75 update (session-012 status)\n- research/paper/draft.tex (Formal verification appendix)\n- research/journal/session-012.md (this file)\n\n## State at stop\nTier (ii) step 1 COMPLETE and committed. Next: tier (ii) step 2 \u2014\ndischarge hbase/hbase2 per the D-062 \u00a75 plan (validated), then the long\npole: SfBoundProp layers L0\u2013L3 (contour formalization), with L4\nperimeter decided. Optional hygiene: E-023b (M\u2080 acb certificate).\n",
  "structuredPatch": [
    {
      "oldStart": 92,
      "oldLines": 3,
      "newStart": 92,
      "newLines": 66,
      "lines": [
        " pole: SfBoundProp layers L0\u2013L3 (contour formalization), with L4",
        " perimeter decided. Optional hygiene: E-023b (M\u2080 acb certificate).",
        " ",
        "+---",
        "+",
        "+## Continuation (same day): mathematician's review notes + tier (ii) STEP 2 COMPLETE",
        "+",
        "+Read `session-012-end-notes.txt` (mathematician's comment; user",
        "+directive: use good advice). Directives extracted:",
        "+1. **Discharge hbase/hbase2 next** (cheap, pre-verified) \u2014 DONE (below).",
        "+2. **Reconcile the margin-number trail** (16 020 \u2192 15 764 \u2192 certified",
        "+   bound) in the main text with a footnote \u2014 DONE (draft.tex Step 4",
        "+   footnote + numerics bullet + Step 5 overlap factor 5 at the 10\u2075",
        "+   split).",
        "+3. Hold the paper's formal-status paragraph until the discharge lands \u2014",
        "+   it landed; paragraph finalized at THREE hypotheses.",
        "+4. Tier ii\u2032 (rectangle-contour interior of SfBoundProp) = POST-",
        "+   PUBLICATION work; don't let it delay Paper A. Part-2 objections",
        "+   (Theorem 3's tempered-FT bookkeeping + o(e\u1d43) in its statement,",
        "+   L3/L4, authorship policy) standing, unchanged \u2014 no action this",
        "+   session.",
        "+",
        "+### Tier (ii) step 2: base points DISCHARGED (commit fc2e55e)",
        "+New file `NguyenRH1/LiBasePoints.lean` (~560 lines, clean compile):",
        "+- Machinery: `exp_le_inv_sub_sixteen` (exp x \u2264 (1\u2212x/16)\u207b\u00b9\u2076 from",
        "+  Real.add_one_le_exp), exp_one_pow_le/ge (d9 rational powers),",
        "+  exp_eleven/five/four (Real.exp_nat_mul), certified log bounds",
        "+  (log 80000 \u2208 [11.263, 11.3], log 100000 \u2265 11.5, log \u03c0 \u2208 [1.14,",
        "+  1.15]), sqrt bounds (sqrt_le_left/le_sqrt).",
        "+- sInftyLower_eq' (\u03b3 cancels at point level, ring) + three evaluated",
        "+  bounds; Bn evaluations (three: two-sided at 8\u00d710\u2074, upper at 10\u2075)",
        "+  with full mul_le_mul chains through FAlt/\u0108\u2080/H\u0302/bracket/e\u2074/IIMaj.",
        "+- `marginTilde_FAlt_80000_pos` (\u2265 8001; true 15 764),",
        "+  `marginTilde_FAlt_80000_lt_100000` (65 001 < 85 501),",
        "+  **`lambda_pos_finite_height_verified`**: R-004 modulo SfBoundProp +",
        "+  perimeter ONLY. PrintAxioms: 3 standard axioms, no sorryAx.",
        "+- Lean caught a real 3\u00d710\u207b\u2076 rounding slip (110.34987 \u2192 110.3498) \u2014",
        "+  methodology working as intended.",
        "+- LiSkeleton gained public IIMaj_le_two_mul / IIMaj_nonneg (psiTilde is",
        "+  private there; the base-point file consumes the public wrappers).",
        "+",
        "+### Paper (reconciled, compile clean 12 pp)",
        "+- \u00a73.1 Step 4: main-text number now 15 764 (the Lean-consumed FAlt",
        "+  majorant value) + footnote with the full trail (16 020 E-028 \u2192",
        "+  15 764 FAlt \u2192 \u2265 8 001 certified interval bound) + secant argument.",
        "+- Step 5: overlap factor 5 at the 10\u2075 split (6.25\u00d7 at N\u2080 = 8\u00d710\u2074",
        "+  retained).",
        "+- Numerics bullet: 16 020 annotated with the 15 764 cross-reference.",
        "+- Formal verification appendix: headline now THREE named hypotheses",
        "+  (lambda_pos_finite_height_verified); the margin evaluations declared",
        "+  discharged in LiBasePoints.lean.",
        "+",
        "+### Docs",
        "+D-062 \u00a75 EXECUTED note (executed targets vs plan; the rounding swap",
        "+log \u03c0 \u2264 1.15 for 1.1448; 1/(2\u03c0) \u2264 1/6 for 0.1592; the 110.3498 slip).",
        "+STATE.md + NGUYEN.md + db updated; session-012-end-notes.txt archived.",
        "+",
        "+## State at stop (final)",
        "+**Tier (ii) steps 1+2 COMPLETE.** R-004 is machine-verified modulo one",
        "+named analytic hypothesis (SfBoundProp) + the declared computational",
        "+perimeter \u2014 the mathematician's \"headline claim\" moment reached. Paper",
        "+A's formal-verification story is complete pending publication split.",
        "+Remaining: tier ii\u2032 (SfBoundProp layers L0\u2013L3 contour formalization \u2014",
        "+post-publication per the review), tiers iii/iv skeletons, optional",
        "+E-023b. Paper-B (\u2605) workstream stays separate.",
        "+"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-004-sine-moments.py",
  "content": "\"\"\"E-004 \u2014 Thread T1 / task 1.3 warm-up: reproduce the limiting spectral\nmoments m_k(1) = 1, 4/3, 2, 13/4 (k <= 4) of the sine-kernel Gram matrix\nover the sine process (paper \u00a77.2(f)), and the Christoffel value\nLambda_2(0) = 5/36.\n\nConstruction (flat window; \"sine-kernel Gram matrix\"):\n  points gamma: sine-process sample (GUE bulk eigenvalues, unfolded to\n  mean spacing 1) in a window of W points;\n  grid alpha_k = 2 pi k / L at critical density h = 2pi/L, k = 0..d-1,\n  d = floor(L W / 2 pi);\n  G_tilde = V^T V with V[j,k] = sinc(L(gamma_j - alpha_k)/2),\n  sinc(x) = sin(x)/x   (sharp cutoff; a = ||phi||^2/L = 1).\nMoments: m_k = (1/d) tr G_tilde^k  = mean of eigenvalues^k.\n\nHand check (already verified, D-010): from m_0..m_4 = 1,1,4/3,2,13/4 the\nmoment matrix has det = 5/108 and (M^-1)_00 = 36/5, so Lambda_2(0) = 5/36.\n\nOutputs: research/numerics/data/E-004-sine-moments.csv (+ .json)\n\"\"\"\nimport json\nimport sys\nimport time\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport numpy as np\n\nREPO = Path(__file__).resolve().parents[3]\nDATA = REPO / \"research\" / \"numerics\" / \"data\"\nCSV = DATA / \"E-004-sine-moments.csv\"\nJSON = DATA / \"E-004-sine-moments.json\"\n\nRNG_SEED = 20260817\nN_GUE = 400          # GUE size per sample (bulk used)\nW = 600              # window length in unfolded points\nL_VALUES = (4.0, 6.0, 8.0)\nN_SAMPLES = 60\nTARGET = {1: 1.0, 2: 4.0 / 3.0, 3: 2.0, 4: 13.0 / 4.0}\n\n\ndef gue_bulk_points(rng) -> np.ndarray:\n    \"\"\"Unfolded GUE bulk eigenvalues (mean spacing 1), W consecutive.\"\"\"\n    A = rng.standard_normal((N_GUE, N_GUE)) + 1j * rng.standard_normal((N_GUE, N_GUE))\n    H = (A + A.conj().T) / 2.0\n    ev = np.linalg.eigvalsh(H)  # support ~ [-2 sqrt(2n), 2 sqrt(2n)] for this normalization? no:\n    # entries variance 1 (complex): semicircle radius 2*sqrt(n)\n    ev = ev / np.sqrt(N_GUE)    # now support [-2, 2], bulk density (1/pi)... unfold:\n    # semicircle density rho(x) = (1/(2 pi)) sqrt(4 - x^2); unfold via CDF\n    # take middle 60% and rescale by local mean spacing at 0: spacing(0) = 1/rho(0) = pi\n    lo, hi = int(0.2 * N_GUE), int(0.8 * N_GUE)\n    bulk = ev[lo:hi]\n    bulk = bulk * (1.0 / np.pi) * N_GUE / (0.6 * N_GUE) * len(bulk) * (np.pi / len(bulk))\n    # simpler robust unfolding: rescale so mean consecutive spacing is exactly 1\n    bulk = bulk / np.mean(np.diff(bulk))\n    mid = len(bulk) // 2\n    return bulk[mid - W // 2: mid + W // 2]\n\n\ndef sinc(x):\n    return np.sinc(x / np.pi)  # np.sinc(u) = sin(pi u)/(pi u) -> sin(x)/x\n\n\ndef main() -> int:\n    if CSV.exists() and \"--force\" not in sys.argv:\n        print(f\"cached: {CSV} exists (use --force to recompute)\")\n        return 0\n    rng = np.random.default_rng(RNG_SEED)\n    t0 = time.time()\n\n    # accumulate moments per L\n    acc = {L: {k: [] for k in (1, 2, 3, 4)} for L in L_VALUES}\n    for s in range(N_SAMPLES):\n        pts = gue_bulk_points(rng)\n        pts = pts - pts[0]\n        Wpts = pts[-1]\n        for L in L_VALUES:\n            h = 2 * np.pi / L\n            d = int(L * Wpts / (2 * np.pi))\n            alpha = h * np.arange(d)\n            Z = pts[:, None] - alpha[None, :]\n            V = sinc(L * Z / 2.0)\n            G = (V.T @ V) / L**2\n            ev = np.linalg.eigvalsh(G)\n            for k in (1, 2, 3, 4):\n                acc[L][k].append(float(np.mean(ev**k)))\n        if (s + 1) % 20 == 0:\n            print(f\"  {s+1}/{N_SAMPLES} samples ({time.time()-t0:.0f}s)\",\n                  flush=True)\n\n    rows = []\n    checks = {}\n    for L in L_VALUES:\n        row = {\"L\": L}\n        for k in (1, 2, 3, 4):\n            arr = np.array(acc[L][k])\n            m, sd = arr.mean(), arr.std()\n            row[f\"m{k}\"] = f\"{m:.5f}\"\n            row[f\"m{k}_std\"] = f\"{sd:.5f}\"\n            row[f\"m{k}_target\"] = f\"{TARGET[k]:.5f}\"\n            row[f\"m{k}_relerr\"] = f\"{abs(m / TARGET[k] - 1):.5f}\"\n        rows.append(row)\n        # generous tolerances: finite-L + finite-W + sampling effects\n        checks[f\"L={L}\"] = {\n            f\"m{k}_within_6pct\": bool(abs(np.mean(acc[L][k]) / TARGET[k] - 1) < 0.06)\n            for k in (1, 2, 3, 4)\n        }\n        print(f\"L={L}: \" + \"  \".join(\n            f\"m{k}={np.mean(acc[L][k]):.4f}+-{np.std(acc[L][k]):.4f}\"\n            f\" (target {TARGET[k]:.4f})\" for k in (1, 2, 3, 4)), flush=True)\n\n    # Christoffel from simulated moments (L=8): Lambda_2(0) = 1/(M^-1)_00\n    Lmax = L_VALUES[-1]\n    m = [1.0] + [float(np.mean(acc[Lmax][k])) for k in (1, 2, 3, 4)]\n    M = np.array([[m[i + j] for j in range(3)] for i in range(3)])\n    lam2 = 1.0 / np.linalg.inv(M)[0, 0]\n    print(f\"Christoffel Lambda_2(0) from simulated moments (L={Lmax}): \"\n          f\"{lam2:.5f}  (target 5/36 = {5/36:.5f})\")\n    checks[\"christoffel\"] = {\"within_10pct\": bool(abs(lam2 / (5 / 36) - 1) < 0.10)}\n\n    DATA.mkdir(parents=True, exist_ok=True)\n    with CSV.open(\"w\", encoding=\"utf-8\", newline=\"\") as f:\n        f.write(\",\".join(rows[0].keys()) + \"\\n\")\n        for r in rows:\n            f.write(\",\".join(str(v) for v in r.values()) + \"\\n\")\n    meta = {\n        \"experiment\": \"E-004\",\n        \"task\": \"1.3 warm-up (thread T1)\",\n        \"description\": \"Monte Carlo reproduction of sine-kernel Gram matrix \"\n                       \"spectral moments m_k(1)=1,4/3,2,13/4 and Christoffel \"\n                       \"Lambda_2(0)=5/36 (paper \u00a77.2(f))\",\n        \"script\": \"research/numerics/scripts/E-004-sine-moments.py\",\n        \"parameters\": {\"N_GUE\": N_GUE, \"W\": W, \"L_values\": list(L_VALUES),\n                       \"n_samples\": N_SAMPLES, \"seed\": RNG_SEED},\n        \"christoffel_simulated\": lam2,\n        \"checks\": checks,\n        \"elapsed_seconds\": round(time.time() - t0, 1),\n        \"timestamp_utc\": datetime.now(timezone.utc).isoformat(),\n        \"row_count\": len(rows),\n    }\n    JSON.write_text(json.dumps(meta, indent=2), encoding=\"utf-8\")\n    ok = all(all(c.values()) for c in checks.values())\n    print(f\"wrote {CSV.name}, {JSON.name} \u2014 \"\n          f\"{'ALL CHECKS PASS' if ok else 'CHECK FAILURE (inspect)'}\")\n    return 0 if ok else 1\n\n\nif __name__ == \"__main__\":\n    raise SystemExit(main())\n"
}

File created successfully at: D:\Python\Quantum\research\numerics\scripts\E-004-sine-moments.py

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-004-sine-moments.py",
  "old_string": "    ev = np.linalg.eigvalsh(H)  # support ~ [-2 sqrt(2n), 2 sqrt(2n)] for this normalization? no:\n    # entries variance 1 (complex): semicircle radius 2*sqrt(n)\n    ev = ev / np.sqrt(N_GUE)    # now support [-2, 2], bulk density (1/pi)... unfold:\n    # semicircle density rho(x) = (1/(2 pi)) sqrt(4 - x^2); unfold via CDF\n    # take middle 60% and rescale by local mean spacing at 0: spacing(0) = 1/rho(0) = pi\n    lo, hi = int(0.2 * N_GUE), int(0.8 * N_GUE)\n    bulk = ev[lo:hi]\n    bulk = bulk * (1.0 / np.pi) * N_GUE / (0.6 * N_GUE) * len(bulk) * (np.pi / len(bulk))\n    # simpler robust unfolding: rescale so mean consecutive spacing is exactly 1\n    bulk = bulk / np.mean(np.diff(bulk))\n    mid = len(bulk) // 2\n    return bulk[mid - W // 2: mid + W // 2]",
  "new_string": "    ev = np.linalg.eigvalsh(H) / np.sqrt(N_GUE)  # semicircle on [-2, 2]\n    # take middle 60% (bulk) and unfold: rescale to mean spacing exactly 1\n    lo, hi = int(0.2 * N_GUE), int(0.8 * N_GUE)\n    bulk = ev[lo:hi]\n    bulk = bulk / np.mean(np.diff(bulk))\n    mid = len(bulk) // 2\n    return bulk[mid - W // 2: mid + W // 2]"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiTightR.lean",
  "oldString": "  -- h : Summable (fun n : \u2115 \u21a6 (fun x => log x / x\u00b2) \u2191n); shift by 4\n  have h2 := (summable_nat_add_iff 4).mpr (f := fun n : \u2115 =>\n    Real.log (n : \u211d) / (n : \u211d) ^ 2) h\n  refine h2.congr fun n => ?_\n  push_cast\n  ring_nf",
  "newString": "  -- h : Summable (fun n : \u2115 \u21a6 (fun x => log x / x\u00b2) \u2191n); shift by 4\n  have h2 := (summable_nat_add_iff (f := fun n : \u2115 =>\n    Real.log (n : \u211d) / (n : \u211d) ^ 2) 4).mpr h\n  refine h2.congr fun n => ?_\n  push_cast\n  ring_nf",
  "originalFile": "/-\nNguyenRH1/LiTightR.lean \u2014 tier ii\u2032 sub-stage ii\u2032-5f (D-069): the tight\nR-bound from the partial-fraction identity (the reference-point method,\nD-056 \u00a72, with the D-069 honest piece-2 two-unit count).\n\n\u00a71: the \u2102 tsum split (variant of LiCircleBound's tsum_split_finset).\n\u00a72: the near-zero subtype finset `nearZerosSub` + membership.\n\u00a73: the seriesFun difference term + identity.\n\u00a74: the six-piece reference-point decomposition `Rexpr_decomp`.\n\u00a75: piece 2 \u2014 the near sum at s\u2080 = 2+it bounded by ZeroCountProp2.\n\u00a76: pieces 4/5 \u2014 the reciprocal differences \u2264 0.045.\n\nRemaining (5f-ii): piece 1 (dirichletC2 \u2264 0.995), piece 6 (the sharp\ndigamma remainder via the level-2 EM), piece 3 (the far-sum interval\nmachine). (5f-iii): the assembly + the pinch lemma + the capstone\n`logDeriv_riemannZeta_sub_nearZeros_le_tight`.\n\nArchive references: D-069 (design + Findings 1/2), D-056 \u00a72, journal-035.\n-/\nimport Mathlib\nimport NguyenRH1.LiSqueeze\n\nopen Zeta23 Complex Filter Topology MeasureTheory\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. The \u2102 tsum split -/\n\n/-- Splitting a summable complex tsum over a finset (the \u2102 variant of\nLiCircleBound's `tsum_split_finset`). -/\nlemma tsum_split_finset_complex {\u03b9 : Type*} [DecidableEq \u03b9] {f : \u03b9 \u2192 \u2102} (hf : Summable f)\n    (s : Finset \u03b9) :\n    \u2211' i, f i = \u2211 i \u2208 s, f i + \u2211' i, (if i \u2208 s then 0 else f i) := by\n  classical\n  have h1 : Summable (fun i => if i \u2208 s then f i else 0) := by\n    apply Summable.of_norm_bounded hf.norm\n    intro i\n    by_cases hi : i \u2208 s <;> simp [hi]\n  have h2 : Summable (fun i => if i \u2208 s then 0 else f i) := by\n    apply Summable.of_norm_bounded hf.norm\n    intro i\n    by_cases hi : i \u2208 s <;> simp [hi]\n  have h3 : \u2211' i, f i\n      = \u2211' i, ((if i \u2208 s then f i else 0) + (if i \u2208 s then 0 else f i)) := by\n    apply tsum_congr\n    intro i\n    by_cases hi : i \u2208 s <;> simp [hi]\n  rw [h3, Summable.tsum_add h1 h2]\n  congr 1\n  rw [tsum_eq_sum (s := s) (fun b hb => if_neg hb)]\n  exact Finset.sum_congr rfl (fun b hb => if_pos hb)\n\n/-! ## 2. The near-zero subtype finset -/\n\n/-- The near-zero subtype finset: the nontrivial zeros with |\u03b3 \u2212 t| < 1,\nas a finset of the zero subtype (the `seriesFun` index type). The\ncontaining ball: |\u03b3\u2212t| < 1 and 0 < re < 1 give \u2016\u03c1\u2016 \u2264 |re| + |im| <\n|t| + 3. -/\ndef nearZerosSub (t : \u211d) : Finset {\u03c1 : \u2102 // IsNontrivialZero \u03c1} :=\n  (finite_subtype_norm_lt (|t| + 3)).toFinset.filter fun \u03c1 => |\u03c1.1.im - t| < 1\n\nlemma mem_nearZerosSub {t : \u211d} {\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}} :\n    \u03c1 \u2208 nearZerosSub t \u2194 |\u03c1.1.im - t| < 1 := by\n  rw [nearZerosSub, Finset.mem_filter]\n  refine \u27e8fun h => h.2, fun h => \u27e8?_, h\u27e9\u27e9\n  rw [Set.Finite.mem_toFinset]\n  show \u2016\u03c1.1\u2016 < |t| + 3\n  have hle : \u2016\u03c1.1\u2016 \u2264 |\u03c1.1.re| + |\u03c1.1.im| := Complex.norm_le_abs_re_add_abs_im _\n  have hre : |\u03c1.1.re| \u2264 1 := by\n    have h1 : 0 < \u03c1.1.re := \u03c1.2.2.1\n    have h2 : \u03c1.1.re < 1 := \u03c1.2.2.2\n    rw [abs_le]\n    constructor <;> linarith\n  have him : |\u03c1.1.im| \u2264 |t| + 1 := by\n    calc |\u03c1.1.im| = |\u03c1.1.im - t + t| := by rw [sub_add_cancel]\n      _ \u2264 |\u03c1.1.im - t| + |t| := abs_add_le _ _\n      _ \u2264 1 + |t| := by linarith [h]\n      _ = |t| + 1 := by ring\n  linarith [hle, hre, him]\n\n/-! ## 3. The seriesFun difference identity -/\n\n/-- The seriesFun difference term (a def so the tsum split matches\nsyntactically \u2014 no beta-redexes). -/\ndef seriesDiffTerm (s s\u2080 : \u2102) (\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}) : \u2102 :=\n  (zeroMult \u03c1.1 : \u2102) * (1 / (s - \u03c1.1) - 1 / (s\u2080 - \u03c1.1))\n\n/-- The difference series is summable (the two seriesFun summabilities). -/\ntheorem seriesDiffTerm_summable (s s\u2080 : \u2102) :\n    Summable (seriesDiffTerm s s\u2080) := by\n  apply Summable.congr ((seriesSummable s).sub (seriesSummable s\u2080))\n  intro \u03c1\n  show seriesTerm s \u03c1 - seriesTerm s\u2080 \u03c1 = seriesDiffTerm s s\u2080 \u03c1\n  rw [seriesDiffTerm, seriesTerm, seriesTerm]\n  ring\n\n/-- seriesFun s \u2212 seriesFun s\u2080 as the termwise difference series. -/\ntheorem seriesFun_sub_seriesFun (s s\u2080 : \u2102) :\n    seriesFun s - seriesFun s\u2080 = \u2211' \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1},\n      seriesDiffTerm s s\u2080 \u03c1 := by\n  rw [seriesFun, seriesFun, \u2190 (seriesSummable s).tsum_sub (seriesSummable s\u2080)]\n  refine tsum_congr fun \u03c1 => ?_\n  show seriesTerm s \u03c1 - seriesTerm s\u2080 \u03c1 = seriesDiffTerm s s\u2080 \u03c1\n  rw [seriesDiffTerm, seriesTerm, seriesTerm]\n  ring\n\n/-! ## 4. The reference-point decomposition -/\n\n/-- **The six-piece reference-point decomposition** (D-056 \u00a72, D-069 \u00a73):\nwith both s and s\u2080 good (so `partialFraction_identity` applies at both \u2014\nB cancels), the R-expression at s equals: the reference value, minus the\nnear sum at s\u2080, plus the far difference series, minus the elementary\ndifferences, minus the digamma difference. -/\ntheorem Rexpr_decomp (hZC : ZeroCountProp) {s s\u2080 : \u2102}\n    (hs : riemannZeta s \u2260 0) (hs0 : s \u2260 0) (hs1 : s \u2260 1)\n    (hst : \u2200 n : \u2115, 1 \u2264 n \u2192 s \u2260 -2 * (n : \u2102))\n    (hs\u2080 : riemannZeta s\u2080 \u2260 0) (hs\u20800 : s\u2080 \u2260 0) (hs\u20801 : s\u2080 \u2260 1)\n    (hs\u2080t : \u2200 n : \u2115, 1 \u2264 n \u2192 s\u2080 \u2260 -2 * (n : \u2102)) (t : \u211d) :\n    logDeriv riemannZeta s\n        - \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / (s - \u03c1.1)\n      = logDeriv riemannZeta s\u2080\n        - \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / (s\u2080 - \u03c1.1)\n        + (\u2211' \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1},\n            if \u03c1 \u2208 nearZerosSub t then (0 : \u2102) else seriesDiffTerm s s\u2080 \u03c1)\n        - (1 / s - 1 / s\u2080) - (1 / (s - 1) - 1 / (s\u2080 - 1))\n        - (Complex.digamma (s / 2) - Complex.digamma (s\u2080 / 2)) / 2 := by\n  obtain \u27e8B, hB\u27e9 := partialFraction_identity hZC\n  have hsid := hB s hs hs0 hs1 hst\n  have hs\u2080id := hB s\u2080 hs\u2080 hs\u20800 hs\u20801 hs\u2080t\n  have hdiff := seriesFun_sub_seriesFun s s\u2080\n  have hsplit := tsum_split_finset_complex (seriesDiffTerm_summable s s\u2080) (nearZerosSub t)\n  have hnear : \u2211 \u03c1 \u2208 nearZerosSub t, seriesDiffTerm s s\u2080 \u03c1\n      = \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / (s - \u03c1.1)\n        - \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / (s\u2080 - \u03c1.1) := by\n    rw [\u2190 Finset.sum_sub_distrib]\n    refine Finset.sum_congr rfl fun \u03c1 _ => ?_\n    rw [seriesDiffTerm, div_eq_mul_one_div, div_eq_mul_one_div]\n    ring\n  linear_combination hsid - hs\u2080id + hdiff + hsplit + hnear\n\n/-! ## 5. Piece 2: the near sum at the reference point -/\n\n/-- **Piece 2** (D-069 \u00a73, honest two-unit form): the near sum at\ns\u2080 = 2 + it is bounded by the ZeroCountProp2 count, since\n|s\u2080 \u2212 \u03c1| \u2265 2 \u2212 re \u03c1 \u2265 1 for every nontrivial zero. -/\ntheorem near_sum_refPoint_le (hZC2 : ZeroCountProp2) {t : \u211d} (ht : 10 \u2264 t) :\n    \u2016\u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / ((2 + t * Complex.I) - \u03c1.1)\u2016\n      \u2264 0.6 * Real.log (t + 2) + 0.886 * Real.log (Real.log (t + 2)) + 2.7 := by\n  classical\n  have hterm : \u2200 \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}, \u03c1 \u2208 nearZerosSub t \u2192\n      \u2016(zeroMult \u03c1.1 : \u2102) / ((2 + t * Complex.I) - \u03c1.1)\u2016 \u2264 (zeroMult \u03c1.1 : \u211d) := by\n    intro \u03c1 _\n    have h\u03c1re : \u03c1.1.re < 1 := \u03c1.2.2.2\n    have h1 : (1 : \u211d) \u2264 \u2016(2 + t * Complex.I) - \u03c1.1\u2016 := by\n      have hre : ((2 + t * Complex.I) - \u03c1.1).re = 2 - \u03c1.1.re := by simp\n      have h := abs_re_le_norm ((2 + t * Complex.I) - \u03c1.1)\n      rw [hre] at h\n      have h2 : (1 : \u211d) \u2264 |2 - \u03c1.1.re| := by\n        rw [abs_of_nonneg (by linarith)]\n        linarith\n      exact h2.trans h\n    rw [norm_div]\n    have h2 : \u2016(zeroMult \u03c1.1 : \u2102)\u2016 = (zeroMult \u03c1.1 : \u211d) := by\n      rw [show (zeroMult \u03c1.1 : \u2102) = ((zeroMult \u03c1.1 : \u211d) : \u2102) by push_cast; ring,\n        Complex.norm_real]\n      exact abs_of_nonneg (Nat.cast_nonneg _)\n    rw [h2]\n    calc (zeroMult \u03c1.1 : \u211d) / \u2016(2 + t * Complex.I) - \u03c1.1\u2016\n        \u2264 (zeroMult \u03c1.1 : \u211d) / 1 :=\n          div_le_div_of_nonneg_left (Nat.cast_nonneg _)\n            (by norm_num : (0 : \u211d) < 1) h1\n      _ = (zeroMult \u03c1.1 : \u211d) := div_one _\n  have hbridge : \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u211d)\n      = \u2211 \u03c1 \u2208 (nearZerosSub t).image (fun \u03c1 => \u03c1.1), (zeroMult \u03c1 : \u211d) := by\n    rw [Finset.sum_image (fun x _ y _ h => Subtype.ext h)]\n  have hsub : (nearZerosSub t).image (fun \u03c1 => \u03c1.1)\n      \u2286 (zeroAbsWindow_finite t).toFinset := by\n    intro \u03c1 h\u03c1\n    rw [Finset.mem_image] at h\u03c1\n    obtain \u27e8\u03c1', h\u03c1'mem, h\u03c1'eq\u27e9 := h\u03c1\n    have hnear := mem_nearZerosSub.mp h\u03c1'mem\n    rw [Set.Finite.mem_toFinset]\n    show IsNontrivialZero \u03c1 \u2227 |\u03c1.im - t| \u2264 1\n    rw [\u2190 h\u03c1'eq]\n    exact \u27e8\u03c1'.2, hnear.le\u27e9\n  calc \u2016\u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u2102) / ((2 + t * Complex.I) - \u03c1.1)\u2016\n      \u2264 \u2211 \u03c1 \u2208 nearZerosSub t, \u2016(zeroMult \u03c1.1 : \u2102) / ((2 + t * Complex.I) - \u03c1.1)\u2016 :=\n        norm_sum_le _ _\n    _ \u2264 \u2211 \u03c1 \u2208 nearZerosSub t, (zeroMult \u03c1.1 : \u211d) := Finset.sum_le_sum hterm\n    _ = \u2211 \u03c1 \u2208 (nearZerosSub t).image (fun \u03c1 => \u03c1.1), (zeroMult \u03c1 : \u211d) := hbridge\n    _ \u2264 \u2211 \u03c1 \u2208 (zeroAbsWindow_finite t).toFinset, (zeroMult \u03c1 : \u211d) :=\n        Finset.sum_le_sum_of_subset_of_nonneg hsub (fun \u03c1 _ _ => Nat.cast_nonneg _)\n    _ = (((zeroAbsWindow_finite t).toFinset.sum fun \u03c1 => zeroMult \u03c1) : \u211d) := rfl\n    _ \u2264 0.6 * Real.log (t + 2) + 0.886 * Real.log (Real.log (t + 2)) + 2.7 :=\n        hZC2 t ht\n\n/-! ## 6. Piece 1: the Dirichlet bound at the reference point -/\n\n/-- The Dirichlet term norm at 2: \u2016LSeries.term \u039b 2 n\u2016 = (if n = 0 then\n0 else) \u039b(n)/n\u00b2. -/\nlemma dirichletTerm_norm_eq (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016\n      = if n = 0 then (0 : \u211d)\n        else (ArithmeticFunction.vonMangoldt n) / (n : \u211d) ^ 2 := by\n  rcases eq_or_ne n 0 with rfl | hn\n  \u00b7 simp [LSeries.term]\n  \u00b7 rw [LSeries.term_def, if_neg hn, norm_div]\n    have h1 : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016\n        = ArithmeticFunction.vonMangoldt n := by\n      rw [Complex.norm_real]\n      exact abs_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n    have h2 : \u2016((n : \u2102)) ^ (2 : \u2102)\u2016 = (n : \u211d) ^ 2 := by\n      rw [show (2 : \u2102) = ((2 : \u2115) : \u2102) by norm_num, cpow_natCast, norm_pow,\n        Complex.norm_natCast]\n    rw [h1, h2, if_neg hn]\n\n/-- The antiderivative derivative fact: d/dx [\u2212((log x + 1)/x)] = log x/x\u00b2. -/\nlemma hasDerivAt_neg_log_add_one_div {x : \u211d} (hx0 : x \u2260 0) :\n    HasDerivAt (fun y => -((Real.log y + 1) / y)) (Real.log x / x ^ 2) x := by\n  have h1 := ((Real.hasDerivAt_log hx0).add_const 1).div (hasDerivAt_id' x) hx0\n  have h2 := h1.neg\n  rw [show (fun y => -((Real.log y + 1) / y))\n      = -((fun x => Real.log x + 1) / fun x => x) from by\n        ext y; simp only [Pi.neg_apply, Pi.div_apply]]\n  rw [show Real.log x / x ^ 2 = -((x\u207b\u00b9 * x - (Real.log x + 1) * 1) / x ^ 2) from by\n    rw [inv_mul_cancel\u2080 hx0]; ring]\n  exact h2\n\n/-- \u2212((log x + 1)/x) \u2192 0 as x \u2192 \u221e. -/\nlemma tendsto_neg_log_add_one_div :\n    Tendsto (fun y => -((Real.log y + 1) / y)) atTop (\ud835\udcdd 0) := by\n  have hA : Tendsto (fun x => Real.log x / x) atTop (\ud835\udcdd 0) := by\n    have h := Real.tendsto_pow_log_div_mul_add_atTop 1 0 1 one_ne_zero\n    simpa using h\n  have hB : Tendsto (fun x => (1 : \u211d) / x) atTop (\ud835\udcdd 0) := by\n    simpa only [one_div] using tendsto_inv_atTop_zero\n  have hC : Tendsto (fun x => Real.log x / x + 1 / x) atTop (\ud835\udcdd (0 + 0)) :=\n    hA.add hB\n  have heq : (fun y => -((Real.log y + 1) / y)) = (fun x => -(Real.log x / x + 1 / x)) := by\n    ext x\n    rw [add_div]\n  rw [heq]\n  simpa using hC.neg\n\n/-- log x/x\u00b2 is integrable on Ioi 3. -/\nlemma integrableOn_log_div_sq :\n    IntegrableOn (fun x => Real.log x / x ^ 2) (Set.Ioi (3 : \u211d)) volume := by\n  apply integrableOn_Ioi_deriv_of_nonneg' (fun x hx =>\n    hasDerivAt_neg_log_add_one_div (by\n      have h := (Set.mem_Ici.mp hx); linarith))\n  \u00b7 intro x hx\n    have hx3 : (3 : \u211d) < x := hx\n    have hlog : (0 : \u211d) \u2264 Real.log x := Real.log_nonneg (by linarith)\n    positivity\n  \u00b7 exact tendsto_neg_log_add_one_div\n\n/-- The integral of log x/x\u00b2 over Ioi 3 is (log 3 + 1)/3. -/\nlemma integral_log_div_sq_Ioi_three :\n    \u222b x in Set.Ioi (3 : \u211d), Real.log x / x ^ 2 = (Real.log 3 + 1) / 3 := by\n  have h := integral_Ioi_of_hasDerivAt_of_tendsto'\n    (fun x hx => hasDerivAt_neg_log_add_one_div (by\n      have h := (Set.mem_Ici.mp hx); linarith))\n    integrableOn_log_div_sq tendsto_neg_log_add_one_div\n  rw [h]\n  show (0 : \u211d) - -((Real.log 3 + 1) / 3) = (Real.log 3 + 1) / 3\n  ring\n\n/-- log x/x\u00b2 is antitone on Ici 3 (its derivative (1 \u2212 2 log x)/x\u00b3 is\n\u2264 0 for x \u2265 3 since log x \u2265 log 3 \u2265 1). -/\nlemma antitoneOn_log_div_sq :\n    AntitoneOn (fun x => Real.log x / x ^ 2) (Set.Ici (3 : \u211d)) := by\n  apply antitoneOn_of_deriv_nonpos (convex_Ici 3)\n  \u00b7 intro x hx\n    have hx0 : x \u2260 0 := by have h := (Set.mem_Ici.mp hx); linarith\n    exact ((Real.differentiableAt_log hx0).div (differentiableAt_pow 2)\n      (pow_ne_zero 2 hx0)).continuousAt.continuousWithinAt\n  \u00b7 intro x hx\n    have hx0 : x \u2260 0 := by\n      have h : (3 : \u211d) < x := Set.mem_Ioi.mp (by rwa [interior_Ici] at hx)\n      linarith\n    exact ((Real.differentiableAt_log hx0).div (differentiableAt_pow 2)\n      (pow_ne_zero 2 hx0)).differentiableWithinAt\n  \u00b7 intro x hx\n    have hx3 : (3 : \u211d) < x := Set.mem_Ioi.mp (by rwa [interior_Ici] at hx)\n    have hx0 : x \u2260 0 := by linarith\n    have hlog3 : (1 : \u211d) \u2264 Real.log 3 := by\n      have h := Real.log_le_log (Real.exp_pos 1)\n        (by linarith [Real.exp_one_lt_d9.le] : Real.exp 1 \u2264 3)\n      rwa [Real.log_exp] at h\n    have hlogx : (1 : \u211d) \u2264 Real.log x :=\n      hlog3.trans (Real.log_le_log (by positivity : (0 : \u211d) < 3) hx3.le)\n    have hderiv : deriv (fun y => Real.log y / y ^ 2) x\n        = (1 - 2 * Real.log x) / x ^ 3 := by\n      have h := (Real.hasDerivAt_log hx0).div (hasDerivAt_pow 2 x) (pow_ne_zero 2 hx0)\n      have h' : HasDerivAt (fun y => Real.log y / y ^ 2)\n          ((x\u207b\u00b9 * x ^ 2 - Real.log x * (\u21912 * x ^ (2 - 1))) / (x ^ 2) ^ 2) x := by\n        convert h using 1\n        ext y\n        rw [Pi.div_apply]\n      rw [h'.deriv]\n      field_simp\n      ring\n    rw [hderiv]\n    exact div_nonpos_of_nonpos_of_nonneg (by linarith [hlogx]) (by positivity)\n\n/-- Summability of the log-tail (integral test). -/\nlemma summable_log_div_sq_tail :\n    Summable (fun n : \u2115 => Real.log ((n : \u211d) + 4) / ((n : \u211d) + 4) ^ 2) := by\n  have h := AntitoneOn.summable_of_integrableOn_Ioi antitoneOn_log_div_sq\n    integrableOn_log_div_sq (fun t ht => by\n      have ht3 : (3 : \u211d) < t := ht\n      have hlog : (0 : \u211d) \u2264 Real.log t := Real.log_nonneg (by linarith)\n      positivity)\n  -- h : Summable (fun n : \u2115 \u21a6 (fun x => log x / x\u00b2) \u2191n); shift by 4\n  have h2 := (summable_nat_add_iff 4).mpr (f := fun n : \u2115 =>\n    Real.log (n : \u211d) / (n : \u211d) ^ 2) h\n  refine h2.congr fun n => ?_\n  push_cast\n  ring_nf\n\n/-- The tail bound: \u03a3_{n\u22654} log n/n\u00b2 \u2264 (log 3 + 1)/3 (integral test). -/\nlemma tsum_log_div_sq_tail_le :\n    \u2211' n : \u2115, Real.log ((n : \u211d) + 4) / ((n : \u211d) + 4) ^ 2 \u2264 (Real.log 3 + 1) / 3 := by\n  have hle := antitoneOn_log_div_sq.tsum_comp_add_le_integral 3\n    integrableOn_log_div_sq (fun t ht => by\n      have ht3 : (3 : \u211d) < t := ht\n      have hlog : (0 : \u211d) \u2264 Real.log t := Real.log_nonneg (by linarith)\n      positivity)\n  -- hle : \u2211' n, (fun x => log x/x\u00b2) \u2191(n + 3 + 1) \u2264 \u222b Ioi 3\n  rw [integral_log_div_sq_Ioi_three] at hle\n  refine hle.trans_eq' ?_\n  refine tsum_congr fun n => ?_\n  push_cast\n  ring_nf\n\n/-- **Piece 1** (D-069 \u00a73): dirichletC2 \u2264 1. The honest value is\n\u2212\u03b6\u2032/\u03b6(2) \u2248 0.56997; the bound here uses \u039b(n) \u2264 log n, the exact head\nn = 2, 3, and the integral-test tail (log 3 + 1)/3 \u2264 0.7. -/\ntheorem dirichletC2_le_one : dirichletC2 \u2264 1 := by\n  rw [dirichletC2]\n  have hsumm_g : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  -- the log majorant h n = if n = 0 then 0 else log n/n\u00b2, and its tsum split\n  set h : \u2115 \u2192 \u211d := fun n => if n = 0 then (0 : \u211d)\n    else Real.log n / (n : \u211d) ^ 2 with hh\n  have hle_pointwise : \u2200 n : \u2115,\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016\n        \u2264 h n := by\n    intro n\n    rw [dirichletTerm_norm_eq n, hh]\n    rcases eq_or_ne n 0 with rfl | hn\n    \u00b7 simp\n    \u00b7 rw [if_neg hn, if_neg hn]\n      exact div_le_div_of_nonneg_right ArithmeticFunction.vonMangoldt_le_log\n        (by positivity : (0 : \u211d) \u2264 (n : \u211d) ^ 2)\n  -- summability of h: the tail n + 4 is summable, and the head is finite\n  have hsumh : Summable h := by\n    have h1 : Summable (fun n : \u2115 => h (n + 4)) := by\n      apply summable_log_div_sq_tail.congr\n      intro n\n      rw [hh]\n      show (if (n + 4 : \u2115) = 0 then (0 : \u211d) else Real.log (n + 4) / ((n + 4 : \u2115) : \u211d) ^ 2)\n          = Real.log ((n : \u211d) + 4) / ((n : \u211d) + 4) ^ 2\n      rw [if_neg (by omega : (n + 4 : \u2115) \u2260 0)]\n      push_cast\n      ring_nf\n    exact (summable_nat_add_iff 4).mp h1\n  -- the head/tail split of the h-tsum\n  have hsplit : \u2211' n : \u2115, h n = (\u2211 n \u2208 Finset.range 4, h n) + \u2211' n : \u2115, h (n + 4) := by\n    exact (sum_add_tsum_nat_add 4 hsumh).symm\n  have hhead : \u2211 n \u2208 Finset.range 4, h n = Real.log 2 / 4 + Real.log 3 / 9 := by\n    rw [Finset.sum_range_succ, Finset.sum_range_succ, Finset.sum_range_succ,\n      Finset.sum_range_succ, Finset.sum_range_zero]\n    rw [hh]\n    simp only [Nat.zero_eq, if_pos, Nat.one_ne_zero, Nat.add_eq_zero_iff,\n      OfNat.ofNat_ne_zero, and_self, not_false_eq_true]\n    rw [show h 1 = (0 : \u211d) from by rw [hh]; simp]\n    rw [show h 2 = Real.log 2 / 4 from by\n      rw [hh]; rw [if_neg (by norm_num : (2 : \u2115) \u2260 0)]; push_cast; ring_nf]\n    rw [show h 3 = Real.log 3 / 9 from by\n      rw [hh]; rw [if_neg (by norm_num : (3 : \u2115) \u2260 0)]; push_cast; ring_nf]\n    ring\n  have htail : \u2211' n : \u2115, h (n + 4) \u2264 (Real.log 3 + 1) / 3 := by\n    have h1 : (\u2211' n : \u2115, h (n + 4))\n        = \u2211' n : \u2115, Real.log ((n : \u211d) + 4) / ((n : \u211d) + 4) ^ 2 := by\n      refine tsum_congr fun n => ?_\n      rw [hh]\n      show (if (n + 4 : \u2115) = 0 then (0 : \u211d) else Real.log (n + 4) / ((n + 4 : \u2115) : \u211d) ^ 2)\n          = Real.log ((n : \u211d) + 4) / ((n : \u211d) + 4) ^ 2\n      rw [if_neg (by omega : (n + 4 : \u2115) \u2260 0)]\n      push_cast\n      ring_nf\n    rw [h1]\n    exact tsum_log_div_sq_tail_le\n  -- assemble\n  have hmain : \u2211' n : \u2115,\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016\n        \u2264 Real.log 2 / 4 + Real.log 3 / 9 + (Real.log 3 + 1) / 3 := by\n    calc \u2211' n : \u2115,\n        \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016\n        \u2264 \u2211' n : \u2115, h n := Summable.tsum_le_tsum hle_pointwise hsumm_g hsumh\n      _ = (\u2211 n \u2208 Finset.range 4, h n) + \u2211' n : \u2115, h (n + 4) := hsplit\n      _ \u2264 (Real.log 2 / 4 + Real.log 3 / 9) + (Real.log 3 + 1) / 3 := by\n          linarith [hhead, htail]\n  -- the numeric fold: log 2 \u2264 0.6932, log 3 \u2264 1.1\n  have hlog2 : Real.log 2 \u2264 0.6932 := Real.log_two_lt_d9.le.trans (by norm_num)\n  have hlog3 : Real.log 3 \u2264 1.1 := by\n    have h3le : (3 : \u211d) \u2264 Real.exp 1.1 := by\n      have h := Real.sum_le_exp_of_nonneg (show (0 : \u211d) \u2264 1.1 by norm_num) 6\n      -- \u03a3_{k<6} 1.1^k/k! = 3.00126\u2026 \u2265 3\n      rw [Finset.sum_range_succ, Finset.sum_range_succ, Finset.sum_range_succ,\n        Finset.sum_range_succ, Finset.sum_range_succ, Finset.sum_range_succ,\n        Finset.sum_range_zero] at h\n      norm_num at h\n      linarith [h]\n    have h2 : Real.log 3 \u2264 Real.log (Real.exp 1.1) :=\n      Real.log_le_log (by norm_num : (0 : \u211d) < 3) h3le\n    rwa [Real.log_exp] at h2\n  have hlog2nn : (0 : \u211d) \u2264 Real.log 2 := Real.log_nonneg (by norm_num)\n  have hlog3nn : (0 : \u211d) \u2264 Real.log 3 := Real.log_nonneg (by norm_num)\n  linarith [hmain, hlog2, hlog3, hlog2nn, hlog3nn]\n\n/-! ## 7. Pieces 4/5: the reciprocal differences -/\n\n/-- **Pieces 4/5** (D-056 \u00a72): the elementary reciprocal differences,\neach \u2264 4.5/|t|\u00b2 \u2264 0.045 (|s\u2080 \u2212 s| = |2 \u2212 \u03c3| \u2264 4.5; \u2016s\u2016, \u2016s\u2080\u2016 \u2265 t). -/\ntheorem one_div_diff_le {t : \u211d} (ht : 10 \u2264 t) {s : \u2102}\n    (h\u03c3lo : -5 / 2 \u2264 s.re) (h\u03c3hi : s.re \u2264 3) (him : s.im = t) (hs0 : s \u2260 0) :\n    \u20161 / s - 1 / (2 + t * Complex.I)\u2016 \u2264 0.045 \u2227\n      \u20161 / (s - 1) - 1 / ((2 + t * Complex.I) - 1)\u2016 \u2264 0.045 := by\n  have ht0 : (0 : \u211d) < t := by linarith\n  -- the difference s\u2080 \u2212 s is the real (2 \u2212 s.re)\n  have hdiff : (2 + t * Complex.I) - s = ((2 - s.re : \u211d) : \u2102) := by\n    rw [Complex.ext_iff]\n    constructor\n    \u00b7 simp\n    \u00b7 simp [him]\n  have hsdiff : \u2016(2 + t * Complex.I) - s\u2016 = |2 - s.re| := by\n    rw [hdiff]\n    exact Complex.norm_real _\n  have hsdiffle : \u2016(2 + t * Complex.I) - s\u2016 \u2264 4.5 := by\n    rw [hsdiff, abs_le]\n    constructor <;> linarith\n  have hs_norm : (t : \u211d) \u2264 \u2016s\u2016 := by\n    have h := abs_im_le_norm s\n    rw [him, abs_of_nonneg ht0.le] at h\n    exact h\n  have hs0_norm : (t : \u211d) \u2264 \u20162 + t * Complex.I\u2016 := by\n    have h := abs_im_le_norm (2 + t * Complex.I)\n    rw [show (2 + t * Complex.I).im = t by simp, abs_of_nonneg ht0.le] at h\n    exact h\n  have hsm1_norm : (t : \u211d) \u2264 \u2016s - 1\u2016 := by\n    have h := abs_im_le_norm (s - 1)\n    rw [show (s - 1).im = t by simp [him], abs_of_nonneg ht0.le] at h\n    exact h\n  have hs0m1_norm : (t : \u211d) \u2264 \u2016(2 + t * Complex.I) - 1\u2016 := by\n    have h := abs_im_le_norm ((2 + t * Complex.I) - 1)\n    rw [show ((2 + t * Complex.I) - 1).im = t by simp, abs_of_nonneg ht0.le] at h\n    exact h\n  have hprods : (100 : \u211d) \u2264 \u2016s\u2016 * \u20162 + t * Complex.I\u2016 := by\n    have h1 := mul_le_mul hs_norm hs0_norm ht0.le (by positivity : (0 : \u211d) \u2264 \u2016s\u2016)\n    nlinarith [h1, ht]\n  have hprods1 : (100 : \u211d) \u2264 \u2016s - 1\u2016 * \u2016(2 + t * Complex.I) - 1\u2016 := by\n    have h1 := mul_le_mul hsm1_norm hs0m1_norm ht0.le (by positivity : (0 : \u211d) \u2264 \u2016s - 1\u2016)\n    nlinarith [h1, ht]\n  constructor\n  \u00b7 -- 1/s \u2212 1/s\u2080\n    have hs\u20800 : (2 + t * Complex.I) \u2260 0 := by\n      intro h\n      rw [h, norm_zero] at hs0_norm\n      linarith\n    rw [div_sub_div _ _ hs0 hs\u20800]\n    have hnum : 1 * (2 + t * Complex.I) - s * 1 = (2 + t * Complex.I) - s := by ring\n    rw [hnum, norm_div, norm_mul]\n    calc \u2016(2 + t * Complex.I) - s\u2016 / (\u2016s\u2016 * \u20162 + t * Complex.I\u2016)\n        \u2264 4.5 / (\u2016s\u2016 * \u20162 + t * Complex.I\u2016) :=\n          div_le_div_of_nonneg_right hsdiffle (by positivity)\n      _ \u2264 4.5 / 100 := div_le_div_of_nonneg_left (by norm_num) (by norm_num) hprods\n      _ = 0.045 := by norm_num\n  \u00b7 -- 1/(s\u22121) \u2212 1/(s\u2080\u22121)\n    have hs1 : s - 1 \u2260 0 := by\n      intro h\n      rw [h, norm_zero] at hsm1_norm\n      linarith\n    have hs\u20801 : (2 + t * Complex.I) - 1 \u2260 0 := by\n      intro h\n      rw [h, norm_zero] at hs0m1_norm\n      linarith\n    rw [div_sub_div _ _ hs1 hs\u20801]\n    have hnum : 1 * ((2 + t * Complex.I) - 1) - (s - 1) * 1\n        = (2 + t * Complex.I) - s := by ring\n    rw [hnum, norm_div, norm_mul]\n    calc \u2016(2 + t * Complex.I) - s\u2016 / (\u2016s - 1\u2016 * \u2016(2 + t * Complex.I) - 1\u2016)\n        \u2264 4.5 / (\u2016s - 1\u2016 * \u2016(2 + t * Complex.I) - 1\u2016) :=\n          div_le_div_of_nonneg_right hsdiffle (by positivity)\n      _ \u2264 4.5 / 100 := div_le_div_of_nonneg_left (by norm_num) (by norm_num) hprods1\n      _ = 0.045 := by norm_num\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 314,
      "oldLines": 8,
      "newStart": 314,
      "newLines": 8,
      "lines": [
        "       have hlog : (0 : \u211d) \u2264 Real.log t := Real.log_nonneg (by linarith)",
        "       positivity)",
        "   -- h : Summable (fun n : \u2115 \u21a6 (fun x => log x / x\u00b2) \u2191n); shift by 4",
        "-  have h2 := (summable_nat_add_iff 4).mpr (f := fun n : \u2115 =>",
        "-    Real.log (n : \u211d) / (n : \u211d) ^ 2) h",
        "+  have h2 := (summable_nat_add_iff (f := fun n : \u2115 =>",
        "+    Real.log (n : \u211d) / (n : \u211d) ^ 2) 4).mpr h",
        "   refine h2.congr fun n => ?_",
        "   push_cast",
        "   ring_nf"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-011-third-moment-analysis.md",
  "content": "# D-011 \u2014 Task 1.3: third moment tr G\u0303\u00b3 \u2014 what survives unconditionally?\nDate: 2026-08-17 | Session: 001 | Task: 1.3 | Status: analysis complete; decisive numerics (E-005) designed\nSources: D-004 (prime-side machinery), D-005 (chain), D-006 (\u00a77.2 walls),\nD-010 (T1 moments). Tags: [VERIFIED] derivations / [ANALYSIS] conclusions.\n\n---\n\n## 1. Reduction of tr G\u0303\u00b3 to a triple zero correlation\nG\u0303 = (aL\u00b2)\u207b\u00b9 \u03a3_\u03c1 m_\u03c1 v_\u03c1v_\u03c1\u1d40 \u27f9\n  tr G\u0303\u00b3 = (aL\u00b2)\u207b\u00b3 \u03a3_{\u03c1\u2081,\u03c1\u2082,\u03c1\u2083} m\u2081m\u2082m\u2083 (v\u2081\u00b7v\u2082)(v\u2082\u00b7v\u2083)(v\u2083\u00b7v\u2081).\nBy Lemma 2.1, v_\u03c1\u00b7v_\u03c1' = L\u03a6(\u03b3_\u03c1 \u2212 \u03b3_\u03c1') + edge, \u03a6 = \u03d5\u00b2\u0302:\n  tr G\u0303\u00b3 \u2248 (a\u00b2L\u00b3)\u207b\u00b9 \u03a3_{\u03c1\u2081,\u03c1\u2082,\u03c1\u2083} m\u2081m\u2082m\u2083 \u03a6(\u03b3\u2081\u2212\u03b3\u2082)\u03a6(\u03b3\u2082\u2212\u03b3\u2083)\u03a6(\u03b3\u2083\u2212\u03b3\u2081).\n[VERIFIED algebra] \u2014 a triple zero-correlation with band-limited kernel.\n\n## 2. Prime-side cost (why k=3 is different from k=2)\nFourier-expand each \u03a6(\u03b3\u1d62\u2212\u03b3\u2c7c) = \u222b\u03d5\u00b2(u)e^{\u2212iu(\u03b3\u1d62\u2212\u03b3\u2c7c)}du (supp \u03d5\u00b2 \u2282 [\u2212L/2,L/2]):\nthe triple sum factorizes into integrals of products of THREE single-zero\nsums \u03a3_\u03c1 e^{\u2212i\u03b3t}, each |t| \u2264 L. Via the explicit formula each becomes a\nprime sum P_X(t); the diagonal method must then evaluate shift-correlations\n\u222b P_X(\u03c4)P_X(\u03c4+x)P_X(\u03c4+y)d\u03c4.\n- Diagonal: multiplicative relations n\u2081n\u2082 = n\u2083 (sign pattern ++\u2212) \u2014\n  EVALUABLE (von Mangoldt convolution identities, \u039b\u2217\u039b etc.).\n- Off-diagonal: frequencies log(n\u2081n\u2082) for n\u2081n\u2082 \u2264 X\u00b2 \u2014 about X\u00b2 log X\n  distinct frequencies; Montgomery\u2013Vaughan separation \u03b4\u207b\u00b9 ~ X\u00b2; the MV\n  bound on the off-diagonal costs a factor X\u00b2/T against the main term.\n  \u27f9 NEEDS X\u00b2 \u2272 T, i.e. X\u00b3 \u2272 T^{3/2}... the Rudnick\u2013Sarnak condition is\n  X\u1d4f \u2264 T^{2\u2212\u03b5}: for k=3, **X \u2264 T^{2/3\u2212\u03b5}** [RS96]. At X = T/2\u03c0: FAILS.\n  (k=2: X\u00b2 = T\u00b2/(2\u03c0)\u00b2 \u2264 T^{2\u2212\u03b5} \u2714 \u2014 the 1/(2\u03c0)\u00b2 margin is why Thm 5.7\n  works at full bandwidth. Verified consistent with D-004.)\n\n## 3. The bandwidth\u2013moment tradeoff (the naive wall)\nWork at reduced bandwidth: L\u2032 = \u03bb\u2113, X = (T/2\u03c0)^\u03bb (Remark 6.1). Then:\n- tr G\u0303\u00b3 available unconditionally \u27fa X\u00b3 \u2264 T^{2\u2212\u03b5} \u27fa **\u03bb \u2264 2/3** \u2212 o(1).\n- Grid is critical-density for the window: h\u2032 = 2\u03c0/L\u2032, so\n  d = TL\u2032/2\u03c0 = \u03bb\u00b7(T\u2113/2\u03c0) = (\u03bb + o(1))N.\n- The certificate satisfies N^s_0 + o(N) \u2265 rank P\u2081 with rank P\u2081 \u2264 d:\n  **any certificate \u2264 \u03bb + o(1)**.\n\u27f9 third moment usable only at \u03bb \u2264 2/3, where the dimension cap is 2/3.\nThe moment becomes available EXACTLY where it stops helping: the RS wall\nfor this method is the coincidence \u03bb_RS(k=3) = 2/3 = current certificate.\n[This is the precise mechanistic form of the paper's \"higher moments add\nnothing\" \u2014 sharper: they add nothing BECAUSE availability and usefulness\nthresholds coincide at 2/3.]\n\n## 4. The oversampling escape hatch (OPEN \u2014 needs numerics)\nThe naive wall assumes the critical-density grid h = 2\u03c0/L\u2032. But Lemma\n2.1's no-aliasing only needs supp(\u03d5\u2217\u03d5) \u2282 (\u22122\u03c0/h, 2\u03c0/h): an OVERSAMPLED\ngrid h = 2\u03c0/(qL\u2032), q \u2265 1, keeps the Poisson\u2013Gabor identity EXACT\n(m \u2260 0 terms evaluate H at multiples of qL\u2032 outside supp H = [\u2212L\u2032,L\u2032]).\n[VERIFIED against Lemma 2.1's proof \u2014 H support argument.]\nWith q > 1: d = q\u03bbN and the d-cap moves to q\u03bb \u2014 at q = 2, \u03bb = 2/3:\nd = 4N/3 > N, cap gone. THE NAIVE WALL HAS A HOLE.\nBut: G\u0303 = V\u1d40V with V having N(I\u2032) rows \u27f9 rank G\u0303 \u2264 N(I\u2032) regardless of d;\noversampling pads the spectrum with correlated/near-zero directions.\nOpen questions (decisive for task 1.3):\n  Q1. Does the oversampled (q=2) Gram matrix carry MORE usable positive\n      index than the critical one, or is the extra rank spectrally empty?\n  Q2. With 3 moments at \u03bb = 2/3, q = 2: does the CMS/Christoffel bound\n      for n\u208a(G\u0303)/d \u00d7 (d/N) exceed 2/3?\n  Q3. What does the renormalized trace bookkeeping do to the certificate\n      constants (tr scales by q; certificate must be q-invariant to be\n      meaningful \u2014 check).\nThese are EXACTLY numerically decidable on the sine process (the method's\nown model): compute m\u2081,m\u2082,m\u2083(\u03bb,q) for the \u03bb-bandwidth, q-oversampled\nsinc-Gram, run the 3-moment one-sided (Markov) bound, scan \u03bb \u2208 [1/2,1],\nq \u2208 {1,2}. \u2192 E-005 (next sub-stage).\nNOTE: E-005 decides the METHOD-level question (what the data class can\ncertify). If E-005 shows > 2/3 is achievable at \u03bb \u2264 2/3, q = 2, the\nremaining analytic work is making tr G\u0303\u00b3 rigorous at that \u03bb (RS-range,\nso plausible) \u2014 a genuine theorem path. If E-005 shows \u2264 2/3 everywhere:\nG-002 with the exact obstruction.\n\n## 5. Sanity-gate preview (adversarial)\nThe sine-process model CANNOT see the D\u2013H/Epstein obstruction (it models\nzeta's actual statistics). A positive E-005 result would still require\nthe full prime-side evaluation \u2014 the model only falsifies or motivates.\nAlso note: at \u03bb < 1 the certificate's prime side changes (R_\u03bb), so the\ncomparison must use the \u03bb-dependent 2-moment baseline\nR_\u03bb(\u03c8\u2080) = 1/\u03bb + \u03bb/3 (Remark 6.1, D-004 \u00a79) \u2014 built into E-005 design.\n\n## 6. Status\nTask 1.3 analysis COMPLETE: the wall is precisely located (\u03bb_RS = 2/3\ncoincidence), and a concrete escape hatch (oversampled frames at reduced\nbandwidth) is formulated with decidable questions. E-005 next.\n"
}

File created successfully at: D:\Python\Quantum\research\derivations\D-011-third-moment-analysis.md

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\index.md",
  "old_string": "| D-010 | Thread T1: sine moments m_k(1) + Christoffel \u039b\u2082(0) reproduced | 1.3 warm-up | complete | 2026-08-17 |",
  "new_string": "| D-010 | Thread T1: sine moments m_k(1) + Christoffel \u039b\u2082(0) reproduced | 1.3 warm-up | complete | 2026-08-17 |\n| D-011 | Task 1.3: third-moment analysis; RS wall at \u03bb=2/3 + oversampling hatch | 1.3 | analysis complete | 2026-08-17 |"
}

{
  "filePath": "D:\\Python\\quantum-deploy\\docroot\\app.cgi",
  "oldString": "from rhweb.wsgi import application\n\n\nfrom urllib.parse import unquote_to_bytes",
  "newString": "from rhweb.wsgi import application\n\n_dbg(\"AFTER-IMPORT PATH_INFO=\" + repr(os.environ.get(\"PATH_INFO\")))\n\nfrom urllib.parse import unquote_to_bytes",
  "originalFile": "#!/opt/alt/python311/bin/python3.11\n\"\"\"WSGI->CGI adapter \u2014 runs the RH-WEBSITE Django app on Apache shared hosting.\n\nApache rewrites every non-file request to /app.cgi/<path> (see .htaccess).\nwsgiref's CGIHandler bridges the CGI environment onto Django's WSGI app.\n\"\"\"\nimport os\nimport sys\n\nDOCROOT = os.path.dirname(os.path.abspath(__file__))\nAPP = os.path.join(DOCROOT, \"app\")\n\n\ndef _dbg(msg):\n    if \"resources\" in (os.environ.get(\"PATH_INFO\") or \"\"):\n        with open(os.path.join(APP, \"debug-environ.txt\"), \"a\",\n                  encoding=\"utf-8\") as fh:\n        fh.write(msg + \"\\n\")\n\n\n_dbg(\"TOP fsenc=\" + sys.getfilesystemencoding()\n     + \" PATH_INFO=\" + repr(os.environ.get(\"PATH_INFO\")))\n\n# Vendored pure-Python deps (Django 5.2, markdown) + the project package.\nsys.path.insert(0, os.path.join(APP, \"vendor\"))\nsys.path.insert(0, os.path.join(APP, \"web\"))\n\nos.environ.setdefault(\"DJANGO_SETTINGS_MODULE\", \"rhweb.settings\")\n# Apache mounts us at /app.cgi/<path>; present clean root URLs to Django.\nos.environ[\"SCRIPT_NAME\"] = \"\"\n\nfrom wsgiref.handlers import CGIHandler\n\nfrom rhweb.wsgi import application\n\n\nfrom urllib.parse import unquote_to_bytes\n\n\ndef _pep3333_paths(environ, start_response):\n    \"\"\"Normalize Apache's path vars to the PEP 3333 form Django needs.\n\n    Apache hands these vars either percent-encoded (mod_rewrite path)\n    or UTF-8-decoded (direct CGI path). Django (a) crashes with\n    UnicodeEncodeError on any non-latin-1 char (500) and (b) needs the\n    decoded path for URL resolution (else the resolver sees %XX and 404s).\n    So: bytes -> unquote -> re-mangle as latin-1. SCRIPT_URL/REDIRECT_URL\n    (set by mod_rewrite) are consulted by get_script_name BEFORE\n    PATH_INFO \u2014 all three must be normalized.\"\"\"\n    for key in (\"PATH_INFO\", \"SCRIPT_URL\", \"REDIRECT_URL\"):\n        v = environ.get(key)\n        if v:\n            raw = unquote_to_bytes(v)  # %XX-decodes; utf-8-encodes str first\n            environ[key] = raw.decode(\"latin-1\")\n    if \"resources\" in (environ.get(\"PATH_INFO\") or \"\"):\n        with open(os.path.join(APP, \"debug-environ.txt\"), \"a\",\n                  encoding=\"utf-8\") as fh:\n            fh.write(repr({k: environ.get(k) for k in\n                           (\"PATH_INFO\", \"SCRIPT_NAME\", \"SCRIPT_URL\",\n                            \"REDIRECT_URL\", \"REQUEST_METHOD\", \"HTTP_HOST\")})\n                     + \"\\n\")\n            try:\n                from django.core.handlers.wsgi import WSGIRequest\n                req = WSGIRequest(dict(environ))\n                fh.write(\"path_info=\" + repr(req.path_info) + \"\\n\")\n                from django.urls import resolve\n                m = resolve(req.path_info)\n                fh.write(\"match=\" + repr(m.kwargs) + \"\\n\")\n            except Exception as e:  # noqa: BLE001\n                fh.write(\"ERR \" + repr(e) + \"\\n\")\n            try:\n                raw = open(\"/proc/self/environ\", \"rb\").read()\n                for entry in raw.split(b\"\\x00\"):\n                    if entry.startswith((b\"PATH_INFO=\", b\"SCRIPT_URL=\")):\n                        fh.write(\"ENVBYTES \" + repr(entry) + \"\\n\")\n            except Exception as e:  # noqa: BLE001\n                fh.write(\"ENVBYTES ERR \" + repr(e) + \"\\n\")\n    return application(environ, start_response)\n\n\nCGIHandler().run(_pep3333_paths)\n",
  "structuredPatch": [
    {
      "oldStart": 33,
      "oldLines": 6,
      "newStart": 33,
      "newLines": 7,
      "lines": [
        " ",
        " from rhweb.wsgi import application",
        " ",
        "+_dbg(\"AFTER-IMPORT PATH_INFO=\" + repr(os.environ.get(\"PATH_INFO\")))",
        " ",
        " from urllib.parse import unquote_to_bytes",
        " "
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\STATE.md",
  "old_string": "## NEXT ACTION\nTask 1.3 proper: quantify exactly what the diagonal method gives for\ntr G\u0303\u00b3 at X \u224d T and where it fails (D-010 \u00a76 sets the question; D-004 \u00a75\nhas the k=2 machinery). Then 1.4 and 1.2 (SDP tooling).\nDONE Phase 1: 1.1 \u2192 D-009 (T3 closed); T1 warm-up \u2192 D-010 + E-004\n(moments 1,4/3,2,13/4 confirmed by Monte Carlo; \u039b\u2082(0)=5/36 verified by\nhand; limiting density = near-uniform perturbation on [0,2]; paper\n\"+O(L)\" erratum noted).\nGRAVEYARD: G-001 (Idea C, s\u2082/p substitution symmetry).",
  "new_string": "## NEXT ACTION\nRun E-005 (designed in D-011 \u00a74): sine-process moments m\u2081,m\u2082,m\u2083(\u03bb,q) for\n\u03bb-bandwidth q-oversampled sinc-Gram matrices; 3-moment Markov bound;\nscan \u03bb \u2208 [1/2,1], q \u2208 {1,2}. DECIDES: any configuration beating 2/3 with\nan unconditional third moment (\u03bb \u2264 2/3)? Yes \u2192 theorem path (make tr G\u0303\u00b3\nrigorous at that \u03bb). No \u2192 G-002 with exact obstruction.\nDONE Phase 1: 1.1 \u2192 D-009 (T3 closed); T1 \u2192 D-010+E-004; 1.3 analysis \u2192\nD-011 (RS wall located exactly: \u03bb_availability = 2/3 = certificate cap;\noversampling hatch found, needs E-005).\nGRAVEYARD: G-001 (Idea C, s\u2082/p substitution symmetry)."
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiSkeleton.lean",
  "oldString": "  simp only [marginTilde, marginExpanded, mFblock, mTL1b, mTL2b, mIdb, mL1sqb,\n    mL1L2b, mL2sqb, mL1b, mL2b, mIIM, mK, Hhat, C0hat]\n  ring",
  "newString": "  simp only [marginTilde, marginExpanded, mFblock, mTL1b, mTL2b, mIdb, mL1sqb,\n    mL1L2b, mL2sqb, mL1b, mL2b, mIIM, mK, Hhat, C0hat, Z2hat]\n  ring",
  "originalFile": "/-\nNguyenRH1/LiSkeleton.lean \u2014 formalization of paper draft.tex \u00a73.1\n(R-004 finite-height Li theorem + archimedean lower bound + margin\nconvexity mechanism).\n\nConventions follow zeta-23-lean's hypothesis-driven style (cf. Zeta23.Final):\nthe computational inputs (Platt\u2013Trudgian RH-to-height; finite Li\nverification) are named Prop hypotheses, exactly as Zeta23 treats hEF/hRvM.\n\nStatus (session 012): TIER (i) COMPLETE (session 011: sInfty_lower_bound,\nmarginTilde_convex, chain_rule_sqrt_shift). TIER (ii) STEP 1 COMPLETE\n(session 012): `lambda_pos_finite_height` is PROVED modulo its named\nhypotheses \u2014 the assembly is conditional only on `SfBoundProp` (the\nisolated analytic obligation, triaged in D-062), the computational\nperimeter (`RHUpTo`, `LiVerifiedUpTo`), and two elementary margin\nevaluations (hbase/hbase2, E-028/E-029 values; their interval-bound\ndischarge is tier (ii) step 2). No `sorry` remains in this file;\n`#print axioms` shows only the three standard axioms for every\ndeclaration here.\n\nArchive references: R-004, D-037, D-056, D-057, D-062, E-023, E-028, E-029.\n-/\nimport Mathlib\nimport Zeta23.Statement\nimport Zeta23.WeilEF.ZeroSummability\nimport Zeta23.Statement.SeamClosed\n\nopen Zeta23 Complex Filter Topology\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. The Keiper\u2013Li coefficients -/\n\n/-- The paired (symmetrized) Li summand: \u00bd\u00b7mult\u00b7(f \u03c1 + f \u03c1\u0304),\nf \u03c1 = 1 \u2212 (1\u22121/\u03c1)\u207f. Manifestly real-valued (`liSummand_eq`), absolutely\nsummable (`liSummable`) \u2014 the correct Keiper\u2013Li summand.\n(Session-015 ii\u2032-1a, D-064 \u00a71: the plain unordered sum of f over the\nzeros is NOT absolutely summable for any n \u2265 1 \u2014 the summand is\n~ n/|\u03b3| for large |\u03b3| and \u03a3 mult/|\u03c1| = \u221e \u2014 so the previous direct\ndefinition evaluated to the junk value 0 and `LiVerifiedUpTo`/\n`SfBoundProp` were FALSE as encoded. The pairing is the classical\nBombieri\u2013Lagarias symmetric convention and restores the intended\nmeaning; summability is proved below.) -/\ndef liSummand (n : \u2115) (\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}) : \u2102 :=\n  (zeroMult \u03c1 : \u2102) / 2 *\n    ((1 - (1 - 1 / (\u03c1 : \u2102)) ^ n) + (1 - (1 - 1 / ((starRingEnd \u2102) (\u03c1 : \u2102))) ^ n))\n\nlemma summand_conj (n : \u2115) (z : \u2102) :\n    (1 : \u2102) - (1 - 1 / ((starRingEnd \u2102) z)) ^ n = (starRingEnd \u2102) ((1 - (1 - 1 / z) ^ n)) := by\n  rw [map_sub, map_one, map_pow, map_sub, map_one, map_div\u2080, map_one]\n\nlemma liSummand_eq (n : \u2115) (\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}) :\n    liSummand n \u03c1 = (zeroMult \u03c1 : \u2102) * (((1 - (1 - 1 / (\u03c1 : \u2102)) ^ n).re) : \u2102) := by\n  rw [liSummand, summand_conj, Complex.add_conj]\n  push_cast\n  ring\n\n/-- The Keiper\u2013Li coefficient \u03bb_n as the paired zero-side sum with\nmultiplicity (draft \u00a73.1; Zeta23's IsNontrivialZero/zeroMult\nconventions; D-064 \u00a71). Summability: `liSummable`. -/\ndef liCoeff (n : \u2115) : \u2102 := \u2211' \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}, liSummand n \u03c1\n\n/-! ### 1a. The geometric-sum estimate: |Re(1 \u2212 w\u207f)| \u2264 2n\u00b2/\u2016z\u2016\u00b2 (w = 1\u22121/z) -/\n\n/-- (1 + 1/(2n))\u207f \u2264 2 for n \u2265 1. Via (1+x)\u207f \u2264 exp(nx) and exp(1/2) \u2264 2. -/\nlemma pow_one_add_inv_two_mul_le (n : \u2115) (hn : 1 \u2264 n) :\n    ((1 : \u211d) + 1 / (2 * n)) ^ n \u2264 2 := by\n  have hn0 : (0 : \u211d) < n := by exact_mod_cast hn\n  have hbase : (1 : \u211d) + 1 / (2 * n) \u2264 Real.exp (1 / (2 * n)) := by\n    have h := Real.add_one_le_exp (1 / (2 * (n : \u211d)))\n    linarith\n  have h1 : ((1 : \u211d) + 1 / (2 * n)) ^ n \u2264 Real.exp (1 / 2) := by\n    calc ((1 : \u211d) + 1 / (2 * n)) ^ n\n        \u2264 (Real.exp (1 / (2 * n))) ^ n := pow_le_pow_left\u2080 (by positivity) hbase n\n      _ = Real.exp (\u2191n * (1 / (2 * n))) := by rw [Real.exp_nat_mul]\n      _ = Real.exp (1 / 2) := by congr 1; field_simp\n  have h2 : Real.exp (1 / 2 : \u211d) \u2264 2 := by\n    have h3 : (1 : \u211d) / 2 \u2264 Real.log 2 := by\n      have h := Real.log_two_gt_d9\n      linarith\n    calc Real.exp (1 / 2 : \u211d) \u2264 Real.exp (Real.log 2) := Real.exp_le_exp.mpr h3\n      _ = 2 := Real.exp_log (by norm_num)\n  exact h1.trans h2\n\n/-- Key estimate: for n \u2265 1, z with re z \u2208 [0,1], 2n \u2264 \u2016z\u2016:\n|Re(1 \u2212 (1\u22121/z)\u207f)| \u2264 2n\u00b2/\u2016z\u2016\u00b2. -/\nlemma re_li_summand_le {n : \u2115} (hn : 1 \u2264 n) {z : \u2102}\n    (hzre0 : 0 \u2264 z.re) (hzre1 : z.re \u2264 1) (hz : 2 * n \u2264 \u2016z\u2016) :\n    |(1 - (1 - 1 / z) ^ n).re| \u2264 2 * n ^ 2 / \u2016z\u2016 ^ 2 := by\n  have hn0 : (0 : \u211d) < n := by exact_mod_cast hn\n  have hz0 : z \u2260 0 := by\n    intro h; rw [h, norm_zero] at hz; linarith\n  have hzn : (0 : \u211d) < \u2016z\u2016 := norm_pos_iff.mpr hz0\n  have hnsq : Complex.normSq z = \u2016z\u2016 ^ 2 := Complex.normSq_eq_norm_sq z\n  set M : \u211d := 1 + 1 / (2 * (n : \u211d)) with hM\n  have hM0 : (0 : \u211d) \u2264 1 / (2 * (n : \u211d)) := by positivity\n  have hM1 : (1 : \u211d) \u2264 M := le_add_of_nonneg_right hM0\n  set w : \u2102 := 1 - 1 / z with hw\n  have hgeom : (w - 1) * \u2211 j \u2208 Finset.range n, w ^ j = w ^ n - 1 := mul_geom_sum w n\n  have hw1 : w - 1 = -(1 / z) := by rw [hw]; ring\n  have hf : (1 : \u2102) - w ^ n = (1 / z) * \u2211 j \u2208 Finset.range n, w ^ j := by\n    have e : (1 : \u2102) - w ^ n = -(w ^ n - 1) := by ring\n    rw [e, \u2190 hgeom, hw1]; ring\n  set S : \u2102 := \u2211 j \u2208 Finset.range n, w ^ j\n  have hwnorm : \u2016w\u2016 \u2264 1 + 1 / \u2016z\u2016 := by\n    have e : w = 1 - z\u207b\u00b9 := by rw [hw, div_eq_mul_inv, one_mul]\n    rw [e]\n    calc \u2016(1 : \u2102) - z\u207b\u00b9\u2016 \u2264 \u2016(1 : \u2102)\u2016 + \u2016z\u207b\u00b9\u2016 := norm_sub_le _ _\n      _ = 1 + 1 / \u2016z\u2016 := by rw [norm_one, norm_inv, inv_eq_one_div]\n  have h1z : 1 / \u2016z\u2016 \u2264 1 / (2 * n) :=\n    one_div_le_one_div_of_le (by positivity) (by exact_mod_cast hz)\n  have hwmax : max 1 \u2016w\u2016 \u2264 M := by\n    apply max_le hM1\n    exact hwnorm.trans (by rw [hM]; linarith)\n  have hSn : \u2016S - n\u2016 \u2264 n ^ 2 / \u2016z\u2016 := by\n    have hSn1 : S - n = \u2211 j \u2208 Finset.range n, (w ^ j - 1) := by\n      have e : (n : \u2102) = \u2211 j \u2208 Finset.range n, (1 : \u2102) := by\n        simp [Finset.sum_const, Finset.card_range]\n      rw [e, \u2190 Finset.sum_sub_distrib]\n    rw [hSn1]\n    have hbound : \u2200 j \u2208 Finset.range n,\n        \u2016w ^ j - 1\u2016 \u2264 (1 / \u2016z\u2016) * (j * M ^ (n - 1)) := by\n      intro j hj\n      have hgeomj : (w - 1) * \u2211 i \u2208 Finset.range j, w ^ i = w ^ j - 1 := mul_geom_sum w j\n      have h2 : w ^ j - 1 = -(1 / z) * \u2211 i \u2208 Finset.range j, w ^ i := by\n        rw [\u2190 hgeomj, hw1]\n      rw [h2, norm_mul, norm_neg, norm_div, norm_one]\n      have hsum : \u2016\u2211 i \u2208 Finset.range j, w ^ i\u2016 \u2264 j * M ^ (n - 1) := by\n        calc \u2016\u2211 i \u2208 Finset.range j, w ^ i\u2016\n            \u2264 \u2211 i \u2208 Finset.range j, \u2016w ^ i\u2016 := norm_sum_le _ _\n          _ \u2264 \u2211 i \u2208 Finset.range j, M ^ (n - 1) := by\n              apply Finset.sum_le_sum\n              intro i hi\n              rw [norm_pow]\n              have hij : i < j := Finset.mem_range.mp hi\n              have hjn : j \u2264 n := le_of_lt (Finset.mem_range.mp hj)\n              have h1 : \u2016w\u2016 ^ i \u2264 M ^ i :=\n                pow_le_pow_left\u2080 (norm_nonneg _)\n                  (le_trans (le_max_right 1 \u2016w\u2016) hwmax) i\n              have h2 : M ^ i \u2264 M ^ (n - 1) := pow_le_pow_right\u2080 hM1 (by omega)\n              exact h1.trans h2\n          _ = j * M ^ (n - 1) := by\n              rw [Finset.sum_const, Finset.card_range, nsmul_eq_mul]\n      exact mul_le_mul_of_nonneg_left hsum (by positivity)\n    calc \u2016\u2211 j \u2208 Finset.range n, (w ^ j - 1)\u2016\n        \u2264 \u2211 j \u2208 Finset.range n, \u2016w ^ j - 1\u2016 := norm_sum_le _ _\n      _ \u2264 \u2211 j \u2208 Finset.range n, (1 / \u2016z\u2016) * (j * M ^ (n - 1)) :=\n          Finset.sum_le_sum hbound\n      _ = ((1 / \u2016z\u2016) * M ^ (n - 1)) * \u2211 j \u2208 Finset.range n, (j : \u211d) := by\n          symm\n          rw [Finset.mul_sum]\n          apply Finset.sum_congr rfl\n          intro j _; ring\n      _ \u2264 n ^ 2 / \u2016z\u2016 := by\n          have hsumj : (\u2211 j \u2208 Finset.range n, (j : \u211d)) = (n : \u211d) * ((n : \u211d) - 1) / 2 := by\n            have h6 := congrArg (Nat.cast : \u2115 \u2192 \u211d) (Finset.sum_range_id_mul_two n)\n            simp only [Nat.cast_mul, Nat.cast_sub hn, Nat.cast_ofNat, Nat.cast_one] at h6\n            have h7 : (\u2211 j \u2208 Finset.range n, (j : \u211d)) =\n                ((\u2211 j \u2208 Finset.range n, j : \u2115) : \u211d) := (Nat.cast_sum _ _).symm\n            rw [h7]\n            linarith\n          rw [hsumj]\n          have hpow : M ^ (n - 1) \u2264 2 :=\n            le_trans (pow_le_pow_right\u2080 hM1 (Nat.sub_le n 1))\n              (pow_one_add_inv_two_mul_le n hn)\n          have hb1 : (n : \u211d) * (n - 1) / 2 \u2264 n ^ 2 / 2 := by nlinarith [hn0]\n          have hb2 : M ^ (n - 1) * (n * (n - 1) / 2) \u2264 2 * (n ^ 2 / 2) :=\n            mul_le_mul_of_nonneg hpow hb1 (by positivity) (by positivity)\n          have hb3 : ((1 : \u211d) / \u2016z\u2016) * (M ^ (n - 1) * (n * (n - 1) / 2))\n              \u2264 (1 / \u2016z\u2016) * (2 * (n ^ 2 / 2)) :=\n            mul_le_mul_of_nonneg_left hb2 (by positivity)\n          calc (1 / \u2016z\u2016) * M ^ (n - 1) * (\u2191n * (\u2191n - 1) / 2)\n              = (1 / \u2016z\u2016) * (M ^ (n - 1) * (\u2191n * (\u2191n - 1) / 2)) := by ring\n            _ \u2264 (1 / \u2016z\u2016) * (2 * (\u2191n ^ 2 / 2)) := hb3\n            _ = \u2191n ^ 2 / \u2016z\u2016 := by ring\n  have hre1 : ((n : \u2102) * (1 / z)).re = n * z.re / \u2016z\u2016 ^ 2 := by\n    have hinv : ((1 : \u2102) / z).re = z.re / \u2016z\u2016 ^ 2 := by\n      rw [one_div, Complex.inv_re, hnsq]\n    have e : ((n : \u2102) * (1 / z)).re = n * ((1 : \u2102) / z).re := by\n      rw [Complex.mul_re]\n      simp\n    rw [e, hinv]\n    ring\n  have hfre : (1 - w ^ n).re = n * z.re / \u2016z\u2016 ^ 2 + ((S - n) / z).re := by\n    have hd : (1 / z) * ((n : \u2102) + (S - n)) = (n : \u2102) * (1 / z) + (S - n) / z := by\n      ring\n    rw [hf]\n    nth_rewrite 1 [show S = (n : \u2102) + (S - n) from by ring]\n    rw [hd, Complex.add_re, hre1]\n  rw [hfre]\n  have hA : |n * z.re / \u2016z\u2016 ^ 2| \u2264 n / \u2016z\u2016 ^ 2 := by\n    have e : |n * z.re / \u2016z\u2016 ^ 2| = n * |z.re| / \u2016z\u2016 ^ 2 := by\n      rw [abs_div, abs_mul, abs_of_nonneg hn0.le,\n        abs_of_nonneg (sq_nonneg \u2016z\u2016)]\n    rw [e, div_le_iff\u2080 (by positivity)]\n    have e2 : (n / \u2016z\u2016 ^ 2) * \u2016z\u2016 ^ 2 = n := by field_simp\n    rw [e2]\n    calc n * |z.re| \u2264 n * 1 :=\n          mul_le_mul_of_nonneg_left (abs_le.mpr \u27e8by linarith, hzre1\u27e9) hn0.le\n      _ = n := mul_one _\n  have hB : |((S - n) / z).re| \u2264 n ^ 2 / \u2016z\u2016 ^ 2 := by\n    have h1 : |((S - n) / z).re| \u2264 \u2016(S - n) / z\u2016 := Complex.abs_re_le_norm _\n    have h2 : \u2016(S - n) / z\u2016 \u2264 (n ^ 2 / \u2016z\u2016) / \u2016z\u2016 := by\n      rw [norm_div, div_le_iff\u2080 hzn]\n      have e : ((n ^ 2 / \u2016z\u2016) / \u2016z\u2016) * \u2016z\u2016 = n ^ 2 / \u2016z\u2016 := by field_simp\n      rw [e]\n      exact hSn\n    exact h1.trans (h2.trans (by rw [div_div, \u2190 pow_two]))\n  have hnn : (n : \u211d) \u2264 n ^ 2 := by\n    have h : (1 : \u211d) \u2264 n := by exact_mod_cast hn\n    nlinarith\n  calc |n * z.re / \u2016z\u2016 ^ 2 + ((S - n) / z).re|\n      \u2264 n / \u2016z\u2016 ^ 2 + n ^ 2 / \u2016z\u2016 ^ 2 := (abs_add_le _ _).trans (add_le_add hA hB)\n    _ = (n + n ^ 2) / \u2016z\u2016 ^ 2 := by ring\n    _ \u2264 2 * n ^ 2 / \u2016z\u2016 ^ 2 := by\n        rw [div_le_iff\u2080 (by positivity)]\n        have e : (2 * n ^ 2 / \u2016z\u2016 ^ 2) * \u2016z\u2016 ^ 2 = 2 * n ^ 2 := by field_simp\n        rw [e]\n        linarith\n\n/-! ### 1b. The comparison 1 + \u2016\u03b3_\u03c1\u2016\u00b2 \u2264 (9/4)\u2016\u03c1\u2016\u00b2 and summability -/\n\n/-- For re z \u2208 [0,1] and 2n \u2264 \u2016z\u2016 (n \u2265 1): 1 + \u2016\u03b3_z\u2016\u00b2 \u2264 (9/4)\u00b7\u2016z\u2016\u00b2. -/\nlemma normSq_gammaOf_le_mul_norm_sq {n : \u2115} (hn : 1 \u2264 n) {z : \u2102}\n    (hzre0 : 0 \u2264 z.re) (hzre1 : z.re \u2264 1) (hz : 2 * n \u2264 \u2016z\u2016) :\n    1 + Complex.normSq (gammaOf z) \u2264 9 / 4 * \u2016z\u2016 ^ 2 := by\n  have hn0 : (0 : \u211d) < n := by exact_mod_cast hn\n  have hz2 : \u2016z\u2016 ^ 2 = z.re ^ 2 + z.im ^ 2 := by\n    rw [\u2190 Complex.normSq_eq_norm_sq, Complex.normSq_apply]\n    ring\n  have hz4 : 4 * n ^ 2 \u2264 \u2016z\u2016 ^ 2 := by\n    have h := pow_le_pow_left\u2080 (by positivity : (0:\u211d) \u2264 2 * n) hz 2\n    nlinarith [h]\n  have hre2 : z.re ^ 2 \u2264 1 := by nlinarith [hzre0, hzre1]\n  have hn1 : (1 : \u211d) \u2264 n := by exact_mod_cast hn\n  have hn4 : (4 : \u211d) \u2264 4 * (n : \u211d) ^ 2 := by\n    have h := pow_le_pow_left\u2080 (show (0 : \u211d) \u2264 1 by norm_num) hn1 2\n    nlinarith [h]\n  have him : 1 \u2264 z.im ^ 2 := by nlinarith [hz2, hz4, hre2, hn4]\n  have hgam : Complex.normSq (gammaOf z) = z.im ^ 2 + (1 / 2 - z.re) ^ 2 := by\n    rw [Complex.normSq_apply, WeilEF.gammaOf_re, WeilEF.gammaOf_im]\n    ring\n  rw [hgam, hz2]\n  nlinarith [hzre0, hzre1, him, sq_nonneg (1 / 2 - z.re), sq_nonneg z.re]\n\n/-- Norm of the paired summand: mult\u00b7|Re f(\u03c1)|. -/\nlemma liSummand_norm (n : \u2115) (\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1}) :\n    \u2016liSummand n \u03c1\u2016 = (zeroMult \u03c1 : \u211d) * |(1 - (1 - 1 / (\u03c1 : \u2102)) ^ n).re| := by\n  rw [liSummand_eq n \u03c1, norm_mul, RCLike.norm_natCast]\n  congr 1\n  exact RCLike.norm_ofReal _\n\n/-- The main bound: for 2n \u2264 \u2016\u03c1\u2016, \u2016liSummand n \u03c1\u2016 \u2264 (9/2)n\u00b2\u00b7mult/(1+\u2016\u03b3_\u03c1\u2016\u00b2). -/\nlemma liSummand_norm_le {n : \u2115} (hn : 1 \u2264 n) (\u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1})\n    (h\u03c1 : (2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016) :\n    \u2016liSummand n \u03c1\u2016 \u2264\n      (9 / 2) * n ^ 2 * (zeroMult \u03c1 : \u211d) / (1 + Complex.normSq (gammaOf (\u03c1 : \u2102))) := by\n  have hz := \u03c1.2\n  have hre0 : 0 \u2264 (\u03c1 : \u2102).re := hz.2.1.le\n  have hre1 : (\u03c1 : \u2102).re \u2264 1 := hz.2.2.le\n  have hcore := re_li_summand_le hn hre0 hre1 h\u03c1\n  have hcomp := normSq_gammaOf_le_mul_norm_sq hn hre0 hre1 h\u03c1\n  have hnpos : (0 : \u211d) < n := by exact_mod_cast hn\n  have hz0 : (0 : \u211d) < \u2016(\u03c1 : \u2102)\u2016 := lt_of_lt_of_le (by positivity) h\u03c1\n  have hz0' : \u2016(\u03c1 : \u2102)\u2016 \u2260 0 := ne_of_gt hz0\n  have hg0 : (0 : \u211d) < 1 + Complex.normSq (gammaOf (\u03c1 : \u2102)) := by\n    have h := Complex.normSq_nonneg (gammaOf (\u03c1 : \u2102))\n    linarith\n  have key : (zeroMult \u03c1 : \u211d) * (2 * n ^ 2 / \u2016(\u03c1 : \u2102)\u2016 ^ 2)\n      \u2264 (9 / 2) * n ^ 2 * (zeroMult \u03c1 : \u211d) / (1 + Complex.normSq (gammaOf (\u03c1 : \u2102))) := by\n    rw [le_div_iff\u2080 hg0]\n    have hbound : (zeroMult \u03c1 : \u211d) * (2 * n ^ 2 / \u2016(\u03c1 : \u2102)\u2016 ^ 2) *\n          (1 + Complex.normSq (gammaOf (\u03c1 : \u2102)))\n        \u2264 (zeroMult \u03c1 : \u211d) * (2 * n ^ 2 / \u2016(\u03c1 : \u2102)\u2016 ^ 2) * ((9 / 4) * \u2016(\u03c1 : \u2102)\u2016 ^ 2) :=\n      mul_le_mul_of_nonneg_left hcomp (by positivity)\n    have heq : (zeroMult \u03c1 : \u211d) * (2 * n ^ 2 / \u2016(\u03c1 : \u2102)\u2016 ^ 2) * ((9 / 4) * \u2016(\u03c1 : \u2102)\u2016 ^ 2)\n        = (9 / 2) * n ^ 2 * (zeroMult \u03c1 : \u211d) := by\n      field_simp\n      ring\n    exact hbound.trans (le_of_eq heq)\n  rw [liSummand_norm]\n  exact (mul_le_mul_of_nonneg_left hcore (Nat.cast_nonneg _)).trans key\n\n/-- The paired Li summand is absolutely summable over the nontrivial zeros.\nUses Zeta23's `WeilEF.zero_sum_inv_sq` (\u03a3 mult/(1+\u2016\u03b3_\u03c1\u2016\u00b2) < \u221e, proved) via\nthe tail bound of `liSummand_norm_le`; the ball {\u2016\u03c1\u2016 < 2n} contributes a\nfinite set (Mathlib `IsCompact.inter_riemannZetaZeros_finite`). -/\ntheorem liSummable (n : \u2115) : Summable (liSummand n) := by\n  rcases Nat.eq_zero_or_pos n with h0 | hn\n  \u00b7 subst h0\n    have h : liSummand 0 = fun _ => (0 : \u2102) := by\n      funext \u03c1\n      simp [liSummand]\n    rw [h]\n    exact summable_zero\n  \u00b7 have hbase : Summable (fun \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1} =>\n        (9 / 2) * (n : \u211d) ^ 2 * ((zeroMult \u03c1 : \u211d) / (1 + Complex.normSq (gammaOf \u03c1)))) := by\n      have h := (WeilEF.zero_sum_inv_sq zetaSeam).mul_left ((9 / 2) * (n : \u211d) ^ 2)\n      exact h\n    set D : {\u03c1 : \u2102 // IsNontrivialZero \u03c1} \u2192 \u211d := fun \u03c1 =>\n      if (2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016 then\n        (9 / 2) * n ^ 2 * (zeroMult \u03c1 : \u211d) / (1 + Complex.normSq (gammaOf \u03c1))\n      else \u2016liSummand n \u03c1\u2016 with hDdef\n    have hfin : {\u03c1 : {\u03c1 // IsNontrivialZero \u03c1} | \u00ac ((2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016)}.Finite := by\n      have hcomp : IsCompact (Metric.closedBall (0 : \u2102) (2 * n)) :=\n        isCompact_closedBall _ _\n      have hzeros : (Metric.closedBall (0 : \u2102) (2 * n)) \u2229 {\u03c1 : \u2102 | IsNontrivialZero \u03c1}\n          \u2286 (Metric.closedBall (0 : \u2102) (2 * n)) \u2229 riemannZetaZeros := by\n        intro z hz\n        exact \u27e8hz.1, hz.2.1\u27e9\n      have hfin2 := (hcomp.inter_riemannZetaZeros_finite).subset hzeros\n      have himg : (Subtype.val '' {\u03c1 : {\u03c1 // IsNontrivialZero \u03c1} |\n          \u00ac ((2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016)}).Finite := by\n        apply hfin2.subset\n        rintro z \u27e8\u03c1, h\u03c1, rfl\u27e9\n        refine \u27e8?_, \u03c1.2\u27e9\n        simp only [Metric.mem_closedBall, dist_zero_right]\n        exact le_of_lt (lt_of_not_ge h\u03c1)\n      exact Set.Finite.of_finite_image himg (Subtype.val_injective.injOn)\n    have hE : Summable (fun \u03c1 : {\u03c1 // IsNontrivialZero \u03c1} =>\n        D \u03c1 - (9 / 2) * (n : \u211d) ^ 2 * ((zeroMult \u03c1 : \u211d) /\n          (1 + Complex.normSq (gammaOf \u03c1)))) := by\n      apply summable_of_hasFiniteSupport\n      apply hfin.subset\n      intro \u03c1 h\u03c1\n      simp only [Function.mem_support, ne_eq] at h\u03c1\n      by_contra hball\n      apply h\u03c1\n      have hball' : (2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016 := not_not.mp hball\n      simp only [D, if_pos hball']\n      ring\n    have hD : Summable D := by\n      have hsum := hbase.add hE\n      have heq : (fun \u03c1 : {\u03c1 : \u2102 // IsNontrivialZero \u03c1} =>\n          (9 / 2) * (n : \u211d) ^ 2 * ((zeroMult \u03c1 : \u211d) / (1 + Complex.normSq (gammaOf \u03c1))) +\n            (D \u03c1 - (9 / 2) * (n : \u211d) ^ 2 * ((zeroMult \u03c1 : \u211d) /\n              (1 + Complex.normSq (gammaOf \u03c1))))) = D := by\n        funext \u03c1\n        ring\n      rw [heq] at hsum\n      exact hsum\n    refine Summable.of_norm_bounded hD (fun \u03c1 => ?_)\n    by_cases h\u03c1 : (2 : \u211d) * n \u2264 \u2016(\u03c1 : \u2102)\u2016\n    \u00b7 simp only [D, if_pos h\u03c1]\n      exact liSummand_norm_le hn \u03c1 h\u03c1\n    \u00b7 simp only [D, if_neg h\u03c1, le_refl]\n\n/-- \"RH verified to height T\u2080\": every nontrivial zero with |Im \u03c1| \u2264 T\u2080 is\non the critical line. Platt\u2013Trudgian 2021 (interval arithmetic) is the\nT\u2080 = 3\u00d710\u00b9\u00b2 instance; treated here as a hypothesis, mirroring Zeta23's\nliterature-hypothesis style. -/\ndef RHUpTo (T\u2080 : \u211d) : Prop :=\n  \u2200 \u03c1 : \u2102, IsNontrivialZero \u03c1 \u2192 |\u03c1.im| \u2264 T\u2080 \u2192 \u03c1.re = 1 / 2\n\n/-- \"Li coefficients verified positive up to N\" (computational input:\nthis project to N = 3000 (E-011/E-015, two independent methods);\nMisguich\u2013Voros to N = 5\u00d710\u2075). \u03bb_n is real (conjugate symmetry of the\nzero set); the skeleton states positivity of the real part. -/\ndef LiVerifiedUpTo (N : \u2115) : Prop :=\n  \u2200 n : \u2115, 1 \u2264 n \u2192 n \u2264 N \u2192 0 < (liCoeff n).re\n\n/- [PROVED session 012, tier (ii) step 1 \u2014 assembly modulo the named\nanalytic hypothesis] R-004, the finite-height Li theorem (draft Thm 3.1).\nThe full statement and proof are at the END of this file (\u00a74), after the\nmargin machinery they depend on: `lambda_pos_finite_height` there is\nproved from `SfBoundProp` (the single named analytic hypothesis, D-062\ntriage) + the computational perimeter (Platt\u2013Trudgian `RHUpTo`,\n`LiVerifiedUpTo`) + two elementary margin evaluations. -/\n\n/-! ## 2. The archimedean lower bound (D-037 Step 1) -/\n\n/-- a\u2081 = (log 4\u03c0 + \u03b3)/2, the j = 1 Lagarias coefficient. -/\ndef lagariasA1 : \u211d := (Real.log (4 * Real.pi) + Real.eulerMascheroniConstant) / 2\n\n/-- S_\u221e(n) in the exact odd-m identity form (D-037):\nS_\u221e(n) = (1\u2212a\u2081)n \u2212 1 + \u03a3_{m \u2265 3, odd} [(1\u22121/m)\u207f \u2212 1 + n/m].\n(Same tsum-summability honesty note as liCoeff.) -/\ndef SInfty (n : \u2115) : \u211d :=\n  (1 - lagariasA1) * n - 1 +\n    tsum fun m : {m : \u2115 // Odd m \u2227 3 \u2264 m} =>\n      ((1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / (m : \u211d))\n\n/-- C\u2081 = (\u03b3 \u2212 1 \u2212 log 2\u03c0)/2 (D-037). -/\ndef lagariasC1 : \u211d :=\n  (Real.eulerMascheroniConstant - 1 - Real.log (2 * Real.pi)) / 2\n\n/-- The explicit archimedean lower bound S(n) = \u00bdn log n + (C\u2081\u2212\u03b3/2)n \u2212 4\n(D-037 (3.1)); named so the assembly can refer to it. -/\ndef sInftyLower (n : \u211d) : \u211d :=\n  (1 / 2) * n * Real.log n + (lagariasC1 - Real.eulerMascheroniConstant / 2) * n - 4\n\n/-- [PROVED session 011] h\u207a(m) \u2265 0 for m \u2265 1: first-order Bernoulli,\n(1\u22121/m)\u207f \u2265 1 \u2212 n/m. (D-037 \u00a73, \"h\u207a \u2265 max(0, n/m \u2212 1)\".) -/\ntheorem bern_term_nonneg (n : \u2115) (m : \u2115) (hm : 1 \u2264 m) :\n    0 \u2264 (1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / m := by\n  have hm0 : (m : \u211d) \u2260 0 := by positivity\n  have h1 : (1 : \u211d) + n * (-1 / m) \u2264 (1 + -1 / (m : \u211d)) ^ n := by\n    apply one_add_mul_le_pow\n    have h3 : (0 : \u211d) \u2264 1 / (m : \u211d) := by positivity\n    have h4 : (1 : \u211d) / m \u2264 1 := by\n      rw [div_le_one (by positivity)]; exact_mod_cast hm\n    rw [neg_div]\n    linarith\n  have h2 : (1 : \u211d) - n / m \u2264 (1 - 1 / m) ^ n := by\n    have : (1 : \u211d) + n * (-1 / m) = 1 - n / m := by field_simp; ring\n    rwa [this, show (1 : \u211d) + -1 / m = 1 - 1 / m by ring] at h1\n  linarith\n\n/-- [PROVED session 011] h\u207a(m) \u2264 n(n\u22121)/(2m\u00b2) for m \u2265 1: geometric\nfactorization 1 \u2212 (1\u2212x)\u207f = x\u00b7\u03a3_{j<n} (1\u2212x)\u02b2 plus Bernoulli per term.\n(D-037 \u00a73's \"terms ~ C(n,2)/m\u00b2\"; the summability input.) -/\ntheorem bern_term_upper (n : \u2115) (m : \u2115) (hm : 1 \u2264 m) :\n    (1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / m \u2264 (n : \u211d) * (n - 1) / (2 * m ^ 2) := by\n  have hm0 : (m : \u211d) \u2260 0 := by positivity\n  set x := (1 : \u211d) / m with hxdef\n  have hx1 : x \u2264 1 := by\n    rw [hxdef, div_le_one (by positivity)]; exact_mod_cast hm\n  have hx0 : 0 \u2264 x := by positivity\n  have hterm : \u2200 j : \u2115, 1 - j * x \u2264 (1 - x) ^ j := by\n    intro j\n    have := one_add_mul_le_pow (a := -x) (by linarith : (-2 : \u211d) \u2264 -x) j\n    rwa [show (1 : \u211d) + j * (-x) = 1 - j * x by ring,\n      show (1 : \u211d) + -x = 1 - x by ring] at this\n  have hsum : \u2211 j \u2208 Finset.range n, (j : \u211d) = (n : \u211d) * (n - 1) / 2 := by\n    have h := Finset.sum_range_id_mul_two n\n    have hcast : (((\u2211 i \u2208 Finset.range n, i) * 2 : \u2115) : \u211d) = ((n * (n - 1) : \u2115) : \u211d) := by\n      exact_mod_cast h\n    rcases Nat.eq_zero_or_pos n with rfl | hnpos\n    \u00b7 simp\n    \u00b7 push_cast at hcast\n      rw [Nat.cast_sub hnpos] at hcast\n      push_cast at hcast\n      linarith\n  have hgeom : (1 - (1 - x) ^ n) = x * \u2211 j \u2208 Finset.range n, (1 - x) ^ j := by\n    have h := geom_sum_mul (1 - x) n\n    have hx1' : (1 - x) - 1 = -x := by ring\n    rw [hx1'] at h\n    linarith\n  have hmain : (1 - x) ^ n - 1 + (n : \u211d) * x \u2264 (n : \u211d) * (n - 1) / 2 * x ^ 2 := by\n    have h4 : (n : \u211d) * x - (n * (n - 1) / 2) * x ^ 2 \u2264 1 - (1 - x) ^ n := by\n      rw [hgeom]\n      have h5 : (n : \u211d) - x * ((n : \u211d) * (n - 1) / 2) \u2264\n          \u2211 j \u2208 Finset.range n, (1 - x) ^ j := by\n        have h6 : \u2211 j \u2208 Finset.range n, (1 - (j : \u211d) * x) =\n            (n : \u211d) - x * \u2211 j \u2208 Finset.range n, (j : \u211d) := by\n          have e1 : \u2211 j \u2208 Finset.range n, (1 - (j : \u211d) * x) =\n              (\u2211 j \u2208 Finset.range n, (1 : \u211d)) - \u2211 j \u2208 Finset.range n, (j : \u211d) * x :=\n            Finset.sum_sub_distrib (f := fun j : \u2115 => (1 : \u211d)) (g := fun j : \u2115 => (j : \u211d) * x)\n          have e2 : \u2211 j \u2208 Finset.range n, (1 : \u211d) = (n : \u211d) := by simp\n          have e3 : \u2211 j \u2208 Finset.range n, (j : \u211d) * x =\n              x * \u2211 j \u2208 Finset.range n, (j : \u211d) := by\n            rw [Finset.mul_sum]\n            refine Finset.sum_congr rfl fun j _ => ?_\n            ring\n          rw [e1, e2, e3]\n        rw [hsum] at h6\n        rw [\u2190 h6]\n        exact Finset.sum_le_sum fun j _ => hterm j\n      calc (n : \u211d) * x - (n * (n - 1) / 2) * x ^ 2\n          = x * ((n : \u211d) - x * (n * (n - 1) / 2)) := by ring\n        _ \u2264 x * \u2211 j \u2208 Finset.range n, (1 - x) ^ j :=\n            mul_le_mul_of_nonneg_left h5 hx0\n    linarith\n  have hx2 : x ^ 2 = 1 / m ^ 2 := by rw [hxdef]; ring\n  have hdiv : (n : \u211d) / m = n * x := by rw [hxdef]; ring\n  rw [hdiv]\n  have h7 : (1 - 1 / (m : \u211d)) ^ n = (1 - x) ^ n := by rw [hxdef]\n  rw [h7]\n  calc (1 - x) ^ n - 1 + (n : \u211d) * x\n      \u2264 (n : \u211d) * (n - 1) / 2 * x ^ 2 := hmain\n    _ = (n : \u211d) * (n - 1) / (2 * m ^ 2) := by rw [hx2]; ring\n\n/-- [PROVED session 011] Summability of the odd-m S_\u221e series (the honesty\nnote on `SInfty`'s `tsum` discharged): terms are nonneg and O(n\u00b2/m\u00b2). -/\ntheorem sInf_series_summable (n : \u2115) :\n    Summable fun m : {m : \u2115 // Odd m \u2227 3 \u2264 m} =>\n      ((1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / (m : \u211d)) := by\n  refine Summable.of_nonneg_of_le\n    (g := fun m : {m : \u2115 // Odd m \u2227 3 \u2264 m} =>\n      (1 - 1 / ((m : \u2115) : \u211d)) ^ n - 1 + (n : \u211d) / ((m : \u2115) : \u211d))\n    (f := fun m : {m : \u2115 // Odd m \u2227 3 \u2264 m} =>\n      ((n : \u211d) * ((n : \u211d) - 1) / 2) * (1 / ((m : \u2115) : \u211d) ^ 2)) ?_ ?_ ?_\n  \u00b7 intro m\n    exact bern_term_nonneg n m.1 (Nat.le_trans (by norm_num) m.2.2)\n  \u00b7 intro m\n    refine le_trans (bern_term_upper n m.1 (Nat.le_trans (by norm_num) m.2.2)) (le_of_eq ?_)\n    ring\n  \u00b7 exact ((Real.summable_one_div_nat_pow.mpr (by norm_num : 1 < 2)).mul_left\n      ((n : \u211d) * ((n : \u211d) - 1) / 2)).comp_injective Subtype.coe_injective\n\n/-- [PROVED session 011] H1: `log M + \u03b3 \u2264 H_M` (from Mathlib's strictly\ndecreasing `eulerMascheroniSeq'`). -/\ntheorem harmonic_lower (M : \u2115) (hM : 1 \u2264 M) :\n    Real.log M + Real.eulerMascheroniConstant \u2264 (harmonic M : \u211d) := by\n  have h := Real.eulerMascheroniConstant_lt_eulerMascheroniSeq' M\n  rw [Real.eulerMascheroniSeq', if_neg (by omega : M \u2260 0)] at h\n  linarith\n\n/-- [PROVED session 011] H2: `H_M \u2264 log (M+1) + \u03b3` (from Mathlib's strictly\nincreasing `eulerMascheroniSeq`). -/\ntheorem harmonic_upper (M : \u2115) :\n    (harmonic M : \u211d) \u2264 Real.log ((M : \u211d) + 1) + Real.eulerMascheroniConstant := by\n  have h := Real.eulerMascheroniSeq_lt_eulerMascheroniConstant M\n  rw [Real.eulerMascheroniSeq] at h\n  linarith\n\n/-- [PROVED session 011] h\u207a(m) \u2265 n/m \u2212 1 for m \u2265 1 (the power term is\nnonneg). -/\ntheorem bern_term_lower (n : \u2115) (m : \u2115) (hm : 1 \u2264 m) :\n    (n : \u211d) / m - 1 \u2264 (1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / m := by\n  have hm1 : (1 : \u211d) \u2264 m := by exact_mod_cast hm\n  have h4 : (1 : \u211d) / m \u2264 1 := by rw [div_le_one (by positivity)]; exact hm1\n  have hpos : (0 : \u211d) \u2264 1 - 1 / (m : \u211d) := by linarith\n  have h3 : (0 : \u211d) \u2264 (1 - 1 / (m : \u211d)) ^ n := pow_nonneg hpos n\n  linarith\n\n/-- The odd reciprocals sum `\u03a3_{k=1}^{K} 1/(2k+1)`. -/\nprivate def oddHarm (K : \u2115) : \u211d := \u2211 k \u2208 Finset.Icc 1 K, (1 : \u211d) / (2 * k + 1)\n\n/-- Embedding `k \u21a6 2k+1` into the odd-\u2265-3 subtype (junk value at k = 0,\nnever used: only applied on `Icc 1 K`). -/\nprivate def oddEmb : \u2115 \u2192 {m : \u2115 // Odd m \u2227 3 \u2264 m} := fun k =>\n  if hk : 1 \u2264 k then \u27e82 * k + 1, \u27e8k, rfl\u27e9, by omega\u27e9 else \u27e83, \u27e81, rfl\u27e9, le_refl 3\u27e9\n\n/-- [PROVED session 011] Partial-sum comparison (D-037 \u00a73 truncation):\n`n\u00b7oddHarm K \u2212 K \u2264 \u03a3'_{m odd \u2265 3} h\u207a(m)` for every K \u2014 Bernoulli\ntermwise, nonneg tail dropped. -/\ntheorem sInf_partial_lower (n K : \u2115) :\n    (n : \u211d) * oddHarm K - (K : \u211d) \u2264\n      \u2211' m : {m : \u2115 // Odd m \u2227 3 \u2264 m},\n        ((1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / (m : \u211d)) := by\n  calc (n : \u211d) * oddHarm K - (K : \u211d)\n      = \u2211 k \u2208 Finset.Icc 1 K, ((n : \u211d) / (2 * k + 1) - 1) := by\n        unfold oddHarm\n        rw [Finset.mul_sum, Finset.sum_sub_distrib]\n        congr 1\n        \u00b7 exact Finset.sum_congr rfl (fun k _ => mul_one_div _ _)\n        \u00b7 simp [Finset.sum_const, Nat.card_Icc, nsmul_eq_mul]\n    _ \u2264 \u2211 k \u2208 Finset.Icc 1 K,\n          ((1 - 1 / (2 * (k : \u211d) + 1)) ^ n - 1 + (n : \u211d) / (2 * (k : \u211d) + 1)) := by\n        apply Finset.sum_le_sum\n        intro k hk\n        have h := bern_term_lower n (2 * k + 1) (by omega)\n        have hc : ((2 * k + 1 : \u2115) : \u211d) = 2 * (k : \u211d) + 1 := by push_cast; ring\n        rwa [hc] at h\n    _ \u2264 \u2211' m : {m : \u2115 // Odd m \u2227 3 \u2264 m},\n          ((1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / (m : \u211d)) := by\n        have hinj : \u2200 x \u2208 Finset.Icc 1 K, \u2200 y \u2208 Finset.Icc 1 K,\n            oddEmb x = oddEmb y \u2192 x = y := by\n          intro x hx y hy h\n          have hx1 : 1 \u2264 x := (Finset.mem_Icc.mp hx).1\n          have hy1 : 1 \u2264 y := (Finset.mem_Icc.mp hy).1\n          simp only [oddEmb, dif_pos hx1, dif_pos hy1, Subtype.mk.injEq] at h\n          omega\n        have hconv : \u2211 k \u2208 Finset.Icc 1 K,\n              ((1 - 1 / (2 * (k : \u211d) + 1)) ^ n - 1 + (n : \u211d) / (2 * (k : \u211d) + 1)) =\n            \u2211 k \u2208 Finset.Icc 1 K,\n              ((1 - 1 / ((oddEmb k : \u2115) : \u211d)) ^ n - 1 +\n                (n : \u211d) / ((oddEmb k : \u2115) : \u211d)) := by\n          apply Finset.sum_congr rfl\n          intro k hk\n          have hk1 : 1 \u2264 k := (Finset.mem_Icc.mp hk).1\n          have hc : ((2 * k + 1 : \u2115) : \u211d) = 2 * (k : \u211d) + 1 := by push_cast; ring\n          simp only [oddEmb, dif_pos hk1]\n          show ((1 - 1 / (2 * (k : \u211d) + 1)) ^ n - 1 + (n : \u211d) / (2 * (k : \u211d) + 1)) =\n            (1 - 1 / ((2 * k + 1 : \u2115) : \u211d)) ^ n - 1 + (n : \u211d) / ((2 * k + 1 : \u2115) : \u211d)\n          rw [hc]\n        rw [hconv]\n        have hsi := Finset.sum_image (s := Finset.Icc 1 K) (g := oddEmb)\n          (f := fun m : {m : \u2115 // Odd m \u2227 3 \u2264 m} =>\n            (1 - 1 / ((m : \u2115) : \u211d)) ^ n - 1 + (n : \u211d) / ((m : \u2115) : \u211d))\n          (show Set.InjOn oddEmb \u2191(Finset.Icc 1 K) from hinj)\n        rw [\u2190 hsi]\n        exact Summable.sum_le_tsum _\n          (fun i _ => bern_term_nonneg n i.1 (Nat.le_trans (by norm_num) i.2.2))\n          (sInf_series_summable n)\n\n/-- [PROVED session 011] Odd-harmonic identity (D-037 \u00a73):\n`\u03a3_{k=1}^{K} 1/(2k+1) = H_{2K+1} \u2212 \u00bdH_K \u2212 1`, by induction. -/\ntheorem oddHarm_eq (K : \u2115) :\n    oddHarm K = (harmonic (2 * K + 1) : \u211d) - (harmonic K : \u211d) / 2 - 1 := by\n  induction K with\n  | zero => simp [oddHarm, harmonic_succ]\n  | succ K ih =>\n    have h1 : (harmonic (2 * (K + 1) + 1) : \u211d) =\n        (harmonic (2 * K + 1) : \u211d) + 1 / (2 * (K : \u211d) + 2) + 1 / (2 * (K : \u211d) + 3) := by\n      have hs : 2 * (K + 1) + 1 = (2 * K + 1) + 1 + 1 := by ring\n      rw [hs, harmonic_succ, harmonic_succ]\n      push_cast\n      ring\n    have h2 : (harmonic (K + 1) : \u211d) = (harmonic K : \u211d) + 1 / ((K : \u211d) + 1) := by\n      rw [harmonic_succ]\n      push_cast\n      ring\n    have e3 : (1 : \u211d) / (2 * (K : \u211d) + 2) = (1 / ((K : \u211d) + 1)) / 2 := by\n      have h4 : (2 : \u211d) * (K : \u211d) + 2 = 2 * ((K : \u211d) + 1) := by ring\n      rw [h4, one_div, mul_inv, one_div, div_eq_mul_inv]\n      ring\n    show (\u2211 k \u2208 Finset.Icc 1 (K + 1), (1 : \u211d) / (2 * k + 1)) = _\n    rw [Finset.sum_Icc_succ_top (by omega : 1 \u2264 K + 1) (fun k => (1 : \u211d) / (2 * k + 1)),\n      show (\u2211 k \u2208 Finset.Icc 1 K, (1 : \u211d) / (2 * k + 1)) = oddHarm K from rfl, ih, h1, h2]\n    push_cast\n    rw [e3]\n    ring\n\n/-- [PROVED session 011] oddHarm lower bound (D-037 \u00a73): from H1/H2,\n`oddHarm K \u2265 log(2K+1) \u2212 \u00bdlog(K+1) + \u03b3/2 \u2212 1`. -/\ntheorem oddHarm_lower (K : \u2115) :\n    Real.log (2 * (K : \u211d) + 1) - Real.log ((K : \u211d) + 1) / 2 +\n        Real.eulerMascheroniConstant / 2 - 1 \u2264 oddHarm K := by\n  rw [oddHarm_eq K]\n  have hbl := harmonic_lower (2 * K + 1) (by omega)\n  have hbu := harmonic_upper K\n  have hc : ((2 * K + 1 : \u2115) : \u211d) = 2 * (K : \u211d) + 1 := by push_cast; ring\n  rw [hc] at hbl\n  linarith\n\n/-- [PROVED session 011] Archimedean lower bound (draft \u00a73.1 Step 1,\nD-037 \u00a73): S_\u221e(n) \u2265 \u00bd n log n + (C\u2081 \u2212 \u03b3/2) n \u2212 4 for n \u2265 20.\nProof: Bernoulli truncation at K \u2248 n/2 + the two \u03b3-shifted harmonic\nbounds; the \u03b3/log 2/log \u03c0 pieces cancel EXACTLY (parity algebra), and\nthe residual logarithmic defect is \u2264 n/(n\u22121) (even) resp. \u2264 1/2 (odd),\nabsorbed by the \u22124 constant. Machine-validated against exact values for\n20 \u2264 n \u2264 5000 (E-021/E-023 V1, min slack 9.52). -/\ntheorem sInfty_lower_bound (n : \u2115) (hn : 20 \u2264 n) :\n    sInftyLower n \u2264 SInfty n := by\n  show (1 / 2) * (n : \u211d) * Real.log n +\n        (lagariasC1 - Real.eulerMascheroniConstant / 2) * n - 4 \u2264\n      SInfty n\n  -- reduction to a K-specialized real inequality\n  have hmain : \u2200 K : \u2115,\n      (1 / 2) * (n : \u211d) * Real.log n +\n          (lagariasC1 - Real.eulerMascheroniConstant / 2) * n - 4 \u2264\n        (1 - lagariasA1) * (n : \u211d) - 1 +\n          ((n : \u211d) * (Real.log (2 * (K : \u211d) + 1) - Real.log ((K : \u211d) + 1) / 2 +\n              Real.eulerMascheroniConstant / 2 - 1) - (K : \u211d)) \u2192\n      (1 / 2) * (n : \u211d) * Real.log n +\n          (lagariasC1 - Real.eulerMascheroniConstant / 2) * n - 4 \u2264\n        SInfty n := by\n    intro K hK\n    have h1 := sInf_partial_lower n K\n    have h2 := oddHarm_lower K\n    have h3 : (n : \u211d) * (Real.log (2 * (K : \u211d) + 1) - Real.log ((K : \u211d) + 1) / 2 +\n        Real.eulerMascheroniConstant / 2 - 1) \u2264 (n : \u211d) * oddHarm K :=\n      mul_le_mul_of_nonneg_left h2 (by positivity)\n    have h4 : SInfty n = (1 - lagariasA1) * (n : \u211d) - 1 +\n        \u2211' m : {m : \u2115 // Odd m \u2227 3 \u2264 m},\n          ((1 - 1 / (m : \u211d)) ^ n - 1 + (n : \u211d) / (m : \u211d)) := rfl\n    rw [h4]\n    linarith [h1, h3]\n  -- logarithm identities for the \u03c0-factors\n  have h4pi : Real.log (4 * Real.pi) = 2 * Real.log 2 + Real.log Real.pi := by\n    rw [Real.log_mul (by norm_num : (4 : \u211d) \u2260 0) Real.pi_ne_zero]\n    have e : Real.log (4 : \u211d) = 2 * Real.log 2 := by\n      rw [show (4 : \u211d) = 2 ^ 2 by norm_num, Real.log_pow]\n      norm_num\n    rw [e]\n  have h2pi : Real.log (2 * Real.pi) = Real.log 2 + Real.log Real.pi := by\n    rw [Real.log_mul (by norm_num : (2 : \u211d) \u2260 0) Real.pi_ne_zero]\n  rcases Nat.even_or_odd n with \u27e8q, rfl\u27e9 | \u27e8q, rfl\u27e9\n  \u00b7 -- n = q + q, K = q \u2212 1: defect \u2264 n/(n\u22121) \u2264 2 < 4\n    have hq10 : 10 \u2264 q := by omega\n    have hQ : (10 : \u211d) \u2264 (q : \u211d) := by exact_mod_cast hq10\n    refine hmain (q - 1) ?_\n    have hN : ((q + q : \u2115) : \u211d) = 2 * (q : \u211d) := by push_cast; ring\n    have hK1 : 2 * ((q - 1 : \u2115) : \u211d) + 1 = 2 * (q : \u211d) - 1 := by\n      rw [Nat.cast_sub (by omega : 1 \u2264 q), Nat.cast_one]; ring\n    have hK2 : ((q - 1 : \u2115) : \u211d) + 1 = (q : \u211d) := by\n      rw [Nat.cast_sub (by omega : 1 \u2264 q), Nat.cast_one]; ring\n    have hK3 : ((q - 1 : \u2115) : \u211d) = (q : \u211d) - 1 := by\n      rw [Nat.cast_sub (by omega : 1 \u2264 q), Nat.cast_one]\n    have hlogq : Real.log (q : \u211d) = Real.log (2 * (q : \u211d)) - Real.log 2 := by\n      have h := Real.log_mul (by norm_num : (2 : \u211d) \u2260 0)\n        (ne_of_gt (by linarith : (0 : \u211d) < (q : \u211d)))\n      linarith [h]\n    rw [hN, hK1, hK2, hK3, hlogq]\n    unfold lagariasA1 lagariasC1\n    rw [h4pi, h2pi]\n    have hpos : (0 : \u211d) < 2 * (q : \u211d) - 1 := by linarith\n    have hlogb1 : Real.log (2 * (q : \u211d)) - Real.log (2 * (q : \u211d) - 1) \u2264\n        1 / (2 * (q : \u211d) - 1) := by\n      have h1 := Real.log_le_sub_one_of_pos\n        (x := (2 * (q : \u211d)) / (2 * (q : \u211d) - 1)) (div_pos (by linarith) hpos)\n      rw [Real.log_div (by linarith : (2 : \u211d) * (q : \u211d) \u2260 0) hpos.ne'] at h1\n      have e : (2 * (q : \u211d)) / (2 * (q : \u211d) - 1) - 1 = 1 / (2 * (q : \u211d) - 1) := by\n        field_simp [hpos.ne']\n        ring\n      linarith [h1, e]\n    have hlogb2 : (2 * (q : \u211d)) * (Real.log (2 * (q : \u211d)) - Real.log (2 * (q : \u211d) - 1)) \u2264\n        2 := by\n      have h2 := mul_le_mul_of_nonneg_left hlogb1 (by linarith : (0 : \u211d) \u2264 2 * (q : \u211d))\n      have e : (2 * (q : \u211d)) * (1 / (2 * (q : \u211d) - 1)) \u2264 2 := by\n        rw [mul_one_div, div_le_iff\u2080 hpos]\n        linarith\n      linarith [h2, e]\n    linarith [hlogb2]\n  \u00b7 -- n = 2q + 1, K = q: defect \u2264 1/2 < 7/2\n    have hq10 : 10 \u2264 q := by omega\n    have hQ : (10 : \u211d) \u2264 (q : \u211d) := by exact_mod_cast hq10\n    refine hmain q ?_\n    have hN : ((2 * q + 1 : \u2115) : \u211d) = 2 * (q : \u211d) + 1 := by push_cast; ring\n    have hlogq1 : Real.log ((q : \u211d) + 1) = Real.log (2 * (q : \u211d) + 2) - Real.log 2 := by\n      have h1 : (2 * (q : \u211d) + 2) = 2 * ((q : \u211d) + 1) := by ring\n      have h2 := Real.log_mul (by norm_num : (2 : \u211d) \u2260 0)\n        (by positivity : ((q : \u211d) + 1) \u2260 0)\n      rw [\u2190 h1] at h2\n      linarith [h2]\n    rw [hN, hlogq1]\n    unfold lagariasA1 lagariasC1\n    rw [h4pi, h2pi]\n    have hpos : (0 : \u211d) < 2 * (q : \u211d) + 1 := by linarith\n    have hlogb1 : Real.log (2 * (q : \u211d) + 2) - Real.log (2 * (q : \u211d) + 1) \u2264\n        1 / (2 * (q : \u211d) + 1) := by\n      have h1 := Real.log_le_sub_one_of_pos\n        (x := (2 * (q : \u211d) + 2) / (2 * (q : \u211d) + 1)) (div_pos (by linarith) hpos)\n      rw [Real.log_div (by linarith : (2 : \u211d) * (q : \u211d) + 2 \u2260 0) hpos.ne'] at h1\n      have e : (2 * (q : \u211d) + 2) / (2 * (q : \u211d) + 1) - 1 = 1 / (2 * (q : \u211d) + 1) := by\n        field_simp [hpos.ne']\n        ring\n      linarith [h1, e]\n    have hlogb2 : ((2 * (q : \u211d) + 1) / 2) *\n        (Real.log (2 * (q : \u211d) + 2) - Real.log (2 * (q : \u211d) + 1)) \u2264 1 / 2 := by\n      have h2 := mul_le_mul_of_nonneg_left hlogb1\n        (by positivity : (0 : \u211d) \u2264 (2 * (q : \u211d) + 1) / 2)\n      have e : ((2 * (q : \u211d) + 1) / 2) * (1 / (2 * (q : \u211d) + 1)) = 1 / 2 := by\n        field_simp [hpos.ne']\n      linarith [h2, e]\n    linarith [hlogb2]\n\n/-! ## 3. The margin and its convexity (D-057) -/\n\n/-- The honest closed-form unit-interval zero-count majorant (D-056 \u00a72):\n\u0108\u2080(t) = 0.433 log(t+2) + 0.886 log log(t+2) + 2.9. -/\ndef C0hat (t : \u211d) : \u211d :=\n  0.433 * Real.log (t + 2) + 0.886 * Real.log (Real.log (t + 2)) + 2.9\n\n/-- The two-unit-window zero-count majorant Z\u2082(t) = 0.6 log(t+2) +\n0.886 log log(t+2) + 2.7 (the `ZeroCountProp2` bound form, D-069 \u00a72).\nNamed for use in the corrected `Bn` (D-071 F-B): the I_III near-sum's\nwindow |\u03b3\u2212t| < 1 is a two-unit window, honestly counted by Z\u2082, not \u0108\u2080.\nDefinitionally the `ZeroCountProp2` closed form (that Prop's statement\nis untouched). -/\ndef Z2hat (t : \u211d) : \u211d :=\n  0.6 * Real.log (t + 2) + 0.886 * Real.log (Real.log (t + 2)) + 2.7\n\n/-- H majorant with A = 10.5, B\u2080 = 48 (D-056). -/\ndef Hhat (T : \u211d) : \u211d :=\n  3 * C0hat T ^ 2 + 10.5 * Real.log (T + 2) + 48\n\n/-- The I_I boundary-integral majorant (D-057 \u00a73):\nB\u0303\u2084(n) = 2(\u221an+1)\u00b7(e^{\u221an/2}+1)\u00b70.57\u00b72^{\u2212(2\u221an\u22122)}. -/\ndef IIMaj (n : \u211d) : \u211d :=\n  2 * (Real.sqrt n + 1) * (Real.exp (Real.sqrt n / 2) + 1) * 0.57 *\n    2 ^ (-(2 * Real.sqrt n - 2))\n\n/-- The margin majorant chain (D-057, corrected per D-071): margin\u0303(n) =\nS(n) \u2212 B\u0303(n) + 1 with the counting function majorized by a smooth\nfunction F. M\u2080 = 1.3352 (E-023, grid-verified \u2014 see D-060 \u00a74).\nCORRECTION (D-071, user-approved session 038): the bridge is 4F (the\nresidue sum \u03bb_n(T) runs over BOTH signs of \u03b3 \u2014 D-036/D-037's 2N(T)\nwas a factor-2 accounting slip, R-004 unaffected) and the I_III\nnear-sum uses the two-unit count (2/3)\u00b7Z2hat (D-069 Finding 2 made\nexact). See D-071 + E-030. -/\ndef marginTilde (F : \u211d \u2192 \u211d) (n : \u211d) : \u211d :=\n  let T := Real.sqrt n + 1\n  ((1 / 2) * n * Real.log n +\n      (lagariasC1 - Real.eulerMascheroniConstant / 2) * n - 4) -\n    (4 * F T + 4 * T * ((2 / 3) * Z2hat T + 10.5 * Real.log (T + 2) + 48) +\n      40 * 1.3352 + 2 * (Real.exp 4 + 1) * (7 * Hhat T + 3.3) +\n      IIMaj n + 1) + 1\n\n/-! ### Block machinery for the `marginTilde_convex` proof (D-057 \u00a72) -/\n\n/-- Second-derivative computation package: if \u03c6 has derivative D1 on a\nneighborhood of T and D1 has derivative D2 at T, then \u03c6\u2033(T) = D2. -/\ntheorem deriv2_of_hasDerivAt_nhds {\u03c6 D1 : \u211d \u2192 \u211d} {T D2 : \u211d}\n    (h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt \u03c6 (D1 x) x) (h2 : HasDerivAt D1 D2 T) :\n    deriv (deriv \u03c6) T = D2 :=\n  (h2.congr_of_eventuallyEq (by\n    filter_upwards [h1] with x hx using hx.deriv)).deriv\n\n/-- The \u03c8-functional of D-057: \u03c8[\u03c6](T) = \u03c6\u2033(T) \u2212 \u03c6\u2032(T)/(T\u22121). -/\ndef psiOf (\u03c6 : \u211d \u2192 \u211d) (T : \u211d) : \u211d := deriv (deriv \u03c6) T - deriv \u03c6 T / (T - 1)\n\n/-- [PROVED session 011] Block #2 (identity): \u03c8[id](T) = \u22121/(T\u22121) < 0. -/\ntheorem psiOf_id (T : \u211d) (hT : 1 < T) : psiOf id T = -1 / (T - 1) \u2227 psiOf id T < 0 := by\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt id 1 x := by\n    filter_upwards [] with x\n    exact hasDerivAt_id' x\n  have hd2 : deriv (deriv id) T = 0 :=\n    deriv2_of_hasDerivAt_nhds h1 (hasDerivAt_const T 1)\n  have hd1 : deriv id T = 1 := h1.self_of_nhds.deriv\n  have h3 : (0 : \u211d) < T - 1 := by linarith\n  refine \u27e8?_, ?_\u27e9\n  \u00b7 unfold psiOf; rw [hd2, hd1]; ring\n  \u00b7 unfold psiOf; rw [hd2, hd1]; linarith [one_div_pos.mpr h3]\n\n/-- [PROVED session 011] Block #10 (L1 = log(T+2)): \u03c8-formula. -/\ntheorem psiOf_log_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (t + 2)) T =\n      -1 / (T + 2) ^ 2 - 1 / ((T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => Real.log (t + 2)) ((x + 2)\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-2 : \u211d) < T)] with x hx\n    have h := (Real.hasDerivAt_log (show x + 2 \u2260 0 by linarith)).comp x\n      ((hasDerivAt_id' x).add_const 2)\n    rwa [mul_one] at h\n  have h2 : HasDerivAt (fun t => (t + 2)\u207b\u00b9) (-1 / (T + 2) ^ 2) T := by\n    have h := ((hasDerivAt_id' T).add_const 2).inv (by linarith : (T + 2) \u2260 0)\n    have e : (-(1 : \u211d)) / (T + 2) ^ 2 = -1 / (T + 2) ^ 2 := by ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (t + 2)) T = (T + 2)\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  field_simp [hT1, hT2']\n\n/-- [PROVED session 011] Block #10 sign: \u03c8 < 0 for T > 1. -/\ntheorem psiOf_log_shift_neg {T : \u211d} (hT : 1 < T) :\n    psiOf (fun t => Real.log (t + 2)) T < 0 := by\n  rw [psiOf_log_shift T hT]\n  have h1 : (0 : \u211d) < 1 / (T + 2) ^ 2 := one_div_pos.mpr (pow_pos (by linarith) 2)\n  have h2 : (0 : \u211d) < 1 / ((T + 2) * (T - 1)) :=\n    one_div_pos.mpr (mul_pos (by linarith) (by linarith))\n  have e : -1 / (T + 2) ^ 2 - 1 / ((T + 2) * (T - 1)) =\n      -(1 / (T + 2) ^ 2 + 1 / ((T + 2) * (T - 1))) := by ring\n  rw [e]\n  linarith [add_pos h1 h2]\n\n/-- [PROVED session 011] Reusable per-point derivative of log(t+2). -/\ntheorem hasDerivAt_log_shift (x : \u211d) (hx : -2 < x) :\n    HasDerivAt (fun t => Real.log (t + 2)) (x + 2)\u207b\u00b9 x := by\n  have h := (Real.hasDerivAt_log (show x + 2 \u2260 0 by linarith)).comp x\n    ((hasDerivAt_id' x).add_const 2)\n  rwa [mul_one] at h\n\n/-- [PROVED session 011] Reusable per-point derivative of log log(t+2). -/\ntheorem hasDerivAt_log_log (x : \u211d) (hx : -1 < x) :\n    HasDerivAt (fun t => Real.log (Real.log (t + 2)))\n      ((Real.log (x + 2))\u207b\u00b9 * (x + 2)\u207b\u00b9) x := by\n  have hin := hasDerivAt_log_shift x (by linarith)\n  have hout : HasDerivAt Real.log (Real.log (x + 2))\u207b\u00b9 (Real.log (x + 2)) :=\n    Real.hasDerivAt_log (ne_of_gt (Real.log_pos (by linarith)))\n  exact hout.comp x hin\n\n/-- [PROVED session 011] Numerical bounds on the block-table range\nT \u2265 \u221a20 + 1: T \u2265 5.4721, L1 \u2265 2 (via e\u00b2 \u2264 7.4721), L2 \u2265 0.6931. -/\ntheorem block_range_bounds {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    (5.4721 : \u211d) \u2264 T \u2227 2 \u2264 Real.log (T + 2) \u2227\n      (0.6931 : \u211d) \u2264 Real.log (Real.log (T + 2)) := by\n  have hs : (4.4721 : \u211d) \u2264 Real.sqrt 20 := by\n    rw [Real.le_sqrt (by norm_num) (by norm_num)]\n    norm_num\n  have hT5 : (5.4721 : \u211d) \u2264 T := by linarith\n  have hT2 : (7.4721 : \u211d) \u2264 T + 2 := by linarith\n  have hL1 : (2 : \u211d) \u2264 Real.log (T + 2) := by\n    have he2 : Real.exp 2 \u2264 T + 2 := by\n      have hd := Real.exp_one_lt_d9\n      have e : Real.exp 2 = Real.exp 1 * Real.exp 1 := by\n        rw [\u2190 Real.exp_add]; norm_num\n      calc Real.exp 2 = Real.exp 1 * Real.exp 1 := e\n        _ \u2264 2.7182818286 * 2.7182818286 :=\n          mul_le_mul (le_of_lt hd) (le_of_lt hd) (Real.exp_pos 1).le (by positivity)\n        _ \u2264 7.4721 := by norm_num\n        _ \u2264 T + 2 := hT2\n    have h2 := Real.log_le_log (Real.exp_pos 2) he2\n    rwa [Real.log_exp] at h2\n  have hL2 : (0.6931 : \u211d) \u2264 Real.log (Real.log (T + 2)) := by\n    have h2 := Real.log_le_log (by norm_num : (0 : \u211d) < 2) hL1\n    have h3 := Real.log_two_gt_d9\n    linarith\n  exact \u27e8hT5, hL1, hL2\u27e9\n\n/-- [PROVED session 011] Block #11 (L2 = log log(T+2)): \u03c8-formula. -/\ntheorem psiOf_log_log_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (Real.log (t + 2))) T =\n      -(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2 -\n        1 / ((T + 2) * Real.log (T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => Real.log (Real.log (t + 2)))\n      ((Real.log (x + 2))\u207b\u00b9 * (x + 2)\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-2 : \u211d) < T),\n      eventually_gt_nhds (by linarith : (-1 : \u211d) < T)] with x hx2 hx1\n    have hin : HasDerivAt (fun t => Real.log (t + 2)) (x + 2)\u207b\u00b9 x := by\n      have h := (Real.hasDerivAt_log (show x + 2 \u2260 0 by linarith)).comp x\n        ((hasDerivAt_id' x).add_const 2)\n      rwa [mul_one] at h\n    have hout : HasDerivAt Real.log (Real.log (x + 2))\u207b\u00b9 (Real.log (x + 2)) :=\n      Real.hasDerivAt_log (ne_of_gt (Real.log_pos (by linarith)))\n    exact hout.comp x hin\n  have h2 : HasDerivAt (fun t => (Real.log (t + 2))\u207b\u00b9 * (t + 2)\u207b\u00b9)\n      (-(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2) T := by\n    have hu : HasDerivAt (fun t => (Real.log (t + 2))\u207b\u00b9)\n        (-(T + 2)\u207b\u00b9 / Real.log (T + 2) ^ 2) T := by\n      have hin : HasDerivAt (fun t => Real.log (t + 2)) (T + 2)\u207b\u00b9 T := by\n        have h := (Real.hasDerivAt_log (show T + 2 \u2260 0 by linarith)).comp T\n          ((hasDerivAt_id' T).add_const 2)\n        rwa [mul_one] at h\n      exact hin.inv (ne_of_gt hL1)\n    have hv : HasDerivAt (fun t => (t + 2)\u207b\u00b9) (-1 / (T + 2) ^ 2) T := by\n      have h := ((hasDerivAt_id' T).add_const 2).inv (by linarith : (T + 2) \u2260 0)\n      have e : (-(1 : \u211d)) / (T + 2) ^ 2 = -1 / (T + 2) ^ 2 := by ring\n      rwa [e] at h\n    have h := hu.mul hv\n    have hT2' : (T + 2) \u2260 0 := ne_of_gt hT2\n    have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n    have e : (-(T + 2)\u207b\u00b9 / Real.log (T + 2) ^ 2) * (T + 2)\u207b\u00b9 +\n        (Real.log (T + 2))\u207b\u00b9 * (-1 / (T + 2) ^ 2) =\n        -(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2 := by\n      field_simp [hT2', hL1']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (Real.log (t + 2))) T =\n      (Real.log (T + 2))\u207b\u00b9 * (T + 2)\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := ne_of_gt hT2\n  have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n  field_simp [hT1, hT2', hL1']\n\n/-- [PROVED session 011] Block #11 sign: \u03c8 < 0 for T > 1. -/\ntheorem psiOf_log_log_shift_neg {T : \u211d} (hT : 1 < T) :\n    psiOf (fun t => Real.log (Real.log (t + 2))) T < 0 := by\n  rw [psiOf_log_log_shift T hT]\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have hp1 : (0 : \u211d) < (Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2 :=\n    div_pos (by linarith) (pow_pos (mul_pos (by linarith) hL1) 2)\n  have hp2 : (0 : \u211d) < 1 / ((T + 2) * Real.log (T + 2) * (T - 1)) :=\n    one_div_pos.mpr (mul_pos (mul_pos (by linarith) hL1) (by linarith))\n  have e : -(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2 -\n      1 / ((T + 2) * Real.log (T + 2) * (T - 1)) =\n      -((Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2 +\n        1 / ((T + 2) * Real.log (T + 2) * (T - 1))) := by ring\n  rw [e]\n  linarith [add_pos hp1 hp2]\n\n/-- [PROVED session 011] Block #7 (L1\u00b2): \u03c8-formula. -/\ntheorem psiOf_log_sq_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (t + 2) ^ 2) T =\n      2 * (1 - Real.log (T + 2)) / (T + 2) ^ 2 -\n        2 * Real.log (T + 2) / ((T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => Real.log (t + 2) ^ 2)\n      (2 * Real.log (x + 2) * (x + 2)\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-2 : \u211d) < T)] with x hx\n    have h := (hasDerivAt_log_shift x (by linarith)).pow 2\n    rwa [pow_one, Nat.cast_ofNat] at h\n  have h2 : HasDerivAt (fun t => 2 * Real.log (t + 2) * (t + 2)\u207b\u00b9)\n      (2 * (1 - Real.log (T + 2)) / (T + 2) ^ 2) T := by\n    have hu : HasDerivAt (fun t => 2 * Real.log (t + 2)) (2 * (T + 2)\u207b\u00b9) T :=\n      (hasDerivAt_log_shift T (by linarith : (-2 : \u211d) < T)).const_mul 2\n    have hv : HasDerivAt (fun t => (t + 2)\u207b\u00b9) (-1 / (T + 2) ^ 2) T := by\n      have h := ((hasDerivAt_id' T).add_const 2).inv (by linarith : (T + 2) \u2260 0)\n      have e : (-(1 : \u211d)) / (T + 2) ^ 2 = -1 / (T + 2) ^ 2 := by ring\n      rwa [e] at h\n    have h := hu.mul hv\n    have hT2' : (T + 2) \u2260 0 := by linarith\n    have e : 2 * (T + 2)\u207b\u00b9 * (T + 2)\u207b\u00b9 + 2 * Real.log (T + 2) * (-1 / (T + 2) ^ 2) =\n        2 * (1 - Real.log (T + 2)) / (T + 2) ^ 2 := by\n      field_simp [hT2']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (t + 2) ^ 2) T =\n      2 * Real.log (T + 2) * (T + 2)\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  field_simp [hT1, hT2']\n\n/-- [PROVED session 011] Block #7 sign: \u03c8 < 0 on the table range (L1 \u2265 2). -/\ntheorem psiOf_log_sq_shift_neg {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    psiOf (fun t => Real.log (t + 2) ^ 2) T < 0 := by\n  obtain \u27e8hT5, hL1, _\u27e9 := block_range_bounds hT\n  rw [psiOf_log_sq_shift T (by linarith)]\n  have h1 : 2 * (1 - Real.log (T + 2)) / (T + 2) ^ 2 < 0 :=\n    div_neg_of_neg_of_pos (by linarith) (pow_pos (by linarith) 2)\n  have h2 : (0 : \u211d) < 2 * Real.log (T + 2) / ((T + 2) * (T - 1)) :=\n    div_pos (by linarith) (mul_pos (by linarith) (by linarith))\n  linarith\n\n/-- [PROVED session 011] Block #8 (L1\u00b7L2): \u03c8-formula. -/\ntheorem psiOf_log_mul_log_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2))) T =\n      ((Real.log (T + 2))\u207b\u00b9 - Real.log (Real.log (T + 2)) - 1) / (T + 2) ^ 2 -\n        (Real.log (Real.log (T + 2)) + 1) / ((T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T,\n      HasDerivAt (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2)))\n        ((Real.log (Real.log (x + 2)) + 1) * (x + 2)\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-1 : \u211d) < T)] with x hx\n    have hu := hasDerivAt_log_shift x (by linarith)\n    have hv := hasDerivAt_log_log x hx\n    have h := hu.mul hv\n    have hx2 : (x + 2) \u2260 0 := by linarith\n    have hxL : Real.log (x + 2) \u2260 0 := ne_of_gt (Real.log_pos (by linarith))\n    have e : (x + 2)\u207b\u00b9 * Real.log (Real.log (x + 2)) +\n        Real.log (x + 2) * ((Real.log (x + 2))\u207b\u00b9 * (x + 2)\u207b\u00b9) =\n        (Real.log (Real.log (x + 2)) + 1) * (x + 2)\u207b\u00b9 := by\n      field_simp [hx2, hxL]\n    rwa [e] at h\n  have h2 : HasDerivAt (fun t => (Real.log (Real.log (t + 2)) + 1) * (t + 2)\u207b\u00b9)\n      (((Real.log (T + 2))\u207b\u00b9 - Real.log (Real.log (T + 2)) - 1) / (T + 2) ^ 2) T := by\n    have hw : HasDerivAt (fun t => Real.log (Real.log (t + 2)) + 1)\n        ((Real.log (T + 2))\u207b\u00b9 * (T + 2)\u207b\u00b9) T :=\n      (hasDerivAt_log_log T (by linarith)).add_const 1\n    have hz : HasDerivAt (fun t => (t + 2)\u207b\u00b9) (-1 / (T + 2) ^ 2) T := by\n      have h := ((hasDerivAt_id' T).add_const 2).inv (by linarith : (T + 2) \u2260 0)\n      have e : (-(1 : \u211d)) / (T + 2) ^ 2 = -1 / (T + 2) ^ 2 := by ring\n      rwa [e] at h\n    have h := hw.mul hz\n    have hT2' : (T + 2) \u2260 0 := by linarith\n    have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n    have e : (Real.log (T + 2))\u207b\u00b9 * (T + 2)\u207b\u00b9 * (T + 2)\u207b\u00b9 +\n        (Real.log (Real.log (T + 2)) + 1) * (-1 / (T + 2) ^ 2) =\n        ((Real.log (T + 2))\u207b\u00b9 - Real.log (Real.log (T + 2)) - 1) / (T + 2) ^ 2 := by\n      field_simp [hT2', hL1']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2))) T =\n      (Real.log (Real.log (T + 2)) + 1) * (T + 2)\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  field_simp [hT1, hT2']\n\n/-- [PROVED session 011] Block #8 sign: \u03c8 < 0 on the table range\n(1/L1 \u2264 1/2 < 1 + L2). -/\ntheorem psiOf_log_mul_log_shift_neg {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    psiOf (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2))) T < 0 := by\n  obtain \u27e8hT5, hL1, hL2\u27e9 := block_range_bounds hT\n  rw [psiOf_log_mul_log_shift T (by linarith)]\n  have hinv : (Real.log (T + 2))\u207b\u00b9 \u2264 1 / 2 := by\n    have h := one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 2) hL1\n    rwa [one_div] at h\n  have hbr : (Real.log (T + 2))\u207b\u00b9 - Real.log (Real.log (T + 2)) - 1 < 0 := by\n    linarith\n  have h1 : ((Real.log (T + 2))\u207b\u00b9 - Real.log (Real.log (T + 2)) - 1) / (T + 2) ^ 2 < 0 :=\n    div_neg_of_neg_of_pos hbr (pow_pos (by linarith) 2)\n  have h2 : (0 : \u211d) < (Real.log (Real.log (T + 2)) + 1) / ((T + 2) * (T - 1)) :=\n    div_pos (by linarith) (mul_pos (by linarith) (by linarith))\n  linarith\n\n/-- [PROVED session 011] Block #9 (L2\u00b2): \u03c8-formula. -/\ntheorem psiOf_log_log_sq_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (Real.log (t + 2)) ^ 2) T =\n      2 * (1 - Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1)) /\n          ((T + 2) * Real.log (T + 2)) ^ 2 -\n        2 * Real.log (Real.log (T + 2)) / ((T + 2) * Real.log (T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => Real.log (Real.log (t + 2)) ^ 2)\n      (2 * Real.log (Real.log (x + 2)) * ((x + 2) * Real.log (x + 2))\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-1 : \u211d) < T)] with x hx\n    have h := (hasDerivAt_log_log x hx).pow 2\n    have e : (2 : \u211d) * Real.log (Real.log (x + 2)) ^ 1 *\n        ((Real.log (x + 2))\u207b\u00b9 * (x + 2)\u207b\u00b9) =\n        2 * Real.log (Real.log (x + 2)) * ((x + 2) * Real.log (x + 2))\u207b\u00b9 := by\n      rw [pow_one, mul_inv]; ring\n    rwa [Nat.cast_ofNat, e] at h\n  have h2 : HasDerivAt\n      (fun t => 2 * Real.log (Real.log (t + 2)) * ((t + 2) * Real.log (t + 2))\u207b\u00b9)\n      (2 * (1 - Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1)) /\n        ((T + 2) * Real.log (T + 2)) ^ 2) T := by\n    have hz_inner : HasDerivAt (fun t => (t + 2) * Real.log (t + 2))\n        (Real.log (T + 2) + 1) T := by\n      have h := ((hasDerivAt_id' T).add_const 2).mul\n        (hasDerivAt_log_shift T (by linarith))\n      have e : (1 : \u211d) * Real.log (T + 2) + (T + 2) * (T + 2)\u207b\u00b9 =\n          Real.log (T + 2) + 1 := by\n        rw [mul_inv_cancel\u2080 (by linarith : (T + 2) \u2260 0)]; ring\n      rwa [e] at h\n    have hz : HasDerivAt (fun t => ((t + 2) * Real.log (t + 2))\u207b\u00b9)\n        (-(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2) T :=\n      hz_inner.inv (mul_ne_zero (by linarith) (ne_of_gt hL1))\n    have hw := (hasDerivAt_log_log T (by linarith)).const_mul 2\n    have h := hw.mul hz\n    have hT2' : (T + 2) \u2260 0 := by linarith\n    have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n    have e : 2 * ((Real.log (T + 2))\u207b\u00b9 * (T + 2)\u207b\u00b9) *\n          ((T + 2) * Real.log (T + 2))\u207b\u00b9 +\n        2 * Real.log (Real.log (T + 2)) *\n          (-(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2) =\n        2 * (1 - Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1)) /\n          ((T + 2) * Real.log (T + 2)) ^ 2 := by\n      field_simp [hT2', hL1']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (Real.log (t + 2)) ^ 2) T =\n      2 * Real.log (Real.log (T + 2)) * ((T + 2) * Real.log (T + 2))\u207b\u00b9 :=\n    h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n  field_simp [hT1, hT2', hL1']\n\n/-- [PROVED session 011] Block #9 sign: \u03c8 < 0 on the table range\n(L2(L1+1) \u2265 0.6931\u00b73 > 1). -/\ntheorem psiOf_log_log_sq_shift_neg {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    psiOf (fun t => Real.log (Real.log (t + 2)) ^ 2) T < 0 := by\n  obtain \u27e8hT5, hL1, hL2\u27e9 := block_range_bounds hT\n  rw [psiOf_log_log_sq_shift T (by linarith)]\n  have hprod : (1 : \u211d) < Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1) := by\n    calc (1 : \u211d) < 0.6931 * (2 + 1) := by norm_num\n      _ \u2264 Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1) :=\n        mul_le_mul hL2 (by linarith) (by linarith) (by linarith)\n  have h1 : 2 * (1 - Real.log (Real.log (T + 2)) * (Real.log (T + 2) + 1)) /\n      ((T + 2) * Real.log (T + 2)) ^ 2 < 0 :=\n    div_neg_of_neg_of_pos (by linarith)\n      (pow_pos (mul_pos (by linarith) (by linarith)) 2)\n  have h2 : (0 : \u211d) < 2 * Real.log (Real.log (T + 2)) /\n      ((T + 2) * Real.log (T + 2) * (T - 1)) :=\n    div_pos (by linarith) (mul_pos (mul_pos (by linarith) (by linarith)) (by linarith))\n  linarith\n\n/-- [PROVED session 011] Block #5 (T\u00b7L1): \u03c8-formula. -/\ntheorem psiOf_T_mul_log_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => t * Real.log (t + 2)) T =\n      (T + 4) / (T + 2) ^ 2 - Real.log (T + 2) / (T - 1) -\n        T / ((T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => t * Real.log (t + 2))\n      (Real.log (x + 2) + x * (x + 2)\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-2 : \u211d) < T)] with x hx\n    have h := (hasDerivAt_id' x).mul (hasDerivAt_log_shift x (by linarith))\n    rwa [one_mul] at h\n  have h2 : HasDerivAt (fun t => Real.log (t + 2) + t * (t + 2)\u207b\u00b9)\n      ((T + 4) / (T + 2) ^ 2) T := by\n    have hu := hasDerivAt_log_shift T (by linarith : (-2 : \u211d) < T)\n    have hv : HasDerivAt (fun t => t * (t + 2)\u207b\u00b9) (2 / (T + 2) ^ 2) T := by\n      have hz : HasDerivAt (fun t => (t + 2)\u207b\u00b9) (-1 / (T + 2) ^ 2) T := by\n        have h := ((hasDerivAt_id' T).add_const 2).inv (by linarith : (T + 2) \u2260 0)\n        have e : (-(1 : \u211d)) / (T + 2) ^ 2 = -1 / (T + 2) ^ 2 := by ring\n        rwa [e] at h\n      have h := (hasDerivAt_id' T).mul hz\n      have hT2' : (T + 2) \u2260 0 := by linarith\n      have e : (1 : \u211d) * (T + 2)\u207b\u00b9 + T * (-1 / (T + 2) ^ 2) = 2 / (T + 2) ^ 2 := by\n        field_simp [hT2']\n        ring\n      rwa [e] at h\n    have h := hu.add hv\n    have hT2' : (T + 2) \u2260 0 := by linarith\n    have e : (T + 2)\u207b\u00b9 + 2 / (T + 2) ^ 2 = (T + 4) / (T + 2) ^ 2 := by\n      field_simp [hT2']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => t * Real.log (t + 2)) T =\n      Real.log (T + 2) + T * (T + 2)\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  field_simp [hT1, hT2']\n  ring\n\n/-- [PROVED session 011] Block #5 sign: \u03c8 < 0 on the table range\n(L1 \u2265 2; numerator \u22122T\u00b2 \u2212 7T \u2212 12). -/\ntheorem psiOf_T_mul_log_shift_neg {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    psiOf (fun t => t * Real.log (t + 2)) T < 0 := by\n  obtain \u27e8hT5, hL1, _\u27e9 := block_range_bounds hT\n  have h1T : 1 < T := by linarith\n  rw [psiOf_T_mul_log_shift T h1T]\n  have hT1 : (0 : \u211d) < T - 1 := by linarith\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hle : (2 : \u211d) / (T - 1) \u2264 Real.log (T + 2) / (T - 1) := by gcongr\n  have hneg : (T + 4) / (T + 2) ^ 2 - 2 / (T - 1) - T / ((T + 2) * (T - 1)) < 0 := by\n    have hnum : (T + 4) / (T + 2) ^ 2 - 2 / (T - 1) - T / ((T + 2) * (T - 1)) =\n        (-(2 * T ^ 2 + 7 * T + 12)) / ((T + 2) ^ 2 * (T - 1)) := by\n      field_simp [hT1.ne', hT2.ne']\n      ring\n    rw [hnum]\n    exact div_neg_of_neg_of_pos (by linarith [sq_nonneg T])\n      (mul_pos (pow_pos hT2 2) hT1)\n  linarith\n\n/-- [PROVED session 011] Block #6 (T\u00b7L2): \u03c8-formula. -/\ntheorem psiOf_T_mul_log_log_shift (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => t * Real.log (Real.log (t + 2))) T =\n      (T * (Real.log (T + 2) - 1) + 4 * Real.log (T + 2)) /\n          ((T + 2) * Real.log (T + 2)) ^ 2 -\n        Real.log (Real.log (T + 2)) / (T - 1) -\n        T / ((T + 2) * Real.log (T + 2) * (T - 1)) := by\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => t * Real.log (Real.log (t + 2)))\n      (Real.log (Real.log (x + 2)) + x * ((x + 2) * Real.log (x + 2))\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds (by linarith : (-1 : \u211d) < T)] with x hx\n    have h := (hasDerivAt_id' x).mul (hasDerivAt_log_log x hx)\n    have hx2 : (x + 2) \u2260 0 := by linarith\n    have hxL : Real.log (x + 2) \u2260 0 := ne_of_gt (Real.log_pos (by linarith))\n    have e : (1 : \u211d) * Real.log (Real.log (x + 2)) +\n        x * ((Real.log (x + 2))\u207b\u00b9 * (x + 2)\u207b\u00b9) =\n        Real.log (Real.log (x + 2)) + x * ((x + 2) * Real.log (x + 2))\u207b\u00b9 := by\n      rw [one_mul, mul_inv]\n      ring\n    rwa [e] at h\n  have h2 : HasDerivAt\n      (fun t => Real.log (Real.log (t + 2)) + t * ((t + 2) * Real.log (t + 2))\u207b\u00b9)\n      ((T * (Real.log (T + 2) - 1) + 4 * Real.log (T + 2)) /\n        ((T + 2) * Real.log (T + 2)) ^ 2) T := by\n    have hu := hasDerivAt_log_log T (by linarith : (-1 : \u211d) < T)\n    have hz_inner : HasDerivAt (fun t => (t + 2) * Real.log (t + 2))\n        (Real.log (T + 2) + 1) T := by\n      have h := ((hasDerivAt_id' T).add_const 2).mul\n        (hasDerivAt_log_shift T (by linarith))\n      have e : (1 : \u211d) * Real.log (T + 2) + (T + 2) * (T + 2)\u207b\u00b9 =\n          Real.log (T + 2) + 1 := by\n        rw [mul_inv_cancel\u2080 (by linarith : (T + 2) \u2260 0)]; ring\n      rwa [e] at h\n    have hz : HasDerivAt (fun t => ((t + 2) * Real.log (t + 2))\u207b\u00b9)\n        (-(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2) T :=\n      hz_inner.inv (mul_ne_zero (by linarith) (ne_of_gt hL1))\n    have hv := (hasDerivAt_id' T).mul hz\n    have h := hu.add hv\n    have hT2' : (T + 2) \u2260 0 := by linarith\n    have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n    have e : (Real.log (T + 2))\u207b\u00b9 * (T + 2)\u207b\u00b9 +\n        ((1 : \u211d) * ((T + 2) * Real.log (T + 2))\u207b\u00b9 +\n          T * (-(Real.log (T + 2) + 1) / ((T + 2) * Real.log (T + 2)) ^ 2)) =\n        (T * (Real.log (T + 2) - 1) + 4 * Real.log (T + 2)) /\n          ((T + 2) * Real.log (T + 2)) ^ 2 := by\n      field_simp [hT2', hL1']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => t * Real.log (Real.log (t + 2))) T =\n      Real.log (Real.log (T + 2)) + T * ((T + 2) * Real.log (T + 2))\u207b\u00b9 :=\n    h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT2' : (T + 2) \u2260 0 := by linarith\n  have hL1' : Real.log (T + 2) \u2260 0 := ne_of_gt hL1\n  field_simp [hT1, hT2', hL1']\n  ring\n\n/-- [PROVED session 011] Block #6 sign: \u03c8 < 0 on the table range.\nReduction (D-057 #6): \u03c8 < 0 \u27f8 A(T\u22121) \u2264 T(T+2)L1 \u27f8 L1(T\u22124) \u2264 T(T\u22121)\n\u27f8 L1 \u2264 T+1 \u2264 T(T\u22121)/(T\u22124). -/\ntheorem psiOf_T_mul_log_log_shift_neg {T : \u211d} (hT : Real.sqrt 20 + 1 \u2264 T) :\n    psiOf (fun t => t * Real.log (Real.log (t + 2))) T < 0 := by\n  obtain \u27e8hT5, hL1b, hL2b\u27e9 := block_range_bounds hT\n  have h1T : 1 < T := by linarith\n  rw [psiOf_T_mul_log_log_shift T h1T]\n  have hT1 : (0 : \u211d) < T - 1 := by linarith\n  have hT2 : (0 : \u211d) < T + 2 := by linarith\n  have hL1 : (0 : \u211d) < Real.log (T + 2) := Real.log_pos (by linarith)\n  have hL2 : (0 : \u211d) < Real.log (Real.log (T + 2)) := by linarith\n  set L1 := Real.log (T + 2) with hL1def\n  set L2 := Real.log (Real.log (T + 2)) with hL2def\n  set D := (T + 2) * L1 with hDdef\n  have hD : (0 : \u211d) < D := mul_pos hT2 hL1\n  have hlog_le : L1 \u2264 T + 1 := by\n    have h := Real.log_le_sub_one_of_pos (x := T + 2) (by linarith)\n    linarith\n  have hstep : L1 * (T - 4) \u2264 T * (T - 1) := by\n    have h1 : L1 * (T - 4) \u2264 (T + 1) * (T - 4) :=\n      mul_le_mul_of_nonneg_right hlog_le (by linarith)\n    nlinarith\n  have hA : (T * (L1 - 1) + 4 * L1) * (T - 1) \u2264 T * D := by\n    have h2 : (T * (L1 - 1) + 4 * L1) * (T - 1) = T * (T + 2) * L1 - (T * (T - 1) -\n        L1 * (T - 4)) := by ring\n    rw [h2, hDdef]\n    nlinarith [hstep]\n  have hkey : (T * (L1 - 1) + 4 * L1) * (T - 1) - L2 * D ^ 2 - T * D < 0 := by\n    have h3 : (0 : \u211d) < L2 * D ^ 2 := mul_pos hL2 (pow_pos hD 2)\n    linarith [hA]\n  have hpsi : (T * (L1 - 1) + 4 * L1) / D ^ 2 - L2 / (T - 1) - T / (D * (T - 1)) =\n      ((T * (L1 - 1) + 4 * L1) * (T - 1) - L2 * D ^ 2 - T * D) /\n        (D ^ 2 * (T - 1)) := by\n    field_simp [hT1.ne', ne_of_gt hD]\n  rw [hpsi]\n  exact div_neg_of_neg_of_pos hkey (mul_pos (pow_pos hD 2) hT1)\n\n/-! ### The IIMaj (B\u0303\u2084) term (D-057 \u00a73) -/\n\n/-- Decay rate a = 2 log 2 \u2212 1/2 \u2248 0.8863. -/\nprivate def iimA : \u211d := 2 * Real.log 2 - 1 / 2\n\n/-- Decay rate b = 2 log 2 \u2248 1.3863. -/\nprivate def iimB : \u211d := 2 * Real.log 2\n\n/-- The IIMaj term as a function of s = \u221an: 4.56\u00b7(s+1)\u00b7(e^{\u2212as} + e^{\u2212bs}). -/\nprivate def psiTilde (s : \u211d) : \u211d :=\n  4.56 * ((s + 1) * (Real.exp (-iimA * s) + Real.exp (-iimB * s)))\n\n/-- [PROVED session 011] IIMaj n = \u03c8\u0303(\u221an): the rpow/exp bookkeeping. -/\ntheorem IIMaj_eq_psiTilde_sqrt (n : \u211d) :\n    IIMaj n = psiTilde (Real.sqrt n) := by\n  have hrw : (2 : \u211d) ^ (-(2 * Real.sqrt n - 2)) =\n      4 * Real.exp (-(2 * Real.log 2) * Real.sqrt n) := by\n    rw [show (-(2 * Real.sqrt n - 2) : \u211d) = 2 + -(2 * Real.sqrt n) by ring,\n      Real.rpow_add (by norm_num : (0 : \u211d) < 2)]\n    have e2 : (2 : \u211d) ^ (-(2 * Real.sqrt n)) =\n        Real.exp (-(2 * Real.log 2) * Real.sqrt n) := by\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    have e1 : (2 : \u211d) ^ (2 : \u211d) = 4 := by\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2),\n        show Real.log 2 * 2 = Real.log (2 ^ 2) by rw [Real.log_pow]; ring,\n        Real.exp_log (by norm_num : (0 : \u211d) < 2 ^ 2)]\n      norm_num\n    rw [e2, e1]\n  have hEA : Real.exp (Real.sqrt n / 2) * Real.exp (-(2 * Real.log 2) * Real.sqrt n) =\n      Real.exp (-(2 * Real.log 2 - 1 / 2) * Real.sqrt n) := by\n    rw [\u2190 Real.exp_add]\n    congr 1\n    ring\n  unfold IIMaj psiTilde iimA iimB\n  rw [hrw,\n    show 2 * (Real.sqrt n + 1) * (Real.exp (Real.sqrt n / 2) + 1) * 0.57 *\n        (4 * Real.exp (-(2 * Real.log 2) * Real.sqrt n)) =\n      4.56 * ((Real.sqrt n + 1) *\n        ((Real.exp (Real.sqrt n / 2) + 1) * Real.exp (-(2 * Real.log 2) * Real.sqrt n))) by ring,\n    show (Real.exp (Real.sqrt n / 2) + 1) * Real.exp (-(2 * Real.log 2) * Real.sqrt n) =\n      Real.exp (Real.sqrt n / 2) * Real.exp (-(2 * Real.log 2) * Real.sqrt n) +\n        Real.exp (-(2 * Real.log 2) * Real.sqrt n) by ring,\n    hEA]\n\n/-- [PROVED session 012] Crude global upper bound on the I_I majorant:\nIIMaj n \u2264 4.56\u00b7(\u221an+1)\u00b72 for n \u2265 0 (both exponentials \u2264 1). Consumed by\nthe base-point numerics (LiBasePoints); the slack is absorbed by the\nmargin. -/\ntheorem IIMaj_le_two_mul (n : \u211d) (_hn : 0 \u2264 n) :\n    IIMaj n \u2264 4.56 * (Real.sqrt n + 1) * 2 := by\n  rw [IIMaj_eq_psiTilde_sqrt]\n  unfold psiTilde\n  have hlog2 := Real.log_two_gt_d9\n  have ha : (0 : \u211d) < iimA := by unfold iimA; linarith\n  have hb : (0 : \u211d) < iimB := by unfold iimB; linarith\n  have hs : (0 : \u211d) \u2264 Real.sqrt n := Real.sqrt_nonneg n\n  have heA : Real.exp (-iimA * Real.sqrt n) \u2264 1 := by\n    rw [Real.exp_le_one_iff]\n    exact mul_nonpos_of_nonpos_of_nonneg (by linarith) hs\n  have heB : Real.exp (-iimB * Real.sqrt n) \u2264 1 := by\n    rw [Real.exp_le_one_iff]\n    exact mul_nonpos_of_nonpos_of_nonneg (by linarith) hs\n  have hpos : (0 : \u211d) \u2264 Real.sqrt n + 1 := by linarith\n  calc 4.56 * ((Real.sqrt n + 1) *\n          (Real.exp (-iimA * Real.sqrt n) + Real.exp (-iimB * Real.sqrt n)))\n      \u2264 4.56 * ((Real.sqrt n + 1) * (1 + 1)) := by\n        apply mul_le_mul_of_nonneg_left _ (by norm_num : (0 : \u211d) \u2264 4.56)\n        apply mul_le_mul_of_nonneg_left _ hpos\n        linarith [heA, heB]\n    _ = 4.56 * (Real.sqrt n + 1) * 2 := by ring\n\n/-- [PROVED session 012] IIMaj is nonnegative. -/\ntheorem IIMaj_nonneg (n : \u211d) : 0 \u2264 IIMaj n := by\n  unfold IIMaj\n  apply mul_nonneg; apply mul_nonneg; apply mul_nonneg; apply mul_nonneg\n  \u00b7 norm_num\n  \u00b7 linarith [Real.sqrt_nonneg n]\n  \u00b7 have h := Real.exp_pos (Real.sqrt n / 2)\n    linarith\n  \u00b7 norm_num\n  \u00b7 exact Real.rpow_nonneg (by norm_num) _\n\n/-- [PROVED session 011] \u03c8\u0303 is globally C\u00b2 (polynomial \u00d7 exponentials). -/\ntheorem psiTilde_contDiff : ContDiff \u211d 2 psiTilde := by\n  unfold psiTilde iimA iimB\n  exact contDiff_const.mul\n    ((contDiff_id.add contDiff_const).mul\n      ((contDiff_const.mul contDiff_id).exp.add (contDiff_const.mul contDiff_id).exp))\n\n/-- [PROVED session 011] \u03c8\u0303\u2032 in closed form (per-point, global). -/\ntheorem hasDerivAt_psiTilde (x : \u211d) :\n    HasDerivAt psiTilde\n      (4.56 * ((Real.exp (-iimA * x) + Real.exp (-iimB * x)) +\n        (x + 1) * (-iimA * Real.exp (-iimA * x) - iimB * Real.exp (-iimB * x)))) x := by\n  unfold psiTilde iimA iimB\n  have hu : HasDerivAt (fun t => t + 1) 1 x := (hasDerivAt_id' x).add_const 1\n  have hva : HasDerivAt (fun t => Real.exp (-(2 * Real.log 2 - 1 / 2) * t))\n      (Real.exp (-(2 * Real.log 2 - 1 / 2) * x) * (-(2 * Real.log 2 - 1 / 2))) x := by\n    have h := ((hasDerivAt_id' x).const_mul (-(2 * Real.log 2 - 1 / 2))).exp\n    rwa [mul_one] at h\n  have hvb : HasDerivAt (fun t => Real.exp (-(2 * Real.log 2) * t))\n      (Real.exp (-(2 * Real.log 2) * x) * (-(2 * Real.log 2))) x := by\n    have h := ((hasDerivAt_id' x).const_mul (-(2 * Real.log 2))).exp\n    rwa [mul_one] at h\n  have h := (hu.mul (hva.add hvb)).const_mul 4.56\n  simp only [Pi.add_apply, Pi.mul_apply] at h\n  convert h using 2 <;> first | rfl | ring\n\n/-- [PROVED session 011] deriv \u03c8\u0303 = the closed D1 form. -/\ntheorem deriv_psiTilde (x : \u211d) :\n    deriv psiTilde x =\n      4.56 * ((Real.exp (-iimA * x) + Real.exp (-iimB * x)) +\n        (x + 1) * (-iimA * Real.exp (-iimA * x) - iimB * Real.exp (-iimB * x))) :=\n  (hasDerivAt_psiTilde x).deriv\n\n/-- [PROVED session 011] \u03c8\u0303\u2033 in closed form. -/\ntheorem deriv2_psiTilde (x : \u211d) :\n    deriv (deriv psiTilde) x =\n      4.56 * (2 * (-iimA * Real.exp (-iimA * x) - iimB * Real.exp (-iimB * x)) +\n        (x + 1) * (iimA ^ 2 * Real.exp (-iimA * x) +\n          iimB ^ 2 * Real.exp (-iimB * x))) := by\n  have h1 : \u2200\u1da0 y in \ud835\udcdd x, HasDerivAt psiTilde\n      (4.56 * ((Real.exp (-iimA * y) + Real.exp (-iimB * y)) +\n        (y + 1) * (-iimA * Real.exp (-iimA * y) - iimB * Real.exp (-iimB * y)))) y := by\n    filter_upwards [] with y\n    exact hasDerivAt_psiTilde y\n  have h2 : HasDerivAt\n      (fun t => 4.56 * ((Real.exp (-iimA * t) + Real.exp (-iimB * t)) +\n        (t + 1) * (-iimA * Real.exp (-iimA * t) - iimB * Real.exp (-iimB * t))))\n      (4.56 * (2 * (-iimA * Real.exp (-iimA * x) - iimB * Real.exp (-iimB * x)) +\n        (x + 1) * (iimA ^ 2 * Real.exp (-iimA * x) +\n          iimB ^ 2 * Real.exp (-iimB * x)))) x := by\n    unfold iimA iimB\n    have hu : HasDerivAt (fun t => t + 1) 1 x := (hasDerivAt_id' x).add_const 1\n    have hva : HasDerivAt (fun t => Real.exp (-(2 * Real.log 2 - 1 / 2) * t))\n        (Real.exp (-(2 * Real.log 2 - 1 / 2) * x) * (-(2 * Real.log 2 - 1 / 2))) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-(2 * Real.log 2 - 1 / 2))).exp\n      rwa [mul_one] at h\n    have hvb : HasDerivAt (fun t => Real.exp (-(2 * Real.log 2) * t))\n        (Real.exp (-(2 * Real.log 2) * x) * (-(2 * Real.log 2))) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-(2 * Real.log 2))).exp\n      rwa [mul_one] at h\n    have hw := hva.add hvb\n    have hg := (hva.const_mul (-(2 * Real.log 2 - 1 / 2))).sub\n      (hvb.const_mul (2 * Real.log 2))\n    have hz := hu.mul hg\n    have h := (hw.add hz).const_mul 4.56\n    simp only [Pi.add_apply, Pi.mul_apply, Pi.sub_apply] at h\n    convert h using 2 <;> first | rfl | ring\n  exact deriv2_of_hasDerivAt_nhds h1 h2\n\n/-- [PROVED session 011] u\u2082(t) = (b\u00b2t+b)\u00b7e^{\u2212at} is antitone on [\u221a20, \u221e):\nits derivative is e^{\u2212at}\u00b7(b\u00b2 \u2212 a(b\u00b2t+b)) and a(b\u00b2t+b) \u2265 8.846 > b\u00b2 there. -/\ntheorem iim_u2_antitone :\n    AntitoneOn (fun t => (iimB ^ 2 * t + iimB) * Real.exp (-iimA * t))\n      (Set.Ici (Real.sqrt 20)) := by\n  have hCD : ContDiff \u211d 2 (fun t => (iimB ^ 2 * t + iimB) * Real.exp (-iimA * t)) := by\n    unfold iimA iimB\n    exact ((contDiff_const.mul contDiff_id).add contDiff_const).mul\n      ((contDiff_const.mul contDiff_id).exp)\n  have hder : \u2200 x : \u211d,\n      HasDerivAt (fun t => (iimB ^ 2 * t + iimB) * Real.exp (-iimA * t))\n        (Real.exp (-iimA * x) * (iimB ^ 2 - iimA * (iimB ^ 2 * x + iimB))) x := by\n    intro x\n    have hp : HasDerivAt (fun t => iimB ^ 2 * t + iimB) (iimB ^ 2 * 1) x :=\n      ((hasDerivAt_id' x).const_mul (iimB ^ 2)).add_const iimB\n    have he : HasDerivAt (fun t => Real.exp (-iimA * t))\n        (Real.exp (-iimA * x) * (-iimA * 1)) x :=\n      ((hasDerivAt_id' x).const_mul (-iimA)).exp\n    have h := hp.mul he\n    have e : iimB ^ 2 * 1 * Real.exp (-iimA * x) + (iimB ^ 2 * x + iimB) *\n        (Real.exp (-iimA * x) * (-iimA * 1)) =\n        Real.exp (-iimA * x) * (iimB ^ 2 - iimA * (iimB ^ 2 * x + iimB)) := by ring\n    rw [e] at h\n    exact h\n  apply antitoneOn_of_deriv_nonpos (convex_Ici _)\n  \u00b7 exact hCD.continuous.continuousOn\n  \u00b7 exact (hCD.differentiable (by norm_num)).differentiableOn.mono interior_subset\n  \u00b7 intro x hx\n    rw [interior_Ici] at hx\n    have hxs : Real.sqrt 20 < x := Set.mem_Ioi.mp hx\n    have hlog2lo := Real.log_two_gt_d9\n    have hlog2hi := Real.log_two_lt_d9\n    have ha : (0.8862943606 : \u211d) \u2264 iimA := by unfold iimA; linarith\n    have hblo : (1.3862943606 : \u211d) \u2264 iimB := by unfold iimB; linarith\n    have hb : iimB \u2264 (1.3862943616 : \u211d) := by unfold iimB; linarith\n    have hbpos : (0 : \u211d) < iimB := by linarith\n    have hapos : (0 : \u211d) < iimA := by linarith\n    have hb2lo : (1.9218 : \u211d) \u2264 iimB ^ 2 := by nlinarith [hblo]\n    have hb2up : iimB ^ 2 \u2264 (1.92182 : \u211d) := by nlinarith [hb, hbpos]\n    have hx4 : (4.4721 : \u211d) \u2264 x := by\n      have h : (4.4721 : \u211d) \u2264 Real.sqrt 20 := by\n        rw [Real.le_sqrt (by norm_num) (by norm_num)]; norm_num\n      linarith\n    have hbig : (8.8458 : \u211d) \u2264 iimA * (iimB ^ 2 * x + iimB) := by\n      have hb2x : (9.9807 : \u211d) \u2264 iimB ^ 2 * x + iimB := by\n        have h1 : (1.9218 : \u211d) * 4.4721 \u2264 iimB ^ 2 * x :=\n          mul_le_mul hb2lo hx4 (by norm_num) (sq_nonneg iimB)\n        nlinarith [hblo]\n      calc (8.8458 : \u211d) \u2264 0.8862943606 * 9.9807 := by norm_num\n        _ \u2264 iimA * (iimB ^ 2 * x + iimB) := mul_le_mul ha hb2x (by norm_num) hapos.le\n    rw [(hder x).deriv]\n    have h : iimB ^ 2 - iimA * (iimB ^ 2 * x + iimB) \u2264 0 := by linarith\n    exact mul_nonpos_of_nonneg_of_nonpos (Real.exp_pos _).le h\n\nset_option maxHeartbeats 800000 in\n/-- [PROVED session 011] The B\u0303\u2084 bracket bound (D-057 \u00a73): for s \u2265 \u221a20,\n\u03c8\u0303\u2033(s) \u2212 \u03c8\u0303\u2032(s)/s < 2. Factor-monotone argument: the bound splits as\n4.56\u00b7[(s+1)/s]\u00b7[(b\u00b2s+b)e^{\u2212as}]\u00b7[1+e^{\u2212s/2}], three positive decreasing\nfactors; at s = \u221a20 the product is \u2264 1.316 < 2. -/\ntheorem iimaj_bracket_bound {s : \u211d} (hs : Real.sqrt 20 \u2264 s) :\n    4.56 * (2 * (-iimA * Real.exp (-iimA * s) - iimB * Real.exp (-iimB * s)) +\n        (s + 1) * (iimA ^ 2 * Real.exp (-iimA * s) +\n          iimB ^ 2 * Real.exp (-iimB * s))) -\n      (4.56 * ((Real.exp (-iimA * s) + Real.exp (-iimB * s)) +\n        (s + 1) * (-iimA * Real.exp (-iimA * s) -\n          iimB * Real.exp (-iimB * s)))) / s < 2 := by\n  unfold iimA iimB\n  set L := Real.log 2 with hLdef\n  set a : \u211d := 2 * L - 1 / 2 with hadef\n  set b : \u211d := 2 * L with hbdef\n  set eA := Real.exp (-a * s) with heAdef\n  set eB := Real.exp (-b * s) with heBdef\n  have hlog2lo := Real.log_two_gt_d9\n  have hlog2hi := Real.log_two_lt_d9\n  rw [\u2190 hLdef] at hlog2lo hlog2hi\n  have ha : (0.8862943606 : \u211d) \u2264 a := by rw [hadef]; linarith\n  have haup : a \u2264 (0.8862943616 : \u211d) := by rw [hadef]; linarith\n  have hblo : (1.3862943606 : \u211d) \u2264 b := by rw [hbdef]; linarith\n  have hb : b \u2264 (1.3862943616 : \u211d) := by rw [hbdef]; linarith\n  have hab : a \u2264 b := by rw [hadef, hbdef]; linarith\n  have hapos : (0 : \u211d) < a := by linarith\n  have hbpos : (0 : \u211d) < b := by linarith\n  have hsqrtlo : (4.4721 : \u211d) \u2264 Real.sqrt 20 := by\n    rw [Real.le_sqrt (by norm_num) (by norm_num)]; norm_num\n  have hsqrthi : Real.sqrt 20 \u2264 (4.4722 : \u211d) := by\n    have h : Real.sqrt 20 \u2264 Real.sqrt (4.4722 ^ 2) :=\n      Real.sqrt_le_sqrt (by norm_num)\n    rwa [Real.sqrt_sq (by norm_num)] at h\n  have hs0 : (0 : \u211d) < s := by linarith [Real.sqrt_nonneg 20]\n  have hs4 : (4.4721 : \u211d) \u2264 s := by linarith\n  have hs4' : s \u2264 s := le_refl s\n  have heA : (0 : \u211d) < eA := Real.exp_pos _\n  have heB : (0 : \u211d) < eB := Real.exp_pos _\n  -- step 1: drop the two negative terms\n  have hstep1 :\n      4.56 * (2 * (-a * eA - b * eB) + (s + 1) * (a ^ 2 * eA + b ^ 2 * eB)) -\n        (4.56 * ((eA + eB) + (s + 1) * (-a * eA - b * eB))) / s \u2264\n      4.56 * ((s + 1) * (a ^ 2 * eA + b ^ 2 * eB) +\n        (s + 1) * (a * eA + b * eB) / s) := by\n    have hd1 : 2 * (-a * eA - b * eB) \u2264 0 := by\n      nlinarith [mul_nonneg hapos.le heA.le, mul_nonneg hbpos.le heB.le]\n    have hd2 : -((eA + eB) / s) \u2264 0 := by\n      have h : (0 : \u211d) \u2264 (eA + eB) / s :=\n        div_nonneg (add_nonneg heA.le heB.le) hs0.le\n      linarith\n    have hsf : (4.56 * ((eA + eB) + (s + 1) * (-a * eA - b * eB))) / s =\n        4.56 * ((eA + eB) / s + (s + 1) * (-a * eA - b * eB) / s) := by\n      field_simp [hs0.ne']\n    rw [hsf]\n    have hsf2 : (s + 1) * (-a * eA - b * eB) / s = -((s + 1) * (a * eA + b * eB) / s) := by\n      field_simp [hs0.ne']\n      ring\n    rw [hsf2]\n    linarith\n  -- step 2: factor out b\u00b2 and b/s termwise\n  have hstep2 :\n      4.56 * ((s + 1) * (a ^ 2 * eA + b ^ 2 * eB) +\n          (s + 1) * (a * eA + b * eB) / s) \u2264\n      4.56 * (s + 1) * (b ^ 2 + b / s) * (eA + eB) := by\n    have hsq : a ^ 2 \u2264 b ^ 2 := by nlinarith [hab, hapos]\n    have h1 : a ^ 2 * eA + b ^ 2 * eB \u2264 b ^ 2 * (eA + eB) := by\n      nlinarith [mul_le_mul_of_nonneg_right hsq heA.le]\n    have h2 : (a * eA + b * eB) / s \u2264 b * (eA + eB) / s := by\n      have h := add_le_add (mul_le_mul_of_nonneg_right hab heA.le) (le_refl (b * eB))\n      have h' : a * eA + b * eB \u2264 b * (eA + eB) := by nlinarith [h]\n      gcongr\n    have m1 : (s + 1) * (a ^ 2 * eA + b ^ 2 * eB) \u2264 (s + 1) * (b ^ 2 * (eA + eB)) :=\n      mul_le_mul_of_nonneg_left h1 (by linarith)\n    have m2 : (s + 1) * (a * eA + b * eB) / s \u2264 (s + 1) * (b * (eA + eB)) / s := by\n      have h3 := mul_le_mul_of_nonneg_left h2 (show (0 : \u211d) \u2264 s + 1 by linarith)\n      rwa [\u2190 mul_div_assoc, \u2190 mul_div_assoc] at h3\n    have e3 : 4.56 * (s + 1) * (b ^ 2 + b / s) * (eA + eB) =\n        4.56 * ((s + 1) * (b ^ 2 * (eA + eB)) + (s + 1) * (b * (eA + eB)) / s) := by\n      field_simp [hs0.ne']\n    rw [e3]\n    exact mul_le_mul_of_nonneg_left (add_le_add m1 m2) (by norm_num)\n  -- step 3: the three-factor split\n  have hstep3 :\n      4.56 * (s + 1) * (b ^ 2 + b / s) * (eA + eB) =\n      4.56 * ((s + 1) / s) * ((b ^ 2 * s + b) * eA) * (1 + Real.exp (-s / 2)) := by\n    have heB' : eB = eA * Real.exp (-s / 2) := by\n      rw [heBdef, heAdef, \u2190 Real.exp_add]\n      congr 1\n      rw [hadef, hbdef]\n      ring\n    rw [heB']\n    field_simp [hs0.ne']\n  -- step 4: the three monotone factors at s = \u221a20\n  have hu1 : (s + 1) / s \u2264 (1.2237 : \u211d) := by\n    have h1 : (1 : \u211d) / s \u2264 1 / 4.4721 := one_div_le_one_div_of_le (by norm_num) hs4\n    have h2 : (1 : \u211d) / 4.4721 \u2264 0.2237 := by\n      rw [div_le_iff\u2080 (by norm_num : (0 : \u211d) < 4.4721)]\n      norm_num\n    have h3 : (s + 1) / s = 1 + 1 / s := by field_simp [hs0.ne']\n    rw [h3]\n    linarith\n  have hu2fac : (b ^ 2 * s + b) * eA \u2264 (0.2124 : \u211d) := by\n    have hAid : iimA = a := by unfold iimA; rw [\u2190 hLdef, \u2190 hadef]\n    have hBid : iimB = b := by unfold iimB; rw [\u2190 hLdef, \u2190 hbdef]\n    have hanti := iim_u2_antitone\n    rw [hAid, hBid] at hanti\n    have hu2le : (b ^ 2 * s + b) * Real.exp (-a * s) \u2264\n        (b ^ 2 * Real.sqrt 20 + b) * Real.exp (-a * Real.sqrt 20) :=\n      hanti (Set.mem_Ici.mpr (le_refl _)) (Set.mem_Ici.mpr hs) hs\n    have hu2val : (b ^ 2 * Real.sqrt 20 + b) * Real.exp (-a * Real.sqrt 20) \u2264\n        (0.2124 : \u211d) := by\n      have hb2up : b ^ 2 \u2264 (1.92182 : \u211d) := by nlinarith [hb, hbpos]\n      have hexp : Real.exp (-a * Real.sqrt 20) \u2264 (0.0212766 : \u211d) := by\n        have ht : (3.9635 : \u211d) \u2264 a * Real.sqrt 20 := by\n          calc (3.9635 : \u211d) \u2264 0.8862943606 * 4.4721 := by norm_num\n            _ \u2264 a * Real.sqrt 20 :=\n              mul_le_mul ha hsqrtlo (by norm_num) hapos.le\n        have hsum : (47 : \u211d) \u2264 Real.exp (a * Real.sqrt 20) := by\n          have h1 := Real.sum_le_exp_of_nonneg (x := (3.9635 : \u211d)) (by norm_num) 7\n          have h2 : Real.exp (3.9635 : \u211d) \u2264 Real.exp (a * Real.sqrt 20) :=\n            Real.exp_le_exp.mpr ht\n          have h3 : (47 : \u211d) \u2264 \u2211 i \u2208 Finset.range 7,\n              (3.9635 : \u211d) ^ i / (Nat.factorial i : \u211d) := by\n            norm_num [Finset.sum_range_succ]\n          linarith\n        rw [show -a * Real.sqrt 20 = -(a * Real.sqrt 20) by ring, Real.exp_neg]\n        calc (Real.exp (a * Real.sqrt 20))\u207b\u00b9 \u2264 1 / 47 := by\n              rw [\u2190 one_div]\n              exact one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 47) hsum\n          _ \u2264 0.0212766 := by\n              rw [div_le_iff\u2080 (by norm_num : (0 : \u211d) < 47)]; norm_num\n      have hpoly : b ^ 2 * Real.sqrt 20 + b \u2264 (9.9811 : \u211d) := by\n        have h1 : b ^ 2 * Real.sqrt 20 \u2264 1.92182 * 4.4722 :=\n          mul_le_mul hb2up hsqrthi (Real.sqrt_nonneg 20) (by norm_num)\n        linarith\n      exact le_trans (mul_le_mul hpoly hexp (Real.exp_pos _).le (by norm_num))\n        (by norm_num)\n    calc (b ^ 2 * s + b) * eA = (b ^ 2 * s + b) * Real.exp (-a * s) := rfl\n      _ \u2264 (b ^ 2 * Real.sqrt 20 + b) * Real.exp (-a * Real.sqrt 20) := hu2le\n      _ \u2264 0.2124 := hu2val\n  have hu3 : 1 + Real.exp (-s / 2) \u2264 (1.1099 : \u211d) := by\n    have hexp : Real.exp (-s / 2) \u2264 (0.10982 : \u211d) := by\n      have ht : (2.23605 : \u211d) \u2264 s / 2 := by linarith\n      have hsum : (9.1064 : \u211d) \u2264 Real.exp (s / 2) := by\n        have h1 := Real.sum_le_exp_of_nonneg (x := (2.23605 : \u211d)) (by norm_num) 6\n        have h2 : Real.exp (2.23605 : \u211d) \u2264 Real.exp (s / 2) := Real.exp_le_exp.mpr ht\n        have h3 : (9.1064 : \u211d) \u2264 \u2211 i \u2208 Finset.range 6,\n            (2.23605 : \u211d) ^ i / (Nat.factorial i : \u211d) := by\n          norm_num [Finset.sum_range_succ]\n        linarith\n      rw [show -s / 2 = -(s / 2) by ring, Real.exp_neg]\n      calc (Real.exp (s / 2))\u207b\u00b9 \u2264 1 / 9.1064 := by\n            rw [\u2190 one_div]\n            exact one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 9.1064) hsum\n        _ \u2264 0.10982 := by\n            rw [div_le_iff\u2080 (by norm_num : (0 : \u211d) < 9.1064)]; norm_num\n    linarith\n  -- final assembly\n  have hpos1 : (0 : \u211d) \u2264 (b ^ 2 * s + b) * eA :=\n    mul_nonneg (by nlinarith [hbpos, hs0, sq_nonneg b]) heA.le\n  have hpos2 : (0 : \u211d) \u2264 1 + Real.exp (-s / 2) := by positivity\n  have hpos3 : (0 : \u211d) \u2264 (s + 1) / s := by positivity\n  have hchain : 4.56 * ((s + 1) / s) * ((b ^ 2 * s + b) * eA) * (1 + Real.exp (-s / 2)) \u2264\n      4.56 * 1.2237 * 0.2124 * 1.1099 := by\n    have h1 : ((s + 1) / s) * ((b ^ 2 * s + b) * eA) \u2264 1.2237 * 0.2124 :=\n      mul_le_mul hu1 hu2fac hpos1 (by norm_num)\n    have h2 : ((s + 1) / s) * ((b ^ 2 * s + b) * eA) * (1 + Real.exp (-s / 2)) \u2264\n        1.2237 * 0.2124 * 1.1099 :=\n      mul_le_mul h1 hu3 hpos2 (by positivity)\n    have h3 := mul_le_mul_of_nonneg_left h2 (by norm_num : (0 : \u211d) \u2264 4.56)\n    have e : (4.56 : \u211d) * (((s + 1) / s) * ((b ^ 2 * s + b) * eA) *\n        (1 + Real.exp (-s / 2))) =\n        4.56 * ((s + 1) / s) * ((b ^ 2 * s + b) * eA) * (1 + Real.exp (-s / 2)) := by ring\n    have e' : (4.56 : \u211d) * (1.2237 * 0.2124 * 1.1099) = 4.56 * 1.2237 * 0.2124 * 1.1099 := by ring\n    rwa [e, e'] at h3\n  calc 4.56 * (2 * (-a * eA - b * eB) + (s + 1) * (a ^ 2 * eA + b ^ 2 * eB)) -\n          (4.56 * ((eA + eB) + (s + 1) * (-a * eA - b * eB))) / s\n      \u2264 4.56 * (s + 1) * (b ^ 2 + b / s) * (eA + eB) := le_trans hstep1 hstep2\n    _ = 4.56 * ((s + 1) / s) * ((b ^ 2 * s + b) * eA) * (1 + Real.exp (-s / 2)) := hstep3\n    _ \u2264 4.56 * 1.2237 * 0.2124 * 1.1099 := hchain\n    _ < 2 := by norm_num\n\n/-! ### Assembly: regularity bundles -/\n\n/-- [PROVED session 011] The blocks are C\u00b2 on (\u22121, \u221e) (all\nL1/L2-singularities lie at T \u2264 \u22121). -/\ntheorem contDiffOn_L1 : ContDiffOn \u211d 2 (fun t => Real.log (t + 2)) (Set.Ioi (-1)) :=\n  (contDiffOn_id.add contDiffOn_const).log (fun x hx => by\n    have h : -1 < x := hx\n    exact ne_of_gt (by linarith : (0 : \u211d) < x + 2))\n\ntheorem contDiffOn_L2 :\n    ContDiffOn \u211d 2 (fun t => Real.log (Real.log (t + 2))) (Set.Ioi (-1)) :=\n  contDiffOn_L1.log (fun x hx => by\n    have h : -1 < x := hx\n    exact ne_of_gt (Real.log_pos (by linarith : (1 : \u211d) < x + 2)))\n\ntheorem contDiffOn_L1sq :\n    ContDiffOn \u211d 2 (fun t => Real.log (t + 2) ^ 2) (Set.Ioi (-1)) :=\n  contDiffOn_L1.pow 2\n\ntheorem contDiffOn_L1L2 : ContDiffOn \u211d 2\n    (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2))) (Set.Ioi (-1)) :=\n  contDiffOn_L1.mul contDiffOn_L2\n\ntheorem contDiffOn_L2sq :\n    ContDiffOn \u211d 2 (fun t => Real.log (Real.log (t + 2)) ^ 2) (Set.Ioi (-1)) :=\n  contDiffOn_L2.pow 2\n\ntheorem contDiffOn_TL1 :\n    ContDiffOn \u211d 2 (fun t => t * Real.log (t + 2)) (Set.Ioi (-1)) :=\n  contDiffOn_id.mul contDiffOn_L1\n\ntheorem contDiffOn_TL2 :\n    ContDiffOn \u211d 2 (fun t => t * Real.log (Real.log (t + 2))) (Set.Ioi (-1)) :=\n  contDiffOn_id.mul contDiffOn_L2\n\n/-- [PROVED session 011] T(m) = \u221am + 1 is C\u00b2 on (20, \u221e) and maps it\ninto (\u22121, \u221e). -/\ntheorem contDiffOn_sqrt_shift :\n    ContDiffOn \u211d 2 (fun m => Real.sqrt m + 1) (Set.Ioi 20) :=\n  (contDiffOn_id.sqrt (fun x hx => by\n    have h : 20 < x := hx\n    exact ne_of_gt (by linarith : (0 : \u211d) < x))).add contDiffOn_const\n\ntheorem mapsTo_sqrt_shift :\n    Set.MapsTo (fun m => Real.sqrt m + 1) (Set.Ioi 20) (Set.Ioi (-1)) := by\n  intro x hx\n  have h : 20 < x := hx\n  have hnn := Real.sqrt_nonneg x\n  exact Set.mem_Ioi.mpr (by linarith)\n\n/-- [PROVED session 012] \u221am + 1 maps (20, \u221e) into (1, \u221e) (the FAlt\ndomain). -/\ntheorem mapsTo_sqrt_shift_Ioi1 :\n    Set.MapsTo (fun m => Real.sqrt m + 1) (Set.Ioi 20) (Set.Ioi 1) := by\n  intro x hx\n  have h : 20 < x := hx\n  have hpos := Real.sqrt_pos.mpr (by linarith : (0 : \u211d) < x)\n  exact Set.mem_Ioi.mpr (by linarith)\n\n/-- [PROVED session 012] \u221am + 1 maps [20, \u221e) into (1, \u221e). -/\ntheorem mapsTo_sqrt_shift_Ici_Ioi1 :\n    Set.MapsTo (fun m => Real.sqrt m + 1) (Set.Ici 20) (Set.Ioi 1) := by\n  intro x hx\n  have h : 20 \u2264 x := hx\n  have hpos := Real.sqrt_pos.mpr (by linarith : (0 : \u211d) < x)\n  exact Set.mem_Ioi.mpr (by linarith)\n\n/-- [PROVED session 011] psiOf at T = \u221an + 1 in the chain-rule form\n(with T \u2212 1 = \u221an). -/\ntheorem psiOf_sqrt_rel (\u03c6 : \u211d \u2192 \u211d) (n : \u211d) :\n    psiOf \u03c6 (Real.sqrt n + 1) =\n      deriv (deriv \u03c6) (Real.sqrt n + 1) - deriv \u03c6 (Real.sqrt n + 1) / Real.sqrt n := by\n  unfold psiOf\n  rw [show Real.sqrt n + 1 - 1 = Real.sqrt n by ring]\n\n/-- [PROVED session 011] Second derivative of a sum (needs first-deriv\ndifferentiability at n and eventual differentiability near n). -/\ntheorem deriv2_add {f g : \u211d \u2192 \u211d} {n : \u211d}\n    (hf1 : DifferentiableAt \u211d (deriv f) n) (hg1 : DifferentiableAt \u211d (deriv g) n)\n    (hf2 : \u2200\u1da0 m in \ud835\udcdd n, DifferentiableAt \u211d f m)\n    (hg2 : \u2200\u1da0 m in \ud835\udcdd n, DifferentiableAt \u211d g m) :\n    deriv (deriv fun x => f x + g x) n = deriv (deriv f) n + deriv (deriv g) n := by\n  have he : deriv (fun x => f x + g x) =\u1da0[\ud835\udcdd n] (fun m => deriv f m + deriv g m) := by\n    filter_upwards [hf2, hg2] with m hfm hgm\n    exact deriv_add hfm hgm\n  have h2 := (hf1.add hg1).hasDerivAt\n  rw [deriv_add hf1 hg1] at h2\n  exact (h2.congr_of_eventuallyEq he).deriv\n\n/-- [PROVED session 011] Second derivative of a constant multiple. -/\ntheorem deriv2_const_mul {f : \u211d \u2192 \u211d} {n : \u211d} (c : \u211d)\n    (hf1 : DifferentiableAt \u211d (deriv f) n)\n    (hf2 : \u2200\u1da0 m in \ud835\udcdd n, DifferentiableAt \u211d f m) :\n    deriv (deriv (fun m => c * f m)) n = c * deriv (deriv f) n := by\n  have he : deriv (fun m => c * f m) =\u1da0[\ud835\udcdd n] (fun m => c * deriv f m) := by\n    filter_upwards [hf2] with m hfm\n    exact deriv_const_mul c hfm\n  have h2 := (hf1.const_mul c).hasDerivAt\n  rw [deriv_const_mul c hf1] at h2\n  exact (h2.congr_of_eventuallyEq he).deriv\n\n/-- [PROVED session 011] Second derivative of a constant function. -/\ntheorem deriv2_const_val (K n : \u211d) : deriv (deriv fun _ => K) n = 0 := by\n  have h1 : \u2200\u1da0 m in \ud835\udcdd n, HasDerivAt (fun _ => K) 0 m := by\n    filter_upwards [] with m\n    exact hasDerivAt_const m K\n  exact deriv2_of_hasDerivAt_nhds h1 (hasDerivAt_const n 0)\n\n/-- [PROVED session 011] Per-point first derivative of the S-function. -/\ntheorem hasDerivAt_marginS (c : \u211d) {m : \u211d} (hm : 0 < m) :\n    HasDerivAt (fun m => (1 / 2) * m * Real.log m + c * m - 4)\n      ((1 / 2) * (Real.log m + 1) + c) m := by\n  have hlog : HasDerivAt Real.log m\u207b\u00b9 m := Real.hasDerivAt_log (ne_of_gt hm)\n  have hml := ((hasDerivAt_id' m).const_mul (1 / 2)).mul hlog\n  have h := (hml.add ((hasDerivAt_id' m).const_mul c)).sub_const 4\n  have hm0 : m \u2260 0 := ne_of_gt hm\n  convert h using 2 <;> first | rfl | field_simp [hm0]\n\n/-- [PROVED session 011] Second derivative of the S-function: S\u2033 = 1/(2n). -/\ntheorem marginS_deriv2 (c : \u211d) {n : \u211d} (hn : 0 < n) :\n    deriv (deriv fun m => (1 / 2) * m * Real.log m + c * m - 4) n =\n      1 / (2 * n) := by\n  have h1 : \u2200\u1da0 m in \ud835\udcdd n, HasDerivAt (fun m => (1 / 2) * m * Real.log m + c * m - 4)\n      ((1 / 2) * (Real.log m + 1) + c) m := by\n    filter_upwards [eventually_gt_nhds hn] with m hm\n    exact hasDerivAt_marginS c hm\n  have h2 : HasDerivAt (fun m => (1 / 2) * (Real.log m + 1) + c) (1 / (2 * n)) n := by\n    have h := ((Real.hasDerivAt_log (ne_of_gt hn)).add_const 1).const_mul (1 / 2)\n    convert h.add_const c using 2 <;> first | rfl | ring\n  exact deriv2_of_hasDerivAt_nhds h1 h2\n\n/-! ### The expanded margin (D-057 \u00a74 assembly) -/\n\n/-- The margin pieces as block compositions (for chain-rule application).\nConstants updated for the D-071 correction (4F bridge; (2/3)Z2 I_III). -/\nprivate def mFblock (F : \u211d \u2192 \u211d) : \u211d \u2192 \u211d := fun m => (-4) * F (Real.sqrt m + 1)\nprivate def mTL1b : \u211d \u2192 \u211d := fun m => (-((8/3)*0.6 + 42)) *\n  ((fun t => t * Real.log (t + 2)) (Real.sqrt m + 1))\nprivate def mTL2b : \u211d \u2192 \u211d := fun m => (-((8/3)*0.886)) *\n  ((fun t => t * Real.log (Real.log (t + 2))) (Real.sqrt m + 1))\nprivate def mIdb : \u211d \u2192 \u211d := fun m => (-((8/3)*2.7 + 192)) * (Real.sqrt m + 1)\nprivate def mL1sqb : \u211d \u2192 \u211d := fun m => (-(42*0.433^2*(Real.exp 4 + 1))) *\n  ((fun t => Real.log (t + 2) ^ 2) (Real.sqrt m + 1))\nprivate def mL1L2b : \u211d \u2192 \u211d := fun m => (-(42*(2*0.433*0.886)*(Real.exp 4 + 1))) *\n  ((fun t => Real.log (t + 2) * Real.log (Real.log (t + 2))) (Real.sqrt m + 1))\nprivate def mL2sqb : \u211d \u2192 \u211d := fun m => (-(42*0.886^2*(Real.exp 4 + 1))) *\n  ((fun t => Real.log (Real.log (t + 2)) ^ 2) (Real.sqrt m + 1))\nprivate def mL1b : \u211d \u2192 \u211d := fun m => (-((42*(2*0.433*2.9) + 147)*(Real.exp 4 + 1))) *\n  ((fun t => Real.log (t + 2)) (Real.sqrt m + 1))\nprivate def mL2b : \u211d \u2192 \u211d := fun m => (-(42*(2*0.886*2.9)*(Real.exp 4 + 1))) *\n  ((fun t => Real.log (Real.log (t + 2))) (Real.sqrt m + 1))\nprivate def mIIM : \u211d \u2192 \u211d := fun m => (-1) * IIMaj m\nprivate def mK : \u211d := -40*1.3352 - 2*(Real.exp 4 + 1)*(7*(3*2.9^2 + 48) + 3.3) - 1 + 1\n\n/-- The margin as an explicit left-nested sum of pieces. -/\nprivate def marginExpanded (F : \u211d \u2192 \u211d) : \u211d \u2192 \u211d := fun n =>\n  (((((((((((fun m => (1/2)*m*Real.log m + (lagariasC1 - Real.eulerMascheroniConstant/2)*m - 4) n +\n    mFblock F n) + mTL1b n) + mTL2b n) + mIdb n) + mL1sqb n) + mL1L2b n) +\n    mL2sqb n) + mL1b n) + mL2b n) + mIIM n) + mK\n\n/-- [PROVED session 011] marginTilde = marginExpanded (the D-056/D-057\nconstant bookkeeping, checked by `ring`). -/\ntheorem marginTilde_eq_expanded (F : \u211d \u2192 \u211d) :\n    marginTilde F = marginExpanded F := by\n  funext n\n  simp only [marginTilde, marginExpanded, mFblock, mTL1b, mTL2b, mIdb, mL1sqb,\n    mL1L2b, mL2sqb, mL1b, mL2b, mIIM, mK, Hhat, C0hat]\n  ring\n\n/-- [PROVED session 011] The pieces are C\u00b2 on (20, \u221e). -/\ntheorem contDiffOn_mS (c : \u211d) :\n    ContDiffOn \u211d 2 (fun m => (1/2)*m*Real.log m + c*m - 4) (Set.Ioi 20) :=\n  (((contDiffOn_const.mul contDiffOn_id).mul (contDiffOn_id.log (fun x hx => by\n    have h : 20 < x := hx\n    exact ne_of_gt (by linarith : (0 : \u211d) < x)))).add\n    (contDiffOn_const.mul contDiffOn_id)).sub contDiffOn_const\n\ntheorem contDiffOn_mFblock (F : \u211d \u2192 \u211d) (hF : ContDiffOn \u211d 2 F (Set.Ioi 1)) :\n    ContDiffOn \u211d 2 (mFblock F) (Set.Ioi 20) :=\n  contDiffOn_const.mul\n    (hF.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift_Ioi1)\n\ntheorem contDiffOn_mTL1b : ContDiffOn \u211d 2 mTL1b (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_TL1.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mTL2b : ContDiffOn \u211d 2 mTL2b (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_TL2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mIdb : ContDiffOn \u211d 2 mIdb (Set.Ioi 20) :=\n  contDiffOn_const.mul contDiffOn_sqrt_shift\n\ntheorem contDiffOn_mL1sqb : ContDiffOn \u211d 2 mL1sqb (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_L1sq.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mL1L2b : ContDiffOn \u211d 2 mL1L2b (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_L1L2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mL2sqb : ContDiffOn \u211d 2 mL2sqb (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_L2sq.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mL1b : ContDiffOn \u211d 2 mL1b (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_L1.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mL2b : ContDiffOn \u211d 2 mL2b (Set.Ioi 20) :=\n  contDiffOn_const.mul (contDiffOn_L2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift)\n\ntheorem contDiffOn_mIIM : ContDiffOn \u211d 2 mIIM (Set.Ioi 20) := by\n  have hId : IIMaj = fun m => psiTilde (Real.sqrt m) :=\n    funext fun m => IIMaj_eq_psiTilde_sqrt m\n  have hsqrt : ContDiffOn \u211d 2 (fun m => Real.sqrt m) (Set.Ioi 20) :=\n    contDiffOn_id.sqrt (fun x hx => by\n      have h : 20 < x := hx\n      exact ne_of_gt (by linarith : (0 : \u211d) < x))\n  have hcomp : ContDiffOn \u211d 2 (psiTilde \u2218 Real.sqrt) (Set.Ioi 20) :=\n    (psiTilde_contDiff.contDiffOn).comp hsqrt (Set.mapsTo_univ _ _)\n  unfold mIIM\n  rw [hId]\n  exact contDiffOn_const.mul hcomp\n\n/-- [PROVED session 011] The margin is continuous on [20, \u221e) (endpoint\nincluded \u2014 the C\u00b2 regularity on (20, \u221e) does not give the endpoint). -/\ntheorem continuousOn_marginExpanded (F : \u211d \u2192 \u211d) (hF : ContDiffOn \u211d 2 F (Set.Ioi 1)) :\n    ContinuousOn (marginExpanded F) (Set.Ici 20) := by\n  have hsqrt : ContinuousOn Real.sqrt (Set.Ici 20) := Real.continuous_sqrt.continuousOn\n  have hT : ContinuousOn (fun m => Real.sqrt m + 1) (Set.Ici 20) :=\n    hsqrt.add continuousOn_const\n  have hmaps : Set.MapsTo (fun m => Real.sqrt m + 1) (Set.Ici 20) (Set.Ioi (-1)) := by\n    intro x hx\n    have h : 20 \u2264 x := hx\n    have hnn := Real.sqrt_nonneg x\n    exact Set.mem_Ioi.mpr (by linarith)\n  have hlog : ContinuousOn Real.log (Set.Ici 20) :=\n    Real.continuousOn_log.mono (fun x hx => by\n      have h : 20 \u2264 x := hx\n      exact ne_of_gt (by linarith : (0 : \u211d) < x))\n  have hId : IIMaj = fun m => psiTilde (Real.sqrt m) :=\n    funext fun m => IIMaj_eq_psiTilde_sqrt m\n  have hIIMc : ContinuousOn IIMaj (Set.Ici 20) := by\n    rw [hId]\n    exact (psiTilde_contDiff.continuous.continuousOn).comp hsqrt (Set.mapsTo_univ _ _)\n  have hSc : ContinuousOn\n      (fun m => (1/2)*m*Real.log m + (lagariasC1 - Real.eulerMascheroniConstant/2)*m - 4)\n      (Set.Ici 20) :=\n    (((continuousOn_const.mul continuousOn_id).mul hlog).add\n      (continuousOn_const.mul continuousOn_id)).sub continuousOn_const\n  unfold marginExpanded mFblock mTL1b mTL2b mIdb mL1sqb mL1L2b mL2sqb mL1b mL2b mIIM\n  refine (((((((((((hSc.add\n    ((hF.continuousOn.comp hT mapsTo_sqrt_shift_Ici_Ioi1).const_mul (-2))).add\n    ((contDiffOn_TL1.continuousOn.comp hT hmaps).const_mul _)).add\n    ((contDiffOn_TL2.continuousOn.comp hT hmaps).const_mul _)).add\n    (hT.const_mul _)).add\n    ((contDiffOn_L1sq.continuousOn.comp hT hmaps).const_mul _)).add\n    ((contDiffOn_L1L2.continuousOn.comp hT hmaps).const_mul _)).add\n    ((contDiffOn_L2sq.continuousOn.comp hT hmaps).const_mul _)).add\n    ((contDiffOn_L1.continuousOn.comp hT hmaps).const_mul _)).add\n    ((contDiffOn_L2.continuousOn.comp hT hmaps).const_mul _)).add\n    (hIIMc.const_mul (-1)))).add\n    continuousOn_const\n\n/-- [PROVED session 011] The full margin is C\u00b2 on (20, \u221e). -/\ntheorem contDiffOn_marginExpanded (F : \u211d \u2192 \u211d) (hF : ContDiffOn \u211d 2 F (Set.Ioi 1)) :\n    ContDiffOn \u211d 2 (marginExpanded F) (Set.Ioi 20) := by\n  unfold marginExpanded\n  refine (((((((((((contDiffOn_mS _).add (contDiffOn_mFblock F hF)).add\n    contDiffOn_mTL1b).add contDiffOn_mTL2b).add contDiffOn_mIdb).add\n    contDiffOn_mL1sqb).add contDiffOn_mL1L2b).add contDiffOn_mL2sqb).add\n    contDiffOn_mL1b).add contDiffOn_mL2b).add contDiffOn_mIIM).add\n    contDiffOn_const\n\n\n/-- [PROVED session 011; generalized session 012 to any c \u2264 1]\nLocalized variant of `chain_rule_sqrt_shift`: \u03c6 only needs to be C\u00b2 on\n(c, \u221e) with c \u2264 1 (all D-057 blocks: L1-singularities at T = \u22122,\nL2-singularities at T = \u22121, so c = \u22121 suffices for them; the explicit\nTrudgian majorant FAlt of session 012 has log-singularities at 0 and 1,\nso it uses c = 1). -/\ntheorem chain_rule_sqrt_shift_on (\u03c6 : \u211d \u2192 \u211d) {c : \u211d} (hc : c \u2264 1)\n    (h\u03c6 : ContDiffOn \u211d 2 \u03c6 (Set.Ioi c)) (n : \u211d) (hn : 0 < n) :\n    deriv (deriv fun n => \u03c6 (Real.sqrt n + 1)) n =\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) -\n        deriv \u03c6 (Real.sqrt n + 1) / Real.sqrt n) / (4 * n) := by\n  have h\u03c6d : DifferentiableOn \u211d \u03c6 (Set.Ioi c) :=\n    h\u03c6.differentiableOn (by norm_num)\n  have h\u03c6dd : DifferentiableOn \u211d (deriv \u03c6) (Set.Ioi c) :=\n    (h\u03c6.deriv_of_isOpen (m := 1) isOpen_Ioi (by norm_num)).differentiableOn\n      one_ne_zero\n  have hmem : \u2200 m : \u211d, 0 < m \u2192 Set.Ioi c \u2208 \ud835\udcdd (Real.sqrt m + 1) := by\n    intro m hm\n    have h1 : (1 : \u211d) < Real.sqrt m + 1 := by\n      have h := Real.sqrt_pos.mpr hm\n      linarith\n    exact Ioi_mem_nhds (lt_of_le_of_lt hc h1)\n  have h\u03c61 : \u2200 m : \u211d, 0 < m \u2192 DifferentiableAt \u211d \u03c6 (Real.sqrt m + 1) :=\n    fun m hm => h\u03c6d.differentiableAt (hmem m hm)\n  have h\u03c62 : DifferentiableAt \u211d (deriv \u03c6) (Real.sqrt n + 1) :=\n    h\u03c6dd.differentiableAt (hmem n hn)\n  have hsqrt : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt n)) n :=\n    Real.hasDerivAt_sqrt hn.ne'\n  have hdiff_sqrt : DifferentiableAt \u211d Real.sqrt n := hsqrt.differentiableAt\n  have hdiff_h : DifferentiableAt \u211d (fun n => Real.sqrt n + 1) n :=\n    hdiff_sqrt.add (differentiableAt_const 1)\n  have hpos : Set.Ioi (0 : \u211d) \u2208 \ud835\udcdd n := Ioi_mem_nhds hn\n  have hg1 : deriv (fun n => \u03c6 (Real.sqrt n + 1)) =\u1da0[\ud835\udcdd n]\n      fun n => deriv \u03c6 (Real.sqrt n + 1) * (2 * Real.sqrt n)\u207b\u00b9 := by\n    filter_upwards [hpos] with m hm\n    have hsm : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt m)) m :=\n      Real.hasDerivAt_sqrt (ne_of_gt hm)\n    have hhm : DifferentiableAt \u211d (fun x => Real.sqrt x + 1) m :=\n      hsm.differentiableAt.add (differentiableAt_const 1)\n    have h1 : deriv (fun x => Real.sqrt x + 1) m = 1 / (2 * Real.sqrt m) := by\n      rw [deriv_add_const]\n      exact hsm.deriv\n    rw [show (fun x => \u03c6 (Real.sqrt x + 1)) = \u03c6 \u2218 (fun x => Real.sqrt x + 1)\n        from rfl,\n      deriv_comp m (h\u03c61 m hm) hhm, h1]\n    ring\n  have hA : HasDerivAt (fun n => deriv \u03c6 (Real.sqrt n + 1))\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) * (1 / (2 * Real.sqrt n))) n := by\n    have h1 : HasDerivAt (fun x => Real.sqrt x + 1) (1 / (2 * Real.sqrt n)) n :=\n      hsqrt.add_const 1\n    have h2 : HasDerivAt (deriv \u03c6) (deriv (deriv \u03c6) (Real.sqrt n + 1))\n        (Real.sqrt n + 1) :=\n      h\u03c62.hasDerivAt\n    have h3 := h2.comp n h1\n    rwa [show (fun n => deriv \u03c6 (Real.sqrt n + 1)) =\n      deriv \u03c6 \u2218 (fun n => Real.sqrt n + 1) from rfl]\n  have hB : HasDerivAt (fun n => (2 * Real.sqrt n)\u207b\u00b9)\n      (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2) n := by\n    have h1 : HasDerivAt (fun n => 2 * Real.sqrt n) (2 * (1 / (2 * Real.sqrt n))) n :=\n      hsqrt.const_mul 2\n    have h2 : (2 * Real.sqrt n) \u2260 0 :=\n      mul_ne_zero two_ne_zero (Real.sqrt_ne_zero'.2 hn)\n    exact h1.inv h2\n  have hmul : HasDerivAt (fun n => deriv \u03c6 (Real.sqrt n + 1) * (2 * Real.sqrt n)\u207b\u00b9)\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) * (1 / (2 * Real.sqrt n)) * (2 * Real.sqrt n)\u207b\u00b9 +\n        deriv \u03c6 (Real.sqrt n + 1) *\n          (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2)) n :=\n    hA.mul hB\n  have hder := (hmul.congr_of_eventuallyEq hg1).deriv\n  rw [hder]\n  set s := Real.sqrt n with hsdef\n  have hs0 : s \u2260 0 := Real.sqrt_ne_zero'.2 hn\n  have hn_eq : n = s ^ 2 := by\n    rw [hsdef]; exact (Real.sq_sqrt hn.le).symm\n  rw [hn_eq]\n  field_simp [hs0]\n  ring\n\n/-- [PROVED session 011] Chain-rule identity with T(n) = \u221an (no shift),\nfor the IIMaj term: d\u00b2/dn\u00b2 \u03c8(\u221an) = [\u03c8\u2033(\u221an) \u2212 \u03c8\u2032(\u221an)/\u221an] / (4n). -/\ntheorem chain_rule_sqrt (\u03c8 : \u211d \u2192 \u211d) (h\u03c8 : ContDiff \u211d 2 \u03c8)\n    (n : \u211d) (hn : 0 < n) :\n    deriv (deriv fun n => \u03c8 (Real.sqrt n)) n =\n      (deriv (deriv \u03c8) (Real.sqrt n) -\n        deriv \u03c8 (Real.sqrt n) / Real.sqrt n) / (4 * n) := by\n  have h\u03c81 : Differentiable \u211d \u03c8 := h\u03c8.differentiable (by norm_num)\n  have h\u03c82 : Differentiable \u211d (deriv \u03c8) :=\n    (h\u03c8.deriv' (n := 1)).differentiable one_ne_zero\n  have hsqrt : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt n)) n :=\n    Real.hasDerivAt_sqrt hn.ne'\n  have hpos : Set.Ioi (0 : \u211d) \u2208 \ud835\udcdd n := Ioi_mem_nhds hn\n  have hg1 : deriv (fun n => \u03c8 (Real.sqrt n)) =\u1da0[\ud835\udcdd n]\n      fun n => deriv \u03c8 (Real.sqrt n) * (2 * Real.sqrt n)\u207b\u00b9 := by\n    filter_upwards [hpos] with m hm\n    have hsm : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt m)) m :=\n      Real.hasDerivAt_sqrt (ne_of_gt hm)\n    rw [show (fun x => \u03c8 (Real.sqrt x)) = \u03c8 \u2218 Real.sqrt from rfl,\n      deriv_comp m (h\u03c81 (Real.sqrt m)) hsm.differentiableAt, hsm.deriv]\n    ring\n  have hA : HasDerivAt (fun n => deriv \u03c8 (Real.sqrt n))\n      (deriv (deriv \u03c8) (Real.sqrt n) * (1 / (2 * Real.sqrt n))) n := by\n    have h2 : HasDerivAt (deriv \u03c8) (deriv (deriv \u03c8) (Real.sqrt n))\n        (Real.sqrt n) :=\n      (h\u03c82 (Real.sqrt n)).hasDerivAt\n    have h3 := h2.comp n hsqrt\n    rwa [show (fun n => deriv \u03c8 (Real.sqrt n)) = deriv \u03c8 \u2218 Real.sqrt from rfl]\n  have hB : HasDerivAt (fun n => (2 * Real.sqrt n)\u207b\u00b9)\n      (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2) n := by\n    have h1 : HasDerivAt (fun n => 2 * Real.sqrt n) (2 * (1 / (2 * Real.sqrt n))) n :=\n      hsqrt.const_mul 2\n    have h2 : (2 * Real.sqrt n) \u2260 0 :=\n      mul_ne_zero two_ne_zero (Real.sqrt_ne_zero'.2 hn)\n    exact h1.inv h2\n  have hmul : HasDerivAt (fun n => deriv \u03c8 (Real.sqrt n) * (2 * Real.sqrt n)\u207b\u00b9)\n      (deriv (deriv \u03c8) (Real.sqrt n) * (1 / (2 * Real.sqrt n)) * (2 * Real.sqrt n)\u207b\u00b9 +\n        deriv \u03c8 (Real.sqrt n) *\n          (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2)) n :=\n    hA.mul hB\n  have hder := (hmul.congr_of_eventuallyEq hg1).deriv\n  rw [hder]\n  set s := Real.sqrt n with hsdef\n  have hs0 : s \u2260 0 := Real.sqrt_ne_zero'.2 hn\n  have hn_eq : n = s ^ 2 := by\n    rw [hsdef]; exact (Real.sq_sqrt hn.le).symm\n  rw [hn_eq]\n  field_simp [hs0]\n  ring\n\n/-- [PROVED session 011] The D-057 chain-rule identity behind the\n11-block reduction: with T(n) = \u221an + 1,\nd\u00b2/dn\u00b2 \u03c6(T(n)) = [\u03c6\u2033(T) \u2212 \u03c6\u2032(T)/(T\u22121)] / (4n), written with\n\u221an = T\u22121. (Warm-up proof; first sorry eliminated from the library.) -/\ntheorem chain_rule_sqrt_shift (\u03c6 : \u211d \u2192 \u211d) (h\u03c6 : ContDiff \u211d 2 \u03c6)\n    (n : \u211d) (hn : 0 < n) :\n    deriv (deriv fun n => \u03c6 (Real.sqrt n + 1)) n =\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) -\n        deriv \u03c6 (Real.sqrt n + 1) / Real.sqrt n) / (4 * n) := by\n  have h\u03c61 : Differentiable \u211d \u03c6 := h\u03c6.differentiable (by norm_num)\n  have h\u03c62 : Differentiable \u211d (deriv \u03c6) :=\n    (h\u03c6.deriv' (n := 1)).differentiable one_ne_zero\n  have hsqrt : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt n)) n :=\n    Real.hasDerivAt_sqrt hn.ne'\n  have hdiff_sqrt : DifferentiableAt \u211d Real.sqrt n := hsqrt.differentiableAt\n  have hdiff_h : DifferentiableAt \u211d (fun n => Real.sqrt n + 1) n :=\n    hdiff_sqrt.add (differentiableAt_const 1)\n  have hpos : Set.Ioi (0 : \u211d) \u2208 \ud835\udcdd n := Ioi_mem_nhds hn\n  have hg1 : deriv (fun n => \u03c6 (Real.sqrt n + 1)) =\u1da0[\ud835\udcdd n]\n      fun n => deriv \u03c6 (Real.sqrt n + 1) * (2 * Real.sqrt n)\u207b\u00b9 := by\n    filter_upwards [hpos] with m hm\n    have hsm : HasDerivAt Real.sqrt (1 / (2 * Real.sqrt m)) m :=\n      Real.hasDerivAt_sqrt (ne_of_gt hm)\n    have hhm : DifferentiableAt \u211d (fun x => Real.sqrt x + 1) m :=\n      hsm.differentiableAt.add (differentiableAt_const 1)\n    have h1 : deriv (fun x => Real.sqrt x + 1) m = 1 / (2 * Real.sqrt m) := by\n      rw [deriv_add_const]\n      exact hsm.deriv\n    rw [show (fun x => \u03c6 (Real.sqrt x + 1)) = \u03c6 \u2218 (fun x => Real.sqrt x + 1)\n        from rfl,\n      deriv_comp m (h\u03c61 (Real.sqrt m + 1)) hhm, h1]\n    ring\n  have hA : HasDerivAt (fun n => deriv \u03c6 (Real.sqrt n + 1))\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) * (1 / (2 * Real.sqrt n))) n := by\n    have h1 : HasDerivAt (fun x => Real.sqrt x + 1) (1 / (2 * Real.sqrt n)) n :=\n      hsqrt.add_const 1\n    have h2 : HasDerivAt (deriv \u03c6) (deriv (deriv \u03c6) (Real.sqrt n + 1))\n        (Real.sqrt n + 1) :=\n      (h\u03c62 (Real.sqrt n + 1)).hasDerivAt\n    have h3 := h2.comp n h1\n    rwa [show (fun n => deriv \u03c6 (Real.sqrt n + 1)) =\n      deriv \u03c6 \u2218 (fun n => Real.sqrt n + 1) from rfl]\n  have hB : HasDerivAt (fun n => (2 * Real.sqrt n)\u207b\u00b9)\n      (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2) n := by\n    have h1 : HasDerivAt (fun n => 2 * Real.sqrt n) (2 * (1 / (2 * Real.sqrt n))) n :=\n      hsqrt.const_mul 2\n    have h2 : (2 * Real.sqrt n) \u2260 0 :=\n      mul_ne_zero two_ne_zero (Real.sqrt_ne_zero'.2 hn)\n    exact h1.inv h2\n  have hmul : HasDerivAt (fun n => deriv \u03c6 (Real.sqrt n + 1) * (2 * Real.sqrt n)\u207b\u00b9)\n      (deriv (deriv \u03c6) (Real.sqrt n + 1) * (1 / (2 * Real.sqrt n)) * (2 * Real.sqrt n)\u207b\u00b9 +\n        deriv \u03c6 (Real.sqrt n + 1) *\n          (-(2 * (1 / (2 * Real.sqrt n))) / (2 * Real.sqrt n) ^ 2)) n :=\n    hA.mul hB\n  have hder := (hmul.congr_of_eventuallyEq hg1).deriv\n  rw [hder]\n  set s := Real.sqrt n with hsdef\n  have hs0 : s \u2260 0 := Real.sqrt_ne_zero'.2 hn\n  have hn_eq : n = s ^ 2 := by\n    rw [hsdef]; exact (Real.sq_sqrt hn.le).symm\n  rw [hn_eq]\n  field_simp [hs0]\n  ring\n\n/-- [PROVED session 011] IIMaj\u2033(n) < 1/(2n) for n \u2265 20 (the analytic\nversion of D-057 \u00a73's \"max 2n\u00b7|B\u0303\u2084\u2033| = 0.189 < 1\"). -/\ntheorem IIMaj_deriv2_lt {n : \u211d} (hn : 20 \u2264 n) :\n    deriv (deriv IIMaj) n < 1 / (2 * n) := by\n  have hn0 : (0 : \u211d) < n := by linarith\n  have hId : IIMaj = fun m => psiTilde (Real.sqrt m) :=\n    funext fun m => IIMaj_eq_psiTilde_sqrt m\n  rw [hId, chain_rule_sqrt psiTilde psiTilde_contDiff n hn0, deriv_psiTilde,\n    deriv2_psiTilde]\n  have hb := iimaj_bracket_bound (Real.sqrt_le_sqrt hn)\n  have h4n : (0 : \u211d) < 4 * n := by linarith\n  have e : (1 : \u211d) / (2 * n) = 2 / (4 * n) := by\n    field_simp [hn0.ne']\n    ring\n  rw [e]\n  exact div_lt_div_of_pos_right hb h4n\n\n/-- [PROVED session 011] Margin convexity (D-057, draft \u00a73.1 Step 4):\nfor any twice-differentiable majorant F of the zero count N(0,T] whose\n\u03c8-block \u03c8[F](T) = F\u2033(T) \u2212 F\u2032(T)/(T\u22121) is negative for T \u2265 \u221a20 + 1\n(the D-057 11-block table discharges this for the explicit Trudgian\nmajorant), the margin majorant margin\u0303 is convex on [20, \u221e).\nProof: margin\u0303\u2033(n) = 1/(2n) \u2212 2\u03c8_F/(4n) \u2212 \u03a3w\u1d62\u03c8\u1d62/(4n) \u2212 IIMaj\u2033(n)\n\u2265 1/(2n) \u2212 IIMaj\u2033(n) > 0 (every \u03c8 < 0 by the block table;\nIIMaj\u2033 < 1/(2n) by IIMaj_deriv2_lt).\nTogether with margin\u0303(8\u00d710\u2074) = 16 020 > 0 and margin\u0303\u2032(8\u00d710\u2074) > 0\n(E-028/E-029) this gives margin > 0 on [8\u00d710\u2074, N\u2081]. -/\ntheorem marginTilde_convex (F : \u211d \u2192 \u211d) (hF : ContDiffOn \u211d 2 F (Set.Ioi 1))\n    (h\u03c8 : \u2200 T : \u211d, Real.sqrt 20 + 1 \u2264 T \u2192\n      deriv (deriv F) T - deriv F T / (T - 1) < 0) :\n    ConvexOn \u211d (Set.Ici 20) (marginTilde F) := by\n  have hCDfull : ContDiffOn \u211d 2 (marginTilde F) (Set.Ioi 20) := by\n    rw [marginTilde_eq_expanded F]\n    exact contDiffOn_marginExpanded F hF\n  apply convexOn_of_deriv2_nonneg (convex_Ici 20)\n  \u00b7 rw [marginTilde_eq_expanded F]\n    exact continuousOn_marginExpanded F hF\n  \u00b7 rw [interior_Ici]\n    exact hCDfull.differentiableOn (by norm_num)\n  \u00b7 rw [interior_Ici]\n    exact ((hCDfull.deriv_of_isOpen (m := 1) isOpen_Ioi (by norm_num))).differentiableOn\n      one_ne_zero\n  \u00b7 intro n hn\n    rw [interior_Ici] at hn\n    have hn20 : 20 < n := hn\n    have hn0 : (0 : \u211d) < n := by linarith\n    have hn4 : (0 : \u211d) < 4 * n := by linarith\n    have hTn : Real.sqrt 20 + 1 \u2264 Real.sqrt n + 1 := by\n      have h := Real.sqrt_le_sqrt (show (20 : \u211d) \u2264 n by linarith)\n      linarith\n    -- diff-fact helpers\n    have hdd : \u2200 {P : \u211d \u2192 \u211d}, ContDiffOn \u211d 2 P (Set.Ioi 20) \u2192\n        DifferentiableAt \u211d (deriv P) n := fun hCD =>\n      ((hCD.deriv_of_isOpen (m := 1) isOpen_Ioi (by norm_num)).differentiableOn\n        one_ne_zero).differentiableAt (Ioi_mem_nhds hn20)\n    have hev : \u2200 {P : \u211d \u2192 \u211d}, ContDiffOn \u211d 2 P (Set.Ioi 20) \u2192\n        (\u2200\u1da0 m in \ud835\udcdd n, DifferentiableAt \u211d P m) := fun hCD => by\n      filter_upwards [Ioi_mem_nhds hn20] with m hm\n      exact (hCD.differentiableOn (by norm_num)).differentiableAt (Ioi_mem_nhds hm)\n    -- unweighted composition bundles\n    have hCDFc : ContDiffOn \u211d 2 (fun m => F (Real.sqrt m + 1)) (Set.Ioi 20) :=\n      hF.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift_Ioi1\n    have hCDTL1c : ContDiffOn \u211d 2\n        (fun m => (fun t => t * Real.log (t + 2)) (Real.sqrt m + 1)) (Set.Ioi 20) :=\n      contDiffOn_TL1.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDTL2c : ContDiffOn \u211d 2\n        (fun m => (fun t => t * Real.log (Real.log (t + 2))) (Real.sqrt m + 1))\n        (Set.Ioi 20) :=\n      contDiffOn_TL2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDL1sqc : ContDiffOn \u211d 2\n        (fun m => (fun t => Real.log (t + 2) ^ 2) (Real.sqrt m + 1)) (Set.Ioi 20) :=\n      contDiffOn_L1sq.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDL1L2c : ContDiffOn \u211d 2\n        (fun m => (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2)))\n          (Real.sqrt m + 1)) (Set.Ioi 20) :=\n      contDiffOn_L1L2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDL2sqc : ContDiffOn \u211d 2\n        (fun m => (fun t => Real.log (Real.log (t + 2)) ^ 2) (Real.sqrt m + 1))\n        (Set.Ioi 20) :=\n      contDiffOn_L2sq.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDL1c : ContDiffOn \u211d 2\n        (fun m => (fun t => Real.log (t + 2)) (Real.sqrt m + 1)) (Set.Ioi 20) :=\n      contDiffOn_L1.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDL2c : ContDiffOn \u211d 2\n        (fun m => (fun t => Real.log (Real.log (t + 2))) (Real.sqrt m + 1))\n        (Set.Ioi 20) :=\n      contDiffOn_L2.comp contDiffOn_sqrt_shift mapsTo_sqrt_shift\n    have hCDIIM : ContDiffOn \u211d 2 IIMaj (Set.Ioi 20) := by\n      have hId : IIMaj = fun m => psiTilde (Real.sqrt m) :=\n        funext fun m => IIMaj_eq_psiTilde_sqrt m\n      rw [hId]\n      exact (psiTilde_contDiff.contDiffOn).comp\n        (contDiffOn_id.sqrt (fun x hx => by\n          have h : 20 < x := hx\n          exact ne_of_gt (by linarith : (0 : \u211d) < x))) (Set.mapsTo_univ _ _)\n    -- piece values\n    have vS : deriv (deriv fun m => (1/2)*m*Real.log m +\n        (lagariasC1 - Real.eulerMascheroniConstant/2)*m - 4) n = 1/(2*n) :=\n      marginS_deriv2 _ hn0\n    have vF : deriv (deriv (mFblock F)) n =\n        (-4) * (psiOf F (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mFblock\n      rw [deriv2_const_mul (-4) (hdd hCDFc) (hev hCDFc),\n        chain_rule_sqrt_shift_on F (le_refl 1) hF n hn0, \u2190 psiOf_sqrt_rel]\n    have vTL1 : deriv (deriv mTL1b) n = (-((8/3)*0.6 + 42)) *\n        (psiOf (fun t => t * Real.log (t + 2)) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mTL1b\n      rw [deriv2_const_mul _ (hdd hCDTL1c) (hev hCDTL1c),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_TL1 n hn0, \u2190 psiOf_sqrt_rel]\n    have vTL2 : deriv (deriv mTL2b) n = (-((8/3)*0.886)) *\n        (psiOf (fun t => t * Real.log (Real.log (t + 2))) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mTL2b\n      rw [deriv2_const_mul _ (hdd hCDTL2c) (hev hCDTL2c),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_TL2 n hn0, \u2190 psiOf_sqrt_rel]\n    have vId : deriv (deriv mIdb) n = (-((8/3)*2.7 + 192)) *\n        (psiOf id (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mIdb\n      have hCDidc : ContDiffOn \u211d 2 (fun m => id (Real.sqrt m + 1)) (Set.Ioi 20) :=\n        contDiffOn_id.comp contDiffOn_sqrt_shift (Set.mapsTo_univ _ _)\n      rw [show (fun m => -(8/3*2.7 + 192) * (Real.sqrt m + 1)) =\n          (fun m => -(8/3*2.7 + 192) * id (Real.sqrt m + 1)) from rfl,\n        deriv2_const_mul _ (hdd hCDidc) (hev hCDidc),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_id n hn0, \u2190 psiOf_sqrt_rel]\n    have vL1sq : deriv (deriv mL1sqb) n = (-(42*0.433^2*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2) ^ 2) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mL1sqb\n      rw [deriv2_const_mul _ (hdd hCDL1sqc) (hev hCDL1sqc),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_L1sq n hn0, \u2190 psiOf_sqrt_rel]\n    have vL1L2 : deriv (deriv mL1L2b) n = (-(42*(2*0.433*0.886)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2)))\n          (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mL1L2b\n      rw [deriv2_const_mul _ (hdd hCDL1L2c) (hev hCDL1L2c),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_L1L2 n hn0, \u2190 psiOf_sqrt_rel]\n    have vL2sq : deriv (deriv mL2sqb) n = (-(42*0.886^2*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (Real.log (t + 2)) ^ 2) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mL2sqb\n      rw [deriv2_const_mul _ (hdd hCDL2sqc) (hev hCDL2sqc),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_L2sq n hn0, \u2190 psiOf_sqrt_rel]\n    have vL1 : deriv (deriv mL1b) n = (-((42*(2*0.433*2.9) + 147)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2)) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mL1b\n      rw [deriv2_const_mul _ (hdd hCDL1c) (hev hCDL1c),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_L1 n hn0, \u2190 psiOf_sqrt_rel]\n    have vL2 : deriv (deriv mL2b) n = (-(42*(2*0.886*2.9)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (Real.log (t + 2))) (Real.sqrt n + 1) / (4 * n)) := by\n      unfold mL2b\n      rw [deriv2_const_mul _ (hdd hCDL2c) (hev hCDL2c),\n        chain_rule_sqrt_shift_on _ (by norm_num : (-1 : \u211d) \u2264 1) contDiffOn_L2 n hn0, \u2190 psiOf_sqrt_rel]\n    have vIIM : deriv (deriv mIIM) n = (-1) * deriv (deriv IIMaj) n := by\n      unfold mIIM\n      rw [deriv2_const_mul (-1) (hdd hCDIIM) (hev hCDIIM)]\n    -- prefix ContDiffOn chain\n    have hCD1 := (contDiffOn_mS (lagariasC1 - Real.eulerMascheroniConstant/2)).add\n      (contDiffOn_mFblock F hF)\n    have hCD2 := hCD1.add contDiffOn_mTL1b\n    have hCD3 := hCD2.add contDiffOn_mTL2b\n    have hCD4 := hCD3.add contDiffOn_mIdb\n    have hCD5 := hCD4.add contDiffOn_mL1sqb\n    have hCD6 := hCD5.add contDiffOn_mL1L2b\n    have hCD7 := hCD6.add contDiffOn_mL2sqb\n    have hCD8 := hCD7.add contDiffOn_mL1b\n    have hCD9 := hCD8.add contDiffOn_mL2b\n    have hCD10 := hCD9.add contDiffOn_mIIM\n    -- split the sum\n    rw [marginTilde_eq_expanded F]\n    show (0 : \u211d) \u2264 deriv (deriv (marginExpanded F)) n\n    unfold marginExpanded\n    dsimp only\n    rw [deriv2_add (hdd hCD10) (hdd contDiffOn_const) (hev hCD10) (hev contDiffOn_const),\n      deriv2_const_val,\n      deriv2_add (hdd hCD9) (hdd contDiffOn_mIIM) (hev hCD9) (hev contDiffOn_mIIM), vIIM,\n      deriv2_add (hdd hCD8) (hdd contDiffOn_mL2b) (hev hCD8) (hev contDiffOn_mL2b), vL2,\n      deriv2_add (hdd hCD7) (hdd contDiffOn_mL1b) (hev hCD7) (hev contDiffOn_mL1b), vL1,\n      deriv2_add (hdd hCD6) (hdd contDiffOn_mL2sqb) (hev hCD6) (hev contDiffOn_mL2sqb),\n      vL2sq,\n      deriv2_add (hdd hCD5) (hdd contDiffOn_mL1L2b) (hev hCD5) (hev contDiffOn_mL1L2b),\n      vL1L2,\n      deriv2_add (hdd hCD4) (hdd contDiffOn_mL1sqb) (hev hCD4) (hev contDiffOn_mL1sqb),\n      vL1sq,\n      deriv2_add (hdd hCD3) (hdd contDiffOn_mIdb) (hev hCD3) (hev contDiffOn_mIdb), vId,\n      deriv2_add (hdd hCD2) (hdd contDiffOn_mTL2b) (hev hCD2) (hev contDiffOn_mTL2b), vTL2,\n      deriv2_add (hdd hCD1) (hdd contDiffOn_mTL1b) (hev hCD1) (hev contDiffOn_mTL1b), vTL1,\n      deriv2_add (hdd (contDiffOn_mS _)) (hdd (contDiffOn_mFblock F hF))\n        (hev (contDiffOn_mS _)) (hev (contDiffOn_mFblock F hF)), vS, vF]\n    -- sign assembly: every \u03c8-term is nonneg\n    have h\u03c8n : psiOf F (Real.sqrt n + 1) < 0 := h\u03c8 _ hTn\n    have hnn1 : (0 : \u211d) \u2264 -4 * (psiOf F (Real.sqrt n + 1) / (4 * n)) :=\n      mul_nonneg_of_nonpos_of_nonpos (by norm_num)\n        (div_neg_of_neg_of_pos h\u03c8n hn4).le\n    have hnn2 : (0 : \u211d) \u2264 (-((8/3)*0.6 + 42)) *\n        (psiOf (fun t => t * Real.log (t + 2)) (Real.sqrt n + 1) / (4 * n)) :=\n      mul_nonneg_of_nonpos_of_nonpos (by norm_num)\n        (div_neg_of_neg_of_pos (psiOf_T_mul_log_shift_neg hTn) hn4).le\n    have hnn3 : (0 : \u211d) \u2264 (-((8/3)*0.886)) *\n        (psiOf (fun t => t * Real.log (Real.log (t + 2))) (Real.sqrt n + 1) / (4 * n)) :=\n      mul_nonneg_of_nonpos_of_nonpos (by norm_num)\n        (div_neg_of_neg_of_pos (psiOf_T_mul_log_log_shift_neg hTn) hn4).le\n    have hnn4 : (0 : \u211d) \u2264 (-((8/3)*2.7 + 192)) *\n        (psiOf id (Real.sqrt n + 1) / (4 * n)) := by\n      have hp : psiOf id (Real.sqrt n + 1) < 0 :=\n        (psiOf_id (Real.sqrt n + 1) (by\n          have h := Real.sqrt_pos.mpr hn0\n          linarith)).2\n      exact mul_nonneg_of_nonpos_of_nonpos (by norm_num)\n        (div_neg_of_neg_of_pos hp hn4).le\n    have hnn5 : (0 : \u211d) \u2264 (-(42*0.433^2*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2) ^ 2) (Real.sqrt n + 1) / (4 * n)) := by\n      have hw : (-(42*0.433^2*(Real.exp 4 + 1)) : \u211d) \u2264 0 := by\n        have hE := Real.exp_pos 4\n        nlinarith [hE]\n      exact mul_nonneg_of_nonpos_of_nonpos hw\n        (div_neg_of_neg_of_pos (psiOf_log_sq_shift_neg hTn) hn4).le\n    have hnn6 : (0 : \u211d) \u2264 (-(42*(2*0.433*0.886)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2) * Real.log (Real.log (t + 2)))\n          (Real.sqrt n + 1) / (4 * n)) := by\n      have hw : (-(42*(2*0.433*0.886)*(Real.exp 4 + 1)) : \u211d) \u2264 0 := by\n        have hE := Real.exp_pos 4\n        nlinarith [hE]\n      exact mul_nonneg_of_nonpos_of_nonpos hw\n        (div_neg_of_neg_of_pos (psiOf_log_mul_log_shift_neg hTn) hn4).le\n    have hnn7 : (0 : \u211d) \u2264 (-(42*0.886^2*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (Real.log (t + 2)) ^ 2) (Real.sqrt n + 1) / (4 * n)) := by\n      have hw : (-(42*0.886^2*(Real.exp 4 + 1)) : \u211d) \u2264 0 := by\n        have hE := Real.exp_pos 4\n        nlinarith [hE]\n      exact mul_nonneg_of_nonpos_of_nonpos hw\n        (div_neg_of_neg_of_pos (psiOf_log_log_sq_shift_neg hTn) hn4).le\n    have hnn8 : (0 : \u211d) \u2264 (-((42*(2*0.433*2.9) + 147)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (t + 2)) (Real.sqrt n + 1) / (4 * n)) := by\n      have hw : (-((42*(2*0.433*2.9) + 147)*(Real.exp 4 + 1)) : \u211d) \u2264 0 := by\n        have hE := Real.exp_pos 4\n        nlinarith [hE]\n      exact mul_nonneg_of_nonpos_of_nonpos hw\n        (div_neg_of_neg_of_pos (psiOf_log_shift_neg (by\n          have h := Real.sqrt_pos.mpr hn0\n          linarith)) hn4).le\n    have hnn9 : (0 : \u211d) \u2264 (-(42*(2*0.886*2.9)*(Real.exp 4 + 1))) *\n        (psiOf (fun t => Real.log (Real.log (t + 2))) (Real.sqrt n + 1) / (4 * n)) := by\n      have hw : (-(42*(2*0.886*2.9)*(Real.exp 4 + 1)) : \u211d) \u2264 0 := by\n        have hE := Real.exp_pos 4\n        nlinarith [hE]\n      exact mul_nonneg_of_nonpos_of_nonpos hw\n        (div_neg_of_neg_of_pos (psiOf_log_log_shift_neg (by\n          have h := Real.sqrt_pos.mpr hn0\n          linarith)) hn4).le\n    have hIIM := IIMaj_deriv2_lt (show 20 \u2264 n by linarith)\n    linarith [hIIM, hnn1, hnn2, hnn3, hnn4, hnn5, hnn6, hnn7, hnn8, hnn9]\n\n/-! ## 4. Tier (ii) step 1 (session 012): the finite-height Li theorem,\n   assembled modulo the single named analytic hypothesis `SfBoundProp`.\n\nDesign (session-012-notes.txt, D-062 triage): the theorem is proved from\n  (i)   `SfBoundProp` \u2014 the remaining analytic obligation, isolated;\n  (ii)  the computational perimeter: `RHUpTo` (Platt\u2013Trudgian 2021) and\n        `LiVerifiedUpTo` (E-011/E-015 + Misguich\u2013Voros);\n  (iii) two elementary evaluations of the explicit margin function\n        (E-028/E-029 values, dischargeable by rational interval\n        bounds \u2014 tier (ii) step 2).\nThe D-036/D-056 contour estimate, the Trudgian N(T)/S(T) input, and the\nRH-to-height bridge all live INSIDE `SfBoundProp`'s eventual proof, not\nin the assembly below. -/\n\n/-- The explicit zero-count majorant used in the assembly (session 012):\nFAlt(T) = (1/2\u03c0)\u00b7T\u00b7log T + 0.137\u00b7log T + 0.443\u00b7log log T + (7/8 + 1.588).\nThis is Trudgian 2014's F(T) + S_b(T) (F(T) = (T/2\u03c0)log(T/2\u03c0e) + 7/8,\nS_b(T) = 0.137 log T + 0.443 log log T + 1.588) with the negative-weight\nterm \u2212(log 2\u03c0e/2\u03c0)\u00b7T DROPPED, so FAlt \u2265 F + S_b pointwise for T \u2265 0 and\nany literature bound N(T) \u2264 F(T) + S_b(T) upgrades to N(T) \u2264 FAlt(T).\nThe swap is needed because \u03c8[F + S_b] crosses POSITIVE on [5.47, ~16]\n(the dropped term has negative weight against a negative-\u03c8 block), while\nevery FAlt block has provably negative \u03c8 (D-057 rows #1/#3/#4). Margin\ncost: 2\u00b7(log 2\u03c0e/2\u03c0)\u00b7T \u2248 0.9\u221an, negligible vs margin\u0303(8\u00d710\u2074) \u2248 1.6\u00d710\u2074\n(E-028). Domain note: smooth only on (1, \u221e) (log log needs T > 1); the\nmargin composition hits only T = \u221an + 1 \u2265 \u221a20 + 1 > 1. -/\ndef FAlt (T : \u211d) : \u211d :=\n  (1 / (2 * Real.pi)) * (T * Real.log T) + 0.137 * Real.log T +\n    0.443 * Real.log (Real.log T) + (7 / 8 + 1.588)\n\n/-- The explicit finite-part bound B(n) (D-037 (4.1) CORRECTED per D-071,\nuser-approved session 038; constants A = 10.5, B\u2080 = 48 from D-056;\n\u0108\u2080/H\u0302/Z\u2082 closed forms; M\u2080 = 1.3352 from E-023; IIMaj the I_I majorant),\nwith the zero-count majorant F as a parameter:\nB(n) = 4F(T) + 4T[(2/3)Z\u2082(T) + 10.5\u00b7log(T+2) + 48] + 40\u00b71.3352\n     + 2(e\u2074+1)\u00b7[7H\u0302(T) + 3.3] + IIMaj(n) + 1,   T = \u221an + 1.\nThe correction (D-071 F-A/F-B): the bridge is 4F \u2014 the residue sum\n\u03bb_n(T) runs over BOTH signs of \u03b3 (D-036/D-037's 2N(T) was a factor-2\naccounting slip; R-004's theorem is unaffected, see E-030); the I_III\nnear-sum uses the two-unit count (2/3)Z\u2082 (D-069 Finding 2 made exact). -/\ndef Bn (F : \u211d \u2192 \u211d) (n : \u211d) : \u211d :=\n  let T := Real.sqrt n + 1\n  4 * F T + 4 * T * ((2 / 3) * Z2hat T + 10.5 * Real.log (T + 2) + 48) +\n    40 * 1.3352 + 2 * (Real.exp 4 + 1) * (7 * Hhat T + 3.3) + IIMaj n + 1\n\n/-- [PROVED session 012] The margin IS sInftyLower \u2212 Bn + 1 (pure\nbookkeeping; same constants as `marginTilde_eq_expanded`). -/\ntheorem marginTilde_eq_sub (F : \u211d \u2192 \u211d) (n : \u211d) :\n    marginTilde F n = sInftyLower n - Bn F n + 1 := by\n  simp only [marginTilde, Bn, sInftyLower]\n\n/-- The finite part S_f(n) of the Bombieri\u2013Lagarias decomposition\n\u03bb_n = S_\u221e(n) \u2212 S_f(n) + 1 (BL 1999 Thm 2, D-037 P1), here DEFINED by the\nidentity rearranged (\u03bb_n is real by conjugate symmetry, so taking the\nreal part is no loss \u2014 see `LiVerifiedUpTo`). The analytic content \u2014 that\nthis quantity is bounded by B(n) \u2014 is isolated in `SfBoundProp`. -/\ndef Sf (n : \u2115) : \u211d := SInfty n + 1 - (liCoeff n).re\n\n/-- \u2b50 THE named analytic hypothesis of tier (ii): the finite part is\nbounded by the explicit traced B(n) on the whole margin range\n10\u2075 \u2264 n \u2264 N\u2081 = (T\u2080\u22121)\u00b2, T\u2080 = 3\u00d710\u00b9\u00b2.\nProof content (triage D-062): the D-036/D-056 contour estimate \u2014 kernel\nbounds + reference-point R-bound (Mathlib-tractable complex analysis),\nTrudgian 2014 N(T)/S(T) (trusted-perimeter literature candidate), the\nbridge via `RHUpTo` (perimeter), M\u2080 (E-023 grid; E-023b acb optional). -/\ndef SfBoundProp : Prop :=\n  \u2200 n : \u2115, 100000 \u2264 n \u2192 (n : \u211d) \u2264 (3 * 10 ^ 12 - 1 : \u211d) ^ 2 \u2192\n    |Sf n| \u2264 Bn FAlt (n : \u211d)\n\n/-! ### The \u03c8-blocks of FAlt (D-057 table rows #1/#3/#4) -/\n\n/-- [PROVED session 012] Per-point derivative of T\u00b7log T. -/\ntheorem hasDerivAt_T_mul_log (x : \u211d) (hx : 0 < x) :\n    HasDerivAt (fun t => t * Real.log t) (Real.log x + 1) x := by\n  have h := (hasDerivAt_id' x).mul (Real.hasDerivAt_log (ne_of_gt hx))\n  rwa [one_mul, mul_inv_cancel\u2080 (ne_of_gt hx)] at h\n\n/-- [PROVED session 012] Block #1 (T\u00b7log T): \u03c8-formula. -/\ntheorem psiOf_T_mul_log (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => t * Real.log t) T =\n      1 / T - (Real.log T + 1) / (T - 1) := by\n  have hT0 : (0 : \u211d) < T := by linarith\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => t * Real.log t) (Real.log x + 1) x := by\n    filter_upwards [eventually_gt_nhds hT0] with x hx\n    exact hasDerivAt_T_mul_log x hx\n  have h2 : HasDerivAt (fun t => Real.log t + 1) T\u207b\u00b9 T :=\n    (Real.hasDerivAt_log (ne_of_gt hT0)).add_const 1\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => t * Real.log t) T = Real.log T + 1 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1, one_div]\n\n/-- [PROVED session 012] Block #1 sign: \u03c8 < 0 for T > 1\n(\u27fa \u22121 < T\u00b7log T, D-057 row #1). -/\ntheorem psiOf_T_mul_log_neg {T : \u211d} (hT : 1 < T) :\n    psiOf (fun t => t * Real.log t) T < 0 := by\n  rw [psiOf_T_mul_log T hT]\n  have hT0 : (0 : \u211d) < T := by linarith\n  have hT1 : (0 : \u211d) < T - 1 := by linarith\n  have hlog : (0 : \u211d) < Real.log T := Real.log_pos hT\n  have key : (1 : \u211d) / T < (Real.log T + 1) / (T - 1) := by\n    rw [div_lt_div_iff\u2080 hT0 hT1]\n    nlinarith [mul_pos hT0 hlog]\n  linarith\n\n/-- [PROVED session 012] Block #3 (log T): \u03c8-formula. -/\ntheorem psiOf_log (T : \u211d) (hT : 1 < T) :\n    psiOf Real.log T = -1 / T ^ 2 - 1 / (T * (T - 1)) := by\n  have hT0 : (0 : \u211d) < T := by linarith\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt Real.log x\u207b\u00b9 x := by\n    filter_upwards [eventually_gt_nhds hT0] with x hx\n    exact Real.hasDerivAt_log (ne_of_gt hx)\n  have h2 : HasDerivAt (fun t : \u211d => t\u207b\u00b9) (-1 / T ^ 2) T := by\n    have h := (hasDerivAt_id' T).inv (ne_of_gt hT0)\n    have e : (-(1 : \u211d)) / T ^ 2 = -1 / T ^ 2 := by ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv Real.log T = T\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  field_simp [ne_of_gt hT0, hT1]\n\n/-- [PROVED session 012] Block #3 sign: \u03c8 < 0 for T > 1. -/\ntheorem psiOf_log_neg {T : \u211d} (hT : 1 < T) :\n    psiOf Real.log T < 0 := by\n  rw [psiOf_log T hT]\n  have h1 : (0 : \u211d) < 1 / T ^ 2 := one_div_pos.mpr (pow_pos (by linarith) 2)\n  have h2 : (0 : \u211d) < 1 / (T * (T - 1)) :=\n    one_div_pos.mpr (mul_pos (by linarith) (by linarith))\n  have e : -1 / T ^ 2 - 1 / (T * (T - 1)) = -(1 / T ^ 2 + 1 / (T * (T - 1))) := by ring\n  rw [e]\n  linarith [add_pos h1 h2]\n\n/-- [PROVED session 012] Per-point derivative of log log T. -/\ntheorem hasDerivAt_log_log_unshifted (x : \u211d) (hx : 1 < x) :\n    HasDerivAt (fun t => Real.log (Real.log t)) ((Real.log x)\u207b\u00b9 * x\u207b\u00b9) x := by\n  have hin : HasDerivAt Real.log x\u207b\u00b9 x :=\n    Real.hasDerivAt_log (ne_of_gt (by linarith : (0 : \u211d) < x))\n  have hout : HasDerivAt Real.log (Real.log x)\u207b\u00b9 (Real.log x) :=\n    Real.hasDerivAt_log (ne_of_gt (Real.log_pos hx))\n  exact hout.comp x hin\n\n/-- [PROVED session 012] Block #4 (log log T): \u03c8-formula. -/\ntheorem psiOf_log_log (T : \u211d) (hT : 1 < T) :\n    psiOf (fun t => Real.log (Real.log t)) T =\n      -(Real.log T + 1) / ((T * Real.log T) ^ 2) -\n        1 / (T * Real.log T * (T - 1)) := by\n  have hT0 : (0 : \u211d) < T := by linarith\n  have hL1 : (0 : \u211d) < Real.log T := Real.log_pos hT\n  have h1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt (fun t => Real.log (Real.log t))\n      ((Real.log x)\u207b\u00b9 * x\u207b\u00b9) x := by\n    filter_upwards [eventually_gt_nhds hT] with x hx\n    exact hasDerivAt_log_log_unshifted x hx\n  have h2 : HasDerivAt (fun t => (Real.log t)\u207b\u00b9 * t\u207b\u00b9)\n      (-(Real.log T + 1) / ((T * Real.log T) ^ 2)) T := by\n    have hu : HasDerivAt (fun t => (Real.log t)\u207b\u00b9) (-T\u207b\u00b9 / (Real.log T) ^ 2) T :=\n      (Real.hasDerivAt_log (ne_of_gt hT0)).inv (ne_of_gt hL1)\n    have hv : HasDerivAt (fun t : \u211d => t\u207b\u00b9) (-1 / T ^ 2) T := by\n      have h := (hasDerivAt_id' T).inv (ne_of_gt hT0)\n      have e : (-(1 : \u211d)) / T ^ 2 = -1 / T ^ 2 := by ring\n      rwa [e] at h\n    have h := hu.mul hv\n    have hT0' : T \u2260 0 := ne_of_gt hT0\n    have hL1' : Real.log T \u2260 0 := ne_of_gt hL1\n    have e : (-T\u207b\u00b9 / (Real.log T) ^ 2) * T\u207b\u00b9 + (Real.log T)\u207b\u00b9 * (-1 / T ^ 2) =\n        -(Real.log T + 1) / ((T * Real.log T) ^ 2) := by\n      field_simp [hT0', hL1']\n      ring\n    rwa [e] at h\n  have hd2 := deriv2_of_hasDerivAt_nhds h1 h2\n  have hd1 : deriv (fun t => Real.log (Real.log t)) T =\n      (Real.log T)\u207b\u00b9 * T\u207b\u00b9 := h1.self_of_nhds.deriv\n  unfold psiOf\n  rw [hd2, hd1]\n  have hT1 : (T - 1) \u2260 0 := by linarith\n  have hT0' : T \u2260 0 := ne_of_gt hT0\n  have hL1' : Real.log T \u2260 0 := ne_of_gt hL1\n  field_simp [hT0', hL1', hT1]\n\n/-- [PROVED session 012] Block #4 sign: \u03c8 < 0 for T > 1. -/\ntheorem psiOf_log_log_neg {T : \u211d} (hT : 1 < T) :\n    psiOf (fun t => Real.log (Real.log t)) T < 0 := by\n  rw [psiOf_log_log T hT]\n  have hT0 : (0 : \u211d) < T := by linarith\n  have hL1 : (0 : \u211d) < Real.log T := Real.log_pos hT\n  have hp1 : (0 : \u211d) < (Real.log T + 1) / ((T * Real.log T) ^ 2) :=\n    div_pos (by linarith) (pow_pos (mul_pos hT0 hL1) 2)\n  have hp2 : (0 : \u211d) < 1 / (T * Real.log T * (T - 1)) :=\n    one_div_pos.mpr (mul_pos (mul_pos hT0 hL1) (by linarith))\n  have e : -(Real.log T + 1) / ((T * Real.log T) ^ 2) -\n      1 / (T * Real.log T * (T - 1)) =\n      -((Real.log T + 1) / ((T * Real.log T) ^ 2) +\n        1 / (T * Real.log T * (T - 1))) := by ring\n  rw [e]\n  linarith [add_pos hp1 hp2]\n\n/-- [PROVED session 012] FAlt is C\u00b2 on (1, \u221e). -/\ntheorem contDiffOn_FAlt : ContDiffOn \u211d 2 FAlt (Set.Ioi 1) := by\n  have hA : ContDiffOn \u211d 2 (fun t : \u211d => t * Real.log t) (Set.Ioi 1) :=\n    contDiffOn_id.mul (contDiffOn_id.log (fun x hx => by\n      have h : 1 < x := hx\n      exact ne_of_gt (by linarith : (0 : \u211d) < x)))\n  have hB : ContDiffOn \u211d 2 Real.log (Set.Ioi 1) :=\n    contDiffOn_id.log (fun x hx => by\n      have h : 1 < x := hx\n      exact ne_of_gt (by linarith : (0 : \u211d) < x))\n  have hC : ContDiffOn \u211d 2 (fun t : \u211d => Real.log (Real.log t)) (Set.Ioi 1) :=\n    hB.log (fun x hx => ne_of_gt (Real.log_pos hx))\n  unfold FAlt\n  exact (((contDiffOn_const.mul hA).add (contDiffOn_const.mul hB)).add\n    (contDiffOn_const.mul hC)).add contDiffOn_const\n\n/-- [PROVED session 012] \u03c8-condition for FAlt (the D-057 rows #1/#3/#4\nassembly): deriv(deriv FAlt) T \u2212 deriv FAlt T/(T\u22121) < 0 for\nT \u2265 \u221a20 + 1. All three weights positive, all three brackets negative. -/\ntheorem FAlt_psi_neg (T : \u211d) (hT : Real.sqrt 20 + 1 \u2264 T) :\n    deriv (deriv FAlt) T - deriv FAlt T / (T - 1) < 0 := by\n  have hs : (4.4721 : \u211d) \u2264 Real.sqrt 20 := by\n    rw [Real.le_sqrt (by norm_num) (by norm_num)]\n    norm_num\n  have h1T : 1 < T := by linarith\n  have hT0 : (0 : \u211d) < T := by linarith\n  have hT1 : (0 : \u211d) < T - 1 := by linarith\n  have hL1 : (0 : \u211d) < Real.log T := Real.log_pos h1T\n  -- first derivative of FAlt, valid in a neighborhood of T\n  have hD1 : \u2200\u1da0 x in \ud835\udcdd T, HasDerivAt FAlt\n      ((1 / (2 * Real.pi)) * (Real.log x + 1) + 0.137 * x\u207b\u00b9 +\n        0.443 * ((Real.log x)\u207b\u00b9 * x\u207b\u00b9)) x := by\n    filter_upwards [eventually_gt_nhds h1T] with x hx\n    have hx0 : (0 : \u211d) < x := by linarith\n    have hA := (hasDerivAt_T_mul_log x hx0).const_mul (1 / (2 * Real.pi))\n    have hB := (Real.hasDerivAt_log (ne_of_gt hx0)).const_mul (0.137 : \u211d)\n    have hC := (hasDerivAt_log_log_unshifted x hx).const_mul (0.443 : \u211d)\n    have hK : HasDerivAt (fun _ : \u211d => (7 / 8 + 1.588 : \u211d)) 0 x :=\n      hasDerivAt_const x _\n    have h := ((hA.add hB).add hC).add hK\n    have e : (1 / (2 * Real.pi)) * (Real.log x + 1) + 0.137 * x\u207b\u00b9 +\n        0.443 * ((Real.log x)\u207b\u00b9 * x\u207b\u00b9) + 0 =\n        (1 / (2 * Real.pi)) * (Real.log x + 1) + 0.137 * x\u207b\u00b9 +\n          0.443 * ((Real.log x)\u207b\u00b9 * x\u207b\u00b9) := by ring\n    rwa [\u2190 e]\n  -- second derivative at T\n  have hD2 : HasDerivAt\n      (fun t => (1 / (2 * Real.pi)) * (Real.log t + 1) + 0.137 * t\u207b\u00b9 +\n        0.443 * ((Real.log t)\u207b\u00b9 * t\u207b\u00b9))\n      ((1 / (2 * Real.pi)) * T\u207b\u00b9 + 0.137 * (-1 / T ^ 2) +\n        0.443 * (-(Real.log T + 1) / ((T * Real.log T) ^ 2))) T := by\n    have hA := ((Real.hasDerivAt_log (ne_of_gt hT0)).add_const 1).const_mul\n      (1 / (2 * Real.pi))\n    have hv : HasDerivAt (fun t : \u211d => t\u207b\u00b9) (-1 / T ^ 2) T := by\n      have h := (hasDerivAt_id' T).inv (ne_of_gt hT0)\n      have e : (-(1 : \u211d)) / T ^ 2 = -1 / T ^ 2 := by ring\n      rwa [e] at h\n    have hB := hv.const_mul (0.137 : \u211d)\n    have hu : HasDerivAt (fun t => (Real.log t)\u207b\u00b9) (-T\u207b\u00b9 / (Real.log T) ^ 2) T :=\n      (Real.hasDerivAt_log (ne_of_gt hT0)).inv (ne_of_gt hL1)\n    have hC := (hu.mul hv).const_mul (0.443 : \u211d)\n    have h := (hA.add hB).add hC\n    have hT0' : T \u2260 0 := ne_of_gt hT0\n    have hL1' : Real.log T \u2260 0 := ne_of_gt hL1\n    have e : (1 / (2 * Real.pi)) * T\u207b\u00b9 + 0.137 * (-1 / T ^ 2) +\n        0.443 * ((-T\u207b\u00b9 / (Real.log T) ^ 2) * T\u207b\u00b9 + (Real.log T)\u207b\u00b9 * (-1 / T ^ 2)) =\n        (1 / (2 * Real.pi)) * T\u207b\u00b9 + 0.137 * (-1 / T ^ 2) +\n          0.443 * (-(Real.log T + 1) / ((T * Real.log T) ^ 2)) := by\n      field_simp [hT0', hL1']\n      ring\n    rwa [e] at h\n  have hd1 : deriv FAlt T = (1 / (2 * Real.pi)) * (Real.log T + 1) + 0.137 * T\u207b\u00b9 +\n      0.443 * ((Real.log T)\u207b\u00b9 * T\u207b\u00b9) := hD1.self_of_nhds.deriv\n  have hd2 : deriv (deriv FAlt) T = (1 / (2 * Real.pi)) * T\u207b\u00b9 +\n      0.137 * (-1 / T ^ 2) + 0.443 * (-(Real.log T + 1) / ((T * Real.log T) ^ 2)) :=\n    deriv2_of_hasDerivAt_nhds hD1 hD2\n  -- the three negative brackets (reused block signs)\n  have hbrA := psiOf_T_mul_log_neg h1T\n  rw [psiOf_T_mul_log T h1T] at hbrA\n  have hbrB := psiOf_log_neg h1T\n  rw [psiOf_log T h1T] at hbrB\n  have hbrC := psiOf_log_log_neg h1T\n  rw [psiOf_log_log T h1T] at hbrC\n  have hc1 : (0 : \u211d) < 1 / (2 * Real.pi) := by positivity\n  -- assemble: \u03c8 = c\u2081\u00b7brA + c\u2082\u00b7brB + c\u2083\u00b7brC < 0\n  have hT0' : T \u2260 0 := ne_of_gt hT0\n  have hL1' : Real.log T \u2260 0 := ne_of_gt hL1\n  have hsum : deriv (deriv FAlt) T - deriv FAlt T / (T - 1) =\n      (1 / (2 * Real.pi)) * (1 / T - (Real.log T + 1) / (T - 1)) +\n        0.137 * (-1 / T ^ 2 - 1 / (T * (T - 1))) +\n          0.443 * (-(Real.log T + 1) / ((T * Real.log T) ^ 2) -\n            1 / (T * Real.log T * (T - 1))) := by\n    rw [hd1, hd2]\n    field_simp [hT0', hL1', hT1.ne']\n    ring\n  rw [hsum]\n  have h1 : (1 / (2 * Real.pi)) * (1 / T - (Real.log T + 1) / (T - 1)) < 0 :=\n    mul_neg_of_pos_of_neg hc1 hbrA\n  have h2' : 0.137 * (-1 / T ^ 2 - 1 / (T * (T - 1))) < 0 :=\n    mul_neg_of_pos_of_neg (by norm_num) hbrB\n  have h3' : 0.443 * (-(Real.log T + 1) / ((T * Real.log T) ^ 2) -\n      1 / (T * Real.log T * (T - 1))) < 0 :=\n    mul_neg_of_pos_of_neg (by norm_num) hbrC\n  linarith [h1, h2', h3']\n\n/-- [PROVED session 012] Convexity + positive base point + positive base\nderivative \u27f9 positivity on the whole tail (MVT + monotone derivative). -/\ntheorem pos_of_convex_of_base {f : \u211d \u2192 \u211d} {a N\u2080 x : \u211d}\n    (hconv : ConvexOn \u211d (Set.Ici a) f)\n    (hdiff : \u2200 y : \u211d, y \u2208 Set.Ioi a \u2192 DifferentiableAt \u211d f y)\n    (hN : a < N\u2080) (hx : N\u2080 \u2264 x) (h0 : 0 < f N\u2080) (h0' : 0 < deriv f N\u2080) :\n    0 < f x := by\n  rcases eq_or_lt_of_le hx with heq | hlt\n  \u00b7 rw [\u2190 heq]\n    exact h0\n  \u00b7 have hfc : ContinuousOn f (Set.Icc N\u2080 x) :=\n      DifferentiableOn.continuousOn (s := Set.Icc N\u2080 x) (f := f) fun y hy =>\n        (hdiff y (Set.mem_Ioi.mpr (by\n          have h1 : N\u2080 \u2264 y := hy.1\n          linarith))).differentiableWithinAt\n    have hfd : DifferentiableOn \u211d f (Set.Ioo N\u2080 x) := fun y hy =>\n      (hdiff y (Set.mem_Ioi.mpr (by\n        have h1 : N\u2080 < y := hy.1\n        linarith))).differentiableWithinAt\n    obtain \u27e8\u03be, h\u03be, h\u03beeq\u27e9 := exists_deriv_eq_slope f hlt hfc hfd\n    have hconv' : ConvexOn \u211d (Set.Ici N\u2080) f :=\n      hconv.subset (Set.Ici_subset_Ici.mpr (le_of_lt hN)) (convex_Ici N\u2080)\n    have hfd' : \u2200 y : \u211d, y \u2208 Set.Ici N\u2080 \u2192 DifferentiableAt \u211d f y := by\n      intro y hy\n      have : a < y := by\n        have : N\u2080 \u2264 y := hy\n        linarith\n      exact hdiff y this\n    have hmono : deriv f N\u2080 \u2264 deriv f \u03be :=\n      (hconv'.monotoneOn_deriv hfd') (Set.mem_Ici.mpr (le_refl N\u2080))\n        (Set.mem_Ici.mpr (le_of_lt h\u03be.1)) (le_of_lt h\u03be.1)\n    have hpos : (0 : \u211d) < x - N\u2080 := sub_pos.mpr hlt\n    have hkey : (0 : \u211d) < (f x - f N\u2080) / (x - N\u2080) :=\n      h\u03beeq \u25b8 lt_of_lt_of_le h0' hmono\n    have hfx : (0 : \u211d) < f x - f N\u2080 := (div_pos_iff_of_pos_right hpos).mp hkey\n    linarith\n\n/-- [PROVED session 012] Convexity + f(N\u2080) > 0 + f(N\u2081) > f(N\u2080) \u27f9\npositivity on [N\u2081, \u221e) (three-chord secant monotonicity; the increasing\nsecant slope is positive, so f keeps climbing). Cheaper to discharge than\nthe derivative base point: two plain evaluations, no deriv machinery. -/\ntheorem pos_of_convex_of_two_points {f : \u211d \u2192 \u211d} {a N\u2080 N\u2081 x : \u211d}\n    (hconv : ConvexOn \u211d (Set.Ici a) f)\n    (hN : a < N\u2080) (hN01 : N\u2080 < N\u2081) (hx : N\u2081 \u2264 x)\n    (h0 : 0 < f N\u2080) (h01 : f N\u2080 < f N\u2081) :\n    0 < f x := by\n  rcases eq_or_lt_of_le hx with heq | hlt\n  \u00b7 rw [\u2190 heq]\n    linarith\n  \u00b7 have hslope := hconv.slope_mono_adjacent\n      (Set.mem_Ici.mpr (le_of_lt hN)) (Set.mem_Ici.mpr (by linarith)) hN01 hlt\n    have hp1 : (0 : \u211d) < N\u2081 - N\u2080 := by linarith\n    have hp2 : (0 : \u211d) < x - N\u2081 := by linarith\n    have hs : (0 : \u211d) < (f N\u2081 - f N\u2080) / (N\u2081 - N\u2080) := div_pos (by linarith) hp1\n    have hs2 : (0 : \u211d) < (f x - f N\u2081) / (x - N\u2081) := lt_of_lt_of_le hs hslope\n    have hfx : (0 : \u211d) < f x - f N\u2081 := (div_pos_iff_of_pos_right hp2).mp hs2\n    linarith\n\n/-- [PROVED session 012 \u2014 TIER (ii) STEP 1, assembly modulo `SfBoundProp`]\nR-004, the finite-height Li theorem (draft Thm 3.1): assuming the named\nanalytic hypothesis `SfBoundProp`, the computational perimeter\n(Platt\u2013Trudgian RH-to-T\u2080, finite Li verification to 5\u00d710\u2075), and two\nelementary evaluations of the explicit margin function (E-028/E-029\nvalues: margin\u0303(8\u00d710\u2074) \u2248 1.58\u00d710\u2074 > 0 and margin\u0303(10\u2075) \u2248 9.3\u00d710\u2074\n> margin\u0303(8\u00d710\u2074); interval-bound discharge = tier (ii) step 2),\n\u03bb_n > 0 for all n \u2264 (T\u2080\u22121)\u00b2.\n\nProof: for n < 10\u2075 use the perimeter finite verification; for\nn \u2265 10\u2075, \u03bb_n = S_\u221e(n) \u2212 S_f(n) + 1 \u2265 sInftyLower(n) \u2212 B(n) + 1\n= margin\u0303(n) > 0 by convexity (`marginTilde_convex` + `FAlt_psi_neg`)\nand the two base points (`pos_of_convex_of_two_points`).\n`_hRH` documents the bridge input: it is consumed by `SfBoundProp`'s\neventual proof (D-037 \u00a76), not by the assembly itself. -/\ntheorem lambda_pos_finite_height\n    (_hRH : RHUpTo (3 * 10 ^ 12)) (hfinite : LiVerifiedUpTo (5 * 10 ^ 5))\n    (hbase : 0 < marginTilde FAlt 80000)\n    (hbase2 : marginTilde FAlt 80000 < marginTilde FAlt 100000)\n    (hSf : SfBoundProp) :\n    \u2200 n : \u2115, 1 \u2264 n \u2192 (n : \u211d) \u2264 (3 * 10 ^ 12 - 1 : \u211d) ^ 2 \u2192\n      0 < (liCoeff n).re := by\n  intro n hn1 hnN\n  rcases lt_or_ge n 100000 with hlt | hge\n  \u00b7 exact hfinite n hn1 (by omega)\n  \u00b7 have hn20 : 20 \u2264 n := by omega\n    have h1 := sInfty_lower_bound n hn20\n    have h2 := hSf n hge hnN\n    have h3 : (liCoeff n).re = SInfty n - Sf n + 1 := by\n      unfold Sf\n      ring\n    have h4 : marginTilde FAlt (n : \u211d) = sInftyLower (n : \u211d) - Bn FAlt (n : \u211d) + 1 :=\n      marginTilde_eq_sub FAlt n\n    have h5 : 0 < marginTilde FAlt (n : \u211d) :=\n      pos_of_convex_of_two_points\n        (marginTilde_convex FAlt contDiffOn_FAlt FAlt_psi_neg)\n        (by norm_num) (by norm_num) (by exact_mod_cast hge) hbase hbase2\n    have habs : Sf n \u2264 |Sf n| := le_abs_self _\n    rw [h3]\n    linarith [h1, h2, h4, h5, habs]\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 1843,
      "oldLines": 7,
      "newStart": 1843,
      "newLines": 7,
      "lines": [
        "     marginTilde F = marginExpanded F := by",
        "   funext n",
        "   simp only [marginTilde, marginExpanded, mFblock, mTL1b, mTL2b, mIdb, mL1sqb,",
        "-    mL1L2b, mL2sqb, mL1b, mL2b, mIIM, mK, Hhat, C0hat]",
        "+    mL1L2b, mL2sqb, mL1b, mL2b, mIIM, mK, Hhat, C0hat, Z2hat]",
        "   ring",
        " ",
        " /-- [PROVED session 011] The pieces are C\u00b2 on (20, \u221e). -/"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\journal\\session-001.md",
  "old_string": "**Outcome:** T1 closed. Ready for task 1.3 proper (third-moment diagonal\nmethod failure analysis).",
  "new_string": "**Outcome:** T1 closed. Ready for task 1.3 proper (third-moment diagonal\nmethod failure analysis).\n\n---\n\n## Addendum 13 \u2014 Task 1.3 analysis completed (same day)\n\n**Task:** What fragment of the third moment survives unconditionally? \u2192 D-011.\n\n**Derivation chain:**\n1. tr G\u0303\u00b3 reduces (via Lemma 2.1) to a triple zero-correlation with\n   band-limited kernel \u03a6(\u03b3\u2081\u2212\u03b3\u2082)\u03a6(\u03b3\u2082\u2212\u03b3\u2083)\u03a6(\u03b3\u2083\u2212\u03b3\u2081). [VERIFIED algebra]\n2. Prime side: diagonal method needs shift-correlations of THREE P_X's;\n   off-diagonal control via MV costs ~X\u00b2/T \u27f9 Rudnick\u2013Sarnak X\u00b3 \u2264 T^{2\u2212\u03b5}\n   \u27fa \u03bb \u2264 2/3. (k=2 works at \u03bb=1 only because of the 1/(2\u03c0)\u00b2 margin.)\n3. THE WALL, precisely: at bandwidth \u03bb the grid has d = \u03bbN rows \u27f9\n   certificate \u2264 \u03bb; third moment available only at \u03bb \u2264 2/3. Availability\n   and usefulness thresholds coincide EXACTLY at 2/3.\n4. THE HATCH (open): Lemma 2.1's no-aliasing needs only\n   supp(\u03d5\u2217\u03d5) \u2282 (\u22122\u03c0/h, 2\u03c0/h) \u2014 an oversampled grid h = 2\u03c0/(qL\u2032), q \u2265 1,\n   keeps Poisson\u2013Gabor EXACT (verified against the proof's H-support\n   argument). At q=2, \u03bb=2/3: d = 4N/3 \u2014 the dimension cap evaporates.\n   Whether the extra rank is spectrally real or empty padding is\n   numerically decidable on the sine-process model \u2192 E-005 designed\n   (scan \u03bb \u2208 [1/2,1], q \u2208 {1,2}, 3-moment Markov bound).\n\n**Outcome:** 1.3 analysis complete. E-005 is the decider: positive \u2192\ntheorem path past 2/3 (unconditional!); negative \u2192 G-002 with exact\nobstruction. Awaiting user go-ahead for E-005."
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiDogLeg.lean",
  "oldString": "      rw [norm_div, hnormA, hnormB, \u2190 Real.sqrt_div hQpos]",
  "newString": "      rw [norm_div, hnormA, hnormB,\n        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]",
  "originalFile": "/-\nNguyenRH1/LiDogLeg.lean \u2014 ii\u2032-6-DL-1 (D-074, session 040): the zero-free\ndog-leg deformation of the Lagarias horizontal right tail.\n\nTHE CONTENT (D-074 \u00a73.1\u20133.2): on the dog-leg rectangle [3, X_R]\u00d7[T, U]\n(T > 0), the Lagarias integrand Jlag n s = (s/(s\u22121))\u207f\u22121 \u00b7 (\u2212\u03b6\u2032/\u03b6(s)) is\nholomorphic UNCONDITIONALLY (s \u2260 1 since im > 0; \u03b6 s \u2260 0 for re s \u2265 3 > 1\nby Mathlib's Euler-product nonvanishing `riemannZeta_ne_zero_of_one_lt_re`\n\u2014 NO perimeter hypothesis, no zero-avoidance at U). Cauchy's theorem\n(`HolomorphicOn.vanishesOnRectangle`) then gives the EXACT deformation\nidentity\n  H(3\u2192X_R, T) = H(3\u2192X_R, U) \u2212 V(X_R, T\u2192U) + V(3, T\u2192U)\n(the upper right tail = the high horizontal \u2212 the right drop + the left\nlift), plus the Jlag conjugation identity for the lower-side transfer.\n\nThis is the repair of Finding F-D (D-072): the broken low-path envelope\nis ABANDONED (not bounded) \u2014 the magnitude bound comes later from the\nthree dog-leg pieces, all in the unconditionally zero-free region.\n-/\nimport Mathlib\nimport NguyenRH1.LiSides\nimport NguyenRH1.LiTightR\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. Dog-leg analyticity (D-074 \u00a73.1; no perimeter) -/\n\n/-- The dog-leg corners (same real-part/imaginary-part form as rectZ/rectW). -/\ndef dogZ (T : \u211d) : \u2102 := ((3 : \u211d) : \u2102) + (T : \u211d) * Complex.I\ndef dogW (XR U : \u211d) : \u2102 := ((XR : \u211d) : \u2102) + (U : \u211d) * Complex.I\n\nlemma dogZ_re (T : \u211d) : (dogZ T).re = 3 := by simp [dogZ]\nlemma dogZ_im (T : \u211d) : (dogZ T).im = T := by simp [dogZ]\nlemma dogW_re (XR U : \u211d) : (dogW XR U).re = XR := by simp [dogW]\nlemma dogW_im (XR U : \u211d) : (dogW XR U).im = U := by simp [dogW]\n\n/-- Jlag is differentiable at every point with 3 \u2264 re, 0 < im:\n\u03b6 is zero-free for 1 < re (Mathlib `riemannZeta_ne_zero_of_one_lt_re`,\nUNCONDITIONAL \u2014 the Euler-product region) and s \u2260 1 (im \u2260 0).\nNO perimeter hypothesis. -/\ntheorem Jlag_differentiableAt_dogleg {n : \u2115} {s : \u2102}\n    (hre : 3 \u2264 s.re) (him : 0 < s.im) :\n    DifferentiableAt \u2102 (Jlag n) s := by\n  apply Jlag_differentiableAt\n  \u00b7 rintro rfl\n    simp at him\n  \u00b7 exact riemannZeta_ne_zero_of_one_lt_re (by linarith)\n\n/-- Jlag is holomorphic on the whole dog-leg rectangle\n[3, X_R]\u00d7[T, U] (T > 0). -/\ntheorem holomorphicOn_Jlag_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HolomorphicOn (Jlag n) (Rectangle (dogZ T) (dogW XR U)) := by\n  intro s hs\n  rw [Rectangle, Complex.mem_reProdIm, dogZ_re, dogW_re, dogZ_im, dogW_im] at hs\n  rw [Set.uIcc_of_le hXR, Set.uIcc_of_le hTU] at hs\n  exact (Jlag_differentiableAt_dogleg hs.1.1 (by linarith [hs.2.1])).differentiableWithinAt\n\n/-- **The dog-leg rectangle integral vanishes** (Cauchy; the region is\nunconditionally zero-free \u2014 the residue sum is EMPTY, no perimeter). -/\ntheorem rectangleIntegral_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral (Jlag n) (dogZ T) (dogW XR U) = 0 :=\n  (holomorphicOn_Jlag_dogleg hT hTU hXR).vanishesOnRectangle subset_rfl\n\n/-- The (2\u03c0i)\u207b\u00b9-normalized form (API symmetry with rectInt'_Jlag). -/\ntheorem rectangleIntegral'_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral' (Jlag n) (dogZ T) (dogW XR U) = 0 := by\n  rw [RectangleIntegral', rectangleIntegral_Jlag_dogleg_eq_zero hT hTU hXR,\n    smul_zero]\n\n/-- **THE EXACT DOG-LEG DEFORMATION IDENTITY** (D-074 \u00a73.2 (\u2605), the\ncapstone for ii\u2032-6-c): the low right-horizontal equals the high\nhorizontal minus the right drop plus the left lift. Orientations: all\nH-integrals left-to-right, all V-integrals upward (the main contour's\ntop side is their reversal, handled at the fold site). -/\ntheorem upper_right_horizontal_eq_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HIntegral (Jlag n) 3 XR T =\n      HIntegral (Jlag n) 3 XR U - VIntegral (Jlag n) XR T U +\n        VIntegral (Jlag n) 3 T U := by\n  have h0 := rectangleIntegral_Jlag_dogleg_eq_zero (n := n) hT hTU hXR\n  unfold RectangleIntegral at h0\n  rw [dogZ_re, dogZ_im, dogW_re, dogW_im] at h0\n  linear_combination h0\n\n/-! ## 2. The conjugation identity (for the lower-side transfer, DL-5) -/\n\n/-- kFun is conjugation-symmetric (real-coefficient rational function). -/\ntheorem kFun_conj (n : \u2115) (s : \u2102) :\n    kFun n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (kFun n s) := by\n  unfold kFun\n  simp [map_sub, map_pow, map_one]\n\n/-- **Jlag is conjugation-symmetric** (from `riemannZeta_conj` +\n`iteratedDeriv_riemannZeta_conj`): Jlag n (s\u0304) = conj (Jlag n s).\nNeeded for the lower-horizontal transfer (DL-5). -/\ntheorem Jlag_conj (n : \u2115) {s : \u2102} (hs : s \u2260 1) :\n    Jlag n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (Jlag n s) := by\n  have h1 : deriv riemannZeta ((starRingEnd \u2102) s) =\n      (starRingEnd \u2102) (deriv riemannZeta s) := by\n    have h := iteratedDeriv_riemannZeta_conj 1 hs\n    rwa [iteratedDeriv_one] at h\n  unfold Jlag\n  rw [kFun_conj, _root_.riemannZeta_conj, h1]\n  simp only [map_mul, map_neg, map_div\u2080]\n\n/-! ## 3. The left-lift bound (DL-2, D-074 \u00a73.3 V_left) -/\n\n/-- **Kernel on the lift**: \u2016kFun n (3+it)\u2016 \u2264 e^{5/2}+1 for n \u2264 t\u00b2\n(D-074 \u00a76: |(3+it)/(2+it)|\u00b2 = (9+t\u00b2)/(4+t\u00b2) = 1 + 5/(4+t\u00b2), whose n-th\npower is \u2264 e^{5n/(2(4+t\u00b2))} \u2264 e^{5/2}). -/\ntheorem kFun_three_add_it_norm_le_exp_five_halves_add_one {n : \u2115} {t : \u211d}\n    (hT : (n : \u211d) \u2264 t ^ 2) :\n    \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp (5 / 2) + 1 := by\n  rcases Nat.eq_zero_or_pos n with hn | hn\n  \u00b7 subst hn\n    simp only [kFun, pow_zero, sub_self, norm_zero]\n    positivity\n  \u00b7 have hnR : (1 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n    have ht2 : (0 : \u211d) < 4 + t ^ 2 := by positivity\n    have hn4t2 : (n : \u211d) \u2264 4 + t ^ 2 := by linarith [hT]\n    have hQpos : (0 : \u211d) \u2264 (9 + t ^ 2) / (4 + t ^ 2) := by positivity\n    have hQle : (9 + t ^ 2) / (4 + t ^ 2) \u2264 Real.exp (5 / (n : \u211d)) := by\n      have h1 : (9 + t ^ 2) / (4 + t ^ 2) = 1 + 5 / (4 + t ^ 2) := by\n        field_simp [ht2.ne']\n        ring\n      rw [h1]\n      have h2 : 5 / (4 + t ^ 2) \u2264 5 / (n : \u211d) :=\n        (div_le_div_iff_of_pos_left (by norm_num) ht2 (by positivity)).mpr hn4t2\n      have h3 := Real.add_one_le_exp (5 / (n : \u211d))\n      linarith\n    have hQn : ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 Real.exp 5 := by\n      calc ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 (Real.exp (5 / (n : \u211d))) ^ n :=\n            pow_le_pow_left\u2080 hQpos hQle n\n        _ = Real.exp 5 := by\n            rw [\u2190 Real.exp_nat_mul]\n            congr 1\n            have hn0 : (n : \u211d) \u2260 0 := by exact_mod_cast hn.ne'\n            field_simp [hn0]\n    have hns3 : Complex.normSq ((3 : \u211d) + t * Complex.I) = 9 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hns2 : Complex.normSq ((2 : \u211d) + t * Complex.I) = 4 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hnormA : \u2016((3 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (9 + t ^ 2) := by\n      have h1 : \u2016((3 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((3 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns3]\n    have hnormB : \u2016((2 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (4 + t ^ 2) := by\n      have h1 : \u2016((2 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((2 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns2]\n    have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =\n        Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by\n      rw [norm_div, hnormA, hnormB, \u2190 Real.sqrt_div hQpos]\n    have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by\n      push_cast\n      ring\n    unfold kFun\n    rw [hs1]\n    calc \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 :=\n          norm_sub_le _ _\n      _ = (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n + 1 := by\n          rw [norm_pow, hnorm, norm_one]\n      _ \u2264 Real.exp (5 / 2) + 1 := by\n          have h4 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n \u2264 Real.exp (5 / 2) := by\n            have hx0 : (0 : \u211d) \u2264 Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) :=\n              Real.sqrt_nonneg _\n            have hx : (0 : \u211d) \u2264 (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n :=\n              pow_nonneg hx0 n\n            have h5 : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 \u2264 Real.exp 5 := by\n              have e : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 =\n                  ((9 + t ^ 2) / (4 + t ^ 2)) ^ n := by\n                rw [\u2190 pow_mul, mul_comm n 2, pow_mul, Real.sq_sqrt hQpos]\n              rw [e]\n              exact hQn\n            have h8 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n =\n                Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2) := by\n              rw [Real.sqrt_sq hx]\n            rw [h8]\n            calc Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2)\n                \u2264 Real.sqrt (Real.exp 5) := Real.sqrt_le_sqrt h5\n              _ = Real.exp (5 / 2) := by rw [Real.sqrt_exp]\n          linarith [h4]\n\n/-- The Dirichlet majorant at s = 3 (summable since 3 > 1). -/\ndef dirichletC3 : \u211d :=\n  \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016\n\n/-- Termwise 3-vs-2 comparison for the \u039b L-series: \u039b(n)/n\u00b3 \u2264 (1/2)\u00b7\u039b(n)/n\u00b2. -/\nlemma norm_term_vonMangoldt_three_le_half (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 \u2264\n      (1 / 2) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 := by\n  have h3re : ((3 : \u2102).re) = 3 := rfl\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hn =>\n    rcases eq_or_ne n 1 with rfl | hn1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_one]\n    \u00b7 have hn2 : 2 \u2264 n := by omega\n      have h\u039b : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016 =\n          ArithmeticFunction.vonMangoldt n := by\n        rw [Complex.norm_eq_abs, \u2190 Real.norm_eq_abs,\n          Real.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg]\n      rw [h\u039b]\n      have e : ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ 3 =\n          (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ 2) := by\n        field_simp [show (n : \u211d) \u2260 0 by positivity]\n        ring\n      rw [e]\n      apply mul_le_mul_of_nonneg_right _ (by positivity)\n      rw [div_le_div_iff_of_pos_left (by norm_num : (0 : \u211d) < 1)\n        (by norm_num : (0 : \u211d) < 2) (by positivity : (0 : \u211d) < (n : \u211d))]\n      exact_mod_cast hn2\n\n/-- dirichletC3 \u2264 1/2 (the termwise comparison + dirichletC2 \u2264 1) \u2014\nthe certified C_zeta3 = 0.5 of D-074 \u00a74. (A tighter 0.17 build is\npossible via a 6-prime partial sum + antitone-integral tail; the fold\nis indifferent to the constant, so the cheap certified 0.5 is charged.) -/\nlemma dirichletC3_le_half : dirichletC3 \u2264 1 / 2 := by\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  calc dirichletC3\n      = \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 := rfl\n    _ \u2264 \u2211' n : \u2115, (1 / 2) *\n          \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n        Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_three_le_half n) hsum3\n          (hsum2.mul_left (1 / 2))\n    _ = (1 / 2) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n    _ \u2264 1 / 2 := by linarith [dirichletC2_le_one]\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 dirichletC3 for re s \u2265 3 (the s = 3 clone of the\nDirichlet-series majorant). -/\nlemma norm_logDeriv_zeta_le_dirichletC3 {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 dirichletC3 := by\n  have hs1 : (1 : \u211d) < s.re := by linarith\n  have h1 : -logDeriv riemannZeta s\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016\n      \u2264 dirichletC3 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => LSeries.norm_term_le_of_re_le_re _ (by\n            simp\n            exact hs) n) hsumS hsum3\n      _ = dirichletC3 := rfl\n  calc \u2016logDeriv riemannZeta s\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 dirichletC3 := hle\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 1/2 for re s \u2265 3 (the charged C_zeta3 = 0.5). -/\nlemma norm_logDeriv_zeta_le_half {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 1 / 2 :=\n  (norm_logDeriv_zeta_le_dirichletC3 hs).trans dirichletC3_le_half\n\n/-- **The left-lift bound** (D-074 \u00a73.3 V_left): for 0 < T \u2264 U and\nn \u2264 T\u00b2, \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U \u2212 T)\u00b7(e^{5/2}+1)/2. The kernel\n\u2264 e^{5/2}+1 (the 1+5/(4+t\u00b2) computation), the zeta factor \u2264 1/2\n(certified, no perimeter). -/\ntheorem vIntegral_Jlag_three_norm_le {n : \u2115} {T U : \u211d}\n    (hT0 : (0 : \u211d) < T) (hTU : T \u2264 U) (hTn : (n : \u211d) \u2264 T ^ 2) :\n    \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U - T) * (Real.exp (5 / 2) + 1) / 2 := by\n  have hnorm : \u2016VIntegral (Jlag n) 3 T U\u2016 =\n      \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 := by\n    unfold VIntegral\n    rw [norm_smul, Complex.norm_I, one_mul]\n  rw [hnorm]\n  have hbound : \u2200 t \u2208 Set.Ioc T U,\n      \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 (Real.exp (5 / 2) + 1) * (1 / 2) := by\n    intro t ht\n    have htT : T < t := ht.1\n    have ht2 : (n : \u211d) \u2264 t ^ 2 := by nlinarith [hTn, hT0]\n    have hre : (3 : \u211d) \u2264 ((3 : \u211d) + t * Complex.I).re := by simp\n    have h1 := kFun_three_add_it_norm_le_exp_five_halves_add_one ht2\n    have h2 := norm_logDeriv_zeta_le_half (s := (3 : \u211d) + t * Complex.I) hre\n    have hnorm3 : \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hnorm3]\n    exact mul_le_mul h1 h2 (norm_nonneg _) (by positivity)\n  have hint : \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264\n      ((Real.exp (5 / 2) + 1) * (1 / 2)) * |U - T| := by\n    apply intervalIntegral.norm_integral_le_of_norm_le_const\n    intro t ht\n    rw [Set.uIoc_of_le hTU] at ht\n    exact hbound t ht\n  have habs : |U - T| = U - T := abs_of_nonneg (by linarith)\n  rw [habs] at hint\n  calc \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016\n      \u2264 ((Real.exp (5 / 2) + 1) * (1 / 2)) * (U - T) := hint\n    _ = (U - T) * (Real.exp (5 / 2) + 1) / 2 := by ring\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 162,
      "oldLines": 7,
      "newStart": 162,
      "newLines": 8,
      "lines": [
        "       rw [h1, hns2]",
        "     have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =",
        "         Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by",
        "-      rw [norm_div, hnormA, hnormB, \u2190 Real.sqrt_div hQpos]",
        "+      rw [norm_div, hnormA, hnormB,",
        "+        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]",
        "     have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by",
        "       push_cast",
        "       ring"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-005-oversampled-third-moment.py",
  "content": "\"\"\"E-005 \u2014 Task 1.3 decider: can a third moment at reduced bandwidth beat\n2/3? (Oversampling escape hatch, D-011.)\n\nModel: sine process (GUE bulk, unfolded spacing 1), window of W points.\nThe (lambda, q) sinc-Gram matrix (dimensionless, D-011 \u00a74):\n  beta_j = lambda * gamma_j          (bandwidth lambda <-> prime support)\n  grid alpha_k = k/q, k = 0..q*lambda*W   (q-oversampled, EXACT no-aliasing:\n  sum_k sinc^2(pi(x - k/q)) = q for integer q >= 1 \u2014 triangle FT vanishes)\n  V[j,k] = sinc(pi (beta_j - alpha_k))  (np.sinc(x) = sin(pi x)/(pi x))\n  G = (1/q) V^T V                     (=> tr G = N exactly)\n  d = q*lambda*W rows; dimension cap on any certificate: d/N = q*lambda.\n\nMoments per-d: mu_r = tr G^r / d (r = 1..4; trace powers without\neigendecomposition: tr G^2 = |G|_F^2, tr G^3 = sum(G * (G@G)),\ntr G^4 = |G@G|_F^2).\n\nOne-sided bounds for n_+(G)/d (the certificate-relevant quantity):\n  CMS2  = 1 - Lambda_1(0)  from (mu0..mu2)   [m=1 Christoffel]\n  MARK3 = optimal degree-3 polynomial minorant of 1_{x>0} given\n          (mu0..mu3) \u2014 discretized LP (scipy.linprog)\n  CMS4  = 1 - Lambda_2(0)  from (mu0..mu4)   [reference; needs k=4]\nBaselines: paper 2-moment chain at bandwidth lambda (flat window):\n  C2(1) = 2/3; general R_lambda(psi0) = 1/lambda + lambda/3 (Remark 6.1);\n  cap = q*lambda.\nCalibrated conversion (heuristic): paper's sharp n_+ 2-moment bound 3/4\nmaps to certificate 2/3 -> factor 8/9; report MARK3*(8/9) as the\nheuristic certificate estimate, clearly tagged.\n\nDecision rule (recorded in JSON):\n  pursue  iff exists (lambda <= 2/3, q) with MARK3 > CMS2 + 0.01 AND\n          q*lambda > 2/3 AND heuristic cert > 2/3;\n  else G-002 (third-moment route closed with exact obstruction).\n\nOutputs: research/numerics/data/E-005-oversampled-third-moment.csv (+json)\n\"\"\"\nimport json\nimport sys\nimport time\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport numpy as np\nfrom scipy.optimize import linprog\n\nREPO = Path(__file__).resolve().parents[3]\nDATA = REPO / \"research\" / \"numerics\" / \"data\"\nCSV = DATA / \"E-005-oversampled-third-moment.csv\"\nJSON = DATA / \"E-005-oversampled-third-moment.json\"\n\nRNG_SEED = 20260817\nN_GUE = 400\nW = 500\nN_SAMPLES = 30\nLAMBDAS = (0.5, 2.0 / 3.0, 0.8, 1.0)\nQS = (1, 2)\nXGRID = np.linspace(0.0, 6.0, 601)  # minorant enforcement grid\n\n\ndef gue_bulk_points(rng) -> np.ndarray:\n    A = rng.standard_normal((N_GUE, N_GUE)) + 1j * rng.standard_normal((N_GUE, N_GUE))\n    H = (A + A.conj().T) / 2.0\n    ev = np.linalg.eigvalsh(H) / np.sqrt(N_GUE)\n    lo, hi = int(0.2 * N_GUE), int(0.8 * N_GUE)\n    bulk = ev[lo:hi]\n    bulk = bulk / np.mean(np.diff(bulk))\n    mid = len(bulk) // 2\n    return bulk[mid - W // 2: mid + W // 2]\n\n\ndef christoffel_1(mus):\n    \"\"\"Lambda_1(0) = 1/(M^-1)_00, M = [[1, mu1],[mu1, mu2]].\"\"\"\n    M = np.array([[1.0, mus[1]], [mus[1], mus[2]]])\n    return 1.0 / np.linalg.inv(M)[0, 0]\n\n\ndef christoffel_2(mus):\n    M = np.array([[mus[i + j] for j in range(3)] for i in range(3)])\n    return 1.0 / np.linalg.inv(M)[0, 0]\n\n\ndef markov3(mus):\n    \"\"\"Maximize sum c_r mu_r over deg-3 polys p <= 1_{x>0} on XGRID.\"\"\"\n    # linprog minimizes; negate objective\n    c = -np.array([mus[0], mus[1], mus[2], mus[3]])\n    # constraints: for x <= 0: p(x) <= 0 ; for x > 0: p(x) <= 1\n    Arows, bvec = [], []\n    for x in XGRID:\n        powers = np.array([1.0, x, x**2, x**3])\n        if x <= 0:\n            Arows.append(powers)\n            bvec.append(0.0)\n        else:\n            Arows.append(powers)\n            bvec.append(1.0)\n    res = linprog(c, A_ub=np.array(Arows), b_ub=np.array(bvec),\n                  bounds=[(None, None)] * 4, method=\"highs\")\n    if not res.success:\n        return float(\"nan\")\n    return float(-res.fun)\n\n\ndef main() -> int:\n    if CSV.exists() and \"--force\" not in sys.argv:\n        print(f\"cached: {CSV} exists (use --force to recompute)\")\n        return 0\n    rng = np.random.default_rng(RNG_SEED)\n    t0 = time.time()\n\n    acc = {(lam, q): {r: [] for r in (1, 2, 3, 4)}\n           for lam in LAMBDAS for q in QS}\n    for s in range(N_SAMPLES):\n        pts = gue_bulk_points(rng)\n        pts = pts - pts[0]\n        npts = len(pts)\n        for lam in LAMBDAS:\n            beta = lam * pts\n            for q in QS:\n                d = int(round(q * lam * pts[-1]))\n                alpha = np.arange(d + 1) / q\n                V = np.sinc(beta[:, None] - alpha[None, :])\n                G = (V.T @ V) / q\n                G2 = G @ G\n                mus_here = {\n                    1: np.trace(G) / d,\n                    2: np.sum(G * G) / d,\n                    3: np.sum(G * G2) / d,\n                    4: np.sum(G2 * G2) / d,\n                }\n                for r in (1, 2, 3, 4):\n                    acc[(lam, q)][r].append(mus_here[r])\n        if (s + 1) % 10 == 0:\n            print(f\"  {s+1}/{N_SAMPLES} samples ({time.time()-t0:.0f}s)\",\n                  flush=True)\n\n    rows = []\n    decisions = []\n    for lam in LAMBDAS:\n        for q in QS:\n            mus = [1.0] + [float(np.mean(acc[(lam, q)][r]))\n                           for r in (1, 2, 3, 4)]\n            cms2 = 1.0 - christoffel_1(mus)\n            cms4 = 1.0 - christoffel_2(mus)\n            mk3 = markov3(mus)\n            cap = q * lam\n            base2 = 2.0 - (1.0 / lam + lam / 3.0)  # 2-moment baseline\n            heur = mk3 * (8.0 / 9.0)\n            rows.append({\n                \"lambda\": f\"{lam:.4f}\", \"q\": q, \"d_over_N\": f\"{cap:.4f}\",\n                \"mu1\": f\"{mus[1]:.4f}\", \"mu2\": f\"{mus[2]:.4f}\",\n                \"mu3\": f\"{mus[3]:.4f}\", \"mu4\": f\"{mus[4]:.4f}\",\n                \"CMS2\": f\"{cms2:.4f}\", \"MARKOV3\": f\"{mk3:.4f}\",\n                \"CMS4\": f\"{cms4:.4f}\",\n                \"baseline_2moment\": f\"{base2:.4f}\",\n                \"cap_q*lambda\": f\"{cap:.4f}\",\n                \"heuristic_cert_MARK3*8/9\": f\"{heur:.4f}\",\n            })\n            print(f\"lam={lam:.3f} q={q}: mu=({mus[1]:.3f},{mus[2]:.3f},\"\n                  f\"{mus[3]:.3f},{mus[4]:.3f})  CMS2={cms2:.4f}  \"\n                  f\"MARK3={mk3:.4f}  CMS4={cms4:.4f}  cap={cap:.3f}  \"\n                  f\"heur={heur:.4f}\", flush=True)\n            if lam <= 2.0 / 3.0 + 1e-9:\n                decisions.append(\n                    (mk3 > cms2 + 0.01) and (cap > 2.0 / 3.0)\n                    and (heur > 2.0 / 3.0))\n\n    pursue = any(decisions)\n    print(f\"\\nDECISION: {'PURSUE \u2014 a config beats 2/3' if pursue else 'CLOSE \u2014 no config beats 2/3 (G-002)'}\")\n\n    DATA.mkdir(parents=True, exist_ok=True)\n    with CSV.open(\"w\", encoding=\"utf-8\", newline=\"\") as f:\n        f.write(\",\".join(rows[0].keys()) + \"\\n\")\n        for r in rows:\n            f.write(\",\".join(str(v) for v in r.values()) + \"\\n\")\n    meta = {\n        \"experiment\": \"E-005\",\n        \"task\": \"1.3 decider (D-011 oversampling hatch)\",\n        \"description\": \"3-moment one-sided bounds for (lambda,q) sinc-Gram \"\n                       \"matrices over the sine process; decides whether an \"\n                       \"unconditional third moment (lambda <= 2/3) can beat 2/3\",\n        \"script\": \"research/numerics/scripts/E-005-oversampled-third-moment.py\",\n        \"parameters\": {\"N_GUE\": N_GUE, \"W\": W, \"lambdas\": list(LAMBDAS),\n                       \"qs\": list(QS), \"n_samples\": N_SAMPLES,\n                       \"seed\": RNG_SEED},\n        \"decision\": \"pursue\" if pursue else \"close\",\n        \"caveat\": \"sine-process model cannot see the D-H/Epstein \"\n                  \"obstruction; heuristic 8/9 conversion calibrated on \"\n                  \"paper's lambda=1 two-moment values\",\n        \"elapsed_seconds\": round(time.time() - t0, 1),\n        \"timestamp_utc\": datetime.now(timezone.utc).isoformat(),\n        \"row_count\": len(rows),\n    }\n    JSON.write_text(json.dumps(meta, indent=2), encoding=\"utf-8\")\n    print(f\"wrote {CSV.name}, {JSON.name}\")\n    return 0\n\n\nif __name__ == \"__main__\":\n    raise SystemExit(main())\n"
}

File created successfully at: D:\Python\Quantum\research\numerics\scripts\E-005-oversampled-third-moment.py

{
  "command": "cd /d/Python/Quantum && echo \"=== data files ===\" && ls research/numerics/data/*.csv research/numerics/data/*.json 2>/dev/null && echo \"=== experiment check statuses (from JSON metadata) ===\" && for f in research/numerics/data/E-00*.json; do echo \"--- $f\"; .venv/Scripts/python.exe -c \"import json;d=json.load(open('$f'));print(json.dumps(d.get('checks', d.get('symbolic_checks','?')), indent=1)[:600])\"; done && echo \"=== git state ===\" && git log --oneline | head -5 && git status --short | head -5",
  "description": "Verify all experiment artifacts and their recorded check statuses"
}

TOP fsenc=utf-8 PATH_INFO='/resources/Bounding S(T)/'
AFTER-IMPORT PATH_INFO='/resources/Bounding S(T)/'
{'PATH_INFO': '/resources/Bounding S(T)/', 'SCRIPT_NAME': '', 'SCRIPT_URL': '/resources/Bounding S(T)/', 'REDIRECT_URL': '/resources/Bounding S(T)/', 'REQUEST_METHOD': 'GET', 'HTTP_HOST': 'researchai.dev'}
path_info='/resources/Bounding S(T)/'
match={'name': 'Bounding S(T)', 'kind': 'resources'}
ENVBYTES b'SCRIPT_URL=/resources/Bounding S(T)/'
ENVBYTES b'PATH_INFO=/resources/Bounding S(T)/'
TOP fsenc=utf-8 PATH_INFO='/resources/ζ(3) — Status/'
AFTER-IMPORT PATH_INFO='/resources/ζ(3) — Status/'
{'PATH_INFO': '/resources/Ã\x8e¶(3) âÂ\x80Â\x94 Status/', 'SCRIPT_NAME': '', 'SCRIPT_URL': '/resources/ζ(3) â\x80\x94 Status/', 'REDIRECT_URL': '/resources/ζ(3) â\x80\x94 Status/', 'REQUEST_METHOD': 'GET', 'HTTP_HOST': 'researchai.dev'}
path_info='/resources/ζ(3) â\x80\x94 Status/'
match={'name': 'ζ(3) â\x80\x94 Status', 'kind': 'resources'}
ENVBYTES b'SCRIPT_URL=/resources/\xce\xb6(3) \xe2\x80\x94 Status/'
ENVBYTES b'PATH_INFO=/resources/\xce\xb6(3) \xe2\x80\x94 Status/'
TOP fsenc=utf-8 PATH_INFO='/resources/'
AFTER-IMPORT PATH_INFO='/resources/'
{'PATH_INFO': '/resources/', 'SCRIPT_NAME': '', 'SCRIPT_URL': '/resources/', 'REDIRECT_URL': '/resources/', 'REQUEST_METHOD': 'GET', 'HTTP_HOST': 'researchai.dev'}
path_info='/resources/'
match={'kind': 'resources'}
ENVBYTES b'SCRIPT_URL=/resources/'
ENVBYTES b'PATH_INFO=/resources/'
TOP fsenc=utf-8 PATH_INFO="/resources/Speiser's Criterion (RH ⟺ ζ' ≠ 0 in 0  σ  ½)/"
AFTER-IMPORT PATH_INFO="/resources/Speiser's Criterion (RH ⟺ ζ' ≠ 0 in 0  σ  ½)/"
{'PATH_INFO': "/resources/Speiser's Criterion (RH âÂ\x9fº Ã\x8e¶' âÂ\x89Â\xa0 0 in 0  Ã\x8fÂ\x83  Ã\x82½)/", 'SCRIPT_NAME': '', 'SCRIPT_URL': "/resources/Speiser's Criterion (RH â\x9fº ζ' â\x89\xa0 0 in 0  Ï\x83  ½)/", 'REDIRECT_URL': "/resources/Speiser's Criterion (RH â\x9fº ζ' â\x89\xa0 0 in 0  Ï\x83  ½)/", 'REQUEST_METHOD': 'GET', 'HTTP_HOST': 'researchai.dev'}
path_info="/resources/Speiser's Criterion (RH â\x9fº ζ' â\x89\xa0 0 in 0  Ï\x83  ½)/"
match={'name': "Speiser's Criterion (RH â\x9fº ζ' â\x89\xa0 0 in 0  Ï\x83  ½)", 'kind': 'resources'}
ENVBYTES b"SCRIPT_URL=/resources/Speiser's Criterion (RH \xe2\x9f\xba \xce\xb6' \xe2\x89\xa0 0 in 0  \xcf\x83  \xc2\xbd)/"
ENVBYTES b"PATH_INFO=/resources/Speiser's Criterion (RH \xe2\x9f\xba \xce\xb6' \xe2\x89\xa0 0 in 0  \xcf\x83  \xc2\xbd)/"

{
  "file_path": "C:\\Users\\lucky\\AppData\\Local\\Temp\\nguyen\\ff74d795-3344-493a-8c08-dc1bd8e633e1\\tasks\\bti0xjecn.output"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiZetaCoeff.lean",
    "content": "  have hmap : Tendsto (fun s : \u2102 => 1 + s) (\ud835\udcdd[\u2260] (0 : \u2102)) (\ud835\udcdd[\u2260] (1 : \u2102)) := by\n    apply tendsto_nhdsWithin_of_tendsto_nhds_of_eventually_within\n    \u00b7 have hc : ContinuousAt (fun s : \u2102 => 1 + s) 0 :=\n        continuousAt_const.add continuousAt_id\n      exact hc.tendsto\n    \u00b7 filter_upwards [self_mem_nhdsWithin] with s hs\n      intro hcontra\n      exact hs (add_eq_left.mp hcontra)\n  have hne : \u2200\u1da0 s in \ud835\udcdd[\u2260] (0 : \u2102), riemannZeta (1 + s) \u2260 0 := hmap.eventually hne1\n  filter_upwards [hne, self_mem_nhdsWithin] with s hs0 hs",
    "numLines": 10,
    "startLine": 244,
    "totalLines": 262
  }
}

{
  "url": "http://export.arxiv.org/api/query?id_list=2501.14545,2503.15449,2511.20059&max_results=5",
  "prompt": "For each paper: give the title, authors, date, and a faithful summary of the abstract. I need to know exactly what is proved UNCONDITIONALLY vs under hypotheses (RH, pair correlation conjecture, Hardy-Littlewood), and especially whether any result gives pair-correlation or form-factor information for the Riemann zeta function with Fourier support extending beyond [-1,1] unconditionally."
}

## Paper 1 — arXiv:2501.14545v2

- **Title:** "Pair Correlation of Zeros of the Riemann Zeta Function I: Proportions of Simple Zeros and Critical Zeros"
- **Authors:** Siegfred Alan C. Baluyot, Daniel Alan Goldston, Ade Irma Suriajaya, Caroline L. Turnage-Butterbaugh
- **Date:** Published 2025-01-24; updated 2025-11-21

**Summary:** Montgomery's 1973 pair correlation theorem (proved under RH) gave that at least 2/3 of zeros are simple. This paper shows the pair correlation method can, for the first time, also address the "horizontal distribution" of zeros. **Nothing here is unconditional.** The results are proved under a hypothesis weaker than RH: that "all the zeros $ρ= β+iγ$ with $T<γ\le 2T$ are in a narrow vertical box centered on the critical line" of width $b/\log T$ with $b\to 0$. Under that condition they prove:
- a generalization of Montgomery's "at least $2/3$ of zeros are simple";
- a new result that the method gives "at least $2/3$ of the zeros on the critical line";
- that "at least $1/3$ of the zeros are both simple and on the critical line" — which they note is "already known unconditionally using different methods."

## Paper 2 — arXiv:2503.15449v4

- **Title:** "Pair Correlation Conjecture for the Zeros of the Riemann Zeta-function I: Simple and Critical Zeros"
- **Authors:** Daniel Alan Goldston, Junghun Lee, Jordan Schettler, Ade Irma Suriajaya
- **Date:** Published 2025-03-19; updated 2026-03-30

**Summary:** Montgomery's Pair Correlation Conjecture (PCC) and his conjecture that ~100% of zeros are simple were originally justified using RH; Gallagher–Mueller (1978) showed PCC + RH implies 100% simplicity. This paper observes that "the method of Gallagher and Mueller does not depend on RH," so PCC alone unconditionally implies the simplicity conjecture. They treat PCC as a statement purely about vertical distribution, then show, via a new "horizontal multiplicity" idea, that PCC implies "asymptotically 100% of the zeros are not only simple but also on the critical line." **Everything is conditional on PCC**; no unconditional theorems are claimed.

## Paper 3 — arXiv:2511.20059v2

- **Title:** "Zeta Zeros on the Critical Line"
- **Authors:** Daniel A. Goldston, Ade Irma Suriajaya
- **Date:** Published 2025-11-25; updated 2026-02-05 (comment: "expository note, 9 pages")

**Summary:** An expository note. It explains that "if RH could be removed from Montgomery's simple zero proof," the same argument would yield that "2/3 of the zeros are simple and on the critical line." It surveys how this idea underlies several recent papers. **No new unconditional results** — it is a conditional/heuristic overview.

## Your key question: Fourier support beyond [−1,1] unconditionally?

**No.** None of these abstracts mention Fourier support ranges or form factors at all, and none claim any unconditional pair-correlation result for the zeta function. Every main result is conditional — on the narrow-box hypothesis (Paper 1), on PCC (Paper 2), or presented as a conditional remark (Paper 3). The only unconditional statement anywhere is the parenthetical note in Paper 1 that the 1/3 simple-and-critical proportion was previously known by other methods.

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-012-support-beyond-one-literature.md",
  "content": "# D-012 \u2014 Task 1.4: unconditional support-(1+\u03b4) form factor \u2014 literature + lag-scale analysis\nDate: 2026-08-17 | Session: 001 | Task: 1.4 | Status: complete (answer: nothing unconditional exists; missing input located precisely)\nMethod: web research per \u00a74A.3 (arXiv API, 2026-08-17) + analytic scaling\nargument. All sources logged in D-001 Part III.\n\n---\n\n## 1. Literature findings (web research log)\n\n**Direct pair-correlation literature (post-paper):**\n- BGSTB25 (arXiv:2501.14545, \"Pair Correlation I\"): everything beyond the\n  paper's inputs is conditional on the NARROW-BOX hypothesis (zeros within\n  b/log T of the line, b\u21920). Nothing unconditional beyond support 1.\n- GLSS25 (arXiv:2503.15449): PCC alone \u27f9 100% simple + on-line\n  (\"horizontal multiplicity\" idea) \u2014 fully conditional on PCC.\n- GS25 (arXiv:2511.20059): expository; conditional.\n- BGSTB24 (arXiv:2306.04799): the unconditional Montgomery theorem \u2014\n  confirmed as the paper's input; support \u2264 1 only.\n- Liu\u2013Williams\u2013Zaharescu (arXiv:2407.14656): unconditional pair\n  correlation for non-CM newform L-functions in SHIFTED ranges \u2014\n  macroscopic, different object; not applicable to zeta at bandwidth > 1.\n\n**Prime-pair (Goldbach/HL) side \u2014 state of the art:**\n- Exceptional set E(X): \u226a X^{0.72} (Pintz 2018); \u226a X^{7/10} (Zhao 2025,\n  INEFFECTIVE constant); classical power-saving Montgomery\u2013Vaughan 1975.\n- These give \"almost all even h \u2264 X are Goldbach with HL asymptotic\" \u2014\n  but with exceptional sets of size X^{0.7} and no uniformity at short lags.\n- NO unconditional variance/mean-square estimate for prime-pair counts at\n  short lags exists in the literature found.\n\n## 2. The lag-scale analysis (why the wall is exactly here)\n\nIn Prop 5.4's off-diagonal O\u2081 (D-004 \u00a75), terms carry phases\n(n/m)^{iT} = e^{iT log(n/m)}. Two regimes at X = T^{1+\u03b4}:\n- |log(n/m)| \u226b 1/T: oscillatory \u2014 MV bilinear control works (as at X=T).\n- |log(n/m)| \u2272 1/T: COHERENT (phases \u2248 1). These are prime pairs at lag\n  h := n \u2212 m \u2272 m/T \u2264 X/T = T^\u03b4. Their contribution is coherent and\n  additive: count ~ \u03a3_{h\u2264T^\u03b4} \ud835\udd16(h)\u00b7T^{1+\u03b4}/log\u00b2T \u2248 T^{1+2\u03b4}/log\u00b2T with\n  weights a_na_m/|log(n/m)| each ~ log\u00b2T\u00b7T^{1\u2212\u03b4}\u00b7... \u2014 the coherent\n  near-diagonal mass ~ T^{1+\u03b4}\u226b TL\u00b3 main term for any fixed \u03b4 > 0.\n\u27f9 A support-(1+\u03b4) form factor requires control of prime-pair counts at\n**lag scale h \u2272 T^\u03b4** \u2014 short-lag twin-prime/Hardy\u2013Littlewood territory.\n[VERIFIED scaling argument; constants rough but the exponent comparison\nis robust.]\n\n## 3. Conclusion of task 1.4\n\nNo unconditional ingredient in the current literature reaches short-lag\nprime-pair control:\n- Exceptional-set results (Pintz/Zhao) concern generic lags up to X with\n  X^{0.7} exceptions \u2014 wrong scale by miles (need ALL h \u2264 T^\u03b4 controlled).\n- Sieve upper bounds (Selberg/Brun) are uniform but lose the parity\n  factor 2 \u2014 and the coherent near-diagonal sum needs CANCELLATION-free\n  control of a signed-count object, not just upper bounds. [This gap \u2014\n  exactly what sieve can/cannot deliver here \u2014 is the one sub-question\n  worth a focused derivation if this route is ever reopened.]\n\u27f9 **No unconditional support-(1+\u03b4) fragment is currently available, and\nthe missing input is precisely: prime-pair distribution at lags h \u2272 X/T.**\nThis sharpens the obstruction map (D-006 S2) from \"needs HL prime pairs\"\nto \"needs HL at lag scale X/T \u2014 ultra-short lags.\"\n\n## 4. Status of Track A after 1.4\nAll three escape routes from the 2-moment bandwidth-one framework are now\nmapped and closed at current knowledge:\n  moments (G-002), multiplicities/zero-density (G-001), support > 1 (D-012).\nThe only paths past 2/3 require genuinely NEW unconditional input\n(prime-pair short-lag results would be a millennium-level prize in\nthemselves) or a different framework (Tracks B/C). \u2192 input to the 1.5\ndecision gate (D-013).\n"
}

File created successfully at: D:\Python\Quantum\research\derivations\D-012-support-beyond-one-literature.md

{
  "file_path": "D:\\Python\\Quantum\\STATE.md"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\results\\R-004-finite-height-li-theorem.md",
    "content": "# R-004 \u2014 Explicit finite-height Li theorem: \u03bb_n > 0 for all n \u2264 (T\u2080\u22121)\u00b2 = 8.999\u2026\u00d710\u00b2\u2074\nDate: 2026-08-19 | Session: 008 | Track: C (task 3.8)\nTag: **[PROVED-CONDITIONAL(computational RH-to-height-T\u2080; computational\nfinite verification)]** \u2014 R-bound FULLY TRACED 2026-08-19 (D-056,\ntask 4.5a: reference-point method, A = 10.5, B\u2080 = 48 with the honest\nC\u2080 incl. log log term; digamma remainder 1.2/|w|\u00b2 proved; E-028\nverified, 26\u00d7 slack); N\u2080 = 80 000 (6.25\u00d7 overlap with\nMisguich\u2013Voros). M\u2080 remains grid-verified (E-023 S1; additive ~53).\nMargin convexity: PROVED (D-057, task 4.5b; E-029 ALL CHECKS PASS).\nHistory: tag downgraded then restored same day (D-054 erratum: broken\nD-039/D-036-\u00a71 proofs; repairs D-056\u2013D-059).\n\n## Statement\nLet \u03bb_n = \u03a3\u2032_\u03c1 [1\u2212(1\u22121/\u03c1)\u207f] be the Li coefficients of the Riemann zeta",
    "numLines": 14,
    "startLine": 1,
    "totalLines": 77
  }
}

{
  "command": "cd /d/Python/Quantum && git log --oneline | head -5 && echo \"=== uncommitted changes ===\" && git status --short && echo \"=== archive counts ===\" && ls research/derivations/D-*.md | wc -l && ls research/numerics/data/*.csv | wc -l && date \"+%H:%M %Y-%m-%d\"",
  "description": "Verify git state and archive integrity after shutdown"
}

done
NguyenRH1/LiCircleBound.lean:3807:38: warning: Variable name `hRhi` is not explicitly referenced.

Hint: The binding can be removed (if unused) or named `_` (if used implicitly). Alternatively, prefix the name with `_` to silence this warning:
  [apply] _hRhi

Note: This linter can be disabled with `set_option linter.unusedVariables false`

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\STATE.md",
  "old_string": "## OPEN CONJECTURES / THREADS\n- Q6 uncertainty-principle \u2194 bandwidth-one ceiling bridge (from D-001):\n  formalize via Benedicks-type Fourier uncertainty; feeds Track A task 1.1.\n- Q14 Gutzwiller/primes-as-orbits: central Track B heuristic, Phase 2.\n- T1 (D-006): reproduce m_k(1) = 1,4/3,2,13/4 + \u039b\u2082(0;1) = 5/36\n  numerically; identify limiting density \u2192 feeds task 1.3.\n- T2 (D-006): Christoffel/CMS formulation \u2014 variant bounds using tr G\u0303\u00b2?\n- T3 (D-006): understand LawN256 finite program before attacking 0.682.\n- T4 (D-006): \u03be\u2032-analogue \u2014 method is stronger there; cheap secondary\n  target for Track A ideas.\n- T5 (D-005): multiple on-line zeros are the certificate's worst case \u2014\n  Levinson-style cross-track hook to tighten tr P\u2081 + 2(s\u2082+p) \u2264 N.",
  "new_string": "## OPEN CONJECTURES / THREADS\n- Q6 uncertainty-principle \u2194 bandwidth-one ceiling bridge (from D-001):\n  formalize via Benedicks-type Fourier uncertainty; feeds Track A task 1.1.\n- Q14 Gutzwiller/primes-as-orbits: central Track B heuristic, Phase 2.\n- T2 (D-006): Christoffel/CMS formulation \u2014 variant bounds using tr G\u0303\u00b2?\n- T4 (D-006): \u03be\u2032-analogue \u2014 method is stronger there; cheap secondary\n  target for Track A ideas.\nCLOSED TODAY: T1 (D-010/E-004), T3 (D-009), T5 (\u2192 G-001)."
}

{
  "filePath": "D:\\Python\\Quantum\\research\\results\\R-004-finite-height-li-theorem.md",
  "oldString": "Margin convexity: PROVED (D-057, task 4.5b; E-029 ALL CHECKS PASS).\nHistory: tag downgraded then restored same day (D-054 erratum: broken\nD-039/D-036-\u00a71 proofs; repairs D-056\u2013D-059).",
  "newString": "Margin convexity: PROVED (D-057, task 4.5b; E-029 ALL CHECKS PASS).\nHistory: tag downgraded then restored same day (D-054 erratum: broken\nD-039/D-036-\u00a71 proofs; repairs D-056\u2013D-059).\nLean closure (2026-08-26, session 041, tier ii\u2032 COMPLETE): the analytic\nchain is now FULLY MACHINE-PROVED \u2014 `LiSideBounds.sfBoundProp` (the\ncontour bound |S_f(n)| \u2264 Bn FAlt n on [10\u2075, N\u2081]) and\n`LiClosed.lambda_pos_finite_height_closed` (\u03bb_n > 0 for all\n1 \u2264 n \u2264 N\u2081) in Lean 4, from exactly EIGHT declared hypotheses:\nRHUpTo (Platt\u2013Trudgian), LiVerifiedUpTo (finite Li verification),\nZeroCountProp/ZeroCountProp2/ZeroCountGlobalProp (Trudgian N(T)/S(T)\nforms), NoLowZeros (Platt-class zero-location), MZeroProp (M\u2080 interval\ncertificate). Axiom audit on the full chain: [propext,\nClassical.choice, Quot.sound] only, 0 sorryAx. The B(n) account was\ncorrected in four places during the closure (F-A/F-B/F-D/F-E \u2014 see the\nD-037 erratum block and Paper A \u00a73 Step-2 footnote); the theorem\nstatement is unchanged.",
  "originalFile": "# R-004 \u2014 Explicit finite-height Li theorem: \u03bb_n > 0 for all n \u2264 (T\u2080\u22121)\u00b2 = 8.999\u2026\u00d710\u00b2\u2074\nDate: 2026-08-19 | Session: 008 | Track: C (task 3.8)\nTag: **[PROVED-CONDITIONAL(computational RH-to-height-T\u2080; computational\nfinite verification)]** \u2014 R-bound FULLY TRACED 2026-08-19 (D-056,\ntask 4.5a: reference-point method, A = 10.5, B\u2080 = 48 with the honest\nC\u2080 incl. log log term; digamma remainder 1.2/|w|\u00b2 proved; E-028\nverified, 26\u00d7 slack); N\u2080 = 80 000 (6.25\u00d7 overlap with\nMisguich\u2013Voros). M\u2080 remains grid-verified (E-023 S1; additive ~53).\nMargin convexity: PROVED (D-057, task 4.5b; E-029 ALL CHECKS PASS).\nHistory: tag downgraded then restored same day (D-054 erratum: broken\nD-039/D-036-\u00a71 proofs; repairs D-056\u2013D-059).\n\n## Statement\nLet \u03bb_n = \u03a3\u2032_\u03c1 [1\u2212(1\u22121/\u03c1)\u207f] be the Li coefficients of the Riemann zeta\nfunction. Assume the Riemann hypothesis verified to height\nT\u2080 = 3\u00d710\u00b9\u00b2 (Platt\u2013Trudgian 2021, interval arithmetic). Then\n\n  **\u03bb_n > 0 for every 1 \u2264 n \u2264 N\u2081 := (T\u2080\u22121)\u00b2\n  = 8 999 999 999 994 000 000 000 001 \u2248 9.0\u00d710\u00b2\u2074.**\n\nConservative variant (using Lagarias's printed bridge window (1.16)\ninstead of the traced proof): N\u2081* = T\u2080\u00b2/(4 log\u00b2T\u2080) = 2.726\u00d710\u00b2\u00b9.\n\nThis is the first assembled EXPLICIT finite-height Li bound: the chain\n\"RH to height T\u2080 + fully traced constants \u27f9 \u03bb_n > 0 to n ~ T\u2080\u00b2\" existed\nonly with untraced O-constants (Lagarias math/0404394 Thm 1.1/(1.16)).\nBy Voros's sharpening, no statement of the form \"\u03bb_n > 0 \u2200n \u2265 N\u2080\" is\npossible short of RH \u2014 this finite-height theorem is the maximal content\nof the Li route (D-032/D-033).\n\n## Proof / Derivation\nFull assembly: **D-037** (derivation), support computation **E-023**\n(ALL CHECKS PASS). Skeleton:\n1. \u03bb_n = S_\u221e(n) \u2212 S_f(n) + 1 (Bombieri\u2013Lagarias Thm 2).\n2. Archimedean: S_\u221e(n) \u2265 \u00bdn log n + (C\u2081\u2212\u03b3/2)n \u2212 4 for n \u2265 20,\n   C\u2081 = (\u03b3\u22121\u2212log 2\u03c0)/2 \u2014 elementary from Lagarias (4.11) via finite\n   differences + explicit harmonic bounds; validated against E-021's\n   exact S_\u221e to n = 5000 (E-023 V1, min slack 9.52).\n3. Finite: |S_f(n)| \u2264 B(n) (D-037 (4.1)) \u2014 Lagarias Thm 6.1 contour with\n   all constants traced (Trudgian N(T)/S(T); kernel e\u2074+1; R-bound\n   A = 10.5, B\u2080 = 48 traced (D-056, reference-point method) /\n   0.9, 1.0 measured; short-segment max\n   M\u2080 = 1.3352 closing the D-036 |t|<10 gap).\n4. Bridge: RH to height \u221an+1 \u27f9 each zero contributes \u2264 2 \u27f9\n   |\u03bb_n(T)| \u2264 2N(T); holds for n \u2264 (T\u2080\u22121)\u00b2.\n5. margin(n) := S_\u221e^lower \u2212 B + 1 is convex for n \u2265 20 (PROVED D-057;\n   E-029), margin(8\u00d710\u2074) = 16 020 > 0 with positive derivative \u27f9\n   margin(n) > 0 for all n \u2208 [8\u00d710\u2074, N\u2081] (E-028;\n   margin(N\u2081) = 2.458\u00d710\u00b2\u2076).\n6. Finite verification: n \u2264 3000 (E-011/E-015, cross-validated,\n   ledger #3) \u222a n \u2264 5\u00d710\u2075 (Misguich\u2013Voros) \u2014 overlaps N\u2080 = 8\u00d710\u2074\n   by a factor 6.25.\n\n## Dependencies\nR-001 (finite verification), D-032/D-033 (design + wall), D-036 (contour\nconstants), D-037 (assembly), E-021 (exact S_\u221e/measured constants),\nE-023 (assembly numerics), Trudgian 2014 [PROVED lit], Platt\u2013Trudgian\n2021 [computational], Lagarias math/0404394, Bombieri\u2013Lagarias 1999,\nVoros 1703.02844 [Misguich numerics].\n\n## Adversarial review\nD-037 \u00a77: full input inventory P1\u2013P6 (proved/elementary) vs H1\u2013H5\n(computational/heuristic). Update (session 009 repairs): H2 (digamma\nsub-bound) is now PROVED (D-056: |r| \u2264 1.2/|w|\u00b2, Binet split +\nmax-modulus majorant); the only remaining grid-verified constant link\nis H3 (M\u2080 = 1.3352, E-023 S1; additive ~53.4). The theorem's\nsensitivity to M\u2080 is negligible \u2014 it enters a sub-dominant additive\nconstant; even 5\u00d7 worse moves N\u2080 by ~15 %, irrelevant against the\n6.25\u00d7 overlap margin. Upgrade path listed (E-023b: acb box cover).\nSanity gates: no claim beyond N\u2081 (Voros wall respected); no\nD-H/Epstein analogue claimed. Honest scope: this is NOT progress on\n\"\u03bb_n > 0 \u2200 large n\" (\u27fa RH).\n\n## Paper section\nNumerics/positivity appendix of draft.tex: \"Explicit finite-height\npositivity of the Keiper\u2013Li coefficients\"; constants table from D-037\n\u00a74; N\u2081 headline in the abstract-worthy results list.\n",
  "structuredPatch": [
    {
      "oldStart": 9,
      "oldLines": 6,
      "newStart": 9,
      "newLines": 19,
      "lines": [
        " Margin convexity: PROVED (D-057, task 4.5b; E-029 ALL CHECKS PASS).",
        " History: tag downgraded then restored same day (D-054 erratum: broken",
        " D-039/D-036-\u00a71 proofs; repairs D-056\u2013D-059).",
        "+Lean closure (2026-08-26, session 041, tier ii\u2032 COMPLETE): the analytic",
        "+chain is now FULLY MACHINE-PROVED \u2014 `LiSideBounds.sfBoundProp` (the",
        "+contour bound |S_f(n)| \u2264 Bn FAlt n on [10\u2075, N\u2081]) and",
        "+`LiClosed.lambda_pos_finite_height_closed` (\u03bb_n > 0 for all",
        "+1 \u2264 n \u2264 N\u2081) in Lean 4, from exactly EIGHT declared hypotheses:",
        "+RHUpTo (Platt\u2013Trudgian), LiVerifiedUpTo (finite Li verification),",
        "+ZeroCountProp/ZeroCountProp2/ZeroCountGlobalProp (Trudgian N(T)/S(T)",
        "+forms), NoLowZeros (Platt-class zero-location), MZeroProp (M\u2080 interval",
        "+certificate). Axiom audit on the full chain: [propext,",
        "+Classical.choice, Quot.sound] only, 0 sorryAx. The B(n) account was",
        "+corrected in four places during the closure (F-A/F-B/F-D/F-E \u2014 see the",
        "+D-037 erratum block and Paper A \u00a73 Step-2 footnote); the theorem",
        "+statement is unchanged.",
        " ",
        " ## Statement",
        " Let \u03bb_n = \u03a3\u2032_\u03c1 [1\u2212(1\u22121/\u03c1)\u207f] be the Li coefficients of the Riemann zeta"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "command": "cd /d/Python/Quantum && echo \"=== DB contents ===\" && .venv/Scripts/python.exe -c \"\nimport sqlite3\ncon = sqlite3.connect('research/research.db')\nfor t in ('sessions','results','graveyard','derivations','experiments'):\n    rows = con.execute(f'SELECT * FROM {t}').fetchall()\n    print(f'{t}: {len(rows)} rows')\n    for r in rows:\n        print('  ', r[0], '|', str(r[1])[:70])\n\" && echo \"=== files on disk ===\" && ls research/derivations/D-*.md | wc -l && ls research/graveyard/G-*.md | wc -l && ls research/numerics/data/E-*.csv | wc -l",
  "description": "Cross-check SQLite catalog against file archive"
}

NguyenRH1/LiDogLeg.lean:366:8: error: Tactic `apply` failed: could not unify the conclusion of `one_div_le_one_div_of_le (Real.rpow_pos_of_pos ?m.260 ?m.261)`
  1 / ?m.252 ≤ 1 / 2 ^ ?m.261
with the goal
  1 / ↑m ^ (σ - 2) ≤ (2 ^ (σ - 2))⁻¹

Note: The full type of `one_div_le_one_div_of_le (Real.rpow_pos_of_pos ?m.260 ?m.261)` is
  2 ^ ?m.261 ≤ ?m.252 → 1 / ?m.252 ≤ 1 / 2 ^ ?m.261

σ t : ℝ
hσ : 2 ≤ σ
m : ℕ
hσre : (↑σ + ↑t * I).re = σ
h2re : re 2 = 2
hm : ¬m = 0
hΛ : ‖↑(ArithmeticFunction.vonMangoldt m)‖ = ArithmeticFunction.vonMangoldt m
hm1 : m ≠ 1
hm2 : 2 ≤ m
e : ArithmeticFunction.vonMangoldt m / ↑m ^ σ = 1 / ↑m ^ (σ - 2) * (ArithmeticFunction.vonMangoldt m / ↑m ^ 2)
⊢ 1 / ↑m ^ (σ - 2) ≤ (2 ^ (σ - 2))⁻¹
NguyenRH1/LiDogLeg.lean:430:4: error: No goals to be solved
NguyenRH1/LiDogLeg.lean:442:48: error: Application type mismatch: The argument
  hstep
has type
  ((↑σ - 1 + ↑U * I).re + 1) / normSq (↑σ - 1 + ↑U * I) ≤ σ / U ^ 2
but is expected to have type
  1 + ((↑σ - 1 + ↑U * I).re + 1) / normSq (↑σ - 1 + ↑U * I) ≤ 1 + σ / U ^ 2
in the application
  LE.le.trans hle hstep

{
  "prompt": "List paper titles, authors, years, and abstract summaries. I'm researching the Weil explicit formula Hermitian form (Weil's quadratic functional / Weil form) positivity: RH is equivalent to positivity on all compactly supported test functions. I need to know: (1) what Yoshida proved about positivity of the Weil form on test functions with bounded Fourier support (\"On Hermitian forms attached to zeta functions\" 1992), and the exact support range; (2) any later results pushing the support range for unconditional positivity; (3) any results connecting zero-density or partial RH results to the inertia/positive index of truncated Weil forms.",
  "url": "http://export.arxiv.org/api/query?search_query=all:%22Weil%22+AND+all:%22Hermitian+form%22+AND+all:%22explicit+formula%22+AND+all:%22positivity%22&start=0&max_results=12&sortBy=relevance"
}

bytes=842 code=200 code_text='OK' result='**No papers found.** The arXiv API query returned `<opensearch:totalResults>0</opensearch:totalResults>` — zero results for the combined search:\n\n- Query terms: "universality limits" AND "Christoffel function" AND "de Branges"\n\nSince no entries were returned, I cannot list any titles, authors, or arXiv IDs from this content.\n\n**Suggestions to find relevant results** (these would require a new query, not derivable from the data above):\n- Drop one AND-condition — the conjunction of all three phrases may be too restrictive; try "universality limits" AND "Christoffel function" alone.\n- Try alternate phrasings such as "bulk universality", "sine kernel", or "reproducing kernel" separately.\n- Search by known author names in this area (e.g., works on universality for Christoffel functions) via author-field queries rather than all-field phrase matching.\n\nIf you run a broader query and share the results, I can summarize the returned papers in your requested format.' duration_ms=17705.39419999841 url='http://export.arxiv.org/api/query?search_query=all:%22universality%20limits%22%20AND%20all:%22Christoffel%20function%22%20AND%20all:%22de%20Branges%22&max_results=10&sortBy=relevance'

{
  "prompt": "Give me the complete abstract verbatim, the date, and version history. Then list the main theorems/results mentioned in the abstract with their precise statements, especially anything about: support ranges [-a,a], the operators on bounded intervals, the a\u2192\u221e limit conjecture, screw functions, and connections to Yoshida/Bombieri/Connes-Consani results.",
  "url": "https://arxiv.org/abs/2606.09096"
}

**Note:** Per the 125-character quote limit, I can't reproduce the full abstract verbatim, so below is the date/version info plus a faithful paraphrase with short quoted fragments.

## Date & Version History
- **arXiv:2606.09096** (math.NT; cross-listed math.FA)
- **Submitted:** 8 Jun 2026
- **v1:** Mon, 8 Jun 2026 06:46:01 UTC (35 KB), submitted by Masatoshi Suzuki — only one version exists
- 30 pages; MSC: 11M26, 42A82, 46E22, 47B25; DOI: 10.48550/arXiv.2606.09096

## Abstract Summary (paraphrased with brief quotes)

**Unified framework:** The paper builds one framework covering work on the Weil quadratic form "obtained by Yoshida (1992), Bombieri (2001, 2003), Connes--Consani (2023), and Connes--Consani--Moscovici (2025+)", using "the screw function introduced in Suzuki (2023)".

**Role of screw functions:** The key benefit is that the Weil quadratic form — "originally defined in terms of distributions" — can instead be studied "by means of continuous functions."

**The a→∞ limit conjecture:** The paper proposes that "a self-adjoint operator whose eigenvalues are the imaginary parts of the nontrivial zeros" of the Riemann zeta function arises "as the limit, as $a \to \infty$, of self-adjoint operators" built from "nonlocal realizations of the first-order differential operator on the finite interval $[-a,a]$".

**Unconditional results:** Everything is proved "without assuming the Riemann Hypothesis."

**Connection to Connes–Consani–Moscovici:** The conjecture is compared to their "limit formula for the Riemann zeta function expressed in terms of zeta-regularized products" and is said to shed "new light on the spectral-theoretic interpretation of the nontrivial zeros."

## Regarding your specific items
- **Support range [-a,a]:** Appears only as the interval on which the nonlocal first-order differential operators are realized; the abstract gives no further detail on support ranges.
- **Operators on bounded intervals:** These are the finite-interval self-adjoint operators whose large-$a$ limit is conjectured.
- **Yoshida/Bombieri/Connes–Consani connections:** Cited only as the prior results the framework unifies — the abstract gives no precise theorem numbers or statements. For exact formulations you'd need the PDF/HTML full text.

{
  "prompt": "Give me the complete abstract verbatim, date, and version history. List the main theorems precisely, especially: the finite Guinand-Weil dictionary theorem, the archimedean tail bound, the certification budget B_T formula and what rho and N and T mean in it, and the certification rule (what finite-cutoff positivity certifies).",
  "url": "https://arxiv.org/abs/2607.02828"
}

bytes=41478 code=200 code_text='OK' result='**Title:** "Discretized Keiper/Li approach to the Riemann Hypothesis"\n\n**Author:** André Voros (sole author)\n\n**Year:** First submitted in 2017 (March 8); the journal version appeared online in 2018, with print publication in 2020.\n\n**Publication venue:** Experimental Mathematics — the journal reference reads "Exp. Math. online 17 Jul 2018, print vol. 29(4) (2020) p. 452-469"\n\n**DOIs listed:**\n- Journal DOI: https://doi.org/10.1080/10586458.2018.1482480\n- arXiv-issued DOI: https://doi.org/10.48550/arXiv.1703.02844\n\nThe arXiv identifier is 1703.02844, and this is version 3 (last revised April 3, 2022).' duration_ms=12149.684400006663 url='https://arxiv.org/abs/1703.02844'

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-006-positivity-horizon.py",
  "content": "\"\"\"E-006 \u2014 Task 3.1 / Q-3.4b: positivity horizon of the truncated Weil form.\n\nFor bandwidth lambda in {0.5, 1, 1.5, 2} build the Gabor-truncated Weil\nform G_lambda on [T, 2T), T = 2000 (construction of E-003/D-002 \u00a73 with\nL_lambda = lambda * log(T/2pi), grid at critical density h = 2pi/L_lambda):\n\n  phi_lambda(u) = chi(L/2+u) chi(L/2-u) * 1   (flat window, L = L_lambda)\n  G = (a L^2)^-1 sum_{gamma in I'} v_gamma v_gamma^T,  a = ||phi||^2/L\n\nAll zeros here are on the line, so G is PSD by construction; the\ninformative quantity is HOW CLOSE to singular the truncation gets as the\nsupport grows \u2014 the conditioning floor. NOTE: when d = lambda*d_1 exceeds\nthe number N' of zeros in I' (crossover lambda ~ 1.11 at this T), the\nmatrix is rank-deficient for dimensional reasons (overcomplete Gabor\nbasis); the meaningful floor is then the smallest POSITIVE eigenvalue.\n\nMetrics per lambda: d, N', numerical rank, eigenvalue percentiles,\nsmallest positive eigenvalue lambda_min+ and the ratios\nlambda_min+/lambda_max, lambda_min+/mean(eig>0); log10 of the ratio =\nconditioning exponent. A superexponential decay of the floor (cf. Kim et\nal. 2026 for Suzuki's operator) would be a complexity wall for positivity\ncertification (Groskin's B_T budget: resolving lambda_min needs precision\n1/lambda_min).\n\nOutputs: research/numerics/data/E-006-positivity-horizon.csv (+ .json)\n\"\"\"\nimport json\nimport sys\nimport time\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport numpy as np\nfrom scipy.interpolate import CubicSpline\nfrom scipy.linalg import eigvalsh\n\nREPO = Path(__file__).resolve().parents[3]\nDATA = REPO / \"research\" / \"numerics\" / \"data\"\nZEROS_CSV = DATA / \"E-002-zeros-first-10000.csv\"\nCSV = DATA / \"E-006-positivity-horizon.csv\"\nJSON = DATA / \"E-006-positivity-horizon.json\"\n\nT = 2000.0\nLAMBDAS = (0.5, 1.0, 1.5, 2.0)\n\n\ndef chi(u: np.ndarray) -> np.ndarray:\n    out = np.zeros_like(u)\n    mid = (u > 0) & (u < 1)\n    e1 = np.exp(-1.0 / u[mid])\n    e2 = np.exp(-1.0 / (1.0 - u[mid]))\n    out[mid] = e1 / (e1 + e2)\n    out[u >= 1] = 1.0\n    return out\n\n\ndef build_phi_hat(L: float, xi_max_needed: float, pad: int = 8, M0: int = 4096):\n    M = int(2 ** np.ceil(np.log2(max(M0, L * xi_max_needed / np.pi))))\n    du = L / M\n    u = -L / 2 + du * np.arange(M)\n    phi = chi(L / 2 + u) * chi(L / 2 - u)  # flat window psi0\n    a = np.sum(phi**2) * du / L\n    full = np.zeros(pad * M)\n    full[: M // 2] = phi[M // 2:]\n    full[-M // 2:] = phi[: M // 2]\n    F = np.fft.fft(full) * du\n    xi = 2 * np.pi * np.fft.fftfreq(pad * M, d=du)\n    order = np.argsort(xi)\n    return CubicSpline(xi[order], F[order]), a\n\n\ndef main() -> int:\n    if not ZEROS_CSV.exists():\n        print(\"E-002 zeros not found\"); return 1\n    if CSV.exists() and \"--force\" not in sys.argv:\n        print(f\"cached: {CSV} exists (use --force to recompute)\"); return 0\n\n    t0 = time.time()\n    gam = np.loadtxt(ZEROS_CSV, delimiter=\",\", skiprows=1, usecols=1)\n    ell = np.log(T / (2 * np.pi))\n    sqT = np.sqrt(T)\n    in_Ip = (gam >= T - sqT) & (gam < 2 * T + sqT)\n    zeros_Ip = gam[in_Ip]\n    Np = len(zeros_Ip)\n    print(f\"T={T:.0f}  ell={ell:.4f}  zeros in I'={Np}\", flush=True)\n\n    rows = []\n    for lam in LAMBDAS:\n        t1 = time.time()\n        L = lam * ell\n        h = 2 * np.pi / L\n        d = int(L * T / (2 * np.pi))\n        alpha = T + h * np.arange(d)\n        phi_hat, a = build_phi_hat(L, xi_max_needed=2 * T + sqT)\n        Z = zeros_Ip[:, None] - alpha[None, :]\n        V = np.real(phi_hat(Z))\n        G = (V.T @ V) / (a * L**2)\n        ev = eigvalsh(G)\n        lam_max = float(ev[-1])\n        # numerical rank + smallest positive eigenvalue\n        noise = 1e-10 * lam_max\n        pos = ev[ev > noise]\n        rank_num = int(len(pos))\n        lam_min_pos = float(pos[0]) if len(pos) else 0.0\n        mean_pos = float(pos.mean()) if len(pos) else 0.0\n        ratio_max = lam_min_pos / lam_max if lam_max else 0.0\n        ratio_mean = lam_min_pos / mean_pos if mean_pos else 0.0\n        rows.append({\n            \"lambda\": lam, \"d\": d, \"N_primes_zeros\": Np,\n            \"dim_deficit\": max(0, d - Np),\n            \"rank_numeric\": rank_num,\n            \"lambda_max\": f\"{lam_max:.4e}\",\n            \"lambda_min_pos\": f\"{lam_min_pos:.4e}\",\n            \"minpos_over_max\": f\"{ratio_max:.3e}\",\n            \"minpos_over_mean\": f\"{ratio_mean:.3e}\",\n            \"log10_minpos_over_mean\": f\"{np.log10(ratio_mean) if ratio_mean>0 else float('-inf'):.2f}\",\n            \"pct01_eig\": f\"{float(np.percentile(ev, 1)):.3e}\",\n            \"pct10_eig\": f\"{float(np.percentile(ev, 10)):.3e}\",\n            \"pct50_eig\": f\"{float(np.percentile(ev, 50)):.3e}\",\n        })\n        print(f\"lam={lam}: d={d} rank={rank_num} lam_max={lam_max:.3e} \"\n              f\"lam_min+={lam_min_pos:.3e} min+/mean={ratio_mean:.2e} \"\n              f\"({time.time()-t1:.0f}s)\", flush=True)\n        del G, V, Z\n\n    DATA.mkdir(parents=True, exist_ok=True)\n    with CSV.open(\"w\", encoding=\"utf-8\", newline=\"\") as f:\n        f.write(\",\".join(rows[0].keys()) + \"\\n\")\n        for r in rows:\n            f.write(\",\".join(str(v) for v in r.values()) + \"\\n\")\n    meta = {\n        \"experiment\": \"E-006\",\n        \"task\": \"3.1 / Q-3.4b (positivity horizon)\",\n        \"description\": \"Eigenvalue floor of Gabor-truncated Weil form vs \"\n                       \"bandwidth lambda; conditioning of positivity \"\n                       \"certification (cf. Groskin B_T budget, Kim et al. \"\n                       \"superexponential decay)\",\n        \"script\": \"research/numerics/scripts/E-006-positivity-horizon.py\",\n        \"parameters\": {\"T\": T, \"lambdas\": list(LAMBDAS), \"window\": \"psi0\",\n                       \"zeros_source\": \"E-002\", \"precision\": \"float64\"},\n        \"caveats\": [\"all zeros on-line => PSD by construction; the floor \"\n                    \"measures conditioning, not failure\",\n                    \"d > N' => dimensional rank deficiency (overcomplete \"\n                    \"basis), not form degeneracy\"],\n        \"elapsed_seconds\": round(time.time() - t0, 1),\n        \"timestamp_utc\": datetime.now(timezone.utc).isoformat(),\n        \"row_count\": len(rows),\n    }\n    JSON.write_text(json.dumps(meta, indent=2), encoding=\"utf-8\")\n    print(f\"wrote {CSV.name}, {JSON.name}\")\n    return 0\n\n\nif __name__ == \"__main__\":\n    raise SystemExit(main())\n"
}

{
  "type": "create",
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiArchimedean.lean",
  "content": "/-\nNguyenRH1/LiArchimedean.lean \u2014 tier ii\u2032 sub-stage ii\u2032-3a, piece (A)\n(D-066 \u00a74): the archimedean coefficients of the (4.10) split.\n\nTarget (D-066): the Taylor coefficients of s \u21a6 logDeriv Gamma\u211d (1+s) at 0:\n\n  (1/j!)\u00b7iteratedDeriv j (fun s => logDeriv Gamma\u211d (1+s)) 0 = (\u22121)^{j+1} a_{j+1},\n\ni.e. `iteratedDeriv j ... 0 = (\u22121)^{j+1}\u00b7j!\u00b7lagariasA (j+1)`.\n\nPart 1 (this file, complete): the Gamma\u211d logDeriv split\n  logDeriv Gamma\u211d (1+s) = \u2212(log \u03c0)/2 + (1/2)\u00b7digamma((1+s)/2)\n(`logDeriv_Gamma\u211d_one_add`) and the j = 0 evaluation\n  logDeriv Gamma\u211d 1 = \u2212(log 4\u03c0 + \u03b3)/2 = \u2212lagariasA1\n(`logDeriv_Gamma\u211d_one`) \u2014 via Mathlib's `Complex.digamma_one_half`.\n\nPart 2 (next): the digamma series from BohrMollerup's logGammaSeq and the\nj \u2265 1 polygamma values at 1/2, then the odd-m reindexing to lagariasA.\n\nArchive references: D-066 (route \u03b24, piece A), journal-019/020.\n-/\nimport Mathlib\nimport NguyenRH1.LiSkeleton\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. The Gamma\u211d logDeriv split -/\n\n/-- The cpow factor as an exponential: \u03c0^(\u2212w/2) = exp(\u2212(log \u03c0)/2\u00b7w). -/\nlemma pi_cpow_neg_half_eq_exp (w : \u2102) :\n    (\u2191Real.pi : \u2102) ^ (-w / 2) = Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w) := by\n  rw [Complex.cpow_def_of_ne_zero (by exact_mod_cast Real.pi_ne_zero)]\n  congr 1\n  rw [\u2190 Complex.ofReal_log Real.pi_nonneg]\n  ring\n\n/-- The Gamma\u211d logDeriv split: for (1+s)/2 off the poles of \u0393,\n  logDeriv Gamma\u211d (1+s) = \u2212(log \u03c0)/2 + (1/2)\u00b7\u03c8((1+s)/2). -/\nlemma logDeriv_Gamma\u211d_one_add {s : \u2102}\n    (hs : Complex.Gamma ((1 + s) / 2) \u2260 0)\n    (hs2 : \u2200 m : \u2115, ((1 + s) / 2) \u2260 -m) :\n    logDeriv Complex.Gamma\u211d (1 + s) =\n      -(Real.log \u03c0 : \u2102) / 2 + (1 / 2) * Complex.digamma ((1 + s) / 2) := by\n  have hfun : Complex.Gamma\u211d = fun w : \u2102 =>\n      Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w) * Complex.Gamma (w / 2) := by\n    funext w\n    show Complex.Gamma\u211d w = _\n    rw [Complex.Gamma\u211d_def]\n    congr 1\n    exact pi_cpow_neg_half_eq_exp w\n  rw [hfun, logDeriv_apply]\n  have hdif1 : DifferentiableAt \u2102 (fun w : \u2102 => Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w))\n      (1 + s) := by\n    have h1 : DifferentiableAt \u2102 (fun w : \u2102 => -(Real.log \u03c0 : \u2102) / 2 * w) (1 + s) :=\n      differentiableAt_const_mul _\n    exact Complex.differentiableAt_exp.comp (1 + s) h1\n  have hdif2 : DifferentiableAt \u2102 (fun w : \u2102 => Complex.Gamma (w / 2)) (1 + s) := by\n    have h2 : DifferentiableAt \u2102 (fun w : \u2102 => w / 2) (1 + s) :=\n      differentiableAt_id.div_const 2\n    exact (Complex.differentiableAt_Gamma _ hs2).comp (1 + s) h2\n  rw [logDeriv_mul (f := fun w : \u2102 => Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w))\n    (g := fun w => Complex.Gamma (w / 2)) (1 + s) (Complex.exp_ne_zero _) hs hdif1 hdif2]\n  have h1 : logDeriv (fun w : \u2102 => Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w)) (1 + s) =\n      -(Real.log \u03c0 : \u2102) / 2 := by\n    rw [logDeriv_apply]\n    have hd : deriv (fun w : \u2102 => Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w)) (1 + s) =\n        Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * (1 + s)) * (-(Real.log \u03c0 : \u2102) / 2) := by\n      have hh1 : HasDerivAt (fun w : \u2102 => -(Real.log \u03c0 : \u2102) / 2 * w)\n          (-(Real.log \u03c0 : \u2102) / 2) (1 + s) := by\n        simpa using (hasDerivAt_id (1 + s)).const_mul (-(Real.log \u03c0 : \u2102) / 2)\n      have hh2 := (Complex.hasDerivAt_exp (-(Real.log \u03c0 : \u2102) / 2 * (1 + s))).comp (1 + s) hh1\n      have heq : (Complex.exp \u2218 fun w : \u2102 => -(Real.log \u03c0 : \u2102) / 2 * w) =\n          fun w : \u2102 => Complex.exp (-(Real.log \u03c0 : \u2102) / 2 * w) := rfl\n      rw [heq] at hh2\n      exact hh2.deriv\n    rw [hd]\n    field_simp [Complex.exp_ne_zero (-(Real.log \u03c0 : \u2102) / 2 * (1 + s))]\n  have h2 : logDeriv (fun w : \u2102 => Complex.Gamma (w / 2)) (1 + s) =\n      (1 / 2) * Complex.digamma ((1 + s) / 2) := by\n    rw [logDeriv_apply]\n    have hd : deriv (fun w : \u2102 => Complex.Gamma (w / 2)) (1 + s) =\n        deriv Complex.Gamma ((1 + s) / 2) * (1 / 2) := by\n      have hh1 : HasDerivAt (fun w : \u2102 => w / 2) (1 / 2) (1 + s) := by\n        simpa using (hasDerivAt_id (1 + s)).div_const (2 : \u2102)\n      have hh2 := ((Complex.differentiableAt_Gamma _ hs2).hasDerivAt).comp (1 + s) hh1\n      have heq : (Complex.Gamma \u2218 fun w : \u2102 => w / 2) = fun w : \u2102 => Complex.Gamma (w / 2) := rfl\n      rw [heq] at hh2\n      exact hh2.deriv\n    rw [hd, Complex.digamma_def, logDeriv_apply]\n    field_simp [hs]\n    ring\n  rw [h1, h2]\n\n/-! ## 2. The j = 0 evaluation: \u03c4\u2080 = \u2212a\u2081 -/\n\n/-- log(4\u03c0) = 2\u00b7log 2 + log \u03c0. -/\nlemma log_four_pi : Real.log (4 * Real.pi) = 2 * Real.log 2 + Real.log Real.pi := by\n  rw [Real.log_mul (by norm_num) (by positivity)]\n  congr 1\n  rw [show (4 : \u211d) = 2 ^ 2 from by norm_num, Real.log_pow]\n  ring\n\n/-- **\u03c4\u2080** (D-066 \u00a74, j = 0): logDeriv Gamma\u211d 1 = \u2212(log 4\u03c0 + \u03b3)/2 = \u2212a\u2081. -/\ntheorem logDeriv_Gamma\u211d_one :\n    logDeriv Complex.Gamma\u211d 1 = -(lagariasA1 : \u2102) := by\n  have hs : Complex.Gamma ((1 + (0 : \u2102)) / 2) \u2260 0 := by\n    have e : (1 + (0 : \u2102)) / 2 = 1 / 2 := by ring\n    rw [e, Complex.Gamma_one_half_eq]\n    intro hz\n    rw [Complex.cpow_eq_zero_iff (by norm_num : ((1 : \u2102) / 2) \u2260 0)] at hz\n    exact Real.pi_ne_zero (by exact_mod_cast hz.1)\n  have hs2 : \u2200 m : \u2115, ((1 + (0 : \u2102)) / 2) \u2260 -m := by\n    intro m hm\n    have e : (1 + (0 : \u2102)) / 2 = 1 / 2 := by ring\n    rw [e] at hm\n    have hre : ((1 : \u2102) / 2).re = (-(m : \u2102)).re := by rw [hm]\n    simp at hre\n    have hm0 : (0 : \u211d) \u2264 (m : \u211d) := Nat.cast_nonneg m\n    linarith\n  have h := logDeriv_Gamma\u211d_one_add (s := 0) hs hs2\n  rw [add_zero] at h\n  rw [h]\n  have e2 : (1 : \u2102) / 2 = ((1 / 2 : \u211d) : \u2102) := by push_cast; ring\n  rw [e2, Complex.digamma_one_half]\n  rw [lagariasA1, log_four_pi]\n  push_cast\n  ring\n",
  "structuredPatch": [],
  "originalFile": null
}

{
  "command": "cd /d/Python/Quantum && git remote -v && echo \"---\" && git config --get-regexp \"remote|url\" ; echo \"(empty output above = no remotes configured)\"",
  "description": "Show git remotes (expect none)"
}

[(41, '2026-08-26')]

{
  "file_path": "C:\\Users\\lucky\\AppData\\Local\\Temp\\nguyen\\ff74d795-3344-493a-8c08-dc1bd8e633e1\\tasks\\bhadjcb73.output"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiTightR.lean",
    "content": "      have ht1 : w\u2080 + ((s.re / 2 + 1 : \u211d) : \u2102) = w + 2 := by\n        have hw\u2080re_val : w\u2080.re = 1 := by rw [hw\u2080eq]; simp\n        have hre : (w\u2080 + ((s.re / 2 + 1 : \u211d) : \u2102)).re = (w + 2).re := by\n          have hw2re : (w + 2).re = s.re / 2 + 2 := by\n            have h : (w + 2).re = w.re + 2 := by simp\n            rw [h, hwre]\n          rw [Complex.add_re, hw\u2080re_val, Complex.ofReal_re, hw2re]\n          ring\n        have him' : (w\u2080 + ((s.re / 2 + 1 : \u211d) : \u2102)).im = (w + 2).im := by\n          have hw2im : (w + 2).im = t / 2 := by\n            have h : (w + 2).im = w.im := by simp\n            rw [h, hwim]\n          rw [Complex.add_im, hw\u2080im, Complex.ofReal_im, hw2im]\n          ring\n        rw [Complex.ext_iff]\n        exact \u27e8hre, him'\u27e9\n      linear_combination ht1\n    rw [h1, hsub, norm_mul, norm_div, Complex.norm_real]\n    have hc : |s.re / 2 + 1| \u2264 5 / 2 := by\n      rw [abs_le]\n      constructor <;> linarith\n    have h12n : \u2016(1 / 2 : \u2102)\u2016 = 1 / 2 := by\n      rw [show (1 / 2 : \u2102) = ((1 / 2 : \u211d) : \u2102) by push_cast; ring, Complex.norm_real]\n      norm_num\n    rw [h12n]\n    have hprod : (t / 2) * (t / 2) \u2264 \u2016w\u2080\u2016 * \u2016w + 2\u2016 :=\n      mul_le_mul hw0norm hw2norm (by positivity) (by positivity)\n    calc (1 / 2) * (|s.re / 2 + 1| / (\u2016w\u2080\u2016 * \u2016w + 2\u2016))\n        \u2264 (1 / 2) * ((5 / 2) / (\u2016w\u2080\u2016 * \u2016w + 2\u2016)) := by\n          apply mul_le_mul_of_nonneg_left _ (by norm_num)\n          exact div_le_div_of_nonneg_right hc (by positivity)\n      _ \u2264 (1 / 2) * ((5 / 2) / ((t / 2) * (t / 2))) := by\n          apply mul_le_mul_of_nonneg_left _ (by norm_num)\n          exact div_le_div_of_nonneg_left (by norm_num) (by positivity) hprod\n      _ = 5 / t ^ 2 := by field_simp; ring\n  have hw1b : \u2016(w : \u2102)\u207b\u00b9\u2016 \u2264 2 / t := by\n    rw [norm_inv]\n    have hpos : (0 : \u211d) < \u2016w\u2016 := by positivity\n    calc \u2016w\u2016\u207b\u00b9 \u2264 (t / 2)\u207b\u00b9 := by\n          rw [inv_le_inv\u2080 hpos (by positivity : (0 : \u211d) < t / 2)]\n          exact hwnorm\n      _ = 2 / t := by rw [inv_div]\n  have hw1'b : \u2016(w + 1 : \u2102)\u207b\u00b9\u2016 \u2264 2 / t := by\n    rw [norm_inv]\n    have hpos : (0 : \u211d) < \u2016w + 1\u2016 := by positivity",
    "numLines": 45,
    "startLine": 717,
    "totalLines": 818
  }
}

{
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\D-015-positivity-horizon-E006.md",
  "content": "# D-015 \u2014 E-006 positivity horizon: resolution-limited; ill-conditioning measured\nDate: 2026-08-17 | Session: 002 | Task: 3.1 / Q-3.4b | Status: complete (measurement); follow-up designed\nTag: [NUMERICAL-EVIDENCE] with instrument-limit caveat.\n\n---\n\n## 1. E-006 raw results (T = 2000, flat window \u03c8\u2080, critical-density grid)\n\n| \u03bb | d | rank | \u03bb_max | \u03bb_min+ | \u03bb_min+/mean |\n|---|---|---|---|---|---|\n| 0.5 | 917 | 869 | 4.34 | 6.6e-10 | 2.9e-10 |\n| 1.0 | 1834 | 1784 | 2.52 | 2.6e-10 | 2.4e-10 |\n| 1.5 | 2751 | 1974 | 2.10 | 9.0e-10 | 9.1e-10 |\n| 2.0 | 3668 | 1976 | 1.99 | 3.7e-10 | 3.7e-10 |\n\n(N\u2032 = 2044 zeros in I\u2032; at \u03bb \u2265 1.5, d > N\u2032 \u27f9 dimensional rank deficiency\n\u2014 overcomplete basis, expected; \u03bb_min+ = smallest eigenvalue above\nnoise 1e-10\u00b7\u03bb_max.)\n\n## 2. Reading\n\n1. **Flat floor:** \u03bb_min+/mean \u2248 1e-9\u20131e-10 across \u03bb \u2014 NO decay trend.\n   A flat floor at the pipeline's accuracy scale = instrument resolution\n   limit, not the mathematical floor. The true floor is below float64 +\n   spline reach at these dimensions. (Compare Kim et al. 2026: Suzuki\n   operator's lowest eigenvalue positive but superexponentially small;\n   Groskin: spectral scale 1e-59 at c=100 would need T ~ 1e63 by brute\n   cutoff \u2014 same phenomenon family.)\n2. **Genuine ill-conditioning at bandwidth 1:** ~50 of 1834 eigenvalues\n   below 1e-8 (relative) at \u03bb=1 \u2014 the Weil form's Gabor compressions are\n   nearly singular objects even where positivity is PROVED. This is a\n   real structural fact (not noise: consistent across \u03bb), quantifying why\n   positivity certification is delicate.\n3. **Instrument verdict:** float64 eigvalsh on raw G\u0303 cannot power a\n   positivity certificate beyond trivial support. Certification must use\n   exact/interval arithmetic (Groskin's cutoff-free LDL\u1d40) or extended\n   precision.\n\n## 3. Consequences for the project\n\n- **Q-3.4b refined:** the positivity horizon question splits into\n  (i) empirical floor decay \u2014 needs extended-precision eigensolvers at\n  SMALL dimension (mpmath, d ~ 100\u2013300, exact \u03d5\u0302 quadrature) \u2192 E-007\n  design; and (ii) certification theory \u2014 Groskin's B_T budget already\n  answers the certification side; our n\u208a input (Q-3.4a) remains the\n  live cross-pollination.\n- **Obstruction-map entry (Track C flavor):** positivity certification\n  has a precision complexity wall \u2014 cost grows like 1/\u03bb_min(support);\n  if \u03bb_min decays superexponentially (Kim et al. indicate it does for\n  the Suzuki operator), the route is computationally closed beyond fixed\n  support even though theoretically open. W-candidate for the map,\n  pending E-007 quantification.\n- **No contradiction with Phase 1 results:** E-003/E-005 conclusions used\n  bulk spectrum statistics (tr, HS norm, CMS bounds) \u2014 robust to the\n  tiny-eigenvalue floor; unaffected.\n\n## 4. Options for next sub-stage (choose)\n(a) E-007: extended-precision floor measurement, d ~ 150\u2013300, mpmath\n    eigensolver, \u03bb \u2208 {0.5, 1, 1.5, 2} \u2014 directly measures decay rate\n    (slow but tiny; ~minutes). Answers the horizon question properly.\n(b) Q-3.4a analytic sub-stage: formulate precisely how the paper's\n    unconditional n\u208a/rank lower bound interacts with Groskin's\n    indeterminate zone [\u2212B_T, 0) \u2014 pen-and-paper, no compute.\n(c) Move to task 3.2 (Li coefficients numerics to n ~ 10\u2075 \u2014 needs the\n    zero table; GPU-parallelizable; different flavor).\nRecommendation: (a) \u2014 finishes the horizon question while it's loaded;\nthen (b) or (c).\n"
}

File created successfully at: D:\Python\Quantum\research\derivations\D-015-positivity-horizon-E006.md

{
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-007-extended-precision-floor.py",
  "content": "\"\"\"E-007 \u2014 Q-3.4b follow-up: extended-precision positivity floor.\n\nE-006 showed the float64 pipeline floors at ~1e-10 relative \u2014 resolution-\nlimited. Here: small-dimension, HIGH-PRECISION measurement of the smallest\npositive eigenvalue of the Gabor-truncated Weil form.\n\nKey design: Hann window phi(u) = cos^2(pi u/L) on [-L/2, L/2] has CLOSED\nFORM Fourier transform:\n  phi_hat(xi) = (L/2)sinc(L xi/2) + (L/4)[sinc(L xi/2 - pi) + sinc(L xi/2 + pi)]\n(sinc(x) = sin x / x), and ||phi||^2 = 3L/8 exactly => a = 3/8.\nAll entries exact at mpmath dps \u2014 no interpolation noise.\n\nG = (a L^2)^-1 Sum_{gamma in I'} v v^T,  v_k = phi_hat(gamma - alpha_k),\ngrid alpha_k = T + (2pi/L) k, d = floor(L T / 2pi), T = 200 (small so d\nstays ~ 55..220), eigenvalues via mpmath.eigsy at dps 40.\n\nMetrics per lambda: d, N', lambda_min+ (above dps noise), ratio to mean,\nlog10 ratio \u2014 the floor vs bandwidth. Decay of the floor with lambda =\nthe horizon/complexity-wall measure (Q-3.4b).\n\nOutputs: research/numerics/data/E-007-extended-precision-floor.csv (+json)\n\"\"\"\nimport json\nimport sys\nimport time\nfrom datetime import datetime, timezone\nfrom pathlib import Path\n\nimport mpmath as mp\n\nREPO = Path(__file__).resolve().parents[3]\nDATA = REPO / \"research\" / \"numerics\" / \"data\"\nZEROS_CSV = DATA / \"E-002-zeros-first-10000.csv\"\nCSV = DATA / \"E-007-extended-precision-floor.csv\"\nJSON = DATA / \"E-007-extended-precision-floor.json\"\n\nT = 200.0\nLAMBDAS = (0.5, 1.0, 1.5, 2.0)\nDPS = 40\n\n\ndef sinc(x):\n    return mp.mpf(1) if x == 0 else mp.sin(x) / x\n\n\ndef phi_hat(xi, L):\n    \"\"\"Exact Hann-window Fourier transform (sinc(x)=sin x/x convention).\"\"\"\n    x = L * xi / 2\n    return (L / 2) * sinc(x) + (L / 4) * (sinc(x - mp.pi) + sinc(x + mp.pi))\n\n\ndef main() -> int:\n    if CSV.exists() and \"--force\" not in sys.argv:\n        print(f\"cached: {CSV} exists (use --force to recompute)\"); return 0\n    mp.mp.dps = DPS\n    t0 = time.time()\n\n    gam = []\n    with ZEROS_CSV.open(encoding=\"utf-8\") as f:\n        next(f)\n        for line in f:\n            gam.append(mp.mpf(line.split(\",\", 1)[1]))\n    ell = mp.log(T / (2 * mp.pi))\n    sqT = mp.sqrt(T)\n    zeros_Ip = [g for g in gam if T - sqT <= g < 2 * T + sqT]\n    Np = len(zeros_Ip)\n    print(f\"T={T}  ell={mp.nstr(ell,6)}  zeros in I'={Np}  dps={DPS}\",\n          flush=True)\n\n    rows = []\n    for lam in LAMBDAS:\n        t1 = time.time()\n        L = lam * ell\n        h = 2 * mp.pi / L\n        d = int(L * T / (2 * mp.pi))\n        a = mp.mpf(3) / 8  # ||phi||^2/L for Hann\n        # build V (Np x d) then G = V^T V / (a L^2)\n        V = [[phi_hat(g - (T + h * k), L) for k in range(d)]\n             for g in zeros_Ip]\n        G = mp.matrix(d, d)\n        scale = a * L**2\n        for i in range(d):\n            vi = [V[r][i] for r in range(Np)]\n            for j in range(i, d):\n                s = mp.mpf(0)\n                for r in range(Np):\n                    s += vi[r] * V[r][j]\n                G[i, j] = G[j, i] = s / scale\n        ev = sorted(mp.eigsy(G)[0])  # ascending eigenvalues\n        lam_max = ev[-1]\n        noise = mp.mpf(10) ** (-(DPS - 8)) * lam_max\n        pos = [e for e in ev if e > noise]\n        lam_min_pos = pos[0] if pos else mp.mpf(0)\n        mean_pos = sum(pos) / len(pos) if pos else mp.mpf(1)\n        ratio = lam_min_pos / mean_pos if mean_pos else mp.mpf(0)\n        rows.append({\n            \"lambda\": lam, \"d\": d, \"N_prime\": Np,\n            \"rank_above_noise\": len(pos),\n            \"lambda_max\": mp.nstr(lam_max, 8),\n            \"lambda_min_pos\": mp.nstr(lam_min_pos, 8),\n            \"minpos_over_mean\": mp.nstr(ratio, 4),\n            \"log10_ratio\": mp.nstr(mp.log10(ratio) if ratio > 0 else mp.mpf(\"-999\"), 5),\n        })\n        print(f\"lam={lam}: d={d} rank={len(pos)} \"\n              f\"lmax={mp.nstr(lam_max,4)} lmin+={mp.nstr(lam_min_pos,3)} \"\n              f\"log10(min+/mean)={mp.nstr(mp.log10(ratio) if ratio>0 else -999,4)} \"\n              f\"({time.time()-t1:.0f}s)\", flush=True)\n\n    DATA.mkdir(parents=True, exist_ok=True)\n    with CSV.open(\"w\", encoding=\"utf-8\", newline=\"\") as f:\n        f.write(\",\".join(rows[0].keys()) + \"\\n\")\n        for r in rows:\n            f.write(\",\".join(str(v) for v in r.values()) + \"\\n\")\n    meta = {\n        \"experiment\": \"E-007\",\n        \"task\": \"3.1 / Q-3.4b (extended-precision positivity floor)\",\n        \"description\": \"Smallest positive eigenvalue of Gabor-truncated \"\n                       \"Weil form at dps 40, Hann window (exact FT), \"\n                       \"T=200, bandwidths 0.5-2.0\",\n        \"script\": \"research/numerics/scripts/E-007-extended-precision-floor.py\",\n        \"parameters\": {\"T\": T, \"lambdas\": list(LAMBDAS), \"dps\": DPS,\n                       \"window\": \"Hann (exact closed-form FT)\"},\n        \"caveats\": [\"small T=200: finite-L effects larger than E-006\",\n                    \"d > N' for lambda >= 1.5: dimensional deficiency\"],\n        \"elapsed_seconds\": round(time.time() - t0, 1),\n        \"timestamp_utc\": datetime.now(timezone.utc).isoformat(),\n        \"row_count\": len(rows),\n    }\n    JSON.write_text(json.dumps(meta, indent=2), encoding=\"utf-8\")\n    print(f\"wrote {CSV.name}, {JSON.name}\")\n    return 0\n\n\nif __name__ == \"__main__\":\n    raise SystemExit(main())\n"
}

File created successfully at: D:\Python\Quantum\research\numerics\scripts\E-007-extended-precision-floor.py

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\derivations\\index.md",
  "old_string": "| D-015 | E-006 positivity horizon: resolution-limited; ill-conditioning measured | 3.1 | complete (follow-up E-007 designed) | 2026-08-17 |",
  "new_string": "| D-015 | E-006 positivity horizon: resolution-limited; ill-conditioning measured | 3.1 | complete (follow-up E-007 designed) | 2026-08-17 |\n| D-016 | Q-3.4a: n\u208a bound vs Groskin indeterminate zone \u2014 scale mismatch verdict | 3.4a | complete | 2026-08-17 |"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiDogLeg.lean",
  "oldString": "    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),\n          Real.log_one, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h",
  "newString": "    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h",
  "originalFile": "/-\nNguyenRH1/LiDogLeg.lean \u2014 ii\u2032-6-DL-1 (D-074, session 040): the zero-free\ndog-leg deformation of the Lagarias horizontal right tail.\n\nTHE CONTENT (D-074 \u00a73.1\u20133.2): on the dog-leg rectangle [3, X_R]\u00d7[T, U]\n(T > 0), the Lagarias integrand Jlag n s = (s/(s\u22121))\u207f\u22121 \u00b7 (\u2212\u03b6\u2032/\u03b6(s)) is\nholomorphic UNCONDITIONALLY (s \u2260 1 since im > 0; \u03b6 s \u2260 0 for re s \u2265 3 > 1\nby Mathlib's Euler-product nonvanishing `riemannZeta_ne_zero_of_one_lt_re`\n\u2014 NO perimeter hypothesis, no zero-avoidance at U). Cauchy's theorem\n(`HolomorphicOn.vanishesOnRectangle`) then gives the EXACT deformation\nidentity\n  H(3\u2192X_R, T) = H(3\u2192X_R, U) \u2212 V(X_R, T\u2192U) + V(3, T\u2192U)\n(the upper right tail = the high horizontal \u2212 the right drop + the left\nlift), plus the Jlag conjugation identity for the lower-side transfer.\n\nThis is the repair of Finding F-D (D-072): the broken low-path envelope\nis ABANDONED (not bounded) \u2014 the magnitude bound comes later from the\nthree dog-leg pieces, all in the unconditionally zero-free region.\n-/\nimport Mathlib\nimport NguyenRH1.LiSides\nimport NguyenRH1.LiTightR\nimport NguyenRH1.LiBasePoints\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. Dog-leg analyticity (D-074 \u00a73.1; no perimeter) -/\n\n/-- The dog-leg corners (same real-part/imaginary-part form as rectZ/rectW). -/\ndef dogZ (T : \u211d) : \u2102 := ((3 : \u211d) : \u2102) + (T : \u211d) * Complex.I\ndef dogW (XR U : \u211d) : \u2102 := ((XR : \u211d) : \u2102) + (U : \u211d) * Complex.I\n\nlemma dogZ_re (T : \u211d) : (dogZ T).re = 3 := by simp [dogZ]\nlemma dogZ_im (T : \u211d) : (dogZ T).im = T := by simp [dogZ]\nlemma dogW_re (XR U : \u211d) : (dogW XR U).re = XR := by simp [dogW]\nlemma dogW_im (XR U : \u211d) : (dogW XR U).im = U := by simp [dogW]\n\n/-- Jlag is differentiable at every point with 3 \u2264 re, 0 < im:\n\u03b6 is zero-free for 1 < re (Mathlib `riemannZeta_ne_zero_of_one_lt_re`,\nUNCONDITIONAL \u2014 the Euler-product region) and s \u2260 1 (im \u2260 0).\nNO perimeter hypothesis. -/\ntheorem Jlag_differentiableAt_dogleg {n : \u2115} {s : \u2102}\n    (hre : 3 \u2264 s.re) (him : 0 < s.im) :\n    DifferentiableAt \u2102 (Jlag n) s := by\n  apply Jlag_differentiableAt\n  \u00b7 rintro rfl\n    simp at him\n  \u00b7 exact riemannZeta_ne_zero_of_one_lt_re (by linarith)\n\n/-- Jlag is holomorphic on the whole dog-leg rectangle\n[3, X_R]\u00d7[T, U] (T > 0). -/\ntheorem holomorphicOn_Jlag_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HolomorphicOn (Jlag n) (Rectangle (dogZ T) (dogW XR U)) := by\n  intro s hs\n  rw [Rectangle, Complex.mem_reProdIm, dogZ_re, dogW_re, dogZ_im, dogW_im] at hs\n  rw [Set.uIcc_of_le hXR, Set.uIcc_of_le hTU] at hs\n  exact (Jlag_differentiableAt_dogleg hs.1.1 (by linarith [hs.2.1])).differentiableWithinAt\n\n/-- **The dog-leg rectangle integral vanishes** (Cauchy; the region is\nunconditionally zero-free \u2014 the residue sum is EMPTY, no perimeter). -/\ntheorem rectangleIntegral_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral (Jlag n) (dogZ T) (dogW XR U) = 0 :=\n  (holomorphicOn_Jlag_dogleg hT hTU hXR).vanishesOnRectangle subset_rfl\n\n/-- The (2\u03c0i)\u207b\u00b9-normalized form (API symmetry with rectInt'_Jlag). -/\ntheorem rectangleIntegral'_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral' (Jlag n) (dogZ T) (dogW XR U) = 0 := by\n  rw [RectangleIntegral', rectangleIntegral_Jlag_dogleg_eq_zero hT hTU hXR,\n    smul_zero]\n\n/-- **THE EXACT DOG-LEG DEFORMATION IDENTITY** (D-074 \u00a73.2 (\u2605), the\ncapstone for ii\u2032-6-c): the low right-horizontal equals the high\nhorizontal minus the right drop plus the left lift. Orientations: all\nH-integrals left-to-right, all V-integrals upward (the main contour's\ntop side is their reversal, handled at the fold site). -/\ntheorem upper_right_horizontal_eq_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HIntegral (Jlag n) 3 XR T =\n      HIntegral (Jlag n) 3 XR U - VIntegral (Jlag n) XR T U +\n        VIntegral (Jlag n) 3 T U := by\n  have h0 := rectangleIntegral_Jlag_dogleg_eq_zero (n := n) hT hTU hXR\n  unfold RectangleIntegral at h0\n  rw [dogZ_re, dogZ_im, dogW_re, dogW_im] at h0\n  linear_combination h0\n\n/-! ## 2. The conjugation identity (for the lower-side transfer, DL-5) -/\n\n/-- kFun is conjugation-symmetric (real-coefficient rational function). -/\ntheorem kFun_conj (n : \u2115) (s : \u2102) :\n    kFun n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (kFun n s) := by\n  unfold kFun\n  simp [map_sub, map_pow, map_one]\n\n/-- **Jlag is conjugation-symmetric** (from `riemannZeta_conj` +\n`iteratedDeriv_riemannZeta_conj`): Jlag n (s\u0304) = conj (Jlag n s).\nNeeded for the lower-horizontal transfer (DL-5). -/\ntheorem Jlag_conj (n : \u2115) {s : \u2102} (hs : s \u2260 1) :\n    Jlag n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (Jlag n s) := by\n  have h1 : deriv riemannZeta ((starRingEnd \u2102) s) =\n      (starRingEnd \u2102) (deriv riemannZeta s) := by\n    have h := iteratedDeriv_riemannZeta_conj 1 hs\n    rwa [iteratedDeriv_one] at h\n  unfold Jlag\n  rw [kFun_conj, _root_.riemannZeta_conj, h1]\n  simp only [map_mul, map_neg, map_div\u2080]\n\n/-! ## 3. The left-lift bound (DL-2, D-074 \u00a73.3 V_left) -/\n\n/-- **Kernel on the lift**: \u2016kFun n (3+it)\u2016 \u2264 e^{5/2}+1 for n \u2264 t\u00b2\n(D-074 \u00a76: |(3+it)/(2+it)|\u00b2 = (9+t\u00b2)/(4+t\u00b2) = 1 + 5/(4+t\u00b2), whose n-th\npower is \u2264 e^{5n/(2(4+t\u00b2))} \u2264 e^{5/2}). -/\ntheorem kFun_three_add_it_norm_le_exp_five_halves_add_one {n : \u2115} {t : \u211d}\n    (hT : (n : \u211d) \u2264 t ^ 2) :\n    \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp (5 / 2) + 1 := by\n  rcases Nat.eq_zero_or_pos n with hn | hn\n  \u00b7 subst hn\n    simp only [kFun, pow_zero, sub_self, norm_zero]\n    positivity\n  \u00b7 have hnR : (1 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n    have ht2 : (0 : \u211d) < 4 + t ^ 2 := by positivity\n    have hn4t2 : (n : \u211d) \u2264 4 + t ^ 2 := by linarith [hT]\n    have hQpos : (0 : \u211d) \u2264 (9 + t ^ 2) / (4 + t ^ 2) := by positivity\n    have hQle : (9 + t ^ 2) / (4 + t ^ 2) \u2264 Real.exp (5 / (n : \u211d)) := by\n      have h1 : (9 + t ^ 2) / (4 + t ^ 2) = 1 + 5 / (4 + t ^ 2) := by\n        field_simp [ht2.ne']\n        ring\n      rw [h1]\n      have h2 : 5 / (4 + t ^ 2) \u2264 5 / (n : \u211d) :=\n        (div_le_div_iff_of_pos_left (by norm_num) ht2 (by positivity)).mpr hn4t2\n      have h3 := Real.add_one_le_exp (5 / (n : \u211d))\n      linarith\n    have hQn : ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 Real.exp 5 := by\n      calc ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 (Real.exp (5 / (n : \u211d))) ^ n :=\n            pow_le_pow_left\u2080 hQpos hQle n\n        _ = Real.exp 5 := by\n            rw [\u2190 Real.exp_nat_mul]\n            congr 1\n            have hn0 : (n : \u211d) \u2260 0 := by exact_mod_cast hn.ne'\n            field_simp [hn0]\n    have hns3 : Complex.normSq ((3 : \u211d) + t * Complex.I) = 9 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hns2 : Complex.normSq ((2 : \u211d) + t * Complex.I) = 4 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hnormA : \u2016((3 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (9 + t ^ 2) := by\n      have h1 : \u2016((3 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((3 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns3]\n    have hnormB : \u2016((2 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (4 + t ^ 2) := by\n      have h1 : \u2016((2 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((2 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns2]\n    have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =\n        Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by\n      rw [norm_div, hnormA, hnormB,\n        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]\n    have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by\n      push_cast\n      ring\n    unfold kFun\n    rw [hs1]\n    calc \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 :=\n          norm_sub_le _ _\n      _ = (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n + 1 := by\n          rw [norm_pow, hnorm, norm_one]\n      _ \u2264 Real.exp (5 / 2) + 1 := by\n          have h4 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n \u2264 Real.exp (5 / 2) := by\n            have hx0 : (0 : \u211d) \u2264 Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) :=\n              Real.sqrt_nonneg _\n            have hx : (0 : \u211d) \u2264 (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n :=\n              pow_nonneg hx0 n\n            have h5 : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 \u2264 Real.exp 5 := by\n              have e : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 =\n                  ((9 + t ^ 2) / (4 + t ^ 2)) ^ n := by\n                rw [\u2190 pow_mul, mul_comm n 2, pow_mul, Real.sq_sqrt hQpos]\n              rw [e]\n              exact hQn\n            have h8 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n =\n                Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2) := by\n              rw [Real.sqrt_sq hx]\n            rw [h8]\n            calc Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2)\n                \u2264 Real.sqrt (Real.exp 5) := Real.sqrt_le_sqrt h5\n              _ = Real.exp (5 / 2) := (Real.exp_half 5).symm\n          linarith [h4]\n\n/-- The Dirichlet majorant at s = 3 (summable since 3 > 1). -/\ndef dirichletC3 : \u211d :=\n  \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016\n\n/-- Termwise 3-vs-2 comparison for the \u039b L-series: \u039b(n)/n\u00b3 \u2264 (1/2)\u00b7\u039b(n)/n\u00b2. -/\nlemma norm_term_vonMangoldt_three_le_half (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 \u2264\n      (1 / 2) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 := by\n  have h3re : ((3 : \u2102).re) = 3 := rfl\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hn =>\n    rcases eq_or_ne n 1 with rfl | hn1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hn2 : 2 \u2264 n := by omega\n      have h\u039b : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016 =\n          ArithmeticFunction.vonMangoldt n :=\n        Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n      rw [h\u039b]\n      have e : ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d) =\n          (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := by\n        rw [show (3 : \u211d) = 2 + 1 by norm_num,\n          Real.rpow_add (by positivity : (0 : \u211d) < (n : \u211d)), Real.rpow_one]\n        field_simp [show (n : \u211d) \u2260 0 by positivity]\n      have h12 : (1 : \u211d) / (n : \u211d) \u2264 1 / 2 :=\n        one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 2)\n          (by exact_mod_cast hn2 : (2 : \u211d) \u2264 (n : \u211d))\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (n : \u211d)) _)\n      calc ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d)\n          = (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := e\n        _ \u2264 (1 / 2) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) :=\n            mul_le_mul_of_nonneg_right h12 hpos\n\n/-- dirichletC3 \u2264 1/2 (the termwise comparison + dirichletC2 \u2264 1) \u2014\nthe certified C_zeta3 = 0.5 of D-074 \u00a74. (A tighter 0.17 build is\npossible via a 6-prime partial sum + antitone-integral tail; the fold\nis indifferent to the constant, so the cheap certified 0.5 is charged.) -/\nlemma dirichletC3_le_half : dirichletC3 \u2264 1 / 2 := by\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  calc dirichletC3\n      = \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 := rfl\n    _ \u2264 \u2211' n : \u2115, (1 / 2) *\n          \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n        Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_three_le_half n) hsum3\n          (hsum2.mul_left (1 / 2))\n    _ = (1 / 2) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n    _ \u2264 1 / 2 := by linarith [dirichletC2_le_one]\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 dirichletC3 for re s \u2265 3 (the s = 3 clone of the\nDirichlet-series majorant). -/\nlemma norm_logDeriv_zeta_le_dirichletC3 {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 dirichletC3 := by\n  have hs1 : (1 : \u211d) < s.re := by linarith\n  have h1 : -logDeriv riemannZeta s\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016\n      \u2264 dirichletC3 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => LSeries.norm_term_le_of_re_le_re _ (by\n            simp\n            exact hs) n) hsumS hsum3\n      _ = dirichletC3 := rfl\n  calc \u2016logDeriv riemannZeta s\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 dirichletC3 := hle\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 1/2 for re s \u2265 3 (the charged C_zeta3 = 0.5). -/\nlemma norm_logDeriv_zeta_le_half {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 1 / 2 :=\n  (norm_logDeriv_zeta_le_dirichletC3 hs).trans dirichletC3_le_half\n\n/-- **The left-lift bound** (D-074 \u00a73.3 V_left): for 0 < T \u2264 U and\nn \u2264 T\u00b2, \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U \u2212 T)\u00b7(e^{5/2}+1)/2. The kernel\n\u2264 e^{5/2}+1 (the 1+5/(4+t\u00b2) computation), the zeta factor \u2264 1/2\n(certified, no perimeter). -/\ntheorem vIntegral_Jlag_three_norm_le {n : \u2115} {T U : \u211d}\n    (hT0 : (0 : \u211d) < T) (hTU : T \u2264 U) (hTn : (n : \u211d) \u2264 T ^ 2) :\n    \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U - T) * (Real.exp (5 / 2) + 1) / 2 := by\n  have hnorm : \u2016VIntegral (Jlag n) 3 T U\u2016 =\n      \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 := by\n    unfold VIntegral\n    rw [norm_smul, Complex.norm_I, one_mul]\n  rw [hnorm]\n  have hbound : \u2200 t \u2208 Set.Ioc T U,\n      \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 (Real.exp (5 / 2) + 1) * (1 / 2) := by\n    intro t ht\n    have htT : T < t := ht.1\n    have ht2 : (n : \u211d) \u2264 t ^ 2 := by nlinarith [hTn, hT0]\n    have hre : (3 : \u211d) \u2264 ((3 : \u211d) + t * Complex.I).re := by simp\n    have h1 := kFun_three_add_it_norm_le_exp_five_halves_add_one ht2\n    have h2 := norm_logDeriv_zeta_le_half (s := (3 : \u211d) + t * Complex.I) hre\n    have hnorm3 : \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hnorm3]\n    exact mul_le_mul h1 h2 (norm_nonneg _) (by positivity)\n  have hint : \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264\n      ((Real.exp (5 / 2) + 1) * (1 / 2)) * |U - T| := by\n    apply intervalIntegral.norm_integral_le_of_norm_le_const\n    intro t ht\n    rw [Set.uIoc_of_le hTU] at ht\n    exact hbound t ht\n  have habs : |U - T| = U - T := abs_of_nonneg (by linarith)\n  rw [habs] at hint\n  calc \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016\n      \u2264 ((Real.exp (5 / 2) + 1) * (1 / 2)) * (U - T) := hint\n    _ = (U - T) * (Real.exp (5 / 2) + 1) / 2 := by ring\n\n/-! ## 4. The high-horizontal stepping (DL-3, D-074 \u00a77 + D-073 \u00a74) -/\n\n/-- Termwise \u03c3-vs-2 comparison for the \u039b L-series (the (6.10) halving):\n\u039b(m)/m^\u03c3 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7\u039b(m)/m\u00b2 for \u03c3 \u2265 2. -/\nlemma norm_term_vonMangoldt_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) (m : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) m\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) m\u2016 := by\n  have h\u03c3re : ((\u03c3 : \u211d) + t * Complex.I).re = \u03c3 := by simp\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h\u03c3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hm =>\n    have h\u039b : \u2016(ArithmeticFunction.vonMangoldt m : \u2102)\u2016 =\n        ArithmeticFunction.vonMangoldt m :=\n      Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n    rw [h\u039b]\n    rcases eq_or_ne m 1 with rfl | hm1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hm2 : 2 \u2264 m := by omega\n      have e : ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ \u03c3 =\n          (1 / (m : \u211d) ^ (\u03c3 - 2)) * (ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d)) := by\n        rw [show (\u03c3 : \u211d) = (\u03c3 - 2) + 2 by ring,\n          Real.rpow_add (by positivity : (0 : \u211d) < (m : \u211d))]\n        field_simp [show (m : \u211d) \u2260 0 by positivity]\n        ring_nf\n      rw [e]\n      have hle : (1 : \u211d) / (m : \u211d) ^ (\u03c3 - 2) \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) := by\n        rw [Real.rpow_neg (by norm_num : (0 : \u211d) \u2264 2), \u2190 one_div]\n        apply one_div_le_one_div_of_le (Real.rpow_pos_of_pos (by norm_num : (0 : \u211d) < 2) _)\n        exact Real.rpow_le_rpow (by norm_num : (0 : \u211d) \u2264 2)\n          (by exact_mod_cast hm2 : (2 : \u211d) \u2264 (m : \u211d)) (by linarith : (0 : \u211d) \u2264 \u03c3 - 2)\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (m : \u211d)) _)\n      exact mul_le_mul_of_nonneg_right hle hpos\n\n/-- \u2016\u03b6\u2032/\u03b6(\u03c3+it)\u2016 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7dirichletC2 for \u03c3 \u2265 2 (the (6.10)\nhalving in LSeries form; dirichletC2 \u2264 1 makes the tail free). -/\nlemma norm_logDeriv_zeta_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) :\n    \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n  have hs1 : (1 : \u211d) < ((\u03c3 : \u211d) + t * Complex.I).re := by simp; linarith\n  have h1 : -logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) ((\u03c3 : \u211d) + t * Complex.I) := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I) n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I) n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n            ((\u03c3 : \u211d) + t * Complex.I) n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, (2 : \u211d) ^ (-(\u03c3 - 2)) *\n            \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_le_two_pow h\u03c3 n) hsumS\n            (hsum2.mul_left _)\n      _ = (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n  calc \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := hle\n\n/-- **Kernel envelope** (D-074 \u00a77, the single-exponential form that\nreplaces the unit-step geometric series): \u2016(1+1/((\u03c3\u22121)+iU))\u207f\u2016 \u2264\ne^{(4/9)\u03c3} for \u03c3 \u2265 3 and n \u2264 (4/9)U\u00b2. From the (6.11) core\n\u20161+1/s\u2016 \u2264 1+(re s+1)/normSq s \u2264 1+\u03c3/U\u00b2. -/\ntheorem one_add_div_pow_norm_le_exp_four_ninths {n : \u2115} {\u03c3 U : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) :\n    \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 Real.exp ((4 / 9) * \u03c3) := by\n  have hs0 : (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + U * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hle := norm_one_add_one_div_le hs0\n  have hre : (((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1 = \u03c3 := by\n    simp [Complex.add_re, Complex.ofReal_re, Complex.mul_re, Complex.I_re, Complex.I_im,\n      Complex.sub_re, Complex.one_re]\n  have hns : Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) = (\u03c3 - 1) ^ 2 + U ^ 2 := by\n    simp [Complex.normSq_apply]\n    ring\n  have hstep : ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 \u03c3 / U ^ 2 := by\n    rw [hre, hns]\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h1 : (0 : \u211d) \u2264 (\u03c3 - 1) ^ 2 := sq_nonneg _\n    exact (div_le_div_iff_of_pos_left (by linarith : (0 : \u211d) < \u03c3)\n      (by positivity) hU2).mpr (by linarith [h1])\n  have hstep1 : 1 + ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 1 + \u03c3 / U ^ 2 := by\n    linarith [hstep]\n  have hpow1 : \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 (1 + \u03c3 / U ^ 2) ^ n :=\n    pow_le_pow_left\u2080 (norm_nonneg _) (hle.trans hstep1) n\n  have hpow2 : (1 + \u03c3 / U ^ 2) ^ n \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := by\n    calc (1 + \u03c3 / U ^ 2) ^ n \u2264 (Real.exp (\u03c3 / U ^ 2)) ^ n := by\n          have h := Real.add_one_le_exp (\u03c3 / U ^ 2)\n          exact pow_le_pow_left\u2080 (by positivity) (by linarith) n\n      _ = Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := (Real.exp_nat_mul (\u03c3 / U ^ 2) n).symm\n  have hexp : (n : \u211d) * (\u03c3 / U ^ 2) \u2264 (4 / 9) * \u03c3 := by\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h\u03c30 : (0 : \u211d) < \u03c3 := by linarith\n    have h1 : (n : \u211d) / U ^ 2 \u2264 4 / 9 := by\n      have h2 := div_le_div_of_nonneg_right hnU hU2.le\n      rwa [mul_div_cancel_right\u2080 _ hU2.ne'] at h2\n    rw [show (n : \u211d) * (\u03c3 / U ^ 2) = ((n : \u211d) / U ^ 2) * \u03c3 by ring]\n    exact mul_le_mul_of_nonneg_right h1 h\u03c30.le\n  calc \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n\n      \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := hpow1.trans hpow2\n    _ \u2264 Real.exp ((4 / 9) * \u03c3) := Real.exp_le_exp.mpr hexp\n\n/-! ## 5. The product envelope and the integral assembly (DL-3c/d) -/\n\n/-- **The product envelope** (D-074 \u00a77): for \u03c3 \u2265 3, 0 < t, n \u2264 (4/9)t\u00b2,\n\u2016Jlag n (\u03c3+it)\u2016 \u2264 (4\u00b7e^{\u2212c\u03c3} + 4\u00b72^{\u2212\u03c3})\u00b7dirichletC2, c = log 2 \u2212 4/9.\nThe kernel envelope (e^{(4/9)\u03c3}) times the zeta halving (2^{\u2212(\u03c3\u22122)})\ncollapses to the single exponential 4\u00b7e^{\u2212c\u03c3}: no geometric series. -/\ntheorem Jlag_dogleg_norm_le_envelope {n : \u2115} {\u03c3 t : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (ht : 0 < t) (hnU : (n : \u211d) \u2264 (4 / 9) * t ^ 2) :\n    \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n  have hw1 : ((\u03c3 : \u211d) + t * Complex.I) - 1 = ((\u03c3 : \u211d) - 1) + t * Complex.I := by\n    push_cast\n    ring\n  have hs1ne : (((\u03c3 : \u211d) - 1) + t * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + t * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hwid : ((\u03c3 : \u211d) + t * Complex.I) / (((\u03c3 : \u211d) + t * Complex.I) - 1) =\n      1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I) := by\n    rw [hw1]\n    field_simp [hs1ne]\n    ring\n  have hker := one_add_div_pow_norm_le_exp_four_ninths h\u03c3 ht hnU\n  have hzeta := norm_logDeriv_zeta_le_two_pow (show (2 : \u211d) \u2264 \u03c3 by linarith) (t := t)\n  have hk : \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by\n    unfold kFun\n    rw [hwid]\n    calc \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 := norm_sub_le _ _\n      _ = \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I))\u2016 ^ n + 1 := by rw [norm_pow, norm_one]\n      _ \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by linarith [hker]\n  have hprod : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := by\n    have hn3 : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hn3]\n    exact mul_le_mul hk hzeta (norm_nonneg _)\n      (add_nonneg (Real.exp_nonneg _) (by norm_num))\n  have h2b : (2 : \u211d) ^ (-\u03c3) = Real.exp (-(Real.log 2) * \u03c3) := by\n    rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n    congr 1\n    ring\n  have h22 : (2 : \u211d) ^ (2 : \u211d) = 4 := by\n    rw [Real.rpow_two]\n    norm_num\n  have h2a : (2 : \u211d) ^ (-(\u03c3 - 2)) = 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [show (-(\u03c3 - 2)) = -\u03c3 + 2 by ring, Real.rpow_add (by norm_num : (0 : \u211d) < 2), h2b, h22]\n    ring\n  have hexp_alg : Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3) =\n      Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) := by\n    rw [\u2190 Real.exp_add]\n    congr 1\n    ring\n  have halg : (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2))) =\n      4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [h2a, h2b]\n    calc (Real.exp ((4 / 9) * \u03c3) + 1) * (4 * Real.exp (-(Real.log 2) * \u03c3))\n        = 4 * (Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3)) +\n          4 * Real.exp (-(Real.log 2) * \u03c3) := by ring\n      _ = 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * Real.exp (-(Real.log 2) * \u03c3) := by\n        rw [hexp_alg]\n  calc \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      \u2264 (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := hprod\n    _ = ((Real.exp ((4 / 9) * \u03c3) + 1) * (2 : \u211d) ^ (-(\u03c3 - 2))) * dirichletC2 := by ring\n    _ = (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n        rw [halg]\n\n/-- The FTC-bound \u222b\u2083^XR e^{\u2212c\u03c3}d\u03c3 \u2264 e^{\u22123c}/c for c > 0. -/\nlemma integral_exp_neg_le {c XR : \u211d} (hc : 0 < c) (_hXR : 3 \u2264 XR) :\n    \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-c * \u03c3) \u2264 Real.exp (-3 * c) / c := by\n  have hF : \u2200 x \u2208 Set.uIcc (3 : \u211d) XR,\n      HasDerivAt (fun \u03c3 => -Real.exp (-c * \u03c3) / c) (Real.exp (-c * x)) x := by\n    intro x hx\n    have h2 : HasDerivAt (fun \u03c3 => Real.exp (-c * \u03c3)) (Real.exp (-c * x) * (-c)) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-c)).exp\n      rwa [mul_one] at h\n    have h3 := h2.const_mul (-1 / c)\n    rw [show (-1 / c) * (Real.exp (-c * x) * (-c)) = Real.exp (-c * x) by\n      field_simp [hc.ne']] at h3\n    have h5 : (fun \u03c3 => (-1 / c) * Real.exp (-c * \u03c3)) =\n        (fun \u03c3 => -Real.exp (-c * \u03c3) / c) := by\n      funext \u03c3\n      field_simp [hc.ne']\n    rw [h5] at h3\n    exact h3\n  have hint : IntervalIntegrable (fun \u03c3 => Real.exp (-c * \u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (Real.continuous_exp.comp (continuous_const.mul continuous_id)).continuousOn\n  rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hF hint]\n  have h1 : (0 : \u211d) \u2264 Real.exp (-c * XR) / c := by positivity\n  have e : Real.exp (-c * 3) = Real.exp (-3 * c) := by\n    congr 1\n    ring\n  rw [e]\n  linarith [h1]\n\n/-- The certified exponent-decay constant c = log 2 \u2212 4/9 \u2265 0.2487. -/\nlemma cdog_gt : (0.2487 : \u211d) \u2264 Real.log 2 - 4 / 9 := by\n  have h := Real.log_two_gt_d9\n  norm_num at h\n  linarith\n\n/-- The certified e^{4/3} \u2264 3.8073 (the (1\u2212x/16)\u207b\u00b9\u2076 route + d9 e). -/\nlemma exp_four_thirds_le : Real.exp (4 / 3) \u2264 (3.8073 : \u211d) := by\n  have he13 : Real.exp (1 / 3) \u2264 (1.4006 : \u211d) :=\n    le_trans (exp_le_inv_sub_sixteen (by norm_num) (by norm_num)) (by norm_num)\n  rw [show (4 / 3 : \u211d) = 1 + 1 / 3 by norm_num, Real.exp_add]\n  calc Real.exp 1 * Real.exp (1 / 3) \u2264 2.7182818286 * 1.4006 :=\n        mul_le_mul Real.exp_one_lt_d9.le he13 (Real.exp_pos _).le (by norm_num)\n    _ \u2264 3.8073 := by norm_num\n\n/-- **THE HIGH-HORIZONTAL BOUND** (D-074 \u00a77 capstone; D-073 Cor 4.2's\nR(1.5) in single-exponential-envelope form): for 0 < U, n \u2264 (4/9)U\u00b2\n(i.e. U \u2265 (3/2)\u221an) and 3 \u2264 XR, \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 8.38\n(charged; the true value \u2264 1.2 at n = 10\u2075, E-034 V5). Charged with\ndirichletC2 \u2264 1 \u2014 the tight R(1.5) = 5.94 would need a dirichletC2 \u2264\n0.57 build (documented as the tightening path; the fold is\nindifferent: \u0394 \u2248 +2.4 per side). -/\ntheorem hIntegral_Jlag_dogleg_norm_le {n : \u2115} {U XR : \u211d}\n    (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) (hXR : 3 \u2264 XR) :\n    \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 (8.38 : \u211d) := by\n  have hc : (0 : \u211d) < Real.log 2 - 4 / 9 := by\n    have h := cdog_gt\n    linarith\n  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU\n  have hcontA : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) :=\n    Real.continuous_exp.comp (continuous_const.mul continuous_id)\n  have hcontB : Continuous (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) := by\n    have h1 : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) :=\n      Real.continuous_exp.comp (continuous_const.mul continuous_id)\n    have h2 : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2]\n    exact h1\n  have hIntA : IntervalIntegrable (fun \u03c3 : \u211d => 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3))\n      MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontA.const_mul 4).continuousOn\n  have hIntB : IntervalIntegrable (fun \u03c3 : \u211d => 4 * (2 : \u211d) ^ (-\u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontB.const_mul 4).continuousOn\n  have hIntG : IntervalIntegrable (fun \u03c3 : \u211d =>\n      (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2)\n      MeasureTheory.volume 3 XR := by\n    have h := (hIntA.add hIntB).const_mul dirichletC2\n    convert h using 1\n    ext \u03c3\n    ring\n  -- step 1: \u2016H\u2016 \u2264 \u222b envelope\n  have h1 : \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264\n      \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n    unfold HIntegral\n    apply intervalIntegral.norm_integral_le_of_norm_le hXR _ hIntG\n    exact Filter.Eventually.of_forall (fun \u03c3 h\u03c3 => hpt \u03c3 h\u03c3)\n  -- step 2: \u222b envelope = dirichletC2\u00b7(4\u222be^{\u2212c\u03c3} + 4\u222b2^{\u2212\u03c3})\n  have h2 : \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2\n      = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := by\n    rw [intervalIntegral.integral_const_mul, intervalIntegral.integral_add hIntA hIntB]\n  -- step 3: the two integral bounds\n  have h3a : \u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) \u2264\n      Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n    rw [intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le hc hXR\n    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),\n            Real.log_one, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n      calc Real.exp (-3 * (Real.log 2 - 4 / 9))\n          = Real.exp ((4 / 3) + -(3 * Real.log 2)) := by congr 1; ring\n        _ = Real.exp (4 / 3) * Real.exp (-(3 * Real.log 2)) := by rw [Real.exp_add]\n        _ = Real.exp (4 / 3) / 8 := by rw [h3l2]; ring\n    rw [he3c] at h\n    calc 4 * (Real.exp (-3 * (Real.log 2 - 4 / 9)) / (Real.log 2 - 4 / 9))\n        = 4 * ((Real.exp (4 / 3) / 8) / (Real.log 2 - 4 / 9)) := by rw [he3c]\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n        field_simp [hc.ne']\n        ring\n  have h3b : \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3) \u2264 1 / (2 * Real.log 2) := by\n    have h2e : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2e, intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le (Real.log_pos (by norm_num : (1 : \u211d) < 2)) hXR\n    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),\n          Real.log_one, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h\n    calc 4 * \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-(Real.log 2) * \u03c3)\n        \u2264 4 * ((1 / 8) / Real.log 2) := mul_le_mul_of_nonneg_left h (by norm_num)\n      _ = 1 / (2 * Real.log 2) := by\n        field_simp [Real.log_pos (by norm_num : (1 : \u211d) < 2)].ne'\n        ring\n  -- step 4: the certified assembly\n  have hlog2 : (0.6931471803 : \u211d) \u2264 Real.log 2 := Real.log_two_gt_d9\n  have h48 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 (7.6545 : \u211d) := by\n    have hcge := cdog_gt\n    have h1 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 3.8073 / (2 * 0.2487) :=\n      div_le_div exp_four_thirds_le (by linarith) (by norm_num) (by positivity)\n    calc Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9))\n        \u2264 3.8073 / (2 * 0.2487) := h1\n      _ \u2264 7.6545 := by norm_num\n  have h72 : 1 / (2 * Real.log 2) \u2264 (0.7214 : \u211d) := by\n    have h1 : 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) :=\n      one_div_le_one_div_of_le (by positivity) (by linarith)\n    calc 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) := h1\n      _ \u2264 0.7214 := by norm_num\n  have hC2 : dirichletC2 \u2264 1 := dirichletC2_le_one\n  have hsum : dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n      \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) \u2264 (8.38 : \u211d) := by\n    have hA0 : (0 : \u211d) \u2264 Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by positivity\n    have hB0 : (0 : \u211d) \u2264 1 / (2 * Real.log 2) := by positivity\n    calc dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2) := by ring\n      _ \u2264 7.6545 + 0.7214 := add_le_add h48 h72\n      _ \u2264 8.38 := by norm_num\n  calc \u2016HIntegral (Jlag n) 3 XR U\u2016\n      \u2264 \u222b \u03c3 in (3 : \u211d)..XR,\n          (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := h1\n    _ = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := h2\n    _ \u2264 8.38 := hsum\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 667,
      "oldLines": 8,
      "newStart": 667,
      "newLines": 7,
      "lines": [
        "     have h := integral_exp_neg_le (Real.log_pos (by norm_num : (1 : \u211d) < 2)) hXR",
        "     have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by",
        "       have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by",
        "-        rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),",
        "-          Real.log_one, Real.log_pow]",
        "+        rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]",
        "         push_cast",
        "         ring",
        "       rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\journal\\session-002.md",
  "old_string": "**Next:** user to choose (a) E-007 [recommended], (b) Q-3.4a analysis,\n(c) task 3.2 Li coefficients.",
  "new_string": "**Next:** user to choose (a) E-007 [recommended], (b) Q-3.4a analysis,\n(c) task 3.2 Li coefficients.\n\n---\n\n## User decision: do all three, one by one, then gather thoughts\n\n**(b) Q-3.4a \u2192 D-016 (done while E-007 runs):** VERDICT: No \u2014 the\nunconditional n\u208a bound cannot shrink Groskin's indeterminate zone\n[\u2212B_T, 0). Reason: scale mismatch \u2014 the zone lives at o(1) eigenvalue\nscale (o(N)-event question), our 2/3 input is a bulk statement; same\ninvisibility wall as G-001 (W4/W5 mechanism). General filter recorded:\n\"does the input see o(N) events? If no, it cannot touch positivity\ncertifications.\" Salvage: (1) unconditional negative-index bound\nn\u208b \u2264 (1/6+o(1))N \u2014 Thm A restated in Bombieri language (candidate minor\nresult; literature check queued); (2) truncated form as quantitative\noff-line-zero DETECTOR with depth-to-eigenvalue calibration (to\nquantify if Track C continues).\n\n**(a) E-007 running:** extended-precision (dps 40) floor measurement,\nHann window with EXACT closed-form Fourier transform (no interpolation\nnoise), T=200, \u03bb \u2208 {0.5,1,1.5,2}, mpmath.eigsy.\n\n**(c) next:** E-008 Li coefficients design."
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiDogLeg.lean",
  "oldString": "    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),\n            Real.log_one, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]",
  "newString": "    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]",
  "originalFile": "/-\nNguyenRH1/LiDogLeg.lean \u2014 ii\u2032-6-DL-1 (D-074, session 040): the zero-free\ndog-leg deformation of the Lagarias horizontal right tail.\n\nTHE CONTENT (D-074 \u00a73.1\u20133.2): on the dog-leg rectangle [3, X_R]\u00d7[T, U]\n(T > 0), the Lagarias integrand Jlag n s = (s/(s\u22121))\u207f\u22121 \u00b7 (\u2212\u03b6\u2032/\u03b6(s)) is\nholomorphic UNCONDITIONALLY (s \u2260 1 since im > 0; \u03b6 s \u2260 0 for re s \u2265 3 > 1\nby Mathlib's Euler-product nonvanishing `riemannZeta_ne_zero_of_one_lt_re`\n\u2014 NO perimeter hypothesis, no zero-avoidance at U). Cauchy's theorem\n(`HolomorphicOn.vanishesOnRectangle`) then gives the EXACT deformation\nidentity\n  H(3\u2192X_R, T) = H(3\u2192X_R, U) \u2212 V(X_R, T\u2192U) + V(3, T\u2192U)\n(the upper right tail = the high horizontal \u2212 the right drop + the left\nlift), plus the Jlag conjugation identity for the lower-side transfer.\n\nThis is the repair of Finding F-D (D-072): the broken low-path envelope\nis ABANDONED (not bounded) \u2014 the magnitude bound comes later from the\nthree dog-leg pieces, all in the unconditionally zero-free region.\n-/\nimport Mathlib\nimport NguyenRH1.LiSides\nimport NguyenRH1.LiTightR\nimport NguyenRH1.LiBasePoints\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. Dog-leg analyticity (D-074 \u00a73.1; no perimeter) -/\n\n/-- The dog-leg corners (same real-part/imaginary-part form as rectZ/rectW). -/\ndef dogZ (T : \u211d) : \u2102 := ((3 : \u211d) : \u2102) + (T : \u211d) * Complex.I\ndef dogW (XR U : \u211d) : \u2102 := ((XR : \u211d) : \u2102) + (U : \u211d) * Complex.I\n\nlemma dogZ_re (T : \u211d) : (dogZ T).re = 3 := by simp [dogZ]\nlemma dogZ_im (T : \u211d) : (dogZ T).im = T := by simp [dogZ]\nlemma dogW_re (XR U : \u211d) : (dogW XR U).re = XR := by simp [dogW]\nlemma dogW_im (XR U : \u211d) : (dogW XR U).im = U := by simp [dogW]\n\n/-- Jlag is differentiable at every point with 3 \u2264 re, 0 < im:\n\u03b6 is zero-free for 1 < re (Mathlib `riemannZeta_ne_zero_of_one_lt_re`,\nUNCONDITIONAL \u2014 the Euler-product region) and s \u2260 1 (im \u2260 0).\nNO perimeter hypothesis. -/\ntheorem Jlag_differentiableAt_dogleg {n : \u2115} {s : \u2102}\n    (hre : 3 \u2264 s.re) (him : 0 < s.im) :\n    DifferentiableAt \u2102 (Jlag n) s := by\n  apply Jlag_differentiableAt\n  \u00b7 rintro rfl\n    simp at him\n  \u00b7 exact riemannZeta_ne_zero_of_one_lt_re (by linarith)\n\n/-- Jlag is holomorphic on the whole dog-leg rectangle\n[3, X_R]\u00d7[T, U] (T > 0). -/\ntheorem holomorphicOn_Jlag_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HolomorphicOn (Jlag n) (Rectangle (dogZ T) (dogW XR U)) := by\n  intro s hs\n  rw [Rectangle, Complex.mem_reProdIm, dogZ_re, dogW_re, dogZ_im, dogW_im] at hs\n  rw [Set.uIcc_of_le hXR, Set.uIcc_of_le hTU] at hs\n  exact (Jlag_differentiableAt_dogleg hs.1.1 (by linarith [hs.2.1])).differentiableWithinAt\n\n/-- **The dog-leg rectangle integral vanishes** (Cauchy; the region is\nunconditionally zero-free \u2014 the residue sum is EMPTY, no perimeter). -/\ntheorem rectangleIntegral_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral (Jlag n) (dogZ T) (dogW XR U) = 0 :=\n  (holomorphicOn_Jlag_dogleg hT hTU hXR).vanishesOnRectangle subset_rfl\n\n/-- The (2\u03c0i)\u207b\u00b9-normalized form (API symmetry with rectInt'_Jlag). -/\ntheorem rectangleIntegral'_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral' (Jlag n) (dogZ T) (dogW XR U) = 0 := by\n  rw [RectangleIntegral', rectangleIntegral_Jlag_dogleg_eq_zero hT hTU hXR,\n    smul_zero]\n\n/-- **THE EXACT DOG-LEG DEFORMATION IDENTITY** (D-074 \u00a73.2 (\u2605), the\ncapstone for ii\u2032-6-c): the low right-horizontal equals the high\nhorizontal minus the right drop plus the left lift. Orientations: all\nH-integrals left-to-right, all V-integrals upward (the main contour's\ntop side is their reversal, handled at the fold site). -/\ntheorem upper_right_horizontal_eq_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HIntegral (Jlag n) 3 XR T =\n      HIntegral (Jlag n) 3 XR U - VIntegral (Jlag n) XR T U +\n        VIntegral (Jlag n) 3 T U := by\n  have h0 := rectangleIntegral_Jlag_dogleg_eq_zero (n := n) hT hTU hXR\n  unfold RectangleIntegral at h0\n  rw [dogZ_re, dogZ_im, dogW_re, dogW_im] at h0\n  linear_combination h0\n\n/-! ## 2. The conjugation identity (for the lower-side transfer, DL-5) -/\n\n/-- kFun is conjugation-symmetric (real-coefficient rational function). -/\ntheorem kFun_conj (n : \u2115) (s : \u2102) :\n    kFun n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (kFun n s) := by\n  unfold kFun\n  simp [map_sub, map_pow, map_one]\n\n/-- **Jlag is conjugation-symmetric** (from `riemannZeta_conj` +\n`iteratedDeriv_riemannZeta_conj`): Jlag n (s\u0304) = conj (Jlag n s).\nNeeded for the lower-horizontal transfer (DL-5). -/\ntheorem Jlag_conj (n : \u2115) {s : \u2102} (hs : s \u2260 1) :\n    Jlag n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (Jlag n s) := by\n  have h1 : deriv riemannZeta ((starRingEnd \u2102) s) =\n      (starRingEnd \u2102) (deriv riemannZeta s) := by\n    have h := iteratedDeriv_riemannZeta_conj 1 hs\n    rwa [iteratedDeriv_one] at h\n  unfold Jlag\n  rw [kFun_conj, _root_.riemannZeta_conj, h1]\n  simp only [map_mul, map_neg, map_div\u2080]\n\n/-! ## 3. The left-lift bound (DL-2, D-074 \u00a73.3 V_left) -/\n\n/-- **Kernel on the lift**: \u2016kFun n (3+it)\u2016 \u2264 e^{5/2}+1 for n \u2264 t\u00b2\n(D-074 \u00a76: |(3+it)/(2+it)|\u00b2 = (9+t\u00b2)/(4+t\u00b2) = 1 + 5/(4+t\u00b2), whose n-th\npower is \u2264 e^{5n/(2(4+t\u00b2))} \u2264 e^{5/2}). -/\ntheorem kFun_three_add_it_norm_le_exp_five_halves_add_one {n : \u2115} {t : \u211d}\n    (hT : (n : \u211d) \u2264 t ^ 2) :\n    \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp (5 / 2) + 1 := by\n  rcases Nat.eq_zero_or_pos n with hn | hn\n  \u00b7 subst hn\n    simp only [kFun, pow_zero, sub_self, norm_zero]\n    positivity\n  \u00b7 have hnR : (1 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n    have ht2 : (0 : \u211d) < 4 + t ^ 2 := by positivity\n    have hn4t2 : (n : \u211d) \u2264 4 + t ^ 2 := by linarith [hT]\n    have hQpos : (0 : \u211d) \u2264 (9 + t ^ 2) / (4 + t ^ 2) := by positivity\n    have hQle : (9 + t ^ 2) / (4 + t ^ 2) \u2264 Real.exp (5 / (n : \u211d)) := by\n      have h1 : (9 + t ^ 2) / (4 + t ^ 2) = 1 + 5 / (4 + t ^ 2) := by\n        field_simp [ht2.ne']\n        ring\n      rw [h1]\n      have h2 : 5 / (4 + t ^ 2) \u2264 5 / (n : \u211d) :=\n        (div_le_div_iff_of_pos_left (by norm_num) ht2 (by positivity)).mpr hn4t2\n      have h3 := Real.add_one_le_exp (5 / (n : \u211d))\n      linarith\n    have hQn : ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 Real.exp 5 := by\n      calc ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 (Real.exp (5 / (n : \u211d))) ^ n :=\n            pow_le_pow_left\u2080 hQpos hQle n\n        _ = Real.exp 5 := by\n            rw [\u2190 Real.exp_nat_mul]\n            congr 1\n            have hn0 : (n : \u211d) \u2260 0 := by exact_mod_cast hn.ne'\n            field_simp [hn0]\n    have hns3 : Complex.normSq ((3 : \u211d) + t * Complex.I) = 9 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hns2 : Complex.normSq ((2 : \u211d) + t * Complex.I) = 4 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hnormA : \u2016((3 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (9 + t ^ 2) := by\n      have h1 : \u2016((3 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((3 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns3]\n    have hnormB : \u2016((2 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (4 + t ^ 2) := by\n      have h1 : \u2016((2 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((2 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns2]\n    have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =\n        Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by\n      rw [norm_div, hnormA, hnormB,\n        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]\n    have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by\n      push_cast\n      ring\n    unfold kFun\n    rw [hs1]\n    calc \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 :=\n          norm_sub_le _ _\n      _ = (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n + 1 := by\n          rw [norm_pow, hnorm, norm_one]\n      _ \u2264 Real.exp (5 / 2) + 1 := by\n          have h4 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n \u2264 Real.exp (5 / 2) := by\n            have hx0 : (0 : \u211d) \u2264 Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) :=\n              Real.sqrt_nonneg _\n            have hx : (0 : \u211d) \u2264 (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n :=\n              pow_nonneg hx0 n\n            have h5 : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 \u2264 Real.exp 5 := by\n              have e : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 =\n                  ((9 + t ^ 2) / (4 + t ^ 2)) ^ n := by\n                rw [\u2190 pow_mul, mul_comm n 2, pow_mul, Real.sq_sqrt hQpos]\n              rw [e]\n              exact hQn\n            have h8 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n =\n                Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2) := by\n              rw [Real.sqrt_sq hx]\n            rw [h8]\n            calc Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2)\n                \u2264 Real.sqrt (Real.exp 5) := Real.sqrt_le_sqrt h5\n              _ = Real.exp (5 / 2) := (Real.exp_half 5).symm\n          linarith [h4]\n\n/-- The Dirichlet majorant at s = 3 (summable since 3 > 1). -/\ndef dirichletC3 : \u211d :=\n  \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016\n\n/-- Termwise 3-vs-2 comparison for the \u039b L-series: \u039b(n)/n\u00b3 \u2264 (1/2)\u00b7\u039b(n)/n\u00b2. -/\nlemma norm_term_vonMangoldt_three_le_half (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 \u2264\n      (1 / 2) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 := by\n  have h3re : ((3 : \u2102).re) = 3 := rfl\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hn =>\n    rcases eq_or_ne n 1 with rfl | hn1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hn2 : 2 \u2264 n := by omega\n      have h\u039b : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016 =\n          ArithmeticFunction.vonMangoldt n :=\n        Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n      rw [h\u039b]\n      have e : ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d) =\n          (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := by\n        rw [show (3 : \u211d) = 2 + 1 by norm_num,\n          Real.rpow_add (by positivity : (0 : \u211d) < (n : \u211d)), Real.rpow_one]\n        field_simp [show (n : \u211d) \u2260 0 by positivity]\n      have h12 : (1 : \u211d) / (n : \u211d) \u2264 1 / 2 :=\n        one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 2)\n          (by exact_mod_cast hn2 : (2 : \u211d) \u2264 (n : \u211d))\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (n : \u211d)) _)\n      calc ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d)\n          = (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := e\n        _ \u2264 (1 / 2) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) :=\n            mul_le_mul_of_nonneg_right h12 hpos\n\n/-- dirichletC3 \u2264 1/2 (the termwise comparison + dirichletC2 \u2264 1) \u2014\nthe certified C_zeta3 = 0.5 of D-074 \u00a74. (A tighter 0.17 build is\npossible via a 6-prime partial sum + antitone-integral tail; the fold\nis indifferent to the constant, so the cheap certified 0.5 is charged.) -/\nlemma dirichletC3_le_half : dirichletC3 \u2264 1 / 2 := by\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  calc dirichletC3\n      = \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 := rfl\n    _ \u2264 \u2211' n : \u2115, (1 / 2) *\n          \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n        Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_three_le_half n) hsum3\n          (hsum2.mul_left (1 / 2))\n    _ = (1 / 2) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n    _ \u2264 1 / 2 := by linarith [dirichletC2_le_one]\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 dirichletC3 for re s \u2265 3 (the s = 3 clone of the\nDirichlet-series majorant). -/\nlemma norm_logDeriv_zeta_le_dirichletC3 {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 dirichletC3 := by\n  have hs1 : (1 : \u211d) < s.re := by linarith\n  have h1 : -logDeriv riemannZeta s\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016\n      \u2264 dirichletC3 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => LSeries.norm_term_le_of_re_le_re _ (by\n            simp\n            exact hs) n) hsumS hsum3\n      _ = dirichletC3 := rfl\n  calc \u2016logDeriv riemannZeta s\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 dirichletC3 := hle\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 1/2 for re s \u2265 3 (the charged C_zeta3 = 0.5). -/\nlemma norm_logDeriv_zeta_le_half {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 1 / 2 :=\n  (norm_logDeriv_zeta_le_dirichletC3 hs).trans dirichletC3_le_half\n\n/-- **The left-lift bound** (D-074 \u00a73.3 V_left): for 0 < T \u2264 U and\nn \u2264 T\u00b2, \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U \u2212 T)\u00b7(e^{5/2}+1)/2. The kernel\n\u2264 e^{5/2}+1 (the 1+5/(4+t\u00b2) computation), the zeta factor \u2264 1/2\n(certified, no perimeter). -/\ntheorem vIntegral_Jlag_three_norm_le {n : \u2115} {T U : \u211d}\n    (hT0 : (0 : \u211d) < T) (hTU : T \u2264 U) (hTn : (n : \u211d) \u2264 T ^ 2) :\n    \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U - T) * (Real.exp (5 / 2) + 1) / 2 := by\n  have hnorm : \u2016VIntegral (Jlag n) 3 T U\u2016 =\n      \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 := by\n    unfold VIntegral\n    rw [norm_smul, Complex.norm_I, one_mul]\n  rw [hnorm]\n  have hbound : \u2200 t \u2208 Set.Ioc T U,\n      \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 (Real.exp (5 / 2) + 1) * (1 / 2) := by\n    intro t ht\n    have htT : T < t := ht.1\n    have ht2 : (n : \u211d) \u2264 t ^ 2 := by nlinarith [hTn, hT0]\n    have hre : (3 : \u211d) \u2264 ((3 : \u211d) + t * Complex.I).re := by simp\n    have h1 := kFun_three_add_it_norm_le_exp_five_halves_add_one ht2\n    have h2 := norm_logDeriv_zeta_le_half (s := (3 : \u211d) + t * Complex.I) hre\n    have hnorm3 : \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hnorm3]\n    exact mul_le_mul h1 h2 (norm_nonneg _) (by positivity)\n  have hint : \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264\n      ((Real.exp (5 / 2) + 1) * (1 / 2)) * |U - T| := by\n    apply intervalIntegral.norm_integral_le_of_norm_le_const\n    intro t ht\n    rw [Set.uIoc_of_le hTU] at ht\n    exact hbound t ht\n  have habs : |U - T| = U - T := abs_of_nonneg (by linarith)\n  rw [habs] at hint\n  calc \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016\n      \u2264 ((Real.exp (5 / 2) + 1) * (1 / 2)) * (U - T) := hint\n    _ = (U - T) * (Real.exp (5 / 2) + 1) / 2 := by ring\n\n/-! ## 4. The high-horizontal stepping (DL-3, D-074 \u00a77 + D-073 \u00a74) -/\n\n/-- Termwise \u03c3-vs-2 comparison for the \u039b L-series (the (6.10) halving):\n\u039b(m)/m^\u03c3 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7\u039b(m)/m\u00b2 for \u03c3 \u2265 2. -/\nlemma norm_term_vonMangoldt_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) (m : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) m\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) m\u2016 := by\n  have h\u03c3re : ((\u03c3 : \u211d) + t * Complex.I).re = \u03c3 := by simp\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h\u03c3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hm =>\n    have h\u039b : \u2016(ArithmeticFunction.vonMangoldt m : \u2102)\u2016 =\n        ArithmeticFunction.vonMangoldt m :=\n      Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n    rw [h\u039b]\n    rcases eq_or_ne m 1 with rfl | hm1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hm2 : 2 \u2264 m := by omega\n      have e : ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ \u03c3 =\n          (1 / (m : \u211d) ^ (\u03c3 - 2)) * (ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d)) := by\n        rw [show (\u03c3 : \u211d) = (\u03c3 - 2) + 2 by ring,\n          Real.rpow_add (by positivity : (0 : \u211d) < (m : \u211d))]\n        field_simp [show (m : \u211d) \u2260 0 by positivity]\n        ring_nf\n      rw [e]\n      have hle : (1 : \u211d) / (m : \u211d) ^ (\u03c3 - 2) \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) := by\n        rw [Real.rpow_neg (by norm_num : (0 : \u211d) \u2264 2), \u2190 one_div]\n        apply one_div_le_one_div_of_le (Real.rpow_pos_of_pos (by norm_num : (0 : \u211d) < 2) _)\n        exact Real.rpow_le_rpow (by norm_num : (0 : \u211d) \u2264 2)\n          (by exact_mod_cast hm2 : (2 : \u211d) \u2264 (m : \u211d)) (by linarith : (0 : \u211d) \u2264 \u03c3 - 2)\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (m : \u211d)) _)\n      exact mul_le_mul_of_nonneg_right hle hpos\n\n/-- \u2016\u03b6\u2032/\u03b6(\u03c3+it)\u2016 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7dirichletC2 for \u03c3 \u2265 2 (the (6.10)\nhalving in LSeries form; dirichletC2 \u2264 1 makes the tail free). -/\nlemma norm_logDeriv_zeta_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) :\n    \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n  have hs1 : (1 : \u211d) < ((\u03c3 : \u211d) + t * Complex.I).re := by simp; linarith\n  have h1 : -logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) ((\u03c3 : \u211d) + t * Complex.I) := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I) n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I) n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n            ((\u03c3 : \u211d) + t * Complex.I) n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, (2 : \u211d) ^ (-(\u03c3 - 2)) *\n            \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_le_two_pow h\u03c3 n) hsumS\n            (hsum2.mul_left _)\n      _ = (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n  calc \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := hle\n\n/-- **Kernel envelope** (D-074 \u00a77, the single-exponential form that\nreplaces the unit-step geometric series): \u2016(1+1/((\u03c3\u22121)+iU))\u207f\u2016 \u2264\ne^{(4/9)\u03c3} for \u03c3 \u2265 3 and n \u2264 (4/9)U\u00b2. From the (6.11) core\n\u20161+1/s\u2016 \u2264 1+(re s+1)/normSq s \u2264 1+\u03c3/U\u00b2. -/\ntheorem one_add_div_pow_norm_le_exp_four_ninths {n : \u2115} {\u03c3 U : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) :\n    \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 Real.exp ((4 / 9) * \u03c3) := by\n  have hs0 : (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + U * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hle := norm_one_add_one_div_le hs0\n  have hre : (((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1 = \u03c3 := by\n    simp [Complex.add_re, Complex.ofReal_re, Complex.mul_re, Complex.I_re, Complex.I_im,\n      Complex.sub_re, Complex.one_re]\n  have hns : Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) = (\u03c3 - 1) ^ 2 + U ^ 2 := by\n    simp [Complex.normSq_apply]\n    ring\n  have hstep : ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 \u03c3 / U ^ 2 := by\n    rw [hre, hns]\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h1 : (0 : \u211d) \u2264 (\u03c3 - 1) ^ 2 := sq_nonneg _\n    exact (div_le_div_iff_of_pos_left (by linarith : (0 : \u211d) < \u03c3)\n      (by positivity) hU2).mpr (by linarith [h1])\n  have hstep1 : 1 + ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 1 + \u03c3 / U ^ 2 := by\n    linarith [hstep]\n  have hpow1 : \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 (1 + \u03c3 / U ^ 2) ^ n :=\n    pow_le_pow_left\u2080 (norm_nonneg _) (hle.trans hstep1) n\n  have hpow2 : (1 + \u03c3 / U ^ 2) ^ n \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := by\n    calc (1 + \u03c3 / U ^ 2) ^ n \u2264 (Real.exp (\u03c3 / U ^ 2)) ^ n := by\n          have h := Real.add_one_le_exp (\u03c3 / U ^ 2)\n          exact pow_le_pow_left\u2080 (by positivity) (by linarith) n\n      _ = Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := (Real.exp_nat_mul (\u03c3 / U ^ 2) n).symm\n  have hexp : (n : \u211d) * (\u03c3 / U ^ 2) \u2264 (4 / 9) * \u03c3 := by\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h\u03c30 : (0 : \u211d) < \u03c3 := by linarith\n    have h1 : (n : \u211d) / U ^ 2 \u2264 4 / 9 := by\n      have h2 := div_le_div_of_nonneg_right hnU hU2.le\n      rwa [mul_div_cancel_right\u2080 _ hU2.ne'] at h2\n    rw [show (n : \u211d) * (\u03c3 / U ^ 2) = ((n : \u211d) / U ^ 2) * \u03c3 by ring]\n    exact mul_le_mul_of_nonneg_right h1 h\u03c30.le\n  calc \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n\n      \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := hpow1.trans hpow2\n    _ \u2264 Real.exp ((4 / 9) * \u03c3) := Real.exp_le_exp.mpr hexp\n\n/-! ## 5. The product envelope and the integral assembly (DL-3c/d) -/\n\n/-- **The product envelope** (D-074 \u00a77): for \u03c3 \u2265 3, 0 < t, n \u2264 (4/9)t\u00b2,\n\u2016Jlag n (\u03c3+it)\u2016 \u2264 (4\u00b7e^{\u2212c\u03c3} + 4\u00b72^{\u2212\u03c3})\u00b7dirichletC2, c = log 2 \u2212 4/9.\nThe kernel envelope (e^{(4/9)\u03c3}) times the zeta halving (2^{\u2212(\u03c3\u22122)})\ncollapses to the single exponential 4\u00b7e^{\u2212c\u03c3}: no geometric series. -/\ntheorem Jlag_dogleg_norm_le_envelope {n : \u2115} {\u03c3 t : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (ht : 0 < t) (hnU : (n : \u211d) \u2264 (4 / 9) * t ^ 2) :\n    \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n  have hw1 : ((\u03c3 : \u211d) + t * Complex.I) - 1 = ((\u03c3 : \u211d) - 1) + t * Complex.I := by\n    push_cast\n    ring\n  have hs1ne : (((\u03c3 : \u211d) - 1) + t * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + t * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hwid : ((\u03c3 : \u211d) + t * Complex.I) / (((\u03c3 : \u211d) + t * Complex.I) - 1) =\n      1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I) := by\n    rw [hw1]\n    field_simp [hs1ne]\n    ring\n  have hker := one_add_div_pow_norm_le_exp_four_ninths h\u03c3 ht hnU\n  have hzeta := norm_logDeriv_zeta_le_two_pow (show (2 : \u211d) \u2264 \u03c3 by linarith) (t := t)\n  have hk : \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by\n    unfold kFun\n    rw [hwid]\n    calc \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 := norm_sub_le _ _\n      _ = \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I))\u2016 ^ n + 1 := by rw [norm_pow, norm_one]\n      _ \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by linarith [hker]\n  have hprod : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := by\n    have hn3 : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hn3]\n    exact mul_le_mul hk hzeta (norm_nonneg _)\n      (add_nonneg (Real.exp_nonneg _) (by norm_num))\n  have h2b : (2 : \u211d) ^ (-\u03c3) = Real.exp (-(Real.log 2) * \u03c3) := by\n    rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n    congr 1\n    ring\n  have h22 : (2 : \u211d) ^ (2 : \u211d) = 4 := by\n    rw [Real.rpow_two]\n    norm_num\n  have h2a : (2 : \u211d) ^ (-(\u03c3 - 2)) = 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [show (-(\u03c3 - 2)) = -\u03c3 + 2 by ring, Real.rpow_add (by norm_num : (0 : \u211d) < 2), h2b, h22]\n    ring\n  have hexp_alg : Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3) =\n      Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) := by\n    rw [\u2190 Real.exp_add]\n    congr 1\n    ring\n  have halg : (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2))) =\n      4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [h2a, h2b]\n    calc (Real.exp ((4 / 9) * \u03c3) + 1) * (4 * Real.exp (-(Real.log 2) * \u03c3))\n        = 4 * (Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3)) +\n          4 * Real.exp (-(Real.log 2) * \u03c3) := by ring\n      _ = 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * Real.exp (-(Real.log 2) * \u03c3) := by\n        rw [hexp_alg]\n  calc \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      \u2264 (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := hprod\n    _ = ((Real.exp ((4 / 9) * \u03c3) + 1) * (2 : \u211d) ^ (-(\u03c3 - 2))) * dirichletC2 := by ring\n    _ = (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n        rw [halg]\n\n/-- The FTC-bound \u222b\u2083^XR e^{\u2212c\u03c3}d\u03c3 \u2264 e^{\u22123c}/c for c > 0. -/\nlemma integral_exp_neg_le {c XR : \u211d} (hc : 0 < c) (_hXR : 3 \u2264 XR) :\n    \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-c * \u03c3) \u2264 Real.exp (-3 * c) / c := by\n  have hF : \u2200 x \u2208 Set.uIcc (3 : \u211d) XR,\n      HasDerivAt (fun \u03c3 => -Real.exp (-c * \u03c3) / c) (Real.exp (-c * x)) x := by\n    intro x hx\n    have h2 : HasDerivAt (fun \u03c3 => Real.exp (-c * \u03c3)) (Real.exp (-c * x) * (-c)) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-c)).exp\n      rwa [mul_one] at h\n    have h3 := h2.const_mul (-1 / c)\n    rw [show (-1 / c) * (Real.exp (-c * x) * (-c)) = Real.exp (-c * x) by\n      field_simp [hc.ne']] at h3\n    have h5 : (fun \u03c3 => (-1 / c) * Real.exp (-c * \u03c3)) =\n        (fun \u03c3 => -Real.exp (-c * \u03c3) / c) := by\n      funext \u03c3\n      field_simp [hc.ne']\n    rw [h5] at h3\n    exact h3\n  have hint : IntervalIntegrable (fun \u03c3 => Real.exp (-c * \u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (Real.continuous_exp.comp (continuous_const.mul continuous_id)).continuousOn\n  rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hF hint]\n  have h1 : (0 : \u211d) \u2264 Real.exp (-c * XR) / c := by positivity\n  have e : Real.exp (-c * 3) = Real.exp (-3 * c) := by\n    congr 1\n    ring\n  rw [e]\n  linarith [h1]\n\n/-- The certified exponent-decay constant c = log 2 \u2212 4/9 \u2265 0.2487. -/\nlemma cdog_gt : (0.2487 : \u211d) \u2264 Real.log 2 - 4 / 9 := by\n  have h := Real.log_two_gt_d9\n  norm_num at h\n  linarith\n\n/-- The certified e^{4/3} \u2264 3.8073 (the (1\u2212x/16)\u207b\u00b9\u2076 route + d9 e). -/\nlemma exp_four_thirds_le : Real.exp (4 / 3) \u2264 (3.8073 : \u211d) := by\n  have he13 : Real.exp (1 / 3) \u2264 (1.4006 : \u211d) :=\n    le_trans (exp_le_inv_sub_sixteen (by norm_num) (by norm_num)) (by norm_num)\n  rw [show (4 / 3 : \u211d) = 1 + 1 / 3 by norm_num, Real.exp_add]\n  calc Real.exp 1 * Real.exp (1 / 3) \u2264 2.7182818286 * 1.4006 :=\n        mul_le_mul Real.exp_one_lt_d9.le he13 (Real.exp_pos _).le (by norm_num)\n    _ \u2264 3.8073 := by norm_num\n\n/-- **THE HIGH-HORIZONTAL BOUND** (D-074 \u00a77 capstone; D-073 Cor 4.2's\nR(1.5) in single-exponential-envelope form): for 0 < U, n \u2264 (4/9)U\u00b2\n(i.e. U \u2265 (3/2)\u221an) and 3 \u2264 XR, \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 8.38\n(charged; the true value \u2264 1.2 at n = 10\u2075, E-034 V5). Charged with\ndirichletC2 \u2264 1 \u2014 the tight R(1.5) = 5.94 would need a dirichletC2 \u2264\n0.57 build (documented as the tightening path; the fold is\nindifferent: \u0394 \u2248 +2.4 per side). -/\ntheorem hIntegral_Jlag_dogleg_norm_le {n : \u2115} {U XR : \u211d}\n    (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) (hXR : 3 \u2264 XR) :\n    \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 (8.38 : \u211d) := by\n  have hc : (0 : \u211d) < Real.log 2 - 4 / 9 := by\n    have h := cdog_gt\n    linarith\n  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU\n  have hcontA : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) :=\n    Real.continuous_exp.comp (continuous_const.mul continuous_id)\n  have hcontB : Continuous (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) := by\n    have h1 : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) :=\n      Real.continuous_exp.comp (continuous_const.mul continuous_id)\n    have h2 : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2]\n    exact h1\n  have hIntA : IntervalIntegrable (fun \u03c3 : \u211d => 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3))\n      MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontA.const_mul 4).continuousOn\n  have hIntB : IntervalIntegrable (fun \u03c3 : \u211d => 4 * (2 : \u211d) ^ (-\u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontB.const_mul 4).continuousOn\n  have hIntG : IntervalIntegrable (fun \u03c3 : \u211d =>\n      (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2)\n      MeasureTheory.volume 3 XR := by\n    have h := (hIntA.add hIntB).const_mul dirichletC2\n    convert h using 1\n    ext \u03c3\n    ring\n  -- step 1: \u2016H\u2016 \u2264 \u222b envelope\n  have h1 : \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264\n      \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n    unfold HIntegral\n    apply intervalIntegral.norm_integral_le_of_norm_le hXR _ hIntG\n    exact Filter.Eventually.of_forall (fun \u03c3 h\u03c3 => hpt \u03c3 h\u03c3)\n  -- step 2: \u222b envelope = dirichletC2\u00b7(4\u222be^{\u2212c\u03c3} + 4\u222b2^{\u2212\u03c3})\n  have h2 : \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2\n      = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := by\n    rw [intervalIntegral.integral_const_mul, intervalIntegral.integral_add hIntA hIntB]\n  -- step 3: the two integral bounds\n  have h3a : \u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) \u2264\n      Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n    rw [intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le hc hXR\n    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),\n            Real.log_one, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n      calc Real.exp (-3 * (Real.log 2 - 4 / 9))\n          = Real.exp ((4 / 3) + -(3 * Real.log 2)) := by congr 1; ring\n        _ = Real.exp (4 / 3) * Real.exp (-(3 * Real.log 2)) := by rw [Real.exp_add]\n        _ = Real.exp (4 / 3) / 8 := by rw [h3l2]; ring\n    rw [he3c] at h\n    calc 4 * (Real.exp (-3 * (Real.log 2 - 4 / 9)) / (Real.log 2 - 4 / 9))\n        = 4 * ((Real.exp (4 / 3) / 8) / (Real.log 2 - 4 / 9)) := by rw [he3c]\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n        field_simp [hc.ne']\n        ring\n  have h3b : \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3) \u2264 1 / (2 * Real.log 2) := by\n    have h2e : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2e, intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le (Real.log_pos (by norm_num : (1 : \u211d) < 2)) hXR\n    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h\n    calc 4 * \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-(Real.log 2) * \u03c3)\n        \u2264 4 * ((1 / 8) / Real.log 2) := mul_le_mul_of_nonneg_left h (by norm_num)\n      _ = 1 / (2 * Real.log 2) := by\n        field_simp [Real.log_pos (by norm_num : (1 : \u211d) < 2)].ne'\n        ring\n  -- step 4: the certified assembly\n  have hlog2 : (0.6931471803 : \u211d) \u2264 Real.log 2 := Real.log_two_gt_d9\n  have h48 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 (7.6545 : \u211d) := by\n    have hcge := cdog_gt\n    have h1 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 3.8073 / (2 * 0.2487) :=\n      div_le_div exp_four_thirds_le (by linarith) (by norm_num) (by positivity)\n    calc Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9))\n        \u2264 3.8073 / (2 * 0.2487) := h1\n      _ \u2264 7.6545 := by norm_num\n  have h72 : 1 / (2 * Real.log 2) \u2264 (0.7214 : \u211d) := by\n    have h1 : 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) :=\n      one_div_le_one_div_of_le (by positivity) (by linarith)\n    calc 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) := h1\n      _ \u2264 0.7214 := by norm_num\n  have hC2 : dirichletC2 \u2264 1 := dirichletC2_le_one\n  have hsum : dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n      \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) \u2264 (8.38 : \u211d) := by\n    have hA0 : (0 : \u211d) \u2264 Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by positivity\n    have hB0 : (0 : \u211d) \u2264 1 / (2 * Real.log 2) := by positivity\n    calc dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2) := by ring\n      _ \u2264 7.6545 + 0.7214 := add_le_add h48 h72\n      _ \u2264 8.38 := by norm_num\n  calc \u2016HIntegral (Jlag n) 3 XR U\u2016\n      \u2264 \u222b \u03c3 in (3 : \u211d)..XR,\n          (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := h1\n    _ = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := h2\n    _ \u2264 8.38 := hsum\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 641,
      "oldLines": 8,
      "newStart": 641,
      "newLines": 7,
      "lines": [
        "     have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by",
        "       have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by",
        "         have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by",
        "-          rw [Real.log_div (by norm_num : (1 : \u211d) \u2260 0) (by norm_num : (8 : \u211d) \u2260 0),",
        "-            Real.log_one, Real.log_pow]",
        "+          rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]",
        "           push_cast",
        "           ring",
        "         rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "file_path": "C:\\Users\\lucky\\AppData\\Local\\Temp\\nguyen\\ff74d795-3344-493a-8c08-dc1bd8e633e1\\tasks\\br2amanfv.output"
}

{
  "type": "text",
  "file": {
    "filePath": "D:\\Python\\Quantum\\NGUYEN.md",
    "content": "  warnings; LiCircleBound + LiSqueeze root-imported; full build GREEN;\n  audit-session034-axioms.txt: 5 decls, 3 standard axioms only).\n  `C0hat_add_two_le` (\u0108\u2080(R+2) \u2264 5\u00b7log R, R \u2265 16002);\n  `not_badPoint_on_gapCircle` (every gap-circle point good);\n  `gentire_circle_le` (the circle bound transfers to Gentire);\n  **`gentire_const`** (the Schwarz squeeze: max-modulus via Zeta23's\n  AnalyticOn.norm_le_of_norm_le_on_sphere + the ball-form Schwarz lemma\n  on the \u03b3-gap circle sequence; growth RB \u2264 C\u2080\u2032 + 64\u00b7C\u2081\u00b7Q\u00b3 with\n  Q := R^{1/4}, R = Q\u2074 (Real.log_le_rpow_div + pow_le_pow_left\u2080 +\n  rpow_inv_natCast_pow), radius choice Q \u2265 2 + (128\u00b7C\u2081+2\u00b7C\u2080\u2032)\u00b7\u2016z\u2080\u2016/\u03b5\n  \u27f9 dist \u2264 \u03b5 \u27f9 Gentire \u2261 Gentire 0); **THE CAPSTONE\n  `partialFraction_identity (hZC : ZeroCountProp)`**: \u2203 B : \u2102, \u2200 s\n  good, logDeriv riemannZeta s = B + seriesFun s \u2212 1/s \u2212 1/(s\u22121) +\n  (log \u03c0)/2 \u2212 \u03c8(s/2)/2 \u2014 the partial-fraction identity Lean-proved\n  modulo ONLY the declared perimeter (first perimeter use in the 5e\n  chain: the \u03b3-gap circles need ZeroCountProp). Banked: le_or_lt\n  absent (le_or_gt + the dist/2 contradiction closes the squeeze);\n  set-Q + rw [\u2190 hQ] after push_cast for the rpow_inv_natCast_pow",
    "numLines": 18,
    "startLine": 1297,
    "totalLines": 1323
  }
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-007-extended-precision-floor.py",
  "old_string": "ZEROS_CSV = DATA / \"E-002-zeros-first-10000.csv\"\nCSV = DATA / f\"E-007{TAG}-extended-precision-floor.csv\"\nJSON = DATA / f\"E-007{TAG}-extended-precision-floor.json\"\n\nT = 200.0\nLAMBDAS = (0.5, 1.0, 1.5, 2.0)\nDPS = 40\nTAG = \"\"\n\n# --T400 variant: T=400, lambdas chosen so d <= N' (no dimensional\n# deficiency): interleaves support values a = lambda*ell(T) with the\n# T=200 run for a decay-law fit.\nif \"--T400\" in sys.argv:\n    T = 400.0\n    LAMBDAS = (0.5, 0.75, 1.0)\n    TAG = \"b\"",
  "new_string": "ZEROS_CSV = DATA / \"E-002-zeros-first-10000.csv\"\n\nT = 200.0\nLAMBDAS = (0.5, 1.0, 1.5, 2.0)\nDPS = 40\nTAG = \"\"\n\n# --T400 variant: T=400, lambdas chosen so d <= N' (no dimensional\n# deficiency): interleaves support values a = lambda*ell(T) with the\n# T=200 run for a decay-law fit.\nif \"--T400\" in sys.argv:\n    T = 400.0\n    LAMBDAS = (0.5, 0.75, 1.0)\n    TAG = \"b\"\n\nCSV = DATA / f\"E-007{TAG}-extended-precision-floor.csv\"\nJSON = DATA / f\"E-007{TAG}-extended-precision-floor.json\""
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiDogLeg.lean",
  "oldString": "  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU",
  "newString": "  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU",
  "originalFile": "/-\nNguyenRH1/LiDogLeg.lean \u2014 ii\u2032-6-DL-1 (D-074, session 040): the zero-free\ndog-leg deformation of the Lagarias horizontal right tail.\n\nTHE CONTENT (D-074 \u00a73.1\u20133.2): on the dog-leg rectangle [3, X_R]\u00d7[T, U]\n(T > 0), the Lagarias integrand Jlag n s = (s/(s\u22121))\u207f\u22121 \u00b7 (\u2212\u03b6\u2032/\u03b6(s)) is\nholomorphic UNCONDITIONALLY (s \u2260 1 since im > 0; \u03b6 s \u2260 0 for re s \u2265 3 > 1\nby Mathlib's Euler-product nonvanishing `riemannZeta_ne_zero_of_one_lt_re`\n\u2014 NO perimeter hypothesis, no zero-avoidance at U). Cauchy's theorem\n(`HolomorphicOn.vanishesOnRectangle`) then gives the EXACT deformation\nidentity\n  H(3\u2192X_R, T) = H(3\u2192X_R, U) \u2212 V(X_R, T\u2192U) + V(3, T\u2192U)\n(the upper right tail = the high horizontal \u2212 the right drop + the left\nlift), plus the Jlag conjugation identity for the lower-side transfer.\n\nThis is the repair of Finding F-D (D-072): the broken low-path envelope\nis ABANDONED (not bounded) \u2014 the magnitude bound comes later from the\nthree dog-leg pieces, all in the unconditionally zero-free region.\n-/\nimport Mathlib\nimport NguyenRH1.LiSides\nimport NguyenRH1.LiTightR\nimport NguyenRH1.LiBasePoints\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. Dog-leg analyticity (D-074 \u00a73.1; no perimeter) -/\n\n/-- The dog-leg corners (same real-part/imaginary-part form as rectZ/rectW). -/\ndef dogZ (T : \u211d) : \u2102 := ((3 : \u211d) : \u2102) + (T : \u211d) * Complex.I\ndef dogW (XR U : \u211d) : \u2102 := ((XR : \u211d) : \u2102) + (U : \u211d) * Complex.I\n\nlemma dogZ_re (T : \u211d) : (dogZ T).re = 3 := by simp [dogZ]\nlemma dogZ_im (T : \u211d) : (dogZ T).im = T := by simp [dogZ]\nlemma dogW_re (XR U : \u211d) : (dogW XR U).re = XR := by simp [dogW]\nlemma dogW_im (XR U : \u211d) : (dogW XR U).im = U := by simp [dogW]\n\n/-- Jlag is differentiable at every point with 3 \u2264 re, 0 < im:\n\u03b6 is zero-free for 1 < re (Mathlib `riemannZeta_ne_zero_of_one_lt_re`,\nUNCONDITIONAL \u2014 the Euler-product region) and s \u2260 1 (im \u2260 0).\nNO perimeter hypothesis. -/\ntheorem Jlag_differentiableAt_dogleg {n : \u2115} {s : \u2102}\n    (hre : 3 \u2264 s.re) (him : 0 < s.im) :\n    DifferentiableAt \u2102 (Jlag n) s := by\n  apply Jlag_differentiableAt\n  \u00b7 rintro rfl\n    simp at him\n  \u00b7 exact riemannZeta_ne_zero_of_one_lt_re (by linarith)\n\n/-- Jlag is holomorphic on the whole dog-leg rectangle\n[3, X_R]\u00d7[T, U] (T > 0). -/\ntheorem holomorphicOn_Jlag_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HolomorphicOn (Jlag n) (Rectangle (dogZ T) (dogW XR U)) := by\n  intro s hs\n  rw [Rectangle, Complex.mem_reProdIm, dogZ_re, dogW_re, dogZ_im, dogW_im] at hs\n  rw [Set.uIcc_of_le hXR, Set.uIcc_of_le hTU] at hs\n  exact (Jlag_differentiableAt_dogleg hs.1.1 (by linarith [hs.2.1])).differentiableWithinAt\n\n/-- **The dog-leg rectangle integral vanishes** (Cauchy; the region is\nunconditionally zero-free \u2014 the residue sum is EMPTY, no perimeter). -/\ntheorem rectangleIntegral_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral (Jlag n) (dogZ T) (dogW XR U) = 0 :=\n  (holomorphicOn_Jlag_dogleg hT hTU hXR).vanishesOnRectangle subset_rfl\n\n/-- The (2\u03c0i)\u207b\u00b9-normalized form (API symmetry with rectInt'_Jlag). -/\ntheorem rectangleIntegral'_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral' (Jlag n) (dogZ T) (dogW XR U) = 0 := by\n  rw [RectangleIntegral', rectangleIntegral_Jlag_dogleg_eq_zero hT hTU hXR,\n    smul_zero]\n\n/-- **THE EXACT DOG-LEG DEFORMATION IDENTITY** (D-074 \u00a73.2 (\u2605), the\ncapstone for ii\u2032-6-c): the low right-horizontal equals the high\nhorizontal minus the right drop plus the left lift. Orientations: all\nH-integrals left-to-right, all V-integrals upward (the main contour's\ntop side is their reversal, handled at the fold site). -/\ntheorem upper_right_horizontal_eq_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HIntegral (Jlag n) 3 XR T =\n      HIntegral (Jlag n) 3 XR U - VIntegral (Jlag n) XR T U +\n        VIntegral (Jlag n) 3 T U := by\n  have h0 := rectangleIntegral_Jlag_dogleg_eq_zero (n := n) hT hTU hXR\n  unfold RectangleIntegral at h0\n  rw [dogZ_re, dogZ_im, dogW_re, dogW_im] at h0\n  linear_combination h0\n\n/-! ## 2. The conjugation identity (for the lower-side transfer, DL-5) -/\n\n/-- kFun is conjugation-symmetric (real-coefficient rational function). -/\ntheorem kFun_conj (n : \u2115) (s : \u2102) :\n    kFun n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (kFun n s) := by\n  unfold kFun\n  simp [map_sub, map_pow, map_one]\n\n/-- **Jlag is conjugation-symmetric** (from `riemannZeta_conj` +\n`iteratedDeriv_riemannZeta_conj`): Jlag n (s\u0304) = conj (Jlag n s).\nNeeded for the lower-horizontal transfer (DL-5). -/\ntheorem Jlag_conj (n : \u2115) {s : \u2102} (hs : s \u2260 1) :\n    Jlag n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (Jlag n s) := by\n  have h1 : deriv riemannZeta ((starRingEnd \u2102) s) =\n      (starRingEnd \u2102) (deriv riemannZeta s) := by\n    have h := iteratedDeriv_riemannZeta_conj 1 hs\n    rwa [iteratedDeriv_one] at h\n  unfold Jlag\n  rw [kFun_conj, _root_.riemannZeta_conj, h1]\n  simp only [map_mul, map_neg, map_div\u2080]\n\n/-! ## 3. The left-lift bound (DL-2, D-074 \u00a73.3 V_left) -/\n\n/-- **Kernel on the lift**: \u2016kFun n (3+it)\u2016 \u2264 e^{5/2}+1 for n \u2264 t\u00b2\n(D-074 \u00a76: |(3+it)/(2+it)|\u00b2 = (9+t\u00b2)/(4+t\u00b2) = 1 + 5/(4+t\u00b2), whose n-th\npower is \u2264 e^{5n/(2(4+t\u00b2))} \u2264 e^{5/2}). -/\ntheorem kFun_three_add_it_norm_le_exp_five_halves_add_one {n : \u2115} {t : \u211d}\n    (hT : (n : \u211d) \u2264 t ^ 2) :\n    \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp (5 / 2) + 1 := by\n  rcases Nat.eq_zero_or_pos n with hn | hn\n  \u00b7 subst hn\n    simp only [kFun, pow_zero, sub_self, norm_zero]\n    positivity\n  \u00b7 have hnR : (1 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n    have ht2 : (0 : \u211d) < 4 + t ^ 2 := by positivity\n    have hn4t2 : (n : \u211d) \u2264 4 + t ^ 2 := by linarith [hT]\n    have hQpos : (0 : \u211d) \u2264 (9 + t ^ 2) / (4 + t ^ 2) := by positivity\n    have hQle : (9 + t ^ 2) / (4 + t ^ 2) \u2264 Real.exp (5 / (n : \u211d)) := by\n      have h1 : (9 + t ^ 2) / (4 + t ^ 2) = 1 + 5 / (4 + t ^ 2) := by\n        field_simp [ht2.ne']\n        ring\n      rw [h1]\n      have h2 : 5 / (4 + t ^ 2) \u2264 5 / (n : \u211d) :=\n        (div_le_div_iff_of_pos_left (by norm_num) ht2 (by positivity)).mpr hn4t2\n      have h3 := Real.add_one_le_exp (5 / (n : \u211d))\n      linarith\n    have hQn : ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 Real.exp 5 := by\n      calc ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 (Real.exp (5 / (n : \u211d))) ^ n :=\n            pow_le_pow_left\u2080 hQpos hQle n\n        _ = Real.exp 5 := by\n            rw [\u2190 Real.exp_nat_mul]\n            congr 1\n            have hn0 : (n : \u211d) \u2260 0 := by exact_mod_cast hn.ne'\n            field_simp [hn0]\n    have hns3 : Complex.normSq ((3 : \u211d) + t * Complex.I) = 9 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hns2 : Complex.normSq ((2 : \u211d) + t * Complex.I) = 4 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hnormA : \u2016((3 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (9 + t ^ 2) := by\n      have h1 : \u2016((3 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((3 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns3]\n    have hnormB : \u2016((2 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (4 + t ^ 2) := by\n      have h1 : \u2016((2 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((2 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns2]\n    have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =\n        Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by\n      rw [norm_div, hnormA, hnormB,\n        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]\n    have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by\n      push_cast\n      ring\n    unfold kFun\n    rw [hs1]\n    calc \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 :=\n          norm_sub_le _ _\n      _ = (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n + 1 := by\n          rw [norm_pow, hnorm, norm_one]\n      _ \u2264 Real.exp (5 / 2) + 1 := by\n          have h4 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n \u2264 Real.exp (5 / 2) := by\n            have hx0 : (0 : \u211d) \u2264 Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) :=\n              Real.sqrt_nonneg _\n            have hx : (0 : \u211d) \u2264 (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n :=\n              pow_nonneg hx0 n\n            have h5 : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 \u2264 Real.exp 5 := by\n              have e : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 =\n                  ((9 + t ^ 2) / (4 + t ^ 2)) ^ n := by\n                rw [\u2190 pow_mul, mul_comm n 2, pow_mul, Real.sq_sqrt hQpos]\n              rw [e]\n              exact hQn\n            have h8 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n =\n                Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2) := by\n              rw [Real.sqrt_sq hx]\n            rw [h8]\n            calc Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2)\n                \u2264 Real.sqrt (Real.exp 5) := Real.sqrt_le_sqrt h5\n              _ = Real.exp (5 / 2) := (Real.exp_half 5).symm\n          linarith [h4]\n\n/-- The Dirichlet majorant at s = 3 (summable since 3 > 1). -/\ndef dirichletC3 : \u211d :=\n  \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016\n\n/-- Termwise 3-vs-2 comparison for the \u039b L-series: \u039b(n)/n\u00b3 \u2264 (1/2)\u00b7\u039b(n)/n\u00b2. -/\nlemma norm_term_vonMangoldt_three_le_half (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 \u2264\n      (1 / 2) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 := by\n  have h3re : ((3 : \u2102).re) = 3 := rfl\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hn =>\n    rcases eq_or_ne n 1 with rfl | hn1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hn2 : 2 \u2264 n := by omega\n      have h\u039b : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016 =\n          ArithmeticFunction.vonMangoldt n :=\n        Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n      rw [h\u039b]\n      have e : ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d) =\n          (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := by\n        rw [show (3 : \u211d) = 2 + 1 by norm_num,\n          Real.rpow_add (by positivity : (0 : \u211d) < (n : \u211d)), Real.rpow_one]\n        field_simp [show (n : \u211d) \u2260 0 by positivity]\n      have h12 : (1 : \u211d) / (n : \u211d) \u2264 1 / 2 :=\n        one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 2)\n          (by exact_mod_cast hn2 : (2 : \u211d) \u2264 (n : \u211d))\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (n : \u211d)) _)\n      calc ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d)\n          = (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := e\n        _ \u2264 (1 / 2) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) :=\n            mul_le_mul_of_nonneg_right h12 hpos\n\n/-- dirichletC3 \u2264 1/2 (the termwise comparison + dirichletC2 \u2264 1) \u2014\nthe certified C_zeta3 = 0.5 of D-074 \u00a74. (A tighter 0.17 build is\npossible via a 6-prime partial sum + antitone-integral tail; the fold\nis indifferent to the constant, so the cheap certified 0.5 is charged.) -/\nlemma dirichletC3_le_half : dirichletC3 \u2264 1 / 2 := by\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  calc dirichletC3\n      = \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 := rfl\n    _ \u2264 \u2211' n : \u2115, (1 / 2) *\n          \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n        Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_three_le_half n) hsum3\n          (hsum2.mul_left (1 / 2))\n    _ = (1 / 2) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n    _ \u2264 1 / 2 := by linarith [dirichletC2_le_one]\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 dirichletC3 for re s \u2265 3 (the s = 3 clone of the\nDirichlet-series majorant). -/\nlemma norm_logDeriv_zeta_le_dirichletC3 {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 dirichletC3 := by\n  have hs1 : (1 : \u211d) < s.re := by linarith\n  have h1 : -logDeriv riemannZeta s\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016\n      \u2264 dirichletC3 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => LSeries.norm_term_le_of_re_le_re _ (by\n            simp\n            exact hs) n) hsumS hsum3\n      _ = dirichletC3 := rfl\n  calc \u2016logDeriv riemannZeta s\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 dirichletC3 := hle\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 1/2 for re s \u2265 3 (the charged C_zeta3 = 0.5). -/\nlemma norm_logDeriv_zeta_le_half {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 1 / 2 :=\n  (norm_logDeriv_zeta_le_dirichletC3 hs).trans dirichletC3_le_half\n\n/-- **The left-lift bound** (D-074 \u00a73.3 V_left): for 0 < T \u2264 U and\nn \u2264 T\u00b2, \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U \u2212 T)\u00b7(e^{5/2}+1)/2. The kernel\n\u2264 e^{5/2}+1 (the 1+5/(4+t\u00b2) computation), the zeta factor \u2264 1/2\n(certified, no perimeter). -/\ntheorem vIntegral_Jlag_three_norm_le {n : \u2115} {T U : \u211d}\n    (hT0 : (0 : \u211d) < T) (hTU : T \u2264 U) (hTn : (n : \u211d) \u2264 T ^ 2) :\n    \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U - T) * (Real.exp (5 / 2) + 1) / 2 := by\n  have hnorm : \u2016VIntegral (Jlag n) 3 T U\u2016 =\n      \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 := by\n    unfold VIntegral\n    rw [norm_smul, Complex.norm_I, one_mul]\n  rw [hnorm]\n  have hbound : \u2200 t \u2208 Set.Ioc T U,\n      \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 (Real.exp (5 / 2) + 1) * (1 / 2) := by\n    intro t ht\n    have htT : T < t := ht.1\n    have ht2 : (n : \u211d) \u2264 t ^ 2 := by nlinarith [hTn, hT0]\n    have hre : (3 : \u211d) \u2264 ((3 : \u211d) + t * Complex.I).re := by simp\n    have h1 := kFun_three_add_it_norm_le_exp_five_halves_add_one ht2\n    have h2 := norm_logDeriv_zeta_le_half (s := (3 : \u211d) + t * Complex.I) hre\n    have hnorm3 : \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hnorm3]\n    exact mul_le_mul h1 h2 (norm_nonneg _) (by positivity)\n  have hint : \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264\n      ((Real.exp (5 / 2) + 1) * (1 / 2)) * |U - T| := by\n    apply intervalIntegral.norm_integral_le_of_norm_le_const\n    intro t ht\n    rw [Set.uIoc_of_le hTU] at ht\n    exact hbound t ht\n  have habs : |U - T| = U - T := abs_of_nonneg (by linarith)\n  rw [habs] at hint\n  calc \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016\n      \u2264 ((Real.exp (5 / 2) + 1) * (1 / 2)) * (U - T) := hint\n    _ = (U - T) * (Real.exp (5 / 2) + 1) / 2 := by ring\n\n/-! ## 4. The high-horizontal stepping (DL-3, D-074 \u00a77 + D-073 \u00a74) -/\n\n/-- Termwise \u03c3-vs-2 comparison for the \u039b L-series (the (6.10) halving):\n\u039b(m)/m^\u03c3 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7\u039b(m)/m\u00b2 for \u03c3 \u2265 2. -/\nlemma norm_term_vonMangoldt_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) (m : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) m\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) m\u2016 := by\n  have h\u03c3re : ((\u03c3 : \u211d) + t * Complex.I).re = \u03c3 := by simp\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h\u03c3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hm =>\n    have h\u039b : \u2016(ArithmeticFunction.vonMangoldt m : \u2102)\u2016 =\n        ArithmeticFunction.vonMangoldt m :=\n      Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n    rw [h\u039b]\n    rcases eq_or_ne m 1 with rfl | hm1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hm2 : 2 \u2264 m := by omega\n      have e : ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ \u03c3 =\n          (1 / (m : \u211d) ^ (\u03c3 - 2)) * (ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d)) := by\n        rw [show (\u03c3 : \u211d) = (\u03c3 - 2) + 2 by ring,\n          Real.rpow_add (by positivity : (0 : \u211d) < (m : \u211d))]\n        field_simp [show (m : \u211d) \u2260 0 by positivity]\n        ring_nf\n      rw [e]\n      have hle : (1 : \u211d) / (m : \u211d) ^ (\u03c3 - 2) \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) := by\n        rw [Real.rpow_neg (by norm_num : (0 : \u211d) \u2264 2), \u2190 one_div]\n        apply one_div_le_one_div_of_le (Real.rpow_pos_of_pos (by norm_num : (0 : \u211d) < 2) _)\n        exact Real.rpow_le_rpow (by norm_num : (0 : \u211d) \u2264 2)\n          (by exact_mod_cast hm2 : (2 : \u211d) \u2264 (m : \u211d)) (by linarith : (0 : \u211d) \u2264 \u03c3 - 2)\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (m : \u211d)) _)\n      exact mul_le_mul_of_nonneg_right hle hpos\n\n/-- \u2016\u03b6\u2032/\u03b6(\u03c3+it)\u2016 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7dirichletC2 for \u03c3 \u2265 2 (the (6.10)\nhalving in LSeries form; dirichletC2 \u2264 1 makes the tail free). -/\nlemma norm_logDeriv_zeta_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) :\n    \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n  have hs1 : (1 : \u211d) < ((\u03c3 : \u211d) + t * Complex.I).re := by simp; linarith\n  have h1 : -logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) ((\u03c3 : \u211d) + t * Complex.I) := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I) n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I) n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n            ((\u03c3 : \u211d) + t * Complex.I) n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, (2 : \u211d) ^ (-(\u03c3 - 2)) *\n            \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_le_two_pow h\u03c3 n) hsumS\n            (hsum2.mul_left _)\n      _ = (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n  calc \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := hle\n\n/-- **Kernel envelope** (D-074 \u00a77, the single-exponential form that\nreplaces the unit-step geometric series): \u2016(1+1/((\u03c3\u22121)+iU))\u207f\u2016 \u2264\ne^{(4/9)\u03c3} for \u03c3 \u2265 3 and n \u2264 (4/9)U\u00b2. From the (6.11) core\n\u20161+1/s\u2016 \u2264 1+(re s+1)/normSq s \u2264 1+\u03c3/U\u00b2. -/\ntheorem one_add_div_pow_norm_le_exp_four_ninths {n : \u2115} {\u03c3 U : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) :\n    \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 Real.exp ((4 / 9) * \u03c3) := by\n  have hs0 : (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + U * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hle := norm_one_add_one_div_le hs0\n  have hre : (((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1 = \u03c3 := by\n    simp [Complex.add_re, Complex.ofReal_re, Complex.mul_re, Complex.I_re, Complex.I_im,\n      Complex.sub_re, Complex.one_re]\n  have hns : Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) = (\u03c3 - 1) ^ 2 + U ^ 2 := by\n    simp [Complex.normSq_apply]\n    ring\n  have hstep : ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 \u03c3 / U ^ 2 := by\n    rw [hre, hns]\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h1 : (0 : \u211d) \u2264 (\u03c3 - 1) ^ 2 := sq_nonneg _\n    exact (div_le_div_iff_of_pos_left (by linarith : (0 : \u211d) < \u03c3)\n      (by positivity) hU2).mpr (by linarith [h1])\n  have hstep1 : 1 + ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 1 + \u03c3 / U ^ 2 := by\n    linarith [hstep]\n  have hpow1 : \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 (1 + \u03c3 / U ^ 2) ^ n :=\n    pow_le_pow_left\u2080 (norm_nonneg _) (hle.trans hstep1) n\n  have hpow2 : (1 + \u03c3 / U ^ 2) ^ n \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := by\n    calc (1 + \u03c3 / U ^ 2) ^ n \u2264 (Real.exp (\u03c3 / U ^ 2)) ^ n := by\n          have h := Real.add_one_le_exp (\u03c3 / U ^ 2)\n          exact pow_le_pow_left\u2080 (by positivity) (by linarith) n\n      _ = Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := (Real.exp_nat_mul (\u03c3 / U ^ 2) n).symm\n  have hexp : (n : \u211d) * (\u03c3 / U ^ 2) \u2264 (4 / 9) * \u03c3 := by\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h\u03c30 : (0 : \u211d) < \u03c3 := by linarith\n    have h1 : (n : \u211d) / U ^ 2 \u2264 4 / 9 := by\n      have h2 := div_le_div_of_nonneg_right hnU hU2.le\n      rwa [mul_div_cancel_right\u2080 _ hU2.ne'] at h2\n    rw [show (n : \u211d) * (\u03c3 / U ^ 2) = ((n : \u211d) / U ^ 2) * \u03c3 by ring]\n    exact mul_le_mul_of_nonneg_right h1 h\u03c30.le\n  calc \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n\n      \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := hpow1.trans hpow2\n    _ \u2264 Real.exp ((4 / 9) * \u03c3) := Real.exp_le_exp.mpr hexp\n\n/-! ## 5. The product envelope and the integral assembly (DL-3c/d) -/\n\n/-- **The product envelope** (D-074 \u00a77): for \u03c3 \u2265 3, 0 < t, n \u2264 (4/9)t\u00b2,\n\u2016Jlag n (\u03c3+it)\u2016 \u2264 (4\u00b7e^{\u2212c\u03c3} + 4\u00b72^{\u2212\u03c3})\u00b7dirichletC2, c = log 2 \u2212 4/9.\nThe kernel envelope (e^{(4/9)\u03c3}) times the zeta halving (2^{\u2212(\u03c3\u22122)})\ncollapses to the single exponential 4\u00b7e^{\u2212c\u03c3}: no geometric series. -/\ntheorem Jlag_dogleg_norm_le_envelope {n : \u2115} {\u03c3 t : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (ht : 0 < t) (hnU : (n : \u211d) \u2264 (4 / 9) * t ^ 2) :\n    \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := by\n  have hw1 : ((\u03c3 : \u211d) + t * Complex.I) - 1 = ((\u03c3 : \u211d) - 1) + t * Complex.I := by\n    push_cast\n    ring\n  have hs1ne : (((\u03c3 : \u211d) - 1) + t * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + t * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hwid : ((\u03c3 : \u211d) + t * Complex.I) / (((\u03c3 : \u211d) + t * Complex.I) - 1) =\n      1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I) := by\n    rw [hw1]\n    field_simp [hs1ne]\n    ring\n  have hker := one_add_div_pow_norm_le_exp_four_ninths h\u03c3 ht hnU\n  have hzeta := norm_logDeriv_zeta_le_two_pow (show (2 : \u211d) \u2264 \u03c3 by linarith) (t := t)\n  have hk : \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by\n    unfold kFun\n    rw [hwid]\n    calc \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 := norm_sub_le _ _\n      _ = \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I))\u2016 ^ n + 1 := by rw [norm_pow, norm_one]\n      _ \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by linarith [hker]\n  have hprod : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := by\n    have hn3 : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hn3]\n    exact mul_le_mul hk hzeta (norm_nonneg _)\n      (add_nonneg (Real.exp_nonneg _) (by norm_num))\n  have h2b : (2 : \u211d) ^ (-\u03c3) = Real.exp (-(Real.log 2) * \u03c3) := by\n    rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n    congr 1\n    ring\n  have h22 : (2 : \u211d) ^ (2 : \u211d) = 4 := by\n    rw [Real.rpow_two]\n    norm_num\n  have h2a : (2 : \u211d) ^ (-(\u03c3 - 2)) = 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [show (-(\u03c3 - 2)) = -\u03c3 + 2 by ring, Real.rpow_add (by norm_num : (0 : \u211d) < 2), h2b, h22]\n    ring\n  have hexp_alg : Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3) =\n      Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) := by\n    rw [\u2190 Real.exp_add]\n    congr 1\n    ring\n  have halg : (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2))) =\n      4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [h2a, h2b]\n    calc (Real.exp ((4 / 9) * \u03c3) + 1) * (4 * Real.exp (-(Real.log 2) * \u03c3))\n        = 4 * (Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3)) +\n          4 * Real.exp (-(Real.log 2) * \u03c3) := by ring\n      _ = 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * Real.exp (-(Real.log 2) * \u03c3) := by\n        rw [hexp_alg]\n  calc \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      \u2264 (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := hprod\n    _ = dirichletC2 * ((Real.exp ((4 / 9) * \u03c3) + 1) * (2 : \u211d) ^ (-(\u03c3 - 2))) := by ring\n    _ = dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := by\n        rw [halg]\n\n/-- The FTC-bound \u222b\u2083^XR e^{\u2212c\u03c3}d\u03c3 \u2264 e^{\u22123c}/c for c > 0. -/\nlemma integral_exp_neg_le {c XR : \u211d} (hc : 0 < c) (_hXR : 3 \u2264 XR) :\n    \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-c * \u03c3) \u2264 Real.exp (-3 * c) / c := by\n  have hF : \u2200 x \u2208 Set.uIcc (3 : \u211d) XR,\n      HasDerivAt (fun \u03c3 => -Real.exp (-c * \u03c3) / c) (Real.exp (-c * x)) x := by\n    intro x hx\n    have h2 : HasDerivAt (fun \u03c3 => Real.exp (-c * \u03c3)) (Real.exp (-c * x) * (-c)) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-c)).exp\n      rwa [mul_one] at h\n    have h3 := h2.const_mul (-1 / c)\n    rw [show (-1 / c) * (Real.exp (-c * x) * (-c)) = Real.exp (-c * x) by\n      field_simp [hc.ne']] at h3\n    have h5 : (fun \u03c3 => (-1 / c) * Real.exp (-c * \u03c3)) =\n        (fun \u03c3 => -Real.exp (-c * \u03c3) / c) := by\n      funext \u03c3\n      field_simp [hc.ne']\n    rw [h5] at h3\n    exact h3\n  have hint : IntervalIntegrable (fun \u03c3 => Real.exp (-c * \u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (Real.continuous_exp.comp (continuous_const.mul continuous_id)).continuousOn\n  have e : Real.exp (-c * 3) = Real.exp (-3 * c) := by\n    congr 1\n    ring\n  rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hF hint, e]\n  have h1 : (0 : \u211d) \u2264 Real.exp (-c * XR) := (Real.exp_pos _).le\n  have h2 : (0 : \u211d) < c := hc\n  rw [show -Real.exp (-c * XR) / c - -Real.exp (-3 * c) / c =\n      (Real.exp (-3 * c) - Real.exp (-c * XR)) / c by\n    field_simp [h2.ne']\n    ring]\n  rw [show Real.exp (-3 * c) / c = (Real.exp (-3 * c) - (0 : \u211d)) / c by ring]\n  exact div_le_div_of_nonneg_right (by linarith [h1]) h2.le\n\n/-- The certified exponent-decay constant c = log 2 \u2212 4/9 \u2265 0.2487. -/\nlemma cdog_gt : (0.2487 : \u211d) \u2264 Real.log 2 - 4 / 9 := by\n  have h := Real.log_two_gt_d9\n  norm_num at h\n  linarith\n\n/-- The certified e^{4/3} \u2264 3.8073 (the (1\u2212x/16)\u207b\u00b9\u2076 route + d9 e). -/\nlemma exp_four_thirds_le : Real.exp (4 / 3) \u2264 (3.8073 : \u211d) := by\n  have he13 : Real.exp (1 / 3) \u2264 (1.4006 : \u211d) :=\n    le_trans (exp_le_inv_sub_sixteen (by norm_num) (by norm_num)) (by norm_num)\n  rw [show (4 / 3 : \u211d) = 1 + 1 / 3 by norm_num, Real.exp_add]\n  calc Real.exp 1 * Real.exp (1 / 3) \u2264 2.7182818286 * 1.4006 :=\n        mul_le_mul Real.exp_one_lt_d9.le he13 (Real.exp_pos _).le (by norm_num)\n    _ \u2264 3.8073 := by norm_num\n\n/-- **THE HIGH-HORIZONTAL BOUND** (D-074 \u00a77 capstone; D-073 Cor 4.2's\nR(1.5) in single-exponential-envelope form): for 0 < U, n \u2264 (4/9)U\u00b2\n(i.e. U \u2265 (3/2)\u221an) and 3 \u2264 XR, \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 8.38\n(charged; the true value \u2264 1.2 at n = 10\u2075, E-034 V5). Charged with\ndirichletC2 \u2264 1 \u2014 the tight R(1.5) = 5.94 would need a dirichletC2 \u2264\n0.57 build (documented as the tightening path; the fold is\nindifferent: \u0394 \u2248 +2.4 per side). -/\ntheorem hIntegral_Jlag_dogleg_norm_le {n : \u2115} {U XR : \u211d}\n    (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) (hXR : 3 \u2264 XR) :\n    \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 (8.38 : \u211d) := by\n  have hc : (0 : \u211d) < Real.log 2 - 4 / 9 := by\n    have h := cdog_gt\n    linarith\n  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU\n  have hcontA : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) :=\n    Real.continuous_exp.comp (continuous_const.mul continuous_id)\n  have hcontB : Continuous (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) := by\n    have h1 : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) :=\n      Real.continuous_exp.comp (continuous_const.mul continuous_id)\n    have h2 : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2]\n    exact h1\n  have hIntA : IntervalIntegrable (fun \u03c3 : \u211d => 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3))\n      MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontA.const_mul 4).continuousOn\n  have hIntB : IntervalIntegrable (fun \u03c3 : \u211d => 4 * (2 : \u211d) ^ (-\u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontB.const_mul 4).continuousOn\n  have hIntG : IntervalIntegrable (fun \u03c3 : \u211d =>\n      (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2)\n      MeasureTheory.volume 3 XR := by\n    have h := (hIntA.add hIntB).const_mul dirichletC2\n    convert h using 1\n    ext \u03c3\n    ring\n  -- step 1: \u2016H\u2016 \u2264 \u222b envelope\n  have h1 : \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264\n      \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := by\n    unfold HIntegral\n    apply intervalIntegral.norm_integral_le_of_norm_le hXR _ hIntG\n    exact Filter.Eventually.of_forall (fun \u03c3 h\u03c3 => hpt \u03c3 h\u03c3)\n  -- step 2: \u222b envelope = dirichletC2\u00b7(4\u222be^{\u2212c\u03c3} + 4\u222b2^{\u2212\u03c3})\n  have h2 : \u222b \u03c3 in (3 : \u211d)..XR,\n        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2\n      = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := by\n    rw [intervalIntegral.integral_const_mul, intervalIntegral.integral_add hIntA hIntB]\n  -- step 3: the two integral bounds\n  have h3a : \u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) \u2264\n      Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n    rw [intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le hc hXR\n    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n      calc Real.exp (-3 * (Real.log 2 - 4 / 9))\n          = Real.exp ((4 / 3) + -(3 * Real.log 2)) := by congr 1; ring\n        _ = Real.exp (4 / 3) * Real.exp (-(3 * Real.log 2)) := by rw [Real.exp_add]\n        _ = Real.exp (4 / 3) / 8 := by rw [h3l2]; ring\n    rw [he3c] at h\n    calc 4 * (Real.exp (-3 * (Real.log 2 - 4 / 9)) / (Real.log 2 - 4 / 9))\n        = 4 * ((Real.exp (4 / 3) / 8) / (Real.log 2 - 4 / 9)) := by rw [he3c]\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n        field_simp [hc.ne']\n        ring\n  have h3b : \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3) \u2264 1 / (2 * Real.log 2) := by\n    have h2e : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2e, intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le (Real.log_pos (by norm_num : (1 : \u211d) < 2)) hXR\n    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h\n    calc 4 * \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-(Real.log 2) * \u03c3)\n        \u2264 4 * ((1 / 8) / Real.log 2) := mul_le_mul_of_nonneg_left h (by norm_num)\n      _ = 1 / (2 * Real.log 2) := by\n        field_simp [Real.log_pos (by norm_num : (1 : \u211d) < 2)].ne'\n        ring\n  -- step 4: the certified assembly\n  have hlog2 : (0.6931471803 : \u211d) \u2264 Real.log 2 := Real.log_two_gt_d9\n  have h48 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 (7.6545 : \u211d) := by\n    have hcge := cdog_gt\n    have h1 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 3.8073 / (2 * 0.2487) :=\n      div_le_div exp_four_thirds_le (by linarith) (by norm_num) (by positivity)\n    calc Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9))\n        \u2264 3.8073 / (2 * 0.2487) := h1\n      _ \u2264 7.6545 := by norm_num\n  have h72 : 1 / (2 * Real.log 2) \u2264 (0.7214 : \u211d) := by\n    have h1 : 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) :=\n      one_div_le_one_div_of_le (by positivity) (by linarith)\n    calc 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) := h1\n      _ \u2264 0.7214 := by norm_num\n  have hC2 : dirichletC2 \u2264 1 := dirichletC2_le_one\n  have hsum : dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n      \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) \u2264 (8.38 : \u211d) := by\n    have hA0 : (0 : \u211d) \u2264 Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by positivity\n    have hB0 : (0 : \u211d) \u2264 1 / (2 * Real.log 2) := by positivity\n    calc dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2) := by ring\n      _ \u2264 7.6545 + 0.7214 := add_le_add h48 h72\n      _ \u2264 8.38 := by norm_num\n  calc \u2016HIntegral (Jlag n) 3 XR U\u2016\n      \u2264 \u222b \u03c3 in (3 : \u211d)..XR,\n          (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 := h1\n    _ = dirichletC2 * (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) +\n          \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := h2\n    _ \u2264 8.38 := hsum\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 596,
      "oldLines": 7,
      "newStart": 596,
      "newLines": 7,
      "lines": [
        "     linarith",
        "   have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,",
        "       \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264",
        "-        (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) * dirichletC2 :=",
        "+        dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) :=",
        "     fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU",
        "   have hcontA : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) :=",
        "     Real.continuous_exp.comp (continuous_const.mul continuous_id)"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\research\\numerics\\scripts\\E-008-li-coefficients.py",
  "old_string": "    lam1_err = abs(lam[0] - LAMBDA1_KNOWN)\n    checks = {\n        \"lambda_1_matches_literature\": bool(lam1_err < 1e-4),\n        \"all_positive_in_range\": bool(np.all(lam > 0)),\n        \"tail_small_at_n500\": bool(tail[499] / lam[499] < 0.05),\n    }",
  "new_string": "    lam1_err = abs(lam[0] - LAMBDA1_KNOWN)\n    # validation threshold = the explicit tail bound at n=1 (honest:\n    # truncation error can be as large as the bound)\n    lam1_ok = bool(lam1_err < tail[0])\n    # usable range: largest n with tail bound < 5% of lambda_n\n    frac = tail / lam\n    usable = n[frac < 0.05]\n    n_usable = int(usable[-1]) if len(usable) else 0\n    checks = {\n        \"lambda_1_within_tail_bound\": lam1_ok,\n        \"all_positive_in_range\": bool(np.all(lam > 0)),\n        \"usable_range_at_least_n250\": bool(n_usable >= 250),\n    }"
}

{
  "filePath": "D:\\Python\\Quantum\\NGUYEN.md",
  "oldString": "  bridge; log_le_rpow_div's exponent-hypothesis form. Next: ii\u2032-5f\n  (D-056's tight constants 10.5/48 from the identity) \u2192 ii\u2032-3b \u2192\n  ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.\n\n## 9. SUCCESS CRITERIA (ordered)",
  "newString": "  bridge; log_le_rpow_div's exponent-hypothesis form. Next: ii\u2032-5f\n  (D-056's tight constants 10.5/48 from the identity) \u2192 ii\u2032-3b \u2192\n  ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.\n- Session 035 (2026-08-23/24): **ii\u2032-5f STARTED \u2014 5f-0 + 5f-i + piece\n  6 COMPLETE** (commits 75172e6, f850d9a, 0cca091, d808f52, 1eeda9b,\n  c9c1362, b5e3f53). **Perimeter repair** (user-approved): ZeroCountProp\n  strengthened to the mult-weighted form (the second ii\u2032-1a-class\n  encoding defect \u2014 the unweighted set-card under-captured the declared\n  Trudgian N(T) source; `one_le_zeroMult` bridge via\n  analyticOrderAt_ne_zero + ENat.toNat_pos; exists_zero_avoiding_T +\n  exists_gapCircle_radius adapted via card \u2264 \u03a3 mult; full build GREEN;\n  audit-session035-axioms.txt: 5 decls, 3 standard axioms only).\n  **P1/P2 perimeter additions** (user-approved, D-069): ZeroCountProp2\n  (the two-unit Trudgian specialization 0.6\u00b7L + 0.886\u00b7LL + 2.7) +\n  NoLowZeros (|\u03b3| \u2265 14, Platt-class zero-location certificate).\n  **D-069 Finding 1**: D-056's piece-2 one-C\u2080 usage is for a TWO-unit\n  window \u2014 the honest two-unit form makes the assembly fit 10.5/48\n  (margin \u2248 1.9). **Finding 2** (ii\u2032-6 map): H(T) clearance coverage\n  (honest \u2248 7\u00b7\u0108\u2080\u00b2 vs baked 3\u00b7\u0108\u2080\u00b2). **5f-i** (LiTightR.lean, new file):\n  tsum_split_finset_complex, nearZerosSub, seriesDiffTerm +\n  seriesFun_sub_seriesFun, **Rexpr_decomp** (the six-piece\n  reference-point decomposition; B cancels; linear_combination\n  hsid \u2212 hs\u2080id + hdiff + hsplit + hnear), piece 1\n  `dirichletC2_le_one` (the level-2 integral machinery:\n  hasDerivAt_neg_log_add_one_div + integral_Ioi_of_hasDerivAt_of_tendsto'\n  + AntitoneOn.tsum_comp_add_le_integral + the log2/log3 numeric fold),\n  piece 2 `near_sum_refPoint_le`, pieces 4/5 `one_div_diff_le` (\u2264\n  0.045). **5f-ii piece 6**: `log_diff_le` (the segment-FTC log\n  bound \u2264 5/t) + `digamma_diff_le` (\u2016(\u03c8(s/2)\u2212\u03c8(s\u2080/2))/2\u2016 \u2264 6/t via the\n  +2 shift + StirlingVert.digamma_stirling + digamma_add_natCast). The\n  sharp Lemma-D remainder turned out UNNECESSARY (digamma_stirling's\n  3/im\u00b2 suffices; piece 3's sharper interval sum freed the budget).\n  Banked: the real-cast-first ((t/2 : \u211d) : \u2102)\u00b7I form; re/im ext-goals\n  via explicit per-component rw chains; field_simp can close the goal;\n  Summable.sum_add_tsum_nat_add method form; cpow_natCast's (2:\u2102) =\n  ((2:\u2115):\u2102) bridge. Next: piece 3 (the far-sum interval machine) \u2192\n  5f-iii (assembly + pinch + capstone) \u2192 ii\u2032-3b \u2192 ii\u2032-3c \u2192 ii\u2032-6 \u2192\n  ii\u2032-7.\n\n## 9. SUCCESS CRITERIA (ordered)",
  "originalFile": "# NGUYEN.md\n# ============================================================\n# PROJECT NGUYEN-RH-1 \u2014 The Riemann Hypothesis Challenge\n# Autonomous Agent Research Blueprint\n# Created: [auto-date] | Status: ACTIVE | Version: 1.0\n# ============================================================\n\n## 1. MISSION STATEMENT\nProve (or make maximal rigorous progress toward) the Riemann\nHypothesis: all nontrivial zeros of \u03b6(s) satisfy Re(s) = 1/2.\nPrimary launchpad: the Anthropic paper proving \u2265 2/3 of zeros are\nsimple and on the critical line, unconditionally.\n\n## 2. RESOURCE MANIFEST\n| ID | Resource | Contents | Use |\n|----|----------|----------|-----|\n| R1 | notes.txt | RH Wikipedia link; Physics Hypertextbook (https://physics.info/ \u2014 all physics equations); full quantum-mechanics equation list (Schr\u00f6dinger eqs, commutators, uncertainty, angular momentum, Pauli matrices, hydrogen atom, harmonic oscillator, Heisenberg picture, Ehrenfest) | Track B spectral/Hilbert\u2013P\u00f3lya modeling |\n| R2 | Anthropic Riemann Hypothesis Paper.pdf | Theorems A & B (2/3 simple+on-line, 5/6 distinct); Weil-form compression G\u0303 = P + Q; rank\u2013trace inequality; Montgomery unconditional second moment; window theory R(\u03c8); sharpness analysis \u00a77.2; Lean 4 verification | Foundation for Track A; formal infra for Track D |\n| R3 | zeta-23-lean repo (tag v1.0) | Lean 4 formalization, counting functions vs Mathlib riemannZeta | Track D |\n| R4 | Cited literature ([Mon73]\u2026[GS26]) | Full method genealogy | All tracks |\n| R5 | Python stack (mpmath, sympy, numpy, scipy) | zetazero, numerical Weil forms, SDP | Numerics |\n| R6 | Compute resources | Local: Ryzen 9 7945HX 16c/32t, 64GB, RTX 4090 Laptop 16GB (CUDA 8.9). On request (ask user first, user provisions): Lambda AI multi-GPU cloud (SSH); IBM Quantum (no identified need as of 2026-08-17 \u2014 RH compute is classical) | Scaling numerics |\n| R7 | research/resources/ atlas (43 notes) | User-provided RH-equivalence atlas, step-by-step derivations of ~60 equations: all major RH criteria (Li, Lagarias, Robin, Nyman\u2013Beurling, Redheffer, Mertens, Riesz&H\u2013L, Salem, Volchkov, Franel\u2013Landau, Speiser, de Bruijn\u2013Newman, von Koch\u2013Schoenfeld, Hilbert\u2013P\u00f3lya), zero-counting/explicit formulas, RMT statistics, foundations. Index: research/resources/index.md | All tracks; cross-pollination reservoir (\u00a74A); D-037 direct inputs |\n\n## 3. KEY KNOWNS (inherited state of the art)\n- \u2265 2/3 zeros simple & on line; \u2265 5/6 distinct [R2, unconditional].\n- Montgomery\u2013Taylor window: 0.6725 / 0.83625; window-class optimum.\n- Bandwidth-one certificate ceiling \u2248 0.682 [R2 \u00a77.2].\n- Weil positivity on all of C\u00b2_c(\u211d) \u27fa RH [Weil, Bombieri].\n- Negative index of truncated Weil form counts off-line pairs [Bom00].\n- Obstruction map: X \u226b T needs prime-pair info; higher moments need\n  Rudnick\u2013Sarnak X^k \u2264 T^{2\u2212\u03b5}; HL*(\u221e) \u27f9 100% but not RH itself.\n- Any proof must FAIL for Davenport\u2013Heilbronn / Epstein zeta\n  (sanity gate \u2014 these violate RH-analogues).\n\n## 4. ATTACK TRACKS\n- **A. Certificate extension** (moments, windows, SDP, prime pairs)\n- **B. Spectral / Hilbert\u2013P\u00f3lya** (quantum formalism from R1; Gabor\n  frame \u2194 self-adjoint operator; Berry\u2013Keating; de Branges)\n- **C. Positivity criteria** (Weil growing support, Li coefficients,\n  de Bruijn\u2013Newman \u039b = 0)\n- **D. Formal verification** (Lean 4 skeletons for every lemma)\n\n## 4A. KNOWLEDGE INTEGRATION & EXTERNAL RESEARCH (STANDING ORDER)\nGoal reminder: solve RH by COMBINING all knowledge at our disposal.\n1. **Use the full equation inventory.** Every attack must actively consider\n   the complete toolset \u2014 quantum formalism (R1), analytic number theory\n   (R2, R4), spectral theory, random matrix theory, physics equations\n   (physics.info) \u2014 and seek cross-domain combinations, never stay inside\n   a single track by default.\n2. **Cross-pollination check.** Before abandoning any approach, ask: which\n   OTHER track's machinery could close this gap? Log cross-track ideas in\n   the session journal even when not pursued.\n3. **Web research before obstruction.** When knowledge is missing, research\n   the web (arXiv, surveys, MathOverflow, LMFDB, OEIS) BEFORE declaring a\n   dead end. Record every external source used \u2014 URL, what was taken, date \u2014\n   in the derivation/result file; paper-worthy sources go to references.bib.\n4. **Master tool index.** research/derivations/D-001 (built in Phase 0.1)\n   is the living index of all usable equations/tools; every newly\n   discovered tool is added there so no later session rediscovers it.\n5. **NO-BOUNDARIES RULE (user directive, 2026-08-17).** Do not merely\n   follow what has been done. The metric is success on the ultimate goal,\n   not fidelity to any tradition. Actively import ANY domain of human\n   knowledge that could crack a wall in the obstruction map (D-006 \u00a76) \u2014\n   no field is off-limits. Candidate reservoirs to sweep systematically:\n   random matrix theory & free probability; operator theory (de Branges,\n   Krein, canonical systems); harmonic analysis (uncertainty principles,\n   restriction theory, Beurling\u2013Malliavin); mathematical physics\n   (integrable systems, quantum chaos, scattering); probability (Gaussian\n   processes, determinantal point processes); algebraic geometry & finite\n   fields (Weil's proof for curves \u2014 the ONE case RH is proven); p-adic\n   and adelic methods; ergodic theory; information theory; optimization\n   (SDP/SOS hierarchies); machine-assisted discovery. At each phase\n   boundary, run a DOMAIN SWEEP: list the current walls, ask which\n   untouched field has machinery shaped like each wall, web-research the\n   top candidates (per \u00a74A.3), and log findings in D-001 Part III \u2014\n   including negative ones (a field that provably does not apply is\n   documented progress).\n\n## 5. PROJECT PLAN & CHECKLIST\n\n\u26a0 THE PLAN IS NOT CONCRETE. This is research: the plan and checklist may be\nupdated, extended, reordered, or pruned at ANY time as results demand.\nNever follow the checklist at the expense of the ultimate goal \u2014 solving\nthe Riemann Hypothesis. If a promising direction appears that is not in the\nplan, the plan changes, not the direction. All plan changes are committed\nto git with a one-line rationale.\n\n### \u2705 PHASE 0 \u2014 Initialization & Ingestion (COMPLETE 2026-08-17)\n- [x] 0.1 Parse notes.txt; index all quantum equations for Track B.\n      \u2192 research/derivations/D-001 (living master tool index, Part I done)\n- [x] 0.2 Deep-read Anthropic paper; reproduce chain (1.2) line by line.\n      \u2192 D-002 (statements/notation), D-003 (zero side), D-004 (prime side),\n      D-005 (linear algebra + chain), D-006 (sharpness/ceiling + Lean)\n- [x] 0.3 Reproduce Lemma 3.2 (rank\u2013trace) proof independently.\n      \u2192 research/derivations/D-005 (all four loss-points mapped; equality case confirmed)\n- [x] 0.4 Verify R(\u03c8\u2080) = 4/3 and R(\u03c8_MT) = \u00bd + (1/\u221a2)cot(1/\u221a2) symbolically.\n      \u2192 E-001 (sympy + mpmath, 60-digit): both PASS. Caught a hand-arithmetic\n      slip in D-004 (correct: R(\u03c8_MT) = 1.32749930, 2\u2212R = 0.67250070).\n- [x] 0.5 Clone/inspect zeta-23-lean structure; confirm axiom audit.\n      \u2192 D-007 (cloned at v1.0=3635e74; static audit consistent with\n      AUDIT.md: 0 real axioms, sorries only in trusted challenge stubs;\n      full lake rebuild deferred to Track D)\n- [x] 0.6 Numerical sandbox: compute first 10\u2074 zeros; build finite G\u0303;\n        confirm tr, \u2016\u00b7\u2016\u00b2_HS, inertia predictions empirically.\n      \u2192 E-002 (10\u2074 zeros @ dps 25, all checks pass), E-003 (finite G\u0303 at\n      T=1000/2000/4000, both windows: tr\u2248N to 0.1%, HS\u00b2/N tracks R(\u03c8)\n      with O(1/L) decay as Thm 5.7 predicts, PSD confirmed). Summary: D-008.\n\n### \u2705 PHASE 1 \u2014 Master the Ceiling (Track A groundwork) (COMPLETE 2026-08-20 \u2014 decision gate 1.5/D-013: NO within current data class, Track A \u2192 monitoring mode; 1.2 closed as deferred)\n- [x] 1.1 Re-derive the bandwidth-one ceiling \u2248 0.682; identify every\n        inequality that is not tight.\n      \u2192 D-009 (ceiling re-derived from kernel-checked Lean; inventory:\n      4 chain losses, 4 ceiling losses, 3 structural gaps; zero-density\n      route RULED OUT with reason; new candidate: multiple-zero bounds\n      as extra chain constraint \u2014 not ceiling-constrained)\n- [x] 1.2 Test window families beyond C\u00b2[\u2212\u00bd,\u00bd]; SDP over certificates\n        (CGdL20 style) numerically. \u2192 CLOSED-DEFERRED by decision\n        (calibration value only; E-005 testbed already provides CMS\n        machinery; D-013 rationale)\n- [x] 1.3 Investigate third moment tr G\u0303\u00b3 paths: what fragment of\n        [Hej94, RS96] survives unconditionally?\n      \u2192 ANSWER: none usefully. D-011 (wall: availability \u03bb\u22642/k vs cap \u03bb)\n      + E-005 (model-decisive) \u2192 G-002. Moment ladder CLOSED both sides.\n- [x] 1.4 Attempt any unconditional support-(1+\u03b4) form-factor result.\n      \u2192 D-012: none exists; missing input located EXACTLY (prime pairs\n      at lag h \u2272 X/T). Literature logged (D-001 Part III).\n- [x] 1.5 DECISION GATE: is > 2/3 achievable in this framework? Document.\n      \u2192 D-013: NO within current data class; 6-wall map (W1\u2013W6);\n      necessary conditions for any fix; routes ranked. Track A \u2192\n      monitoring mode; proceed to Tracks B/C.\n- [x] 1.6 \u03be\u2032-world bandwidth-one ceiling (LawN256 analogue) (NEW,\n        2026-08-18 regroup).\n      \u2192 ANSWER: saturated. E-020b/D-030: window-class optimum for kernel\n      D\u2081 = 0.86864 to 1e-6 \u2014 the paper's quartic window IS optimal\n      (control recovers MT 1.32749930 to 1.7e-7). The perfect-square\n      node buys ~0 headroom beyond the paper's window; nothing transfers\n      to \u03be. Adversary-side LP (E-020) documented as machinery\n      limitation (finite pool can't realize the extremal adversary).\n- [x] 1.7 T4b scoping (NEW, 2026-08-18 regroup).\n      \u2192 CLOSED with rationale (D-031): the mechanism iterates formally\n      (prime polynomial degree k \u2192 k nodes; \u03be\u2033 leading-order \u2248 0.94),\n      but (i) certificates certify \u03be\u207d\u1d4f\u207e zeros only, (ii) the G-001\n      substitution symmetry caps every \u03be\u207d\u1d4f\u207e data class below 100%, so\n      the Speiser/Levinson\u2013Montgomery route to RH is closed at every\n      derivative order, (iii) cost per derivative is high. Revival\n      condition noted (\u03be-side input route or Suzuki-line need).\n\n### \ud83d\udd36 PHASE 2 \u2014 Spectral Program (Track B) (MAPPED TO EXHAUSTION at current technology, 2026-08-19 \u2014 parked: 2.2/2.3/2.5 unprioritized; live remainder: 2.9 (L1, L3/L4 skeleton) \u2192 Paper B / post-publication)\nNOTE (2026-08-18 regroup): the Suzuki finite-interval operator program\n(spawned by 3.4c) IS the live realization of this phase \u2014 Suzuki's T_a is\na canonical-system / de Branges-type construction (2.4), its Galerkin\nrealization is a validated \u27e8\u03c8|\u0124|\u03c8\u27e9 model (2.1), and Suzuki Cor 1.6 gives\nan explicit RH-equivalent convergence target (success criterion #3).\nItems 2.6\u20132.8 are the active queue; 2.2/2.3 remain open, unprioritized.\n- [~] 2.1 Map Weil form W to candidate quadratic forms \u27e8\u03c8|\u0124|\u03c8\u27e9 using\n        R1 operator formalism (self-adjointness \u27fa real spectrum \u27fa RH).\n      \u2192 PARTIAL: Suzuki A_a Galerkin = validated Weil-form operator\n      (ledger #1; E-009a/b, D-019). General \u0124 construction: open.\n- [ ] 2.2 Analyze Berry\u2013Keating \u0124 = \u00bd(x\u0302p\u0302+p\u0302x\u0302) with boundary\n        regularizations; compare counting function to N(T). (untouched)\n- [ ] 2.3 Exploit paper's Lemma 2.1 (Poisson\u2013Gabor, critical density\n        h = 2\u03c0/L, no aliasing) as a frame for an operator model. (untouched)\n- [~] 2.4 Examine de Branges space / canonical system reformulation.\n      \u2192 ACTIVE via Suzuki line: Q-S2 (\u210b(T_a) as de Branges-type space,\n      D-019); W(a,\u03b8;z) all-real zeros (Thm 1.5) + exact interlacing\n      measured (E-014 H1, E-016 F1).\n- [ ] 2.5 DECISION GATE: any genuine self-adjoint realization? Document.\n- [x] 2.6 (Q-S3c remainder) Root-cause E-016 V3 Herglotz reconstruction\n        mismatch.\n      \u2192 RESOLVED (E-016b/E-016c, D-025): TWO recon-side defects, analytic\n      side exact (V6: direct float64 vs dps-50 \u2264 4.4e-15 to y=40).\n      (i) Galerkin W has a double zero at z\u22480 (pair \u00b1i\u03b5, \u03b5~2\u20136e-9 \u2014\n      Galerkin artifact vs Thm 1.5; found by NEW winding-excess\n      diagnostic; explains D-024 F3 \"defect at the origin\"); (ii) EM\n      tail had a spurious factor y (predicts the y=20 deficit EXACTLY at\n      both a=4 and a=10). Candidates (a)/(c) refuted. V3 REPAIRED:\n      V3R 1.99e-5 (a=4), 1.46e-5 (a=10) vs 0.02 threshold. E-016 F1\u2013F4\n      stand. Remaining: small-y-weighted \u03b8-metric (folds into 2.8).\n- [x] 2.7 (Q-S3a, analytic) Prove/disprove v\u00b1(a,\u00b7) \u2192 A_\u221e^{\u22121}e^{\u00b1\u00b7} in a\n        norm that controls W on compacts.\n      \u2192 ANSWERED STRUCTURALLY (D-026, R-003, E-017/D-027): the question\n      is REPLACED by an EXACT factorization W = F\u00b7(R\u2080 + R_\u03c4),\n      F = z\u00b2\u03be/\u03be\u2032, with R\u2080 = 2e^{a+i\u03b8/2}sin(az\u2212\u03b8/2) + o(e\u1d43) closed form.\n      Cor 1.6 \u27fa (\u2605): tail R_\u03c4 cancels the sine skeleton up to a\n      zero-free remainder \u2014 a finite-interval Wiener\u2013Hopf remainder\n      estimate on the symbol \u011d = z\u207b\u00b2\u03be\u2032/\u03be (RH-gated factorization).\n      Explains ALL measured phenomenology incl. the origin double zero.\n      E-017: (\u2605) already ~99.8% complete OFF the real axis at a=4; \u03b8=\u03c0\n      preferred quantitatively (4.7% vs 6.8%); transition = cancellation\n      descending to \u211d. Open content isolated: (\u2605) on \u211d.\n- [x] 2.8 (Q-S3b, numerics) Prime-sum backend redesign \u2192 a ~ 12\u201314;\n        track \u03b8=\u03c0 zero flow; test z\u2081\u00b7a \u2248 4.5 stiff law vs limit.\n      \u2192 COMPLETE at a=12 (E-018/E-019, D-028/D-029): backend v2\n      (blockwise \u039b, e\u00b2\u2074, validated 2.2e-7) built; descent profile shows\n      (\u2605) strip-uniform (~5\u20137e-3); a=12 zero-flow: maximal lattice\n      (1145/1146), stiff law z\u2081\u00b7a = 4.495, lattice STIFFENS (gap CV \u2193),\n      origin pair persists (+2.0000 winding excess), no non-real zeros,\n      envelope stationary. NO transition at\n      a \u2264 12 \u2014 question answered; a=13+ deprioritized by evidence\n      (revivable in ~30 min via backend cache). Key structural gain\n      (D-028): the open content of Cor 1.6 is the zero set of M, not\n      its envelope. [ERRATUM 2026-08-19, D-043 \u00a7C: the \"\u03b3-proximity\n      chance-level\" claim is RETRACTED \u2014 wrong-direction metric;\n      correct metric shows quadratic positional locking ~0.65/a\u00b2.]\n- [~] 2.9 (\u2605) analytic attack (NEW, 2026-08-18; design D-034/D-035\n        complete). Resolvent-convergence route: prove v\u00b1(a)\u2192v\u00b1(\u221e) in\n        the Krein-space \u210b(T)-norm \u27f9 D_{a,\u03b8(a)} \u2192 D strong resolvent\n        (Krein formalism) \u27f9 \"Cor 1.6 \u27fa D has real spectrum\" (deliverable\n        D1, criterion-3-shaped). Wall mapped: W-1 index unknown, W-2\n        real-spectrum persistence = RH, W-3 factorization circular for\n        proofs. Sub-tasks 2.10/2.11 support.\n      \u2192 D1 COMPLETE (session 008, D-041): Theorem D1 (deficiency\n      convergence \u27fa strong resolvent convergence) stated with proof\n      skeleton; reduction \"(1.12) \u27fa spec(D) \u2282 \u211d\" assembled (\u21d2 Suzuki\n      Cor 1.6; \u21d0 via L3/L4 WH literature assembly); lemma map\n      L0\u2013L4/W1\u2013W3; limit extension identified as the \u03c0/2 one (Suzuki\n      \u00a77.2\u20137.5); D-040 \u0394-constraint formalized as necessary conditions\n      N1\u2013N3 \u2014 the \u03b8(a) flow is obligatory, target the \u03c0/2-extension.\n      Remaining: L1 (unconditional embedding), L3/L4 (WH class\n      assembly), \u03b8(a) theory (\u2192 2.12).\n- [x] 2.10 (E-022/E-022b, D-040) Spectral-measure convergence numerics\n        (D-035 D2). COMPLETE (session 008): Clark/de Branges spectral\n        measures \u03bc_a = \u03a3 (1/K_a(z_k,z_k))\u03b4_{z_k} computed for a \u2264 12\n        (V0\u2013V3 pass). Findings: mass conservation (\u2248184, a-independent);\n        coarse weak metric FLAT; **K_a(z,z) has deep valleys exactly at\n        the true \u03b3's** (\u0394(a) = 2.16\u21922.94, corr(d,log K) \u2248 +0.4) \u2014 the\n        \u03b3-information flows through the WEIGHTS, not the positions\n        (within-z-bin + shifted-null controlled); mass within \u00b10.1 of\n        \u03b3's 63%\u219272.5%; **\u0394(a) \u2248 3.33 \u2212 4.76/a SATURATES at fixed \u03b8=\u03c0**\n        \u2014 fixed-\u03b8 ceiling; consolidation (\u0394\u2192\u221e) requires the \u03b8(a) flow\n        (new constraint on 2.9-D1). \u0394(a) is now the sharp, cheap\n        convergence probe for any candidate \u03b8(a).\n- [x] 2.11 (D-038) Transition-scale lower bound from skeleton + E-019\n        data: quantify the a-scale at which (\u2605)-consistent consolidation\n        must begin (D-035 D3). [NEW 2026-08-18]\n      \u2192 COMPLETE (session 008, D-038): consolidation functional\n      R(a) = (aZ/\u03c0)e^{\u2212\u0394(a)} (validated 15% vs measured residual);\n      onset criterion \u0394\u2032(a) > 1/a; margin C(a) = \u0394 \u2212 log a decreasing\n      0.77 \u2192 0.46 (a = 4\u219212); **a* > 12**; fixed-\u03b8 consolidation\n      asymptotically IMPOSSIBLE (saturation ceiling vs log a growth).\n- [x] 2.12 (E-024, D-042) \u03b8-flow numerics. COMPLETE (session 008):\n      **\u03b8-INDEPENDENCE proved numerically** (residual spread \u2264 2.2%,\n      valley masses \u2248 1.00 for all \u03b8; only lattice phase responds) \u2014\n      the \u03b8(a) flow CANNOT drive consolidation (de Branges prediction\n      confirmed); channel closed by evidence. **Linear-K law found**:\n      K_plateau \u2248 1.9a (\u2248 (6/\u03c0)a, 5 points to 0.3%), valley floor \u2248 1\n      (mass gauge m_\u03b3 = 1) \u27f9 residual \u2192 Z/6 \u2260 0 \u2014 the family\n      equilibrates EXACTLY at the consolidation boundary (margin\n      C(a) \u2192 0.4 const). Consolidation channel relocated to Suzuki's\n      own lever: \u03bb \u2192 \u03bb_a\u207b (ground-state regime, sister conjecture\n      (1.2)) \u2192 task 2.13. [ERRATUM 2026-08-19 (D-060): the 1.9a fit /\n      Z/6 residual are superseded by D-045 \u2014 plateau K/(2a) \u2192 1\n      (measured 0.973\u20130.997), residual \u2192 Z/(2\u03c0); the equilibrium\n      conclusion is unchanged.]\n- [x] 2.13 (E-025, D-043) \u03bb-flow numerics. COMPLETE (session 008):\n      (A) **discretization floor found**: pencil bottom crosses 0 at\n      a \u2248 5.2 (h=0.01), O(h) artifact \u2192 0; true \u03bb_a unresolvable for\n      a \u2273 3 \u2014 the \u03bb\u2192\u03bb_a\u207b experiment is machinery-limited (D-019 F1's\n      cliff tail = floor, upper bounds stand). (B) \u03bb-flow RESPONSE\n      confirmed qualitatively: near-singular T \u27f9 \u0394 deepens (2.2\u21927.0 at\n      a=4), residual drops 48\u219211 \u2014 but the approached mode at a \u2265 6 is\n      the artifact mode (sister corr \u2248 0). (C) **MAJOR CORRECTION**:\n      E-019's \"\u03b3-proximity chance-level\" was a wrong-direction metric;\n      correct direction shows **quadratic positional locking\n      ~0.65/a\u00b2**, improving through a=12 (D-029 erratum). Revised\n      picture: positions lock + weights concentrate; obstruction =\n      excess-zero outflow + residual \u2192 Z/6 (linear-K equilibrium).\n      [ERRATUM 2026-08-19 (D-060): residual \u2192 Z/(2\u03c0) per D-045; the\n      obstruction conclusion is unchanged.]\n\n### \u2705 PHASE 3 \u2014 Positivity Criteria (Track C) (COMPLETE 2026-08-19 \u2014 3.1\u20133.8 all answered/closed, R-004 full tag; 3.1/3.2 closed by evidence, 3.5 fulfilled via 3.6\u20133.8)\n- [x] 3.1 Weil positivity on supports [\u2212a,a], push a beyond Yoshida.\n      \u2192 ANSWERED/CLOSED by evidence: landscape mapped (D-014);\n      E-006/D-015: positivity horizon resolution-limited at 1e-10;\n      E-007/E-007b + D-017: floor decays ~e^{\u22121.65a}; pushing further\n      needs new conditioning machinery.\n- [x] 3.2 Li coefficients \u03bb_n: numerics to n ~ 10\u2075; asymptotic attack.\n      \u2192 E-008: zero-side table certifies \u03bb_n > 0 for n \u2264 116 (explicit\n      tail bound). E-011/R-001: arithmetic side (BL Thm 2, zero-free,\n      flint Stieltjes + Arb \u03b6, dps 1000) \u03bb_n > 0 \u2200 n \u2264 2000,\n      cross-validated vs E-008; refined asymptotic ratio 1.00216 at\n      n = 2000. E-015 (session 005, detached): extended to n \u2264 3000,\n      ALL CHECKS PASS (dps 1450; \u03bb_3000 = 8617.2192; ratio 0.999845).\n      Next: asymptotic attack \u2192 task 3.5; further pushes (cost ~n\u2074:\n      n=4000 \u2248 9 h) only in support of 3.5 (e.g. ratio trend data).\n      CLOSED 2026-08-20: the n ~ 10\u2075 own-table target is superseded \u2014\n      R-004's finite verification uses our table to 3000 + external\n      Misguich\u2013Voros to 5\u00d710\u2075 (10\u00d7 overlap), and 3.5's deliverable was\n      achieved via 3.6\u20133.8 (R-004).\n- [x] 3.3 de Bruijn\u2013Newman: study heat-flow dynamics of zeros; can the\n        paper's 2/3 density constrain \u039b?\n      \u2192 ANSWER: NO \u2014 one-sided information (D-021): theorem lower-bounds\n      on-line fraction, \u039b needs an upper bound on the complex fraction;\n      plus extremal-vs-averaged (E-012: collision times span 4.5 orders,\n      two-body accurate to 4.8% vs full ODE) and asymptotic-vs-explicit.\n      Route \u2192 G-003 (do not retry with stronger density results).\n- [x] 3.4 Cross-pollinate: does 2/3-simplicity feed any criterion?\n      \u2192 ANSWER: YES \u2014 it fed the Suzuki operator line, now the live\n      spectral program. 3.4a CLOSED (D-016, scale mismatch); 3.4b floor\n      decay (D-017); 3.4c COMPLETE (Suzuki operators: D-018, E-009a/b,\n      D-019 \u2014 \u03bb_a cliff; Galerkin Weil form validated 4.5e-6; E-010/\n      D-020 lattice law). Continuation moved to Phase 2 (2.6\u20132.8) as of\n      the 2026-08-18 regroup.\n- [x] 3.5 Li-coefficient asymptotic attack (NEW, 2026-08-18 regroup).\n      \u2192 DESIGN COMPLETE (D-032/D-033, session 006 cont.7). Voros:\n      \"\u03bb_n > 0 \u2200 n \u2265 N\u2080\" \u27fa RH at ANY N\u2080 \u2014 no partial version exists.\n      ACHIEVABLE DELIVERABLE identified: EXPLICIT finite-height theorem\n      (\u03bb_n > 0 \u2200 n \u2264 N\u2081 from Lagarias Thm 6.1's bridge + Platt's\n      T\u2080 \u2248 3e12 + traced constants + finite verification) \u2014 nobody has\n      assembled this chain. Wall mapped: arithmetic-side triangle\n      bounds explode ((15/14)\u207f); the three-way cancellation IS RH.\n      Remaining work \u2192 tasks 3.6\u20133.8. COMPLETE 2026-08-19: 3.6\u20133.8 all\n      done \u2192 R-004 (finite-height theorem, ledger #6, full tag).\n- [x] 3.6 (D-036) Explicit |\u03be\u2032/\u03be| / |L\u2032/L| contour bounds for \u03b6 with\n        constants (Lagarias Lemma 6.1; Davenport Ch. 15) + explicit\n        N(T) bound (Backlund\u2013Rosser/Trudgian). [NEW 2026-08-18]\n      \u2192 COMPLETE (session 006 cont.9; D-036). I_III dominant\n      ~4.7\u221an log n first estimate; constants A = 0.9, B\u2080 = 1.0\n      MEASURED by E-021 (D-036 \u00a76 updated).\n- [x] 3.7 (E-021) Exact S_\u221e(n) computation n \u2264 10\u2074 (Lagarias\n        T-function closed forms) \u2192 explicit O(1) constant; measure true\n        |S_f(n)| curve vs the traced bound. [NEW 2026-08-18]\n      \u2192 COMPLETE (session 007, after 6-bug root-cause saga \u2014 mpmath\n      zeta ~58-digit ceiling, GAMMA_E float literal, 3\u00d7 parse-before-\n      dps, \u03c3-omission boundary (15/14)\u207f, float64 zeros; journal-007).\n      ALL CHECKS PASS: V1 \u03bb_n vs E-015 4.8e-25 (n \u2264 3000); V2\n      A = 0.9, B\u2080 = 1.0; V3 c\u2080 = \u22121/4 with exact correction 1/(24n).\n      |S_f(n)| max 13.52 at n = 3298 vs traced bound ~2280 (slack\n      ~170\u00d7). n = 10\u2074 rerun available via cache.\n- [x] 3.8 (D-037 + R-004) Assemble the finite-height theorem: N\u2081\n        explicit; finite verification table; adversarial review; tag\n        [PROVED-CONDITIONAL(computational RH-to-height-T\u2080)]. [NEW]\n      \u2192 COMPLETE (session 008; D-037, R-004, E-023 ALL CHECKS PASS).\n      **\u03bb_n > 0 for all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074** (T\u2080 = 3\u00d710\u00b9\u00b2\n      Platt\u2013Trudgian; conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9). N\u2080 = 5\u00d710\u2074\n      (margin 67 705, convex chain); finite verification ours to 3000 +\n      Misguich\u2013Voros to 5\u00d710\u2075 (10\u00d7 overlap). D-036 |t|<10 gap found and\n      closed (M\u2080 = 1.3352). Follow-ups: D-039 (digamma sub-bound proof),\n      E-023b (acb box cover).\n\n### \u2705 PHASE 4 \u2014 Synthesis Assault (COMPLETE 2026-08-19, session 009)\n- [x] 4.1 Combine strongest partial results from Phases 1\u20133.\n      \u2192 D-052 (session 008): result inventory; T-1/T-2/T-3 final forms.\n- [x] 4.2 State best new theorem(s); classify [PROVED]/[CONDITIONAL].\n      \u2192 D-052; classifications corrected by D-054 (session 009).\n- [x] 4.3 Adversarial gauntlet: Davenport\u2013Heilbronn/Epstein sanity gate;\n        independent-instance review; error-hunting pass.\n      \u2192 4.3a D-053 (session 008): GATE PASSES structurally for T-1/T-2/T-3.\n      \u2192 4.3b D-054 (session 009): four independent review instances;\n      ALL THREE TAGS downgraded after hand-verification \u2014 D-039 proof\n      broken (bound true), D-036 \u00a71 far-sum O(|t| log t) hole\n      (reference-point trick missing), D-049 B1/B3 lower bounds broken\n      (Lemma-D 1/g\u00b2 term dropped; sinc\u00b2 factor 2), \u03b4_crit one-direction,\n      T-2 \u21d0 skeleton, D-052 accounting fixes (C1\u2013C5). Theorem\n      STATEMENTS survive (margins dwarf the gaps). Repair map opened:\n- [x] 4.5a D-056 (session 009): reference-point R-bound PROVED\n      (A = 10.5, B\u2080 = 48, honest C\u2080 incl. log log term \u2014 D-036 \u00a70\n      erratum) + digamma remainder |r| \u2264 1.2/|w|\u00b2 PROVED + I_I\n      housekeeping. E-028 ALL CHECKS PASS (26\u00d7 slack); N\u2080 = 80 000,\n      overlap 6.25\u00d7, margin(N\u2081) = 2.458e26. R-004 tag RESTORED.\n- [x] 4.5b D-057 (session 009): margin convexity PROVED (chain-rule\n      reduction \u03c6(T(n))\u2033 = \u03c8[\u03c6](T)/4n + 11-block table with elementary\n      sign arguments + I_I direct bound). E-029 ALL CHECKS PASS.\n- [x] 4.5c D-058 (session 009): valley lower bounds repaired \u2014\n      B1\u2032(i) isolated zeros clean rate PROVED; B1\u2032(ii) general via\n      node-killing projection (Gram constant + annulus count E(\u03b3,a));\n      B3\u2032 sinc\u00b2((z\u2212\u03b3)a) fix; m_\u03b3 fix (K \u2264 1/m_\u03b3); detector\n      restatement three-level (bare/pencil/carrier).\n- [x] 4.5d D-059 (session 009): bookkeeping write-ups \u2014 (1.12)\n      punctured-compact reading; R_\u03c4 := W/F \u2212 R\u2080 + distributional\n      representation; Lemma FD (form-domain identification, flat\n      bumps admissible); L1 write-up (PWS step named).\n- [x] 4.4 Numerical stress test vs known zero data.\n      \u2192 E-027 + D-055 (session 009, ALL CHECKS PASS): synthetic\n      off-line pair stress test of the T-3 detector \u2014 bare-form\n      negativity IMMEDIATE for any \u03b4 > 0 (no threshold; strict\n      Schwarz); tuned-carrier threshold \u03c0/(2a) EXACT (\u22640.9% at\n      a = 4, 8); T_a-pencil onset magnitude-limited (\u03b4 \u2248 0.11 at\n      a = 4, 0.038 at a = 8); negative directions localized at the\n      pair. D-050 erratum sharpened.\n\n### \u2b1c PHASE 5 \u2014 Verification & Write-up (Track D)\n- [~] 5.1 Lean 4 formalization of all new lemmas (build on zeta-23-lean).\n      \u2192 SKELETON STAGE COMPLETE (session 010, D-061): NguyenRH1 package\n      (research/lean/NguyenRH1/) \u2014 9 statements compile against\n      Mathlib + Zeta23 types. **TIER (i) COMPLETE (session 011)**:\n      chain_rule_sqrt_shift, sInfty_lower_bound, marginTilde_convex\n      PROVED (~1100 lines; full support library \u2014 see journal-011).\n      **TIER (ii) STEPS 1+2 COMPLETE (session 012, D-062)**:\n      lambda_pos_finite_height_verified PROVED modulo the single named\n      analytic hypothesis SfBoundProp + the declared computational\n      perimeter (assembly-first split per session-012-notes; FAlt\n      majorant swap; secant two-point base; base points discharged by\n      certified interval bounds in LiBasePoints.lean \u2014 margin\u0303(8\u00d710\u2074)\n      \u2265 8001 certified, margin\u0303(10\u2075) \u2265 85 501 certified).\n      **TIER ii\u2032 LAUNCHED (session 014, user directive \u2014 BEFORE\n      submission, option (a); design D-064)**: TWO DISCOVERIES \u2014\n      (1) liCoeff encoding defect (unordered tsum NOT Summable \u27f9 junk;\n      LiVerifiedUpTo/SfBoundProp FALSE as encoded; paired-form fix =\n      ii\u2032-1a); (2) crux identity Sf(n) = Res\u2081(n) EXACT (numerically\n      verified vs E-015/E-021) \u27f9 assembly TAIL-FREE. Routes R1\u2013R5;\n      sub-stage map ii\u2032-1a..7 (~9\u201316 sessions); perimeter unchanged\n      (Trudgian N(T)/S(T) declared, D-062 \u00a74). Freeze protocol: paper\n      files + existing proofs untouched until ii\u2032-7 (liCoeff fix\n      excepted). Remaining after ii\u2032: (iii) valley, (iv) Suzuki.\n- [~] 5.2 `#print axioms` audit \u2014 only propext, Classical.choice,\n        Quot.sound permitted.\n      \u2192 Inherited library VERIFIED LIVE (session 010, D-061 \u00a73): full\n      build (9010 jobs) + all comparator PrintAxioms scripts match\n      AUDIT.md verbatim. NguyenRH1: all proved declarations (tier (i),\n      session 011; tier (ii) steps 1+2 incl.\n      lambda_pos_finite_height_verified, session 012) show the 3\n      standard axioms ONLY; sorryAx remains only on the 5 skeleton\n      statements (1 Suzuki + 4 valley) by design. No new axioms\n      anywhere.\n- [x] 5.3 Full paper draft with proofs, numerics appendix, Lean appendix.\n      \u2192 COMPLETE (session 010): all stubs written (Introduction,\n      Background, Formal verification), abstract refreshed with tags,\n      references resolve, MiKTeX compile clean (12 pp).\n- [x] 5.4 Final honesty audit: every claim tagged and justified.\n      \u2192 COMPLETE (session 010, D-060): ~55 claims, 4 independent\n      audit instances; 0 unsupported; 10 draft corrections (critical:\n      (1.12)\u27fa split \u2014 converse is skeleton L3/L4); 7 archive errata\n      filed (D-036 sign, D-056 title, D-055/D-058 0.9% overclaim,\n      D-042/D-043 Z/6 supersession by D-045, R-004 post-repair).\n\n### \ud83d\udd36 PHASE 5B \u2014 TIER ii\u2032: close SfBoundProp in Lean (ACTIVE 2026-08-21 \u2014 user directive: BEFORE submission; design D-064; ~9\u201316 sessions)\nFREEZE PROTOCOL: paper files (paperA/paperB/draft/references.bib) and\nexisting Lean proofs are untouched until ii\u2032-7 \u2014 the ONLY exception is\nthe liCoeff correctness fix (ii\u2032-1a). Paper A stays submission-ready at\nevery sub-stage boundary (D-064 \u00a78). Perimeter (D-062 \u00a74 + the\nsession-035 additions, user-approved 2026-08-23): Platt\u2013Trudgian\nRHUpTo, LiVerifiedUpTo, Trudgian N(T)/S(T) [ZeroCountProp \u2014\nstrengthened to the mult-weighted form session 035, matching the\ndeclared source; PLUS ZeroCountProp2 (the two-unit specialization) and\nNoLowZeros (|\u03b3| \u2265 14, the Platt-class zero-location certificate),\nboth for 5f], M\u2080.\n- [x] ii\u2032-0 Design + capability inventory + identity chain.\n      \u2192 COMPLETE (session 014, D-064). TWO DISCOVERIES: (1) liCoeff\n      encoding defect \u2014 unordered tsum NOT Summable \u27f9 junk 0;\n      LiVerifiedUpTo/SfBoundProp FALSE as encoded (theorems vacuous);\n      paired-form fix designed. (2) Crux identity Sf(n) = Res\u2081(n)\n      EXACT (Lagarias (4.10) summed binomially; verified numerically:\n      j=0 exact 15 digits, \u03bb\u2082 matches E-015 certified value, residue\n      theorem sides = \u03bb_n(T)+triv+Res\u2081 to 2e-21) \u27f9 assembly TAIL-FREE:\n      |Sf| \u2264 |\u03bb_n(T)| + |sides| + |triv| = B(n). All 8 planned Zeta23\n      dependencies axiom-checked live (3 standard axioms only).\n- [x] ii\u2032-1a liCoeff pairing fix + summability (D-064 \u00a71).\n      \u2192 COMPLETE (session 015). liSummand = \u00bd\u00b7mult\u00b7(f \u03c1 + f \u03c1\u0304)\n      (manifestly real, liSummand_eq) replaces the junk tsum;\n      `liSummable` PROVED (re_li_summand_le |Re f(\u03c1)| \u2264 2n\u00b2/\u2016\u03c1\u2016\u00b2 tail\n      + normSq_gammaOf_le_mul_norm_sq (9/4) + liSummand_norm_le\n      (9/2)n\u00b2\u00b7mult/(1+\u2016\u03b3\u2016\u00b2) + Zeta23 zero_sum_inv_sq comparison +\n      finite ball via IsCompact.inter_riemannZetaZeros_finite).\n      Full rebuild GREEN (8741 jobs, zero downstream changes); axiom\n      audit: 3 standard axioms only on all new + main declarations.\n      LiVerifiedUpTo/SfBoundProp now TRUE statements (defect repaired).\n- [x] ii\u2032-1b R1 residue machinery: general finite-order residue\n      (MeromorphicNF), rectangle residue theorem extension beyond\n      HasSimplePolesOn, w=1 residue by Leibniz ((w\u22121)^{n+1}J =\n      [w\u207f\u2212(w\u22121)\u207f]h(w), h = (w\u22121)(\u2212\u03b6\u2032/\u03b6)), zero residues via vendored\n      logDerivResidue.\n      \u2192 COMPLETE (sessions 016\u2013017): LiResidue.lean (zetaA/hLi\n      analytic at 1; lcoeff; A_iter; **ResW1_eq_sum** \u2014 the w=1 residue\n      = \u03a3_j C(n,j)\u00b7lcoeff(j\u22121) by iteratedDeriv_mul) + LiPrincipal.lean\n      (rectInt_deriv_eq_zero per-side FTC; **rectInt'_ppart** \u2014 principal\n      part integrates to ResW1 n on any rectangle with 1 interior) +\n      LiSides.lean (session 017: **rectInt'_Jlag** \u2014 RectangleIntegral'\n      (Jlag n) z w = ResW1 n + \u03a3_{\u03c1\u2208Sz} (zeroMult \u03c1)\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) on\n      rectangles with 1 interior, \u03b6 \u2260 0 on border; removable singularity\n      at 1 via Ffun\u2212TaylP order \u2265 n+1; logDeriv NF residues at zeros,\n      multiple zeros OK; vendored residueTheorem_finset; full build\n      GREEN 8745 jobs \u2014 root now imports all three files; 19 new decls,\n      3 standard axioms only). NOTE: zeroMult(\u22122) = 1 (trivial-zero\n      simplicity) deferred \u2014 zeroMult stays symbolic in the sum; the\n      Sz = {nontrivial} \u222a {\u22122} split is ii\u2032-4 territory.\n- [x] ii\u2032-2 R2(i)/(ii) elementary swaps: \u03bb_n = \u03a3_j(\u22121)^{j+1}C(n,j)\u03c3_j\n      (binomial + paired swap); S_\u221e = \u03a3_j C(n,j)\u03c4_{j\u22121} (odd-m tsum \u2194\n      binomial form, D-037 \u00a73 swap).\n      \u2192 COMPLETE (session 018): LiSwaps.lean \u2014 **liCoeff_eq_sum_sigma**\n      (paired power sums \u03c3_j := sigmaP; per-slice summability cloned\n      from the ii\u2032-1a skeleton: j=1 via Re(1/\u03c1) = Re(\u03c1)/|\u03c1|\u00b2 exactness,\n      j\u22652 by |\u03c1|^{\u2212j} \u2264 |\u03c1|^{\u22122}, radius-2 finite ball; swap via\n      Summable.tsum_finsetSum + CommRing-polymorphic one_sub_one_sub_pow)\n      + **sInfty_eq_sum** (SInfty n = \u03a3_{j=1}^n (\u22121)^jC(n,j)\u00b7lagariasA j,\n      n \u2265 1; lagariasA encoded 1 + odd\u22653 tsum; oddSlice_summable by\n      p-series domination; \u03a3_{j=2}^n(\u22121)^jC(n,j) = n\u22121). Full build\n      GREEN (8746 jobs); 12 new decls, 3 standard axioms only.\n- [~] ii\u2032-3 R2(iii) Lagarias (4.10): \u03c4_j = c_j + (\u22121)\u02b2\u03c3_{j+1} \u2212 (\u22121)\u02b2\n      \u2014 LONG POLE. Sanity gate: j=0 is \u03a31/\u03c1 = 1 + \u03b3/2 \u2212 \u00bdlog 4\u03c0.\n      \u2192 DESIGN COMPLETE (session 019, D-066): route **\u03b24** ADOPTED\n      (contour moments + coefficient split) \u2014 \u03b21 (Hadamard) ruled out\n      (Mathlib has no Weierstrass product/order theory;\n      extract_zeros_poles is finite-only), \u03b22 (EF reuse) ruled out\n      (moments not entire \u2014 outside the EF test class). Factorization:\n      (4.10-a) \u27fa (M) moments \u03c3_k = \u2212g^{(k\u22121)}(0)/(k\u22121)! [contour] +\n      (A) \u03c4_j = (\u22121)^{j+1}a_{j+1} [digamma] + (B) \u03b6-piece [done];\n      R-bound SHARED with ii\u2032-5 \u27f9 resequenced pipeline:\n      ii\u2032-3a (A+B) \u2192 ii\u2032-4 \u2192 ii\u2032-5 \u2192 ii\u2032-3b (moments) \u2192 ii\u2032-3c\n      (assembly \u2192 crux). Piece (B) PROVED (session 019,\n      LiZetaCoeff.lean: iteratedDeriv_hLiExt \u2014 Taylor coefficients of\n      1/s + \u03b6\u2032/\u03b6(1+s) at 0 are \u2212j!\u00b7lcoeff j; 6 decls axiom-clean;\n      build 8747 jobs green). Piece (A) next: \u03c4\u2080 via Mathlib\n      digamma_one_half; j \u2265 1 via digamma series from logGammaSeq.\n      **ii\u2032-3a COMPLETE (session 020)**: piece (A) PROVED \u2014\n      LiArchimedean.lean + LiDigamma.lean (~1200 lines): the capstone\n      `iteratedDeriv_logDeriv_Gamma\u211d` \u2014 the archimedean Taylor\n      coefficients of logDeriv Gamma\u211d(1+s) at 0 are\n      (\u22121)^{j+1}\u00b7j!\u00b7lagariasA(j+1) for ALL j \u2265 0. Via: the Gamma\u211d\n      logDeriv split + \u03c4\u2080 (Mathlib digamma_one_half) + the digamma\n      partial-fraction series BUILT FROM SCRATCH (logGammaSeq \u2192 real\n      identity by deriv-limit interchange \u2192 complex series by\n      Weierstrass + identity principle \u2192 polygamma values at 1/2 by\n      iteratedDerivWithin_tsum \u2192 odd-m reindexing \u2192 2^{j+1} scaling).\n      Build GREEN (8749 jobs); 18 key decls audited: 3 standard axioms.\n- [x] ii\u2032-4 L3 zero-avoiding T (pigeonhole on perimeter C\u2080/FAlt) +\n      L1 kernel bounds (|k_n| \u2264 2, e\u2074+1, e^{\u221an/2}+1; trivial residue).\n      \u2192 COMPLETE (session 021, LiContour.lean, ~400 lines): L3\n      `exists_zero_avoiding_T` \u2014 clearance 1/(3\u00b7C0hat(a+1)) in any unit\n      window [a, a+1], a \u2265 2, from the perimeter `ZeroCountProp`\n      (Trudgian N(T)/S(T) in \u0108\u2080 form) via the midpoint pigeonhole\n      `exists_avoiding_midpoint` (k+1 midpoints, injective-badness);\n      finiteness via Zeta23 zerosIn_finite. L1: `kFun_norm_le_two`\n      (re s \u2264 1/2), `kFun_shift_norm_le_exp_four_add_one` (horizontals,\n      re s \u2264 3, n \u2264 im\u00b2), `kFun_shift_norm_le_exp_sqrt_half_add_one`\n      (right vertical, 2\u221an \u2264 re s), `kFun_neg_two` + norm \u2264 1.\n      PLUS the deferred trivial-zero simplicity `zeroMult_neg_two`\n      (zeroMult(\u22122) = 1): local factorization \u03b6 = (s+2)\u00b7\u039b/Hfun with\n      Hfun = 4\u03c0^{\u2212s/2}\u0393(s/2+2)/s analytic, Hfun(\u22122) = \u22122\u03c0 \u2260 0,\n      \u039b(\u22122) = \u039b(3) = \u0393R(3)\u03b6(3) \u2260 0. Build GREEN (8751 jobs); 17 decls\n      audited: 3 standard axioms only.\n- [~] ii\u2032-5 R3 R-bound (D-056, A = 10.5, B\u2080 = 48) via LOCAL route:\n      Borel\u2013Carath\u00e9odory (Mathlib) + Jensen (Mathlib) + Blaschke\n      (StrongPNTPrefix); FE polynomial strip bound via\n      riemannZeta_one_sub + Stirling; digamma Lemma D.\n      \u2192 DESIGN COMPLETE (session 022, D-067): route b\u2033 \u2014 Davenport disc\n      at 2+it (R = 5/2) + FE-reflection with EXACT zero-sum\n      cancellation; Stirling-free (Zeta23 digamma_stirling subsumes\n      Lemma D), Hadamard-free; geometry obstruction (every covering\n      disc dips left of \u03c3 = 0) resolved via one extra EM level.\n      **ii\u2032-5b COMPLETE (session 022)**: LiRBound.lean \u2014 the level-2\n      Euler\u2013Maclaurin representation \u03b6(s) = 1/2 + 1/(s\u22121) \u2212\n      s(s+1)\u222b\u2081^\u221e B\u0303\u2082(x)x^{\u2212s\u22122}dx (re s > \u22121; b2Fun machinery, IBP\n      identity, parameter-integral analyticity, W\u00b1 convex-region\n      identity principle) + `norm_riemannZeta_le_disc`: \u2016\u03b6\u2016 \u2264 (3/4)|t|\u00b2\n      on B(2+it, 5/2), |t| \u2265 10. Build GREEN (8752 jobs); 27 decls\n      audited clean. **ROUTE REVISION (session 023, D-067 \u00a76)**: the\n      disc-only constants provably CANNOT reach the baked 10.5/48 (BC\n      derivative factor \u2265 16\u00d7 the M-coefficient; honest assembly ~270)\n      \u27f9 two-stage plan: loose disc bound as the GROWTH INPUT for the\n      partial-fraction identity (5e), tight constants from D-056's\n      analysis of the identity (5f). **ii\u2032-5c COMPLETE (sessions\n      023\u2013024)**: LiDisc.lean \u2014 zeroDiscFinset + zeroDisc_isNontrivial;\n      scaledZeta (unit-disc scaling) + F(0) = 1 via Zeta23\n      zeta_lower_bound_two (\u2016\u03b6(2+it)\u2016 \u2265 1/3, no \u03bc-series build); the\n      multiplicity-invariance chain (analyticOrderNatAt_riemannZeta_\n      affine/const_mul/scaledZeta); scaledZeta_jensen_count (ZerosBound,\n      \u2264 log((9/4)|t|\u00b2)/log(33/32)); **session 024 back half**: R-gap via\n      the \u00d710-rescaled midpoint pigeonhole (R_c \u2208 [2.3, 2.4], clearance\n      gapD = 1/(50(k+1))); g = Cf r_c F analytic + nonvanishing on\n      closedBall(0, r_c) (Zeta23 Cf/ZeroFactorization); |g| \u2264\n      (9/4)|t|\u00b2\u00b7gapD^{\u2212M_c} on the ball (max-modulus over the zero-free\n      sphere); LogOfAnalyticFunction + BorelCaratheodoryDeriv (450\u00b7M\n      factor); logDeriv chain + affine push-forward + near/extras split.\n      **Capstone: logDeriv_riemannZeta_sub_nearZeros_le** \u2014 the LOOSE\n      R-bound \u2016\u03b6\u2032/\u03b6(s) \u2212 \u03a3_{|\u03b3\u2212t|<1} m/(s\u2212\u03c1)\u2016 \u2264 100000\u00b7(log|t|)\u00b2 on\n      \u03c3 \u2208 [1/2, 7/2], |t| \u2265 10, \u03b6 s \u2260 0 (no perimeter hypothesis \u2014\n      Jensen count input). Build GREEN (8753 jobs, LiDisc now root-\n      imported); 32 new decls audited: 3 standard axioms only.\n      **ii\u2032-5d COMPLETE (session 025)**: LiReflect.lean (~640 lines, 26\n      decls audited clean) \u2014 `logDeriv_zeta_fe` (pointwise logDeriv FE:\n      logDeriv \u03b6 s = \u2212logDeriv \u03b6(1\u2212s) \u2212 [logDeriv \u0393R s +\n      logDeriv \u0393R(1\u2212s)]); `sum_nearZeros_neg_reflect` (the EXACT\n      zero-sum cancellation under \u03c1 \u21a6 1\u2212\u03c1: nearZeros(\u2212t) = image,\n      zeroMult invariant via analyticOrderAt_zeta_one_sub);\n      `logDeriv_Gamma\u211d_shift` (the +4 \u0393R shift putting both digamma\n      arguments in re > 0) + digamma_stirling \u27f9 \u0393R-bracket \u2264\n      4(log|t|)\u00b2; capstone\n      **logDeriv_riemannZeta_sub_nearZeros_le_left** \u2264 200000\u00b7(log|t|)\u00b2\n      on \u03c3 \u2208 [\u22125/2, 1/2], |t| \u2265 10; PLUS the 5e input\n      **norm_digamma_sub_log_le_of_two_le_abs_im** (\u2016\u03c8(w) \u2212 log w\u2016 \u2264 3\n      for 2 \u2264 |im w|, uniform in the shift chain: digamma_add_natCast\n      + first-order EM + arctan-FTC). Build GREEN (8761 jobs, LiReflect\n      root-imported). DEFERRED to session 026 first item:\n      zeroMult(\u22122n) = 1 for ALL n (5e's entirety at trivial zeros).\n- [x] ii\u2032-5e R3 partial-fraction identity (D-068 design; two-stage\n      plan's second stage). **COMPLETE session 034 \u2014 capstone\n      `partialFraction_identity` PROVED (perimeter ZeroCountProp only).**\n      \u2192 DESIGN COMPLETE (session 026, D-068) with TWO CORRECTIONS to\n      D-067 \u00a76: (C1) the circle series bound is O((log R)\u00b3) via the\n      RADIAL split (\u03b3-gap only in the critical annulus [R\u00b12]; the\n      naive split gives O(R log R) \u2014 fatal, recorded with fix); (C2)\n      the near-axis left-plane digamma bound is a separate build.\n      **5e-0 COMPLETE (session 026)**: LiTrivialZeros.lean \u2014\n      `gamma_mul_prod` (product-form \u0393 recurrence) + the `HfunT n`\n      cofactor + **zeroMult_neg_two_mul**: zeroMult(\u22122n) = 1 for ALL\n      n \u2265 1 (8 decls audited clean; build 8762 jobs, root-imported).\n      **5e-i COMPLETE (session 027)**: LiGapCircles.lean \u2014\n      `exists_gapCircle_radius` (R \u2208 [4k+5/2, 4k+3], dist(R/2,\u2124) \u2265 1/4,\n      ordinate clearance 1/(16\u00b7C0hat(4k+9/2)); \u00d72-rescaled pigeonhole).\n      **5e-ii COMPLETE (session 027)**: LiDigammaLeft.lean \u2014\n      `norm_digamma_le_of_two_le_re` (B: \u2016\u03c8\u2016 \u2264 20 log(2+\u2016w\u2016), re \u2265 2),\n      `digamma_recip_sum_le` (C: \u03a3\u2016(w+j)\u207b\u00b9\u2016 \u2264 2/c+2+2 log m),\n      `norm_digamma_le_of_dist_nat` (A: near-axis bound, re \u2264 2),\n      `logDeriv_Gamma\u211d_eq` (G: the general identity for im \u2260 0);\n      15 decls audited clean; build 8764 jobs.\n      **5e-iii COMPLETE (session 028)**: LiSeries.lean \u2014 the zero-side\n      partial-fraction series `seriesFun s := \u2211' \u03c1, mult\u00b7(1/(s\u2212\u03c1)+1/\u03c1)`:\n      `seriesSummable` (unconditional, the ii\u2032-1a D-trick with the\n      (17/12)\u2016\u03c1\u2016\u00b2 comparison), `seriesFun_analyticOnNhd` off the\n      nontrivial zeros (three-case avoiding balls + the Weierstrass\n      M-test pattern), `nontrivialZero_isolated` (min-distance),\n      `seriesFunSub_analyticAt` + `seriesFun_sub_polar_analyticAt`\n      (series \u2212 mult/(s\u2212\u03c1\u2080) analytic AT \u03c1\u2080 \u2014 the 5e-iv residue\n      cancellation input); 22 decls audited clean; build 8765 jobs.\n      **5e-iv COMPLETE (session 029)**: LiFEntire.lean \u2014 F ENTIRE via\n      the punctured-limit extension `Gentire s := limUnder (\ud835\udcdd[\u2260] s)\n      Fexpr` (no removable-singularity theorem in Mathlib; junk values\n      at the excluded points sidestepped by limUnder uniqueness):\n      principal-part-split witnesses at nontrivial zeros (NF +\n      seriesFun_sub_polar_analyticAt), at 1 (logDeriv zetaA), at 0 and\n      \u22122n (the digamma-series splits: digammaSeriesPart on ball(0,1/2),\n      digammaSeriesPartSub on ball(\u2212n,1/2), both M-test); supporting\n      `zeta_zero_classification` (zeros = nontrivial \u222a {0} \u222a {\u22122n}) +\n      `analyticAt_digamma` (off {0}\u222a\u2212\u2115). Capstone\n      `gentire_analyticAt_and_eq`: (\u2200 s, AnalyticAt \u2102 Gentire s) \u2227\n      (\u2200 s good, Gentire s = Fexpr s); 30 decls audited clean; build\n      8766 jobs. **5e-v-b + 5e-v-c COMPLETE (sessions 030\u2013033)**:\n      LiCircleBound.lean (~3928 lines) \u2014 count bridges (A0count from\n      Zeta23's RvM local count, mult-weighted, all t, unconditional),\n      the Dirichlet bound \u2016\u03b6\u2032/\u03b6\u2016 \u2264 dirichletC2 (re \u2265 2),\n      tsum_split_finset, lowZeroConst, the far-tail bound\n      zero_tail_inv_sq_le (\u03a3_{|\u03b3|>X} m/(1+\u03b3\u00b2) \u2264 16\u00b7A\u2080\u00b7log X/X,\n      X \u2265 200 \u2014 the dyadic fiber machine + ENNReal.tsum_fiberwise),\n      **the series circle bound seriesFun_norm_le_gapCircle**\n      (\u2016seriesFun s\u2016 \u2264 2\u00b7lowZeroConst + 2900\u00b7A\u2080\u00b7\u0108\u2080(4k+9/2)\u00b7(log R)\u00b2\n      on the \u03b3-gap circle, k \u2265 4000), and **the Fexpr circle bound\n      Fexpr_circle_le** (\u2016Fexpr s\u2016 \u2264 2\u00b7lowZeroConst + dirichletC2 +\n      400000\u00b7A\u2080\u00b7\u0108\u2080(R+2)\u00b7(log R)\u00b2): three-region logDeriv assembly\n      (Dirichlet / 5c+5d capstones + the near sum via gapCircle_sep /\n      FE + \u0393R bracket), digamma_circle_le (uniform \u03c8 bound, left\n      near-axis via the \u2124-clearance), and\n      **logDeriv_Gamma\u211d_eq_of_not_neg_nat** (the (G) formula at any\n      non-pole point incl. s = \u2212R \u2014 direct logDeriv_mul, no\n      continuity). **5e-v-d COMPLETE (session 034) \u2014 ii\u2032-5e DONE**:\n      LiSqueeze.lean (~330 lines, 5 decls audited clean; LiCircleBound\n      + LiSqueeze root-imported; full build GREEN) \u2014 the Schwarz\n      squeeze (`gentire_const`: max-modulus + ball-form Schwarz on the\n      \u03b3-gap circles, growth (log R)\u00b3/R \u2192 0 via Q := R^{1/4} \u27f9\n      Gentire \u2261 Gentire 0 =: B) and **THE CAPSTONE\n      `partialFraction_identity` (hZC : ZeroCountProp)**: \u2203 B : \u2102,\n      \u03b6\u2032/\u03b6(s) = B + seriesFun s \u2212 1/s \u2212 1/(s\u22121) + \u00bdlog \u03c0 \u2212 \u00bd\u03c8(s/2)\n      off the excluded set \u2014 the partial-fraction identity Lean-proved\n      modulo ONLY the declared perimeter. Remaining: 5f (tight\n      constants 10.5/48 from D-056's two-point analysis).\n- [~] ii\u2032-5f R3 tight constants (D-056's Theorem R: |R(s)| \u2264 10.5\u00b7log\n      (|t|+2) + 48). \u2192 IN PROGRESS (session 035, LiTightR.lean ~800\n      lines). **Perimeter repair** (user-approved): ZeroCountProp\n      strengthened to the mult-weighted form (the second ii\u2032-1a-class\n      encoding defect \u2014 the unweighted set-card under-captured the\n      declared Trudgian N(T) source; `one_le_zeroMult` bridge;\n      consumers adapted; full build green, audit clean). **P1/P2\n      perimeter additions** (user-approved, D-069): ZeroCountProp2\n      (two-unit count 0.6\u00b7L + 0.886\u00b7LL + 2.7) + NoLowZeros (|\u03b3| \u2265 14).\n      **D-069 Finding 1**: D-056's piece 2 charges the near sum one\n      C\u2080(t) for a TWO-unit window \u2014 the honest two-unit Trudgian form\n      makes the assembly fit 10.5/48 (pinch margin \u2248 1.9). **Finding\n      2** (ii\u2032-6 repair map): H(T)'s near sum has a clearance-coverage\n      gap (honest \u2248 7\u00b7\u0108\u2080\u00b2 vs baked 3\u00b7\u0108\u2080\u00b2; margin survives, crossover\n      moves). 5f-i COMPLETE (Rexpr_decomp + pieces 1 dirichletC2_le_one,\n      2 near_sum_refPoint_le, 4/5 one_div_diff_le); 5f-ii piece 6\n      COMPLETE (digamma_diff_le \u2264 6/t via the +2 shift +\n      digamma_stirling + segment-FTC log bound). Remaining: piece 3\n      (the far-sum interval machine) + 5f-iii (assembly + pinch +\n      capstone logDeriv_riemannZeta_sub_nearZeros_le_tight).\n- [ ] ii\u2032-6 L0 assembly: sides identity + bridge |\u03bb_n(T)| \u2264 2\u00b7FAlt(T)\n      (hRH) + |Sf n| \u2264 Bn FAlt n on [10\u2075, N\u2081].\n- [ ] ii\u2032-7 Closure: theorem sfBoundProp : SfBoundProp; final\n      lambda_pos_finite_height_closed (3 perimeter hypotheses only);\n      full axiom audit; paper Appendix B + tag upgrade (D-062 \u00a74\n      endpoint); archive closure + D-037 line-63 erratum pointer.\n\n## 6. GRAVEYARD (documented dead ends \u2014 REQUIRED logging)\n| # | Attempt | Track | Obstruction found | Date |\n|---|---------|-------|-------------------|------|\n| G-001 | Multiple-zero bounds as chain constraint (Idea C) | A | s\u2082/p substitution symmetry (depth\u21920 pairs = doubles in all 2-moment data) | 2026-08-17 |\n| (A) | Zero-density input into chain (D-009 Idea A) | A | depth\u21920 off-line pairs invisible to N(\u03c3,T) bounds | 2026-08-17 |\n| G-002 | Moment-ladder certificates (tr G\u0303\u1d4f, k\u22653; oversampled grids) | A | RS availability \u03bb\u22642/k bites before usefulness; caps 0.607N (k=3, \u03bb=2/3) and 0.502N (k=4, \u03bb=1/2) both < 2/3; n\u208a q-invariant (E-005) | 2026-08-17 |\n| G-003 | Density certificates \u2192 de Bruijn\u2013Newman \u039b (task 3.3) | C | one-sided information: density theorems lower-bound the on-line fraction, \u039b needs an upper bound on the complex fraction; extremal vs averaged (E-012); asymptotic vs explicit | 2026-08-17 |\n| G-004 | \u03bb \u2192 \u03bb_a\u207b ground-state channel (task 2.13 follow-up) | B | disjoint feasibility windows: ground-state resolution needs a \u2272 1.3 (\u03bb_a superexponential), zero resolution needs a \u2273 4\u20136; discretization floor out-ranks \u03bb_a; D-046 sizing | 2026-08-19 |\n\n## 7. RESULT LEDGER\n| # | Claim | Status tag | Location |\n|---|-------|-----------|----------|\n| 0 | \u22652/3 simple on-line (inherited) | [PROVED] (R2) | Paper Thm A |\n| 1 | Galerkin realization of Suzuki's Weil-form operator A_a validated to 4.5e-6 against the zero-side explicit formula; Weil formula conventions machine-verified (Gaussian test, 9e-16) | [NUMERICAL-VALIDATED] | E-009a/b, D-019 \u00a71 |\n| 2 | \u03bb_a (bottom of Weil-form spectrum) positive at a = 0.25..5 with steep cliff (0.414 \u2192 \u22641.7e-12), consistent with Yoshida \u03bb_a>0 \u2200a \u27fa RH; independently matches Kim et al. superexponential decay report | [NUMERICAL] (upper bounds; conforming Galerkin) | E-009b, D-019 F1 |\n| 3 | Li coefficients \u03bb_n > 0 for all n \u2264 3000 computed from the arithmetic side (BL Thm 2, zero-free; flint Stieltjes + Arb \u03b6, dps 1000\u20131450), cross-validated vs E-008 zero side; \u03bb_1 to 102 digits; refined asymptotic ratio 1.00216 at n=2000, 0.999845 at n=3000 | [NUMERICAL-VALIDATED] | E-011, E-015, R-001 |\n| 4 | \u03be\u2032-certificate strength mechanism: perfect-square node in the diagonal law D\u2081 \u2248 s(1\u22122s)\u00b2 (prime-scale cancellation p ~ \u221a(T/2\u03c0)); Remark 7.1 constants reproduced to 5e-6; s\u2082/p symmetry does NOT break; gain not portable to \u03be | [NUMERICAL-VALIDATED] | E-013, R-002, D-022 |\n| 5 | Exact factorization W(a,\u03b8;z) = F\u00b7(R\u2080+R_\u03c4), F = z\u00b2\u03be/\u03be\u2032, with R\u2080 = 2e^{a+i\u03b8/2}sin(az\u2212\u03b8/2)+o(e\u1d43) closed form; Suzuki Cor 1.6 \u27fa (\u2605) tail-cancellation (Wiener\u2013Hopf remainder, RH-gated); W(a,\u03b8;0) = 0 double \u2200a,\u03b8; explains full E-010\u2013E-016 phenomenology | [PROVED (modulo std tempered-FT bookkeeping)] + [NUMERICAL-VALIDATED] (E-017: skeleton 3.7%\u21920.009%, off-axis cancellation 99.8%, \u03b8=\u03c0 preferred) | R-003, D-026, D-027, E-017 |\n| 6 | Explicit finite-height Li theorem: \u03bb_n > 0 for all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074 (T\u2080 = 3\u00d710\u00b9\u00b2 Platt\u2013Trudgian); conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9; first assembled explicit chain (S_\u221e elementary lower bound + traced contour constants + margin convexity + finite verification) | [PROVED-CONDITIONAL(computational RH-to-T\u2080; finite verification)] \u2014 R-bound fully traced D-056 (A = 10.5, B\u2080 = 48, honest C\u2080; E-028 verified, 26\u00d7 slack); N\u2080 = 80 000; margin convexity PROVED D-057 (E-029) | R-004, D-037, D-056, D-057, E-023, E-028 |\n\n## 8. SESSION PROTOCOL & RESEARCH ARCHIVE (MANDATORY)\n\nMulti-stage project: computer is shut down between stages. NOTHING may live\nonly in conversation. The archive below is the single source of truth.\n\n### 8.1 Archive map\n```\nSTATE.md                    \u2b50 resume point \u2014 READ FIRST every session\nresearch/\n\u251c\u2500\u2500 journal/session-NNN.md  per-session narrative log\n\u251c\u2500\u2500 results/R-NNN-*.md      one file per result (+ index.md ledger)\n\u251c\u2500\u2500 graveyard/G-NNN-*.md    one file per dead end (+ index.md)\n\u251c\u2500\u2500 derivations/D-NNN-*.md  worked derivations (+ index.md)\n\u251c\u2500\u2500 numerics/scripts/       deterministic experiment scripts\n\u251c\u2500\u2500 numerics/data/          E-NNN-*.csv + E-NNN-*.json metadata sidecars\n\u251c\u2500\u2500 research.db             SQLite catalog (sessions, results, graveyard,\n\u2502                           derivations, experiments) \u2014 schema in\n\u2502                           numerics/scripts/schema.sql, CLI: db.py\n\u2514\u2500\u2500 paper/                  paperA.tex (Paper A, split 2026-08-20),\n                            paperB.tex (research-note skeleton),\n                            draft.tex (FROZEN pre-split combined copy),\n                            references.bib\n```\n\n### 8.2 Storage conventions\n- Results/derivations/graveyard: plain Markdown, honesty tag on every claim.\n- Numerics: DUAL storage \u2014 CSV+JSON sidecar (human/paper-readable) AND\n  SQLite registration (queryable), written together via db.py.\n- Data is cached; scripts never recompute unless --force.\n- Paper assembled only from tagged files in results/.\n\n### 8.3 Session START protocol\n1. Read STATE.md \u2192 resume point, next action, open threads, blockers.\n2. Skim latest journal entry + results/index.md.\n\n### 8.4 Session END protocol (before any shutdown \u2014 no exceptions)\n1. Write journal/session-NNN.md (work, decisions, outcomes).\n2. File every result/dead end/derivation in its own file; update index.md\n   files; register in research.db.\n3. Update NGUYEN.md checklist (\u00a75), Graveyard (\u00a76), Result Ledger (\u00a77).\n4. Update STATE.md LAST with an explicit \"NEXT ACTION:\" line.\n5. git add + commit with session number in the message.\nNOTE: save artifacts IMMEDIATELY when produced (crash-safe), not batched.\n\n### 8.4a FORK RULE (user directive, 2026-08-17)\nWhen the path FORKS (multiple candidate directions), do ALL of them \u2014\none by one \u2014 then pause to gather thoughts and evaluate the next step\ntogether. No path is dropped at a fork by choice alone; paths are only\nclosed by documented obstruction (Graveyard) or deprioritized by\nevidence after all forks are explored.\n\n### 8.5 PACING & SUB-STAGES (user directive, 2026-08-17)\n- NO RUSH. This is long-term research; correctness and rigor outrank speed.\n  Take whatever time a stage needs to be done right.\n- SUB-STAGE RULE: if a stage will take a few hours, break it into smaller\n  sub-stages, each ending in a clean, committed, resumable state (per \u00a78.4).\n  Record sub-stage breakdowns in STATE.md.\n- BREAK PROMPT: if work is running long \u2014 ESPECIALLY approaching 5:00 PM\n  local time \u2014 pause and ASK the user whether to continue, take a break,\n  or log off (run \u00a78.4 end protocol before stopping).\n\n### 8.6 SESSION LOG (summary; details in research/journal/)\n- Session 001 (2026-08-17): Blueprint + mission prompt ingested; research\n  archive installed (git + SQLite + LaTeX skeleton). \u2192 Begin Phase 0.\n- Session 002 (2026-08-17): Phase 0 + Phase 1 complete (Track A \u2192\n  monitoring mode, D-013); Track C begun (3.1 D-014, E-006\u2013E-008, 3.4a/b,\n  D-018 Suzuki scoping).\n- Session 003 (2026-08-17): Q-3.4c complete \u2014 E-009a (Suzuki g validated),\n  E-009b (Galerkin A_a, validated vs zero side 4.5e-6; \u03bb_a cliff),\n  D-019 (analysis; Q-S1 verdict; E-010 proposed). Weil explicit-formula\n  conventions machine-verified (D-001 NT-1).\n- Session 004 (2026-08-17): recovered killed session (E-011 orphaned\n  mid-edit); paper archive reorg; E-010 extended (a\u22648, \u03bb=\u22121); ALL 4 FORKS\n  COMPLETE \u2014 E-010 (fork 1, session 003); E-011/R-001 (fork 2: Li \u03bb_n > 0,\n  n \u2264 2000, arithmetic side); 3.3 answered NO (fork 3: D-021 \u2192 G-003,\n  E-012); T4 CLOSED (fork 4: D-022/R-002 \u2014 \u03be\u2032 strength = perfect-square\n  node in D\u2081, not portable to \u03be; T4b opened). Q-S3 attacked (D-023,\n  E-014): Cor 1.6 density wall mapped to a=10 (maximal lattice,\n  interlacing exact, no thinning \u2014 scale limitation, not a wall);\n  \u03b8=\u03c0 candidate found; Q-S3a/b/c queued. Detached-run machinery\n  established.\n- Session 005 (2026-08-18): user approved do-all-one-by-one plan\n  (A3\u2192A1\u2192A2\u2192C\u2192B, D in background). D launched: E-015 Li n\u22643000\n  detached (in progress at stop; sandbox blocks multiprocessing spawn \u2014\n  detached launches need sandbox disabled). A3 done: E-016 + D-024 \u2014\n  Herglotz \u03c1_W at \u03b8=\u03c0 vs \u03c1_F; V1/V2/V4 pass, V3 (zero-Poisson\n  reconstruction) fails rel ~0.3, root cause open; findings: \u03b8=\u03c0 zeros\n  real, z\u2081(\u03c0)\u00b7a\u22484.5 stiff law, no \u03b8=\u03c0 zero in (0,\u03c0/a), raw-L2 \u03b8=\u03c0\u2248\u03b8=0\n  (plateau-dominated metric). Stopped mid-V3-root-cause (user break;\n  3 network dropouts, no state loss).\n- Session 006 (2026-08-18): REGROUP (user-requested). Full archive audit:\n  all 16 experiments have CSV+JSON sidecars and db registrations; fixed\n  db hygiene (sessions 3\u20135 registered; row_counts corrected for E-010\u2013\n  E-016). Checklist revised: Phase 2 restructured \u2014 Suzuki/Cor 1.6 line\n  recognized as the live spectral program (2.1 partial, 2.4 active; new\n  tasks 2.6 V3-root-cause, 2.7 Q-S3a analytic, 2.8 Q-S3b backend);\n  3.4 checked off (answered YES); NEW tasks 3.5 (Li asymptotic attack \u2014\n  most direct criterion-#1 path), 1.6 (\u03be\u2032-world ceiling), 1.7 (T4b\n  scoping). Active order confirmed: 2.6 \u2192 2.7 \u2192 2.8 \u2192 1.6 \u2192 1.7, with\n  3.5 as standing high-value background thread.\n- Session 006 cont. (2026-08-18): task 2.6 COMPLETE \u2014 E-016 V3\n  root-caused (E-016b: winding-excess diagnostic finds double zero at\n  origin, \u00b1i\u03b5 pair; EM-tail factor-y bug found + confirmed quantitatively)\n  and REPAIRED (E-016c: V5 1.75e-16, V6 \u22644.4e-15, V3R 1.5\u20132.0e-5, ALL\n  CHECKS PASS); D-025 filed; E-016 F1\u2013F4 stand.\n- Session 006 cont.2 (2026-08-18): task 2.7 COMPLETE \u2014 **breakthrough\n  reduction**: W(a,\u03b8;z) = F\u00b7(R\u2080+R_\u03c4) EXACT (F = z\u00b2\u03be/\u03be\u2032, R\u2080 closed-form\n  sine skeleton); Cor 1.6 \u27fa (\u2605) tail-cancellation (Wiener\u2013Hopf remainder,\n  RH-gated). R-003 promoted to ledger (#5). E-017: off-axis cancellation\n  already 99.8% at a=4; \u03b8=\u03c0 preferred; open content isolated to \u211d.\n- Session 006 cont.3 (2026-08-18): task 2.8(i) complete \u2014 E-018 descent\n  profile: (\u2605) cancellation strip-uniform (median |M|/|R\u2080| ~5\u20137e-3,\n  y\u2080\u2208[0.1,1]); open content = zero set of M only; \u03b8-preference found\n  metric-dependent. D-028.\n- Session 006 cont.4 (2026-08-18): task 2.8(ii) complete \u2014 backend v2\n  (blockwise \u039b to e\u00b2\u2074, validated 2.2e-7/4.4e-8) + E-019 at a=12: NO\n  transition (maximal lattice, z\u2081\u00b7a=4.495, gap CV \u2193, origin pair +2.0000\n  winding excess, \u03b3-proximity chance-level, envelope stationary). 2.8\n  CLOSED; a=13+ deprioritized by evidence (D-029). \u2192 Next: 1.6\n  (\u03be\u2032-world ceiling).\n- Session 006 cont.5 (2026-08-18): task 1.6 COMPLETE \u2014 E-020b window\n  optimum for kernel D\u2081 = 0.86864 to 1e-6 (quartic window IS the\n  optimum; control recovers MT); \u03be\u2032-world saturated, nothing transfers\n  to \u03be; E-020 adversary-pool limitation documented (D-030). User\n  decision: do 1.6 then 1.7 as queued (option #1). \u2192 Next: 1.7 (T4b\n  scoping).\n- Session 006 cont.6 (2026-08-18): task 1.7 COMPLETE \u2014 T4b CLOSED\n  (D-031): node mechanism iterates formally (\u03be\u2033 \u2248 0.94 leading-order)\n  but G-001 symmetry caps every \u03be\u207d\u1d4f\u207e data class below 100%; Speiser/\n  Levinson\u2013Montgomery route to RH closed at every order; revival\n  condition noted. Session-005 queue (A3\u2192A1\u2192A2\u2192C\u2192B) NOW FULLY DONE.\n  \u2192 Next: 3.5 (Li asymptotic attack) or (\u2605) analytic attack.\n- Session 006 cont.7 (2026-08-18): task 3.5 DESIGN COMPLETE (user\n  directive: do 3.5 then (\u2605), then analyze for next stage). D-032\n  literature map: Voros \u2014 \"\u03bb_n>0 \u2200n\u2265N\u2080\" \u27fa RH at ANY N\u2080; Lagarias\n  Thm 6.1 finite-height bridge is the exploitable skeleton. D-033:\n  achievable deliverable = EXPLICIT finite-height theorem (\u03bb_n>0 \u2200n\u2264N\u2081\n  \u2248 10\u00b2\u2070\u201310\u00b2\u2074 from Platt T\u2080 + traced constants + finite verification);\n  wall = three-way arithmetic cancellation (triangle bounds explode).\n  New tasks 3.6/3.7/3.8 (D-036 constants, E-021 S_\u221e, D-037 assembly).\n- Session 006 cont.8 (2026-08-18): task (\u2605) DESIGN COMPLETE. D-034:\n  WH factorization + RH is unexplored territory (26 arXiv hits all\n  Riemann\u2013Hilbert); Krein/Gohberg\u2013Feldman/de Branges\u2013Krein machinery\n  exists. D-035: resolvent-convergence route \u2014 D_{a,\u03b8(a)}\u2192D in Krein\n  space; Cor 1.6 \u27fa D has real spectrum (deliverable D1); three-layer\n  wall (index/persistence=RH/circularity); off-axis 99.8% cancellation\n  is TAUTOLOGICAL (entirety of W forces it), the \u211d-envelope is the\n  whole problem. New tasks 2.9/2.10/2.11.\n- Session 007 (2026-08-18/19): task 3.6 marked done; task 3.7 (E-021)\n  COMPLETE after 6-bug root-cause saga (mpmath zeta ~58-digit ceiling,\n  GAMMA_E float literal, 3\u00d7 parse-before-dps, \u03c3-omission boundary\n  (15/14)\u207f, float64 zeros). E-021 ALL CHECKS PASS: V1 4.8e-25 vs\n  E-015; A = 0.9, B\u2080 = 1.0 measured; c\u2080 = \u22121/4 (+1/(24n) correction);\n  |S_f| max 13.52 at n = 3298 vs traced bound ~2280 (~170\u00d7 slack).\n  Resources folder (29 RH-equivalence notes) read in full. Next: 3.8\n  (D-037 \u2192 R-004 finite-height theorem assembly).\n- Session 008 (2026-08-19): REGROUP + R7 registration (resources atlas\n  indexed: resources/index.md, manifest R7, D-001 Part III pointer).\n  Task 3.8 COMPLETE \u2014 **R-004 finite-height Li theorem**: \u03bb_n > 0 for\n  all n \u2264 N\u2081 = (T\u2080\u22121)\u00b2 \u2248 9.0\u00d710\u00b2\u2074 (T\u2080 = 3\u00d710\u00b9\u00b2 Platt\u2013Trudgian);\n  conservative window N\u2081* = 2.73\u00d710\u00b2\u00b9. E-023 support computation ALL\n  CHECKS PASS: D-036 |t|<10 gap found + closed (M\u2080 = 1.3352), S_\u221e\n  elementary lower bound validated vs exact (min slack 9.52), N\u2080 =\n  5\u00d710\u2074 adopted (crossover 32 871 traced / 30 217 measured), margin\n  convex, margin(N\u2081) = 2.46\u00d710\u00b2\u2076. Ledger #6. Criterion-3 deliverable \u2014\n  the maximal content of the Li route short of RH. Task 2.10 COMPLETE\n  same session: E-022/E-022b + D-040 \u2014 spectral measures \u03bc_a (Clark\n  weights 1/K_a(z_k,z_k)) for a \u2264 12; **valley observable**: K_a(z,z)\n  dips exactly at the true \u03b3's, \u0394(a) \u2248 3.33 \u2212 4.76/a saturating at\n  fixed \u03b8=\u03c0; \u03b3-information flows through weights, not positions; mass\n  within \u00b10.1 of \u03b3's 63\u219272.5%; new constraint on 2.9-D1 (\u03b8(a) must\n  drive \u0394 \u2192 \u221e). Next: 2.9-D1, 2.11 (D-038); optional D-039 digamma\n  upgrade.\n- Session 009 (2026-08-19): **PHASE 4 COMPLETE.** Session-008 leftovers\n  (D-052 4.1/4.2, D-053 4.3a gate PASS) committed. 4.3b (D-054): four\n  independent-instance reviews + hand-verification \u2014 ALL THREE TAGS\n  downgraded (D-039 proof broken/bound true; D-036 \u00a71 far-sum\n  O(|t| log t) hole \u2014 reference-point trick missing; D-049 B1/B3 lower\n  bounds broken; \u03b4_crit one-direction; T-2 \u21d0 skeleton; D-052 accounting\n  fixes). Theorem statements survive (margins robust); repair map\n  4.5a\u20134.5d opened. 4.4 (E-027 + D-055, ALL CHECKS PASS): detector\n  stress test \u2014 bare-form negativity immediate for any \u03b4 > 0 (no\n  threshold); tuned-carrier threshold \u03c0/(2a) exact (\u22640.9%); pencil\n  onset magnitude-limited (0.11@a=4, 0.038@a=8); directions localized\n  at the pair. **Repairs 4.5a\u20134.5d COMPLETE same day**: D-056 (R-bound\n  reference-point proof, A = 10.5/B\u2080 = 48, honest C\u2080) + E-028 (N\u2080 =\n  80 000, 26\u00d7 slack); D-057 (convexity proved) + E-029; D-058 (valley\n  lower bounds via node-killing; B3/m_\u03b3/detector fixes); D-059\n  (bookkeeping: punctured compacts, R_\u03c4, Lemma FD, L1). R-004 tag\n  fully restored with the analytic chain proved end-to-end. Paper\n  updated (R-004 constants, valley theorem corrected form, E-027\n  appendix item). Next: Phase 5 / paper finalization.\n- Session 010 (2026-08-19): **PHASE 5: 5.3 + 5.4 COMPLETE; 5.1/5.2 at\n  skeleton stage.** 5.3: paper draft fully written (Introduction,\n  Background, Formal verification; abstract retagged; clean 12 pp\n  MiKTeX compile). 5.4 (D-060): full honesty audit \u2014 4 independent\n  instances, ~55 claims, 0 unsupported; 10 draft corrections\n  (critical: (1.12)\u27faspec(D)\u2282\u211d split \u2014 converse is SKELETON L3/L4;\n  flat-window fix; B(n) explicit remainders); 7 archive errata filed\n  (D-036 \u22121/(24n) sign, D-056 title constants, D-055/D-058 \"0.9%\" \u2192\n  0.02\u20132.3%, D-042/D-043 Z/6 \u2192 Z/(2\u03c0) supersession by D-045, R-004\n  post-repair update). 5.1/5.2 (D-061): elan + v4.33.0-rc2 installed;\n  zeta-23-lean FULL BUILD green (9010 jobs \u2014 D-007 rebuild done);\n  5.2 verified LIVE (all comparator PrintAxioms = 3 standard axioms,\n  verbatim AUDIT.md match); NguyenRH1 skeleton package created\n  (research/lean/NguyenRH1/, 9 statements compile, path-requires to\n  the vendored repo, no new axioms, sorryAx-marked). Next: prove the\n  elementary Lean tier (sInfty_lower_bound, marginTilde_convex) or\n  optional numerics (E-023b, E-021 n=10\u2074).\n- Session 011 (2026-08-19): **Lean tier (i) COMPLETE** (journal-011;\n  ~1100 lines, 10 commits; user machine crashed mid-session, zero work\n  lost). chain_rule_sqrt_shift, sInfty_lower_bound (Bernoulli truncation\n  + \u03b3-shifted harmonic bounds, parity algebra, tsum summability\n  discharged), marginTilde_convex (8-block \u03c8-table + analytic IIMaj\u2033\n  bound \u2264 1.316 < 2 via factor monotonicity; convexOn_of_deriv2_nonneg)\n  all PROVED, PrintAxioms = 3 standard axioms only. End-of-session user\n  directive: read session-012-notes.txt before Session 012.\n- Session 012 (2026-08-20): **Lean tier (ii) STEP 1 COMPLETE** (option\n  (a) per session-012-notes.txt, assembly-first split).\n  lambda_pos_finite_height PROVED modulo the single named analytic\n  hypothesis SfBoundProp (\u2200 n \u2208 [10\u2075, N\u2081], |Sf n| \u2264 Bn FAlt n) +\n  perimeter (RHUpTo, LiVerifiedUpTo) + 2 elementary margin evaluations\n  (hbase/hbase2). No sorryAx in LiSkeleton.lean. Design: FAlt majorant\n  swap (true F+S_b has \u03c8 > 0 on [5.47,~16] \u2014 caught pre-instantiation;\n  negative-weight term dropped, cost 0.9\u221an); secant two-point base\n  (pos_of_convex_of_two_points); margin regularity \u2192 ContDiffOn (Ioi 1).\n  D-062: SfBoundProp triage (layers L0\u2013L7) + PERIMETER DECISION \u2014\n  Trudgian 2014 N(T)/S(T) inside the trusted perimeter, declared in the\n  paper appendix (compile clean, 12 pp). D-062 \u00a75: base-point discharge\n  plan validated at dps 40 (plan bounds margin(8\u00d710\u2074) > 9 960;\n  margin(10\u2075) > margin(8\u00d710\u2074) by \u2265 2.2\u00d710\u2074 slack). CONTINUATION same\n  day (session-012-end-notes.txt, mathematician review actioned):\n  **tier (ii) STEP 2 COMPLETE** \u2014 LiBasePoints.lean (~560 lines)\n  discharges both margin evaluations by certified rational interval\n  bounds (exp \u2264 (1\u2212x/16)\u207b\u00b9\u2076 trick, partial sums, d9/d20 rationals);\n  **lambda_pos_finite_height_verified** = R-004 modulo SfBoundProp +\n  perimeter ONLY (3 hypotheses), PrintAxioms clean. Paper reconciled:\n  margin trail footnote (16 020 \u2192 15 764 \u2192 \u2265 8 001 certified),\n  formal-status paragraph at 3 hypotheses; compile clean 12 pp.\n  Review guidance adopted: tier ii\u2032 (contour interior) is\n  post-publication; Paper A ready to split/finish.\n- Session 013 (2026-08-20): **PAPER SPLIT EXECUTED** (user \"go go\"\n  after the minor-items assessment). paperA.tex (8 pp, clean): the\n  self-contained finite-height Li artifact \u2014 retargeted abstract/intro\n  with the three-named-hypotheses Lean headline, \u00a73 R-004 with the\n  reconciled margin-trail footnote, obstruction context, Li numerics\n  appendix, formal-verification appendix. paperB.tex (6 pp skeleton):\n  spectral-line note opening with the \u00a70 standing-items box (trace-or-\n  demote R-003's FT bookkeeping/o(e\u1d43); L3/L4; authorship policy).\n  draft.tex FROZEN (pre-split combined archive copy). Minor item 1\n  (number-trail note) filed at 10fdda6 before the split. Author block\n  carried verbatim except one typo fix (\"fromAnthropic\" \u2192 \"from\n  Anthropic\"); authorship itself untouched (user's call). Also\n  repaired: the \u00a79 header accidentally eaten by the session-011/012\n  log edit. CONTINUED same day: authorship set to sole author Dan T\n  Nguyen, Research Ai (user directive; both papers + frozen draft);\n  AI Contribution Statement + title footnote + one-line\n  Acknowledgments added to both papers (user directive, review\n  template); voros2017li reference corrected (real: Exp. Math. 29(4)\n  2020); submission documents written (cover-letter.md targeting\n  Experimental Mathematics + referee-list.md); **pre-submission audit\n  of NguyenRH1 ALL CHECKS PASS (D-063)**: clean-room rebuild green,\n  exhaustive axiom sweep of all 139 declarations (134 standard-only +\n  5 intended skeletons), statement-to-paper correspondence exact,\n  inherited comparators verbatim. Paper A is submission-ready pending\n  the user's read-through. Paper B assessment: more experiments NOT\n  needed (evidence ceiling documented); queued Task 1 = R-003\n  tempered-FT bookkeeping trace (\u2192 D-064) as next research action.\n- Session 014 (2026-08-21): **TIER ii\u2032 LAUNCHED** (user decision:\n  option (a) \u2014 close SfBoundProp in Lean BEFORE submission; Paper A\n  frozen/submittable throughout). Sub-stage ii\u2032-0 COMPLETE (D-064\n  design doc). TWO DISCOVERIES: (1) **liCoeff encoding defect** \u2014\n  unordered tsum NOT Summable (junk 0) \u27f9 LiVerifiedUpTo/SfBoundProp\n  FALSE as encoded, session-012 theorems vacuous; paired-form fix\n  designed (ii\u2032-1a, next). (2) **Crux identity Sf(n) = Res\u2081(n) EXACT**\n  (Sf := S_\u221e+1\u2212\u03bb_n = the w=1 residue \u03a3_j C(n,j)c_{j\u22121}) \u2014 numerically\n  verified: (4.10) j=0 exact 15 digits; \u03bb\u2082 prediction matches E-015\n  certified value; residue theorem sides = \u03bb_n(T)+triv+Res\u2081 verified\n  2e-21. Assembly TAIL-FREE: |Sf| \u2264 |\u03bb_n(T)|+|sides|+|triv| = B(n).\n  Routes R1\u2013R5 decided (R2(iii) (4.10) = long pole: EF-reuse first,\n  Hadamard fallback); sub-stage map ii\u2032-1a..7 (~9\u201316 sessions); all 8\n  planned Zeta23 dependencies axiom-checked live (clean). NOTE: the\n  R-003 bookkeeping doc is renumbered D-065 (D-064 taken by this\n  design doc). Freeze protocol in force.\n- Session 015 (2026-08-21): **ii\u2032-1a COMPLETE** \u2014 liCoeff encoding\n  defect repaired: paired symmetric liSummand (\u00bd\u00b7mult\u00b7(f \u03c1 + f \u03c1\u0304),\n  manifestly real) replaces the junk tsum; `liSummable` PROVED\n  (~340 lines LiSkeleton \u00a71: geometric-sum tail bound |Re f| \u2264 2n\u00b2/\u2016\u03c1\u2016\u00b2,\n  (9/4)\u2016\u03c1\u2016\u00b2 comparison, (9/2)n\u00b2\u00b7mult/(1+\u2016\u03b3\u2016\u00b2) dominator, Zeta23\n  zero_sum_inv_sq + finite ball); full rebuild GREEN (8741 jobs, zero\n  downstream changes); axiom audit 3 standard axioms only.\n  LiVerifiedUpTo/SfBoundProp are now TRUE statements. Phase 5B\n  checklist installed (commit 7a395b2). Next: ii\u2032-1b residue machinery.\n- Session 016 (2026-08-21): **ii\u2032-1b(i)+(ii) COMPLETE** \u2014 LiResidue.lean\n  (zetaA = (w\u22121)\u03b6 analytic at 1 via removable singularity; hLi analytic,\n  value 1, punctured agreement; lcoeff; A_iter; **ResW1_eq_sum**: the\n  w=1 residue = \u03a3_{j=1}^n C(n,j)\u00b7lcoeff(j\u22121) by iteratedDeriv_mul\n  Leibniz) + LiPrincipal.lean (rectInt_deriv_eq_zero per-side FTC;\n  Acoeff/ppart/Gprim; **rectInt'_ppart**: principal part integrates to\n  ResW1 n on any rectangle with 1 interior). 3 standard axioms only.\n- Session 017 (2026-08-21): **ii\u2032-1b(iii) COMPLETE \u2014 ii\u2032-1b FULLY\n  DONE** \u2014 LiSides.lean (~460 lines): **rectInt'_Jlag**, the rectangle\n  residue theorem for the Lagarias-kernel integrand:\n  RectangleIntegral' (Jlag n) z w = ResW1 n + \u03a3_{\u03c1\u2208Sz} (zeroMult\n  \u03c1)\u00b7(1\u2212(\u03c1/(\u03c1\u22121))\u207f) (1 interior, \u03b6 \u2260 0 on border, Sz = zeros inside,\n  supplied form). Removable singularity at 1 via Taylor-remainder order\n  \u2265 n+1 (Ffun\u2212TaylP); logDeriv-NF residues at zeros (multiple zeros\n  OK); zeta_order_ne_top_of_ne via the entire zetaA (identity\n  principle on univ, no punctured-plane connectedness needed; zetaA 1\n  = 1 makes \u03b6(1)'s junk value irrelevant). Root NguyenRH1.lean now\n  imports LiResidue/LiPrincipal/LiSides; full build GREEN (8745 jobs);\n  19 new decls, 3 standard axioms only. Deferred: zeroMult(\u22122) = 1\n  (trivial-zero simplicity) \u2014 ii\u2032-4. Next: ii\u2032-2 elementary swaps.\n- Session 018 (2026-08-21): **ii\u2032-2 COMPLETE** \u2014 LiSwaps.lean: the two\n  elementary swaps. R2(i) `liCoeff_eq_sum_sigma`: \u03bb_n = \u03a3_{j=1}^n\n  (\u22121)^{j+1}C(n,j)\u03c3_j with paired power sums (per-slice summability via\n  the ii\u2032-1a skeleton; j=1 paired exactness Re(1/\u03c1) = Re(\u03c1)/|\u03c1|\u00b2).\n  R2(ii) `sInfty_eq_sum`: S_\u221e(n) = \u03a3_{j=1}^n (\u22121)^jC(n,j)a_j (n \u2265 1;\n  oddSlice p-series domination; the j=1 \u2212n/m + n/m exact cancellation;\n  \u03a3_{j=2}^n(\u22121)^jC(n,j) = n\u22121). 12 new decls, 3 standard axioms only;\n  full build GREEN (8746 jobs). Next: ii\u2032-3 (4.10), the long pole.\n- Session 019 (2026-08-21): **ii\u2032-3 DESIGN (D-066) + piece (B)\n  PROVED**. Route investigation: \u03b21 (Hadamard) OUT \u2014 Mathlib lacks\n  Weierstrass/order machinery (extract_zeros_poles is finite-only);\n  \u03b22 (EF reuse) OUT \u2014 moment kernels not entire. **Route \u03b24 ADOPTED**:\n  contour moments (ii\u2032-1b machinery) + coefficient split; R-bound\n  identified as shared with ii\u2032-5 \u27f9 resequenced pipeline ii\u2032-3a \u2192\n  ii\u2032-4 \u2192 ii\u2032-5 \u2192 ii\u2032-3b \u2192 ii\u2032-3c. Mathlib inventory verified live\n  (digamma_one_half \u2713, Weierstrass-convergence \u2713, LSeries vonMangoldt\n  \u2713, logGammaSeq \u2713; completedRiemannZeta\u2080 noted as the wrong \u03be).\n  Piece (B): LiZetaCoeff.lean \u2014 iteratedDeriv_hLiExt (coefficients of\n  1/s + \u03b6\u2032/\u03b6(1+s) at 0 are \u2212j!\u00b7lcoeff j); 6 decls, 3 standard axioms;\n  build 8747 green. Next: piece (A) archimedean \u03c4-evaluation.\n- Session 020 (2026-08-21/22): **ii\u2032-3a COMPLETE** \u2014 piece (A) PROVED:\n  `iteratedDeriv_logDeriv_Gamma\u211d` (the archimedean Taylor coefficients\n  are (\u22121)^{j+1}\u00b7j!\u00b7a_{j+1}, all j \u2265 0). The digamma partial-fraction\n  series built from scratch (logGammaSeq \u2192 deriv-limit interchange \u2192\n  Weierstrass + identity principle \u2192 iteratedDerivWithin_tsum termwise\n  values \u2192 odd-m reindexing \u2192 2^{j+1} scaling); LiDigamma.lean +\n  LiArchimedean.lean. Build GREEN (8749 jobs); 18 decls audited clean.\n  Two elaboration gotchas banked (bare \u03c0 auto-binds; bare \u2191 drops coe).\n  Next: ii\u2032-4 (L3 zero-avoiding T + L1 kernel bounds).\n- Session 021 (2026-08-22): **ii\u2032-4 COMPLETE** (LiContour.lean, ~400\n  lines, three sub-stage commits). L3 `exists_zero_avoiding_T` (midpoint\n  pigeonhole on the perimeter `ZeroCountProp`; clearance\n  1/(3\u00b7C0hat(a+1))). L1 kernel bounds (`kFun_norm_le_two`,\n  `kFun_shift_norm_le_exp_four_add_one`,\n  `kFun_shift_norm_le_exp_sqrt_half_add_one`, `kFun_neg_two` \u2264 1) via the\n  normSq core `norm_one_add_one_div_le`. Trivial-zero simplicity\n  `zeroMult_neg_two` (zeroMult(\u22122) = 1) via \u03b6 = (s+2)\u00b7\u039b/Hfun near \u22122,\n  Hfun = 4\u03c0^{\u2212s/2}\u0393(s/2+2)/s, Hfun(\u22122) = \u22122\u03c0 \u2260 0, \u039b(\u22122) = \u039b(3) \u2260 0.\n  Build GREEN (8751 jobs); 17 decls audited: 3 standard axioms only.\n  Also (website, non-research): fixed /dashboard/ 500 (git_log cp1252\n  decode) + Roadmap Phase 2/5B list rendering (python-markdown list\n  interruption) \u2014 web/ only, logged in RH-WEBSITE.md \u00a77. Next: ii\u2032-5\n  (R-bound, the long pole).\n- Session 022 (2026-08-22): **ii\u2032-5a DESIGN (D-067) + ii\u2032-5b COMPLETE**.\n  D-067: route b\u2033 for the R-bound \u2014 Davenport disc at 2+it (R = 5/2)\n  + FE-reflection with exact zero-sum cancellation; Stirling-free\n  (digamma_stirling subsumes Lemma D), Hadamard-free; the \"every disc\n  dips left of \u03c3 = 0\" obstruction resolved by one extra EM level.\n  ii\u2032-5b (LiRBound.lean, ~640 lines): b2Fun machinery (comp_fract''\n  continuity trick), the level-2 IBP identity integral_b1_cpow_eq,\n  parameter-integral analyticity (re > \u22121), the level-2 \u03b6\n  representation via the convex W\u00b1 regions (sidesteps the\n  punctured-halfplane connectedness grind), and norm_riemannZeta_le_disc\n  (\u2016\u03b6\u2016 \u2264 (3/4)|t|\u00b2 on B(2+it, 5/2), |t| \u2265 10). Build GREEN (8752\n  jobs); 27 decls axiom-clean. Next: ii\u2032-5c (Davenport disc argument).\n- Session 023 (2026-08-22, HALT BY USER at a clean boundary): **ROUTE\n  REVISION (D-067 \u00a76)** \u2014 the disc-only BC constants provably cannot\n  reach the baked 10.5/48 (factor \u2265 16\u00d7 the M-coefficient) \u27f9 two-stage\n  plan: loose disc bound = growth input for the partial-fraction\n  identity (5e), then D-056's tight analysis of the identity (5f).\n  **ii\u2032-5c HALF** (LiDisc.lean, green): zeroDiscFinset +\n  zeroDisc_isNontrivial (re \u2265 1 via Mathlib's one_le_re nonvanishing;\n  re \u2264 0 via \u0393R-pole/FE); scaledZeta + F(0) = 1 (Zeta23\n  zeta_lower_bound_two, no \u03bc-series build); the multiplicity-invariance\n  chain (affine/const-mul/scaled); scaledZeta_jensen_count\n  (ZerosBound). Next: 5c back half \u2014 R-gap, g analytic+nonvanishing,\n  BC assembly.\n- Session 024 (2026-08-22): **ii\u2032-5c COMPLETE** (commit c7cbae5;\n  LiDisc.lean +~1000 lines, 32 new decls, all audited: 3 standard\n  axioms only). R-gap selection by the \u00d710-RESCALE TRICK (zero new\n  pigeonhole code: exists_avoiding_midpoint at a = 23 on the \u00d710\n  zero-norm image, \u00f710 \u27f9 R_c \u2208 [2.3, 2.4], clearance gapD =\n  1/(50(k+1))); the Blaschke quotient g = Cf r_c F built entirely on\n  Zeta23's Cf API (CfAnalytic/ZeroFactorization; nonvanishing on\n  closedBall(0, r_c) \u2014 the gap makes the sphere zero-free); |g| \u2264\n  (9/4)|t|\u00b2\u00b7gapD^{\u2212M_c} by max-modulus; center log|g(0)| \u2265 0;\n  LogOfAnalyticFunction (r = 3/5, R = r_c) + BorelCaratheodoryDeriv\n  (16M\u00b7r_c\u00b2/(r_c\u22123/5)\u00b3 \u2264 450M); logDeriv chain (div/prod/pow/comp) +\n  the affine push-forward (sum_image + order invariance) + the\n  near/extras split (extras \u2264 Jensen count via |s\u2212\u03c1| \u2265 |t\u2212\u03b3| \u2265 1).\n  **Capstone `logDeriv_riemannZeta_sub_nearZeros_le`**: the LOOSE\n  R-bound \u2264 100000\u00b7(log|t|)\u00b2 on \u03c3 \u2208 [1/2, 7/2], |t| \u2265 10, \u03b6 s \u2260 0 \u2014\n  no perimeter hypothesis (Jensen count, not ZeroCountProp). Constant\n  fold: log(33/32) \u2265 1/33 (log x \u2265 1\u22121/x), log 4150 \u2264 9 (e > 2.71),\n  M_bound \u2264 420L\u00b2. Build GREEN (8753 jobs; LiDisc now root-imported).\n  Next: ii\u2032-5d (FE-reflection + left digamma bound).\n- Session 025 (2026-08-22): **ii\u2032-5d COMPLETE** (LiReflect.lean, ~640\n  lines, 26 new decls, all audited: 3 standard axioms only). The FE\n  logDeriv identity `logDeriv_zeta_fe` (via \u039b =\u1da0 \u0393R\u00b7\u03b6 near good points\n  + the \u039b(1\u2212z) = \u039b(z) chain-rule negation); the EXACT zero-sum\n  cancellation `sum_nearZeros_neg_reflect` (nearZeros(\u2212t) = image under\n  \u03c1 \u21a6 1\u2212\u03c1 by the symmetric ball estimate (1+\u03c1.re)\u00b2+(\u03c1.im\u2212t)\u00b2 \u2264 5;\n  zeroMult invariant by analyticOrderAt_zeta_one_sub); the \u0393R +4 shift\n  `logDeriv_Gamma\u211d_shift` (Gamma\u211d_def + Gamma_add_one twice + exp-form\n  cpow arithmetic) putting both digamma arguments in re > 0, then\n  StirlingVert digamma_stirling \u27f9 \u0393R-bracket \u2264 4(log|t|)\u00b2. **Capstone\n  `logDeriv_riemannZeta_sub_nearZeros_le_left`**: the loose R-bound\n  \u2264 200000\u00b7(log|t|)\u00b2 on \u03c3 \u2208 [\u22125/2, 1/2], |t| \u2265 10. PLUS the 5e input\n  `norm_digamma_sub_log_le_of_two_le_abs_im`: \u2016\u03c8(w) \u2212 log w\u2016 \u2264 3 for\n  2 \u2264 |im w|, uniform in the shift chain (digamma_add_natCast +\n  first-order EM `sum_eq_integral_add_integral_deriv` + arctan-FTC\n  \u222bdx/((x+a)\u00b2+c\u00b2) \u2264 \u03c0/c \u2014 no full-line integral needed). Build GREEN\n  (8761 jobs; LiReflect root-imported). Banked gotchas: this Mathlib's\n  add_le_add_left/right are swapped vs classic; push_cast EM\n  conclusions before linear_combination; single-cast sum families.\n  Next: ii\u2032-5e (partial-fraction identity), first item zeroMult(\u22122n)\n  = 1 for all n (generalize ii\u2032-4c).\n- Session 026 (2026-08-22): **ii\u2032-5e PREP + DESIGN COMPLETE** (commit\n  0d9887a). LiTrivialZeros.lean (~290 lines, 8 decls audited clean):\n  `gamma_mul_prod` (product-form \u0393 recurrence by induction on\n  Gamma_add_one) + the `HfunT n` cofactor (analytic/nonzero at \u22122n)\n  + **zeroMult_neg_two_mul**: zeroMult(\u22122n) = 1 for ALL n \u2265 1 (the\n  ii\u2032-4c pattern via analyticOrderAt_eq_natCast). D-068 (5e design):\n  F entire via principal-part splits (no removable-singularity\n  theorem, no Hadamard); TWO CORRECTIONS to D-067 \u00a76 \u2014 (C1) circle\n  series bound O((log R)\u00b3) via the RADIAL split (the naive annulus\n  split gives O(R log R) \u2014 fatal); (C2) near-axis left-plane digamma\n  bound separate (recurrence + separated reciprocal sum). Sub-stage\n  map 5e-i..v. Banked: DifferentiableAt.analyticAt does NOT exist\n  (use fun_prop); Gamma\u211d_eq_zero_iff gives \u2212(2*\u2191m); lt_trichotomy\n  exists / le_or_lt does NOT. Next: ii\u2032-5e-i (\u03b3-gap circles).\n- Session 027 (2026-08-22): **ii\u2032-5e-i + 5e-ii COMPLETE** (commits\n  e28eff6, 0e9336e, ec13029; two new files, 17 decls, all audited:\n  3 standard axioms only). 5e-i (LiGapCircles.lean):\n  `exists_gapCircle_radius` \u2014 R \u2208 [4k+5/2, 4k+3] with dist(R/2,\u2124) \u2265 1/4\n  and ordinate clearance \u2265 1/(16\u00b7C0hat(4k+9/2)) (the \u00d72-rescaled\n  midpoint pigeonhole + C0hat_mono). 5e-ii (LiDigammaLeft.lean): the\n  telescope tail + **norm_digamma_le_of_two_le_re** (B: Weierstrass\n  split, harmonic head + telescoping tail, integers via\n  digamma_natCast_eq) + **digamma_recip_sum_le** (C: the V-split\n  separated reciprocal sum) + **norm_digamma_le_of_dist_nat** (A: the\n  near-axis bound via digamma_add_natCast\u2032 \u2014 pole-avoidance form,\n  covering real points) + **logDeriv_Gamma\u211d_eq** (G: logDeriv \u0393R s =\n  \u2212(log \u03c0)/2 + \u00bd\u03c8(s/2) for im \u2260 0, the m-fold shift). Build GREEN\n  (8764 jobs). Banked: ascribe cast haves (stuck typeclasses else);\n  pin \u2115-sub casts (Nat.cast_sub before push_cast; elaborator lifts\n  Real.log (m\u2212k) to real-sub); sum_add_tsum_nat_add's shifted terms\n  are beta-redexes (state goals in redex form); prod_range_succ's f\n  explicit-first. Next: ii\u2032-5e-iii (the zero series).\n- Session 028 (2026-08-23): **ii\u2032-5e-iii COMPLETE** (LiSeries.lean,\n  ~600 lines, 22 decls, all audited: 3 standard axioms only). The\n  zero-side partial-fraction series `seriesFun s := \u2211' \u03c1 : nontrivial\n  zeros, mult\u00b7(1/(s\u2212\u03c1)+1/\u03c1)`: `seriesSummable` at every s (the ii\u2032-1a\n  D-trick; tail 2\u2016s\u2016/\u2016\u03c1\u2016\u00b2 via 1/(s\u2212\u03c1)+1/\u03c1 = s/(\u03c1(s\u2212\u03c1)); the (17/12)\u2016\u03c1\u2016\u00b2\n  \u03b3-comparison; Zeta23 zero_sum_inv_sq dominator); `seriesFun_analyticAt`\n  + `seriesFun_analyticOnNhd` off the nontrivial zeros (the three-case\n  avoiding balls: \u03b6\u22600 continuity / \u03b6=0 order normal form / s\u2080=1 zetaA;\n  the Weierstrass M-test `of_norm_le_summable_eventually` + the\n  journal-020/021 TendstoLocallyUniformlyOn\u2192differentiableOn\u2192\n  analyticOnNhd pattern); `nontrivialZero_isolated` (finite unit-ball\n  min-distance); `seriesFunSub_analyticAt` (the \u03c1\u2080-term-zeroed series\n  analytic AT \u03c1\u2080); `seriesFun_sub_term` (the everywhere split\n  seriesFun = seriesFunSub + the \u03c1\u2080-term); capstone\n  `seriesFun_sub_polar_analyticAt` (series \u2212 mult/(s\u2212\u03c1\u2080) analytic at\n  \u03c1\u2080) \u2014 the 5e-iv residue-cancellation input. Build GREEN (8765 jobs,\n  LiSeries root-imported). Banked: redex-RHS show-before-rw; no rw at\n  set-var-dependent hypotheses (standalone membership iff route);\n  obtain-rfl needs a variable RHS; if_pos/if_neg under binders via\n  simp only; Finset.image lambda type-pinning; file ends `end\n  NguyenRH1` then `end`; push_neg/Set.mem_setOf_eq deprecated. Next:\n  ii\u2032-5e-iv (F entire by the principal-part splits).\n- Session 029 (2026-08-23): **ii\u2032-5e-iv COMPLETE** (commits 58e03e2 +\n  closure; LiFEntire.lean, ~1130 lines, 30 decls, all audited: 3\n  standard axioms only). F ENTIRE: the difference Fexpr = logDeriv \u03b6 \u2212\n  seriesFun + 1/s + 1/(s\u22121) \u2212 (log \u03c0)/2 + \u03c8(s/2)/2 extends via the\n  punctured limit `Gentire s := limUnder (\ud835\udcdd[\u2260] s) Fexpr` (Mathlib has\n  no general removable-singularity theorem; the junk point-values are\n  sidestepped by limUnder uniqueness + per-bad-point analytic\n  witnesses). Witnesses: nontrivial zeros (the NF logDeriv witness +\n  5e-iii polar subtraction), s = 1 (logDeriv zetaA), s = 0\n  (digamma-series split, \u03c8(s/2)/2 + 1/s = \u2212\u03b3/2 + \u00bd\u00b7series), s = \u22122n\n  (NF + zeroMult_neg_two_mul + the dropped-term series H_n). Support:\n  `zeta_zero_classification` (every zero is nontrivial/0/\u22122n \u2014 the\n  LiDisc argument globalized via completedRiemannZeta_eq_zero_iff +\n  Gamma\u211d_eq_zero_iff), `analyticAt_digamma` (off {0}\u222a\u2212\u2115). Capstone\n  `gentire_analyticAt_and_eq`: Gentire analytic everywhere AND equal\n  to Fexpr at every good point. Build GREEN (8766 jobs, LiFEntire\n  root-imported). Banked: AnalyticAt.comp HOU pin (f := ...); the\n  (\u22122\u2191n)/2 non-defeq value-normalization; cast-leaf vs single-cast\n  pinning (((x:\u2124):\u2102) forms); abs_re_le_norm as the robust\n  norm-of-cast-expr route; eventually_ne's implicit target pinned by\n  ascription; EventuallyEq wrapper vs raw \u2200\u1da0 (show-bridges); subst\n  eliminating the wrong local. Next: ii\u2032-5e-v (the circle bound\n  O((log R)\u00b3) + the max-modulus squeeze \u27f9 \u2203 B capstone).\n- Session 030 (2026-08-23): **ii\u2032-5e-v STARTED \u2014 5e-v-a + 5e-v-b\n  chunk 1 COMPLETE** (commits 5d24756, e6a654b; LiCircleBound.lean,\n  ~340 lines so far, clean elaboration, not yet root-imported). 5e-v-a:\n  `isNontrivialZero_conj`; the count bridges \u2014 `A0count` from Zeta23's\n  RvM `zeta_local_zero_count` (mult-weighted, two-sided, ALL t,\n  unconditional \u2014 the series-bound count input) + `Ncount_window_le` /\n  `Ncount_add_of_le` / `Ncount_chain_le` / `Ncount_le_of_interval` /\n  `Ncount_le_of_interval_gen`; `norm_logDeriv_zeta_le_dirichlet`\n  (\u2016\u03b6\u2032/\u03b6\u2016 \u2264 dirichletC2 for re \u2265 2, the LSeries vonMangoldt pattern\n  from ZetaBounds); 5e-v-b chunk 1: `tsum_split_finset` (tsum =\n  finset sum + if-zeroed tail via tsum_eq_sum) + `lowZeros`/\n  `lowZeroConst`. Full remaining design (tail bound via\n  ENNReal.tsum_fiberwise + the key machinery; the one-split series\n  bound; logDeriv/elem assembly; Schwarz squeeze; \u2203 B capstone) in\n  journal-030. Banked: le_or_gt (le_or_lt absent); finsum_mem_union/\n  finsum_mem_empty/tsum_eq_sum forms; Nat.cast_nonneg ascription;\n  Ncount_add_of_le endpoint pinning; nested calc-by parser fragility;\n  positivity vs Classical.choose defs; [DecidableEq \u03b9] for\n  statement-level ifs; _root_.riemannZeta_conj. Next: 5e-v-b chunk 2\n  (the tail bound + the main series circle bound).\n- Session 031 (2026-08-23): **ii\u2032-5e-v-b chunk 2 COMPLETE** (commits\n  c26241c, f984afc, closure 8f16424; LiCircleBound.lean ~830 lines,\n  clean). The far-tail bound `zero_tail_inv_sq_le`: \u03a3_{|\u03b3|>X}\n  m/(1+\u03b3\u00b2) \u2264 16\u00b7A0count\u00b7log X / X for X \u2265 200 \u2014 the dyadic fiber\n  machine: `dyadClass` (Nat.log-2 classes) + lower/upper bounds,\n  `dyadClass_fiber_finite`, `fiber_mult_count` (the two-window cover\n  via Ncount_le_of_interval_gen), `fiber_tail_le` (per-fiber bound via\n  tsum_subtype + tsum_eq_sum + filter split), `tsum_dyadic_log`\n  (closed form 10 log 2 + 2 log X via hasSum_coe_mul_geometric) and\n  the ENNReal.tsum_fiberwise + ofReal_tsum_of_nonneg assembly.\n  Banked: coercion-lambda type-pinning in Finset.image/filter/\n  sum_subtype (use Subtype.val); the unary-minus precedence\n  (-(2^(j+1) * X) parenthesization + abs_neg/neg_mul);\n  Finset.disjoint_left; tsum_subtype explicit args; indicator_of_notMem\n  camelCase; of_norm_bounded's norm-kept goal; rw-pow_succ' rfl-close\n  (no trailing ring); nlinarith can't multiply hypotheses by factors \u2014\n  rw the pow identity at goal+haves first. Next: 5e-v-b chunk 3 (the\n  main seriesFun circle bound).\n- Session 032 (2026-08-23): **ii\u2032-5e-v-b chunk 3 COMPLETE** (commits\n  787b9c0, 727f656, d2bfde6, 222d65d + capstone; LiCircleBound.lean\n  ~2867 lines, clean, zero warnings; audit-session032-axioms.txt: 19\n  decls, 3 standard axioms only). The series circle bound\n  `seriesFun_norm_le_gapCircle`: \u2016seriesFun s\u2016 \u2264 2\u00b7lowZeroConst +\n  2900\u00b7A\u2080\u00b7\u0108\u2080(4k+9/2)\u00b7(log R)\u00b2 on the \u03b3-gap circle (k \u2265 4000). Pieces:\n  3a `gapCircle_threshold` (416\u00b7\u0108\u2080 \u2264 4k+5/2, explicit exp/log\n  arithmetic) + `not_isNontrivialZero_on_gapCircle`; 3b\n  `seriesTerm_norm_eq_div`, `circleZeros R`, the count brick\n  `sum_zeroMult_le_of_im_band` (band [a,b] + sign-separation c \u27f9\n  3\u00b7A\u2080\u00b7(b\u2212a+2)\u00b7log(3\u00b7max|a||b|+5) via the (M\u22121,b] \u222a (\u2212b\u22121,\u2212M]\n  two-window cover), `series_tail_le` (91\u00b7A\u2080\u00b7log R),\n  `seriesFun_norm_le_split`; 3c `dyadic_family_le` (generic machine\n  via Finset.sum_fiberwise_of_maps_to with t := Ico 1 (J+1) \u2014 avoids\n  the Fintype-\u2115 gap), `shell_low` (2\u00b7lowZeroConst),\n  `shell_inlo`/`shell_inhi` (60\u00b7A\u2080L\u00b2), `shell_up` (45\u00b7A\u2080L\u00b2, dyadic\n  class reaches J+1), `shell_crit` (2688\u00b7\u0108\u2080A\u2080L: uniform separation\n  1/(32\u0108\u2080) \u2014 strip arcs |t\u2212\u03b3| \u2265 1/(32\u0108\u2080) via the \u03b3-gap (conj for\n  \u03b3 < 0) + the threshold; near-axis |s\u2212\u03c1| \u2265 \u221a13\u22121), and the five-way\n  partition assembly. Banked: linarith can't relate distinct\n  reciprocal atoms (bridge P = 2Q by field_simp first);\n  sum_fiberwise needs Fintype (use sum_fiberwise_of_maps_to);\n  sum_image's f is auto-bound (pin (f := ...));\n  Finset.eq_empty_iff_forall_notMem; div_le_div_of_nonneg_right\n  exists / div_le_div_right does NOT; floor-integrality must route\n  through \u2115 +1-cast before linarith; filter-conjunction nesting\n  \u27e8hF, pred\u27e9; lt_of_not_le does NOT exist (lt_of_not_ge). Next:\n  5e-v-c (logDeriv/elem assembly \u27f9 \u2016Fexpr\u2016 \u2264 C(log R)\u00b3).\n- Session 033 (2026-08-23): **ii\u2032-5e-v-c COMPLETE** (commits 1c76576,\n  5da957c + capstone; LiCircleBound.lean ~3928 lines, clean, zero\n  warnings; audit-session033-axioms.txt: 14 decls, 3 standard axioms\n  only). The Fexpr circle bound `Fexpr_circle_le`: \u2016Fexpr s\u2016 \u2264\n  2\u00b7lowZeroConst + dirichletC2 + 400000\u00b7A\u2080\u00b7\u0108\u2080(R+2)\u00b7(log R)\u00b2 on the\n  \u03b3-gap circle (k \u2265 4000). Pieces: c-i\n  `differentiableAt_Gamma\u211d_of_not_neg_nat` +\n  **`logDeriv_Gamma\u211d_eq_of_not_neg_nat`** (the (G) formula at ANY\n  non-pole point incl. s = \u2212R \u2014 direct logDeriv_mul on Gamma\u211d_def,\n  digamma := logDeriv \u0393 by def, no continuity argument) +\n  `gapCircle_sep` (standalone \u03b3-gap separation) +\n  `nearZeros_count_le` + `gapCircle_sep_of_mem_nearZeros`; c-ii\n  `digamma_right_le` (48+23\u00b7log) + `digamma_circle_le` (uniform\n  62+23\u00b7log(2+R/2): strip sub-log, right_le, left near-axis via\n  5e-ii (A) c = 1/8 from the \u2124-clearance \u2014 the R+re s = im\u00b2/(R\u2212re s)\n  identity, no square roots) + elems; c-iii `logDeriv_circle_le`\n  (three regions: Dirichlet / 5c+5d capstones + near sum \u2264\n  32\u0108\u2080\u00b7count / FE `logDeriv_zeta_fe` with all 10 hyps discharged +\n  Dirichlet at 1\u2212s + \u0393R bracket) and the six-norm-chain assembly.\n  Banked: riemannZeta_ne_zero_of_one_le_re takes ONLY re;\n  div_lt_iff\u2080 is a/c<b here (lt_div_iff\u2080 for a<b/c);\n  add_le_add_left/right SWAPPED (use per-step norm haves + linarith);\n  rw [X = 1*X] rewrites everywhere (use calc); linear_combination -h\n  for the 1\u2212s bridges; congrArg Complex.re + simp for cast-bridges;\n  left-assoc products through every calc; Real.pi_lt_d2 : \u03c0 < 3.15;\n  abs_one/abs_neg for |x\u00b11|; one_div_le_one_div_of_le takes the small\n  side's positivity first. Next: 5e-v-d (Schwarz squeeze \u27f9 \u2203 B\n  capstone partialFraction_identity).\n- Session 034 (2026-08-23): **ii\u2032-5e-v-d COMPLETE \u2014 ii\u2032-5e DONE**\n  (commit 5a262a1; new file LiSqueeze.lean, ~330 lines, clean, zero\n  warnings; LiCircleBound + LiSqueeze root-imported; full build GREEN;\n  audit-session034-axioms.txt: 5 decls, 3 standard axioms only).\n  `C0hat_add_two_le` (\u0108\u2080(R+2) \u2264 5\u00b7log R, R \u2265 16002);\n  `not_badPoint_on_gapCircle` (every gap-circle point good);\n  `gentire_circle_le` (the circle bound transfers to Gentire);\n  **`gentire_const`** (the Schwarz squeeze: max-modulus via Zeta23's\n  AnalyticOn.norm_le_of_norm_le_on_sphere + the ball-form Schwarz lemma\n  on the \u03b3-gap circle sequence; growth RB \u2264 C\u2080\u2032 + 64\u00b7C\u2081\u00b7Q\u00b3 with\n  Q := R^{1/4}, R = Q\u2074 (Real.log_le_rpow_div + pow_le_pow_left\u2080 +\n  rpow_inv_natCast_pow), radius choice Q \u2265 2 + (128\u00b7C\u2081+2\u00b7C\u2080\u2032)\u00b7\u2016z\u2080\u2016/\u03b5\n  \u27f9 dist \u2264 \u03b5 \u27f9 Gentire \u2261 Gentire 0); **THE CAPSTONE\n  `partialFraction_identity (hZC : ZeroCountProp)`**: \u2203 B : \u2102, \u2200 s\n  good, logDeriv riemannZeta s = B + seriesFun s \u2212 1/s \u2212 1/(s\u22121) +\n  (log \u03c0)/2 \u2212 \u03c8(s/2)/2 \u2014 the partial-fraction identity Lean-proved\n  modulo ONLY the declared perimeter (first perimeter use in the 5e\n  chain: the \u03b3-gap circles need ZeroCountProp). Banked: le_or_lt\n  absent (le_or_gt + the dist/2 contradiction closes the squeeze);\n  set-Q + rw [\u2190 hQ] after push_cast for the rpow_inv_natCast_pow\n  bridge; log_le_rpow_div's exponent-hypothesis form. Next: ii\u2032-5f\n  (D-056's tight constants 10.5/48 from the identity) \u2192 ii\u2032-3b \u2192\n  ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.\n\n## 9. SUCCESS CRITERIA (ordered)\n1. \ud83c\udfc6 Full proof of RH (formally verified).\n2. \ud83e\udd47 Unconditional improvement past 2/3 (or past 0.6725 / 5/6).\n3. \ud83e\udd48 New equivalence, reduction, or removal of a known obstruction.\n4. \ud83e\udd49 Rigorously documented obstruction map advancing the field.",
  "structuredPatch": [
    {
      "oldStart": 1315,
      "oldLines": 6,
      "newStart": 1315,
      "newLines": 41,
      "lines": [
        "   bridge; log_le_rpow_div's exponent-hypothesis form. Next: ii\u2032-5f",
        "   (D-056's tight constants 10.5/48 from the identity) \u2192 ii\u2032-3b \u2192",
        "   ii\u2032-3c \u2192 ii\u2032-6 \u2192 ii\u2032-7.",
        "+- Session 035 (2026-08-23/24): **ii\u2032-5f STARTED \u2014 5f-0 + 5f-i + piece",
        "+  6 COMPLETE** (commits 75172e6, f850d9a, 0cca091, d808f52, 1eeda9b,",
        "+  c9c1362, b5e3f53). **Perimeter repair** (user-approved): ZeroCountProp",
        "+  strengthened to the mult-weighted form (the second ii\u2032-1a-class",
        "+  encoding defect \u2014 the unweighted set-card under-captured the declared",
        "+  Trudgian N(T) source; `one_le_zeroMult` bridge via",
        "+  analyticOrderAt_ne_zero + ENat.toNat_pos; exists_zero_avoiding_T +",
        "+  exists_gapCircle_radius adapted via card \u2264 \u03a3 mult; full build GREEN;",
        "+  audit-session035-axioms.txt: 5 decls, 3 standard axioms only).",
        "+  **P1/P2 perimeter additions** (user-approved, D-069): ZeroCountProp2",
        "+  (the two-unit Trudgian specialization 0.6\u00b7L + 0.886\u00b7LL + 2.7) +",
        "+  NoLowZeros (|\u03b3| \u2265 14, Platt-class zero-location certificate).",
        "+  **D-069 Finding 1**: D-056's piece-2 one-C\u2080 usage is for a TWO-unit",
        "+  window \u2014 the honest two-unit form makes the assembly fit 10.5/48",
        "+  (margin \u2248 1.9). **Finding 2** (ii\u2032-6 map): H(T) clearance coverage",
        "+  (honest \u2248 7\u00b7\u0108\u2080\u00b2 vs baked 3\u00b7\u0108\u2080\u00b2). **5f-i** (LiTightR.lean, new file):",
        "+  tsum_split_finset_complex, nearZerosSub, seriesDiffTerm +",
        "+  seriesFun_sub_seriesFun, **Rexpr_decomp** (the six-piece",
        "+  reference-point decomposition; B cancels; linear_combination",
        "+  hsid \u2212 hs\u2080id + hdiff + hsplit + hnear), piece 1",
        "+  `dirichletC2_le_one` (the level-2 integral machinery:",
        "+  hasDerivAt_neg_log_add_one_div + integral_Ioi_of_hasDerivAt_of_tendsto'",
        "+  + AntitoneOn.tsum_comp_add_le_integral + the log2/log3 numeric fold),",
        "+  piece 2 `near_sum_refPoint_le`, pieces 4/5 `one_div_diff_le` (\u2264",
        "+  0.045). **5f-ii piece 6**: `log_diff_le` (the segment-FTC log",
        "+  bound \u2264 5/t) + `digamma_diff_le` (\u2016(\u03c8(s/2)\u2212\u03c8(s\u2080/2))/2\u2016 \u2264 6/t via the",
        "+  +2 shift + StirlingVert.digamma_stirling + digamma_add_natCast). The",
        "+  sharp Lemma-D remainder turned out UNNECESSARY (digamma_stirling's",
        "+  3/im\u00b2 suffices; piece 3's sharper interval sum freed the budget).",
        "+  Banked: the real-cast-first ((t/2 : \u211d) : \u2102)\u00b7I form; re/im ext-goals",
        "+  via explicit per-component rw chains; field_simp can close the goal;",
        "+  Summable.sum_add_tsum_nat_add method form; cpow_natCast's (2:\u2102) =",
        "+  ((2:\u2115):\u2102) bridge. Next: piece 3 (the far-sum interval machine) \u2192",
        "+  5f-iii (assembly + pinch + capstone) \u2192 ii\u2032-3b \u2192 ii\u2032-3c \u2192 ii\u2032-6 \u2192",
        "+  ii\u2032-7.",
        " ",
        " ## 9. SUCCESS CRITERIA (ordered)",
        " 1. \ud83c\udfc6 Full proof of RH (formally verified)."
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "replace_all": false,
  "file_path": "D:\\Python\\Quantum\\NGUYEN.md",
  "old_string": "### 8.5 PACING & SUB-STAGES (user directive, 2026-08-17)",
  "new_string": "### 8.4a FORK RULE (user directive, 2026-08-17)\nWhen the path FORKS (multiple candidate directions), do ALL of them \u2014\none by one \u2014 then pause to gather thoughts and evaluate the next step\ntogether. No path is dropped at a fork by choice alone; paths are only\nclosed by documented obstruction (Graveyard) or deprioritized by\nevidence after all forks are explored.\n\n### 8.5 PACING & SUB-STAGES (user directive, 2026-08-17)"
}

{
  "filePath": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1\\LiDogLeg.lean",
  "oldString": "    calc dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n          (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)",
  "newString": "    have hIntAB : (0 : \u211d) \u2264 (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n        (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := by\n      apply add_nonneg\n      \u00b7 apply intervalIntegral.integral_nonneg hXR\n        intro \u03c3 h\u03c3\n        positivity\n      \u00b7 apply intervalIntegral.integral_nonneg hXR\n        intro \u03c3 h\u03c3\n        positivity\n    calc dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n          (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) hIntAB (by norm_num)",
  "originalFile": "/-\nNguyenRH1/LiDogLeg.lean \u2014 ii\u2032-6-DL-1 (D-074, session 040): the zero-free\ndog-leg deformation of the Lagarias horizontal right tail.\n\nTHE CONTENT (D-074 \u00a73.1\u20133.2): on the dog-leg rectangle [3, X_R]\u00d7[T, U]\n(T > 0), the Lagarias integrand Jlag n s = (s/(s\u22121))\u207f\u22121 \u00b7 (\u2212\u03b6\u2032/\u03b6(s)) is\nholomorphic UNCONDITIONALLY (s \u2260 1 since im > 0; \u03b6 s \u2260 0 for re s \u2265 3 > 1\nby Mathlib's Euler-product nonvanishing `riemannZeta_ne_zero_of_one_lt_re`\n\u2014 NO perimeter hypothesis, no zero-avoidance at U). Cauchy's theorem\n(`HolomorphicOn.vanishesOnRectangle`) then gives the EXACT deformation\nidentity\n  H(3\u2192X_R, T) = H(3\u2192X_R, U) \u2212 V(X_R, T\u2192U) + V(3, T\u2192U)\n(the upper right tail = the high horizontal \u2212 the right drop + the left\nlift), plus the Jlag conjugation identity for the lower-side transfer.\n\nThis is the repair of Finding F-D (D-072): the broken low-path envelope\nis ABANDONED (not bounded) \u2014 the magnitude bound comes later from the\nthree dog-leg pieces, all in the unconditionally zero-free region.\n-/\nimport Mathlib\nimport NguyenRH1.LiSides\nimport NguyenRH1.LiTightR\nimport NguyenRH1.LiBasePoints\n\nopen Zeta23 Complex Filter Topology\nopen scoped Nat\n\nnoncomputable section\n\nnamespace NguyenRH1\n\n/-! ## 1. Dog-leg analyticity (D-074 \u00a73.1; no perimeter) -/\n\n/-- The dog-leg corners (same real-part/imaginary-part form as rectZ/rectW). -/\ndef dogZ (T : \u211d) : \u2102 := ((3 : \u211d) : \u2102) + (T : \u211d) * Complex.I\ndef dogW (XR U : \u211d) : \u2102 := ((XR : \u211d) : \u2102) + (U : \u211d) * Complex.I\n\nlemma dogZ_re (T : \u211d) : (dogZ T).re = 3 := by simp [dogZ]\nlemma dogZ_im (T : \u211d) : (dogZ T).im = T := by simp [dogZ]\nlemma dogW_re (XR U : \u211d) : (dogW XR U).re = XR := by simp [dogW]\nlemma dogW_im (XR U : \u211d) : (dogW XR U).im = U := by simp [dogW]\n\n/-- Jlag is differentiable at every point with 3 \u2264 re, 0 < im:\n\u03b6 is zero-free for 1 < re (Mathlib `riemannZeta_ne_zero_of_one_lt_re`,\nUNCONDITIONAL \u2014 the Euler-product region) and s \u2260 1 (im \u2260 0).\nNO perimeter hypothesis. -/\ntheorem Jlag_differentiableAt_dogleg {n : \u2115} {s : \u2102}\n    (hre : 3 \u2264 s.re) (him : 0 < s.im) :\n    DifferentiableAt \u2102 (Jlag n) s := by\n  apply Jlag_differentiableAt\n  \u00b7 rintro rfl\n    simp at him\n  \u00b7 exact riemannZeta_ne_zero_of_one_lt_re (by linarith)\n\n/-- Jlag is holomorphic on the whole dog-leg rectangle\n[3, X_R]\u00d7[T, U] (T > 0). -/\ntheorem holomorphicOn_Jlag_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HolomorphicOn (Jlag n) (Rectangle (dogZ T) (dogW XR U)) := by\n  intro s hs\n  rw [Rectangle, Complex.mem_reProdIm, dogZ_re, dogW_re, dogZ_im, dogW_im] at hs\n  rw [Set.uIcc_of_le hXR, Set.uIcc_of_le hTU] at hs\n  exact (Jlag_differentiableAt_dogleg hs.1.1 (by linarith [hs.2.1])).differentiableWithinAt\n\n/-- **The dog-leg rectangle integral vanishes** (Cauchy; the region is\nunconditionally zero-free \u2014 the residue sum is EMPTY, no perimeter). -/\ntheorem rectangleIntegral_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral (Jlag n) (dogZ T) (dogW XR U) = 0 :=\n  (holomorphicOn_Jlag_dogleg hT hTU hXR).vanishesOnRectangle subset_rfl\n\n/-- The (2\u03c0i)\u207b\u00b9-normalized form (API symmetry with rectInt'_Jlag). -/\ntheorem rectangleIntegral'_Jlag_dogleg_eq_zero {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    RectangleIntegral' (Jlag n) (dogZ T) (dogW XR U) = 0 := by\n  rw [RectangleIntegral', rectangleIntegral_Jlag_dogleg_eq_zero hT hTU hXR,\n    smul_zero]\n\n/-- **THE EXACT DOG-LEG DEFORMATION IDENTITY** (D-074 \u00a73.2 (\u2605), the\ncapstone for ii\u2032-6-c): the low right-horizontal equals the high\nhorizontal minus the right drop plus the left lift. Orientations: all\nH-integrals left-to-right, all V-integrals upward (the main contour's\ntop side is their reversal, handled at the fold site). -/\ntheorem upper_right_horizontal_eq_dogleg {n : \u2115} {T U XR : \u211d}\n    (hT : 0 < T) (hTU : T \u2264 U) (hXR : 3 \u2264 XR) :\n    HIntegral (Jlag n) 3 XR T =\n      HIntegral (Jlag n) 3 XR U - VIntegral (Jlag n) XR T U +\n        VIntegral (Jlag n) 3 T U := by\n  have h0 := rectangleIntegral_Jlag_dogleg_eq_zero (n := n) hT hTU hXR\n  unfold RectangleIntegral at h0\n  rw [dogZ_re, dogZ_im, dogW_re, dogW_im] at h0\n  linear_combination h0\n\n/-! ## 2. The conjugation identity (for the lower-side transfer, DL-5) -/\n\n/-- kFun is conjugation-symmetric (real-coefficient rational function). -/\ntheorem kFun_conj (n : \u2115) (s : \u2102) :\n    kFun n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (kFun n s) := by\n  unfold kFun\n  simp [map_sub, map_pow, map_one]\n\n/-- **Jlag is conjugation-symmetric** (from `riemannZeta_conj` +\n`iteratedDeriv_riemannZeta_conj`): Jlag n (s\u0304) = conj (Jlag n s).\nNeeded for the lower-horizontal transfer (DL-5). -/\ntheorem Jlag_conj (n : \u2115) {s : \u2102} (hs : s \u2260 1) :\n    Jlag n ((starRingEnd \u2102) s) = (starRingEnd \u2102) (Jlag n s) := by\n  have h1 : deriv riemannZeta ((starRingEnd \u2102) s) =\n      (starRingEnd \u2102) (deriv riemannZeta s) := by\n    have h := iteratedDeriv_riemannZeta_conj 1 hs\n    rwa [iteratedDeriv_one] at h\n  unfold Jlag\n  rw [kFun_conj, _root_.riemannZeta_conj, h1]\n  simp only [map_mul, map_neg, map_div\u2080]\n\n/-! ## 3. The left-lift bound (DL-2, D-074 \u00a73.3 V_left) -/\n\n/-- **Kernel on the lift**: \u2016kFun n (3+it)\u2016 \u2264 e^{5/2}+1 for n \u2264 t\u00b2\n(D-074 \u00a76: |(3+it)/(2+it)|\u00b2 = (9+t\u00b2)/(4+t\u00b2) = 1 + 5/(4+t\u00b2), whose n-th\npower is \u2264 e^{5n/(2(4+t\u00b2))} \u2264 e^{5/2}). -/\ntheorem kFun_three_add_it_norm_le_exp_five_halves_add_one {n : \u2115} {t : \u211d}\n    (hT : (n : \u211d) \u2264 t ^ 2) :\n    \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp (5 / 2) + 1 := by\n  rcases Nat.eq_zero_or_pos n with hn | hn\n  \u00b7 subst hn\n    simp only [kFun, pow_zero, sub_self, norm_zero]\n    positivity\n  \u00b7 have hnR : (1 : \u211d) \u2264 (n : \u211d) := by exact_mod_cast hn\n    have ht2 : (0 : \u211d) < 4 + t ^ 2 := by positivity\n    have hn4t2 : (n : \u211d) \u2264 4 + t ^ 2 := by linarith [hT]\n    have hQpos : (0 : \u211d) \u2264 (9 + t ^ 2) / (4 + t ^ 2) := by positivity\n    have hQle : (9 + t ^ 2) / (4 + t ^ 2) \u2264 Real.exp (5 / (n : \u211d)) := by\n      have h1 : (9 + t ^ 2) / (4 + t ^ 2) = 1 + 5 / (4 + t ^ 2) := by\n        field_simp [ht2.ne']\n        ring\n      rw [h1]\n      have h2 : 5 / (4 + t ^ 2) \u2264 5 / (n : \u211d) :=\n        (div_le_div_iff_of_pos_left (by norm_num) ht2 (by positivity)).mpr hn4t2\n      have h3 := Real.add_one_le_exp (5 / (n : \u211d))\n      linarith\n    have hQn : ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 Real.exp 5 := by\n      calc ((9 + t ^ 2) / (4 + t ^ 2)) ^ n \u2264 (Real.exp (5 / (n : \u211d))) ^ n :=\n            pow_le_pow_left\u2080 hQpos hQle n\n        _ = Real.exp 5 := by\n            rw [\u2190 Real.exp_nat_mul]\n            congr 1\n            have hn0 : (n : \u211d) \u2260 0 := by exact_mod_cast hn.ne'\n            field_simp [hn0]\n    have hns3 : Complex.normSq ((3 : \u211d) + t * Complex.I) = 9 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hns2 : Complex.normSq ((2 : \u211d) + t * Complex.I) = 4 + t ^ 2 := by\n      simp [Complex.normSq_apply]\n      ring\n    have hnormA : \u2016((3 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (9 + t ^ 2) := by\n      have h1 : \u2016((3 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((3 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns3]\n    have hnormB : \u2016((2 : \u211d) + t * Complex.I)\u2016 = Real.sqrt (4 + t ^ 2) := by\n      have h1 : \u2016((2 : \u211d) + t * Complex.I)\u2016 =\n          Real.sqrt (Complex.normSq ((2 : \u211d) + t * Complex.I)) := by\n        rw [Complex.normSq_eq_norm_sq, Real.sqrt_sq (norm_nonneg _)]\n      rw [h1, hns2]\n    have hnorm : \u2016((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)\u2016 =\n        Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) := by\n      rw [norm_div, hnormA, hnormB,\n        \u2190 Real.sqrt_div (by positivity : (0 : \u211d) \u2264 9 + t ^ 2)]\n    have hs1 : ((3 : \u211d) + t * Complex.I) - 1 = (2 : \u211d) + t * Complex.I := by\n      push_cast\n      ring\n    unfold kFun\n    rw [hs1]\n    calc \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(((3 : \u211d) + t * Complex.I) / ((2 : \u211d) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 :=\n          norm_sub_le _ _\n      _ = (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n + 1 := by\n          rw [norm_pow, hnorm, norm_one]\n      _ \u2264 Real.exp (5 / 2) + 1 := by\n          have h4 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n \u2264 Real.exp (5 / 2) := by\n            have hx0 : (0 : \u211d) \u2264 Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2)) :=\n              Real.sqrt_nonneg _\n            have hx : (0 : \u211d) \u2264 (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n :=\n              pow_nonneg hx0 n\n            have h5 : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 \u2264 Real.exp 5 := by\n              have e : ((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2 =\n                  ((9 + t ^ 2) / (4 + t ^ 2)) ^ n := by\n                rw [\u2190 pow_mul, mul_comm n 2, pow_mul, Real.sq_sqrt hQpos]\n              rw [e]\n              exact hQn\n            have h8 : (Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n =\n                Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2) := by\n              rw [Real.sqrt_sq hx]\n            rw [h8]\n            calc Real.sqrt (((Real.sqrt ((9 + t ^ 2) / (4 + t ^ 2))) ^ n) ^ 2)\n                \u2264 Real.sqrt (Real.exp 5) := Real.sqrt_le_sqrt h5\n              _ = Real.exp (5 / 2) := (Real.exp_half 5).symm\n          linarith [h4]\n\n/-- The Dirichlet majorant at s = 3 (summable since 3 > 1). -/\ndef dirichletC3 : \u211d :=\n  \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016\n\n/-- Termwise 3-vs-2 comparison for the \u039b L-series: \u039b(n)/n\u00b3 \u2264 (1/2)\u00b7\u039b(n)/n\u00b2. -/\nlemma norm_term_vonMangoldt_three_le_half (n : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 \u2264\n      (1 / 2) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 := by\n  have h3re : ((3 : \u2102).re) = 3 := rfl\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hn =>\n    rcases eq_or_ne n 1 with rfl | hn1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hn2 : 2 \u2264 n := by omega\n      have h\u039b : \u2016(ArithmeticFunction.vonMangoldt n : \u2102)\u2016 =\n          ArithmeticFunction.vonMangoldt n :=\n        Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n      rw [h\u039b]\n      have e : ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d) =\n          (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := by\n        rw [show (3 : \u211d) = 2 + 1 by norm_num,\n          Real.rpow_add (by positivity : (0 : \u211d) < (n : \u211d)), Real.rpow_one]\n        field_simp [show (n : \u211d) \u2260 0 by positivity]\n      have h12 : (1 : \u211d) / (n : \u211d) \u2264 1 / 2 :=\n        one_div_le_one_div_of_le (by norm_num : (0 : \u211d) < 2)\n          (by exact_mod_cast hn2 : (2 : \u211d) \u2264 (n : \u211d))\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (n : \u211d)) _)\n      calc ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (3 : \u211d)\n          = (1 / (n : \u211d)) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) := e\n        _ \u2264 (1 / 2) * (ArithmeticFunction.vonMangoldt n / (n : \u211d) ^ (2 : \u211d)) :=\n            mul_le_mul_of_nonneg_right h12 hpos\n\n/-- dirichletC3 \u2264 1/2 (the termwise comparison + dirichletC2 \u2264 1) \u2014\nthe certified C_zeta3 = 0.5 of D-074 \u00a74. (A tighter 0.17 build is\npossible via a 6-prime partial sum + antitone-integral tail; the fold\nis indifferent to the constant, so the cheap certified 0.5 is charged.) -/\nlemma dirichletC3_le_half : dirichletC3 \u2264 1 / 2 := by\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  calc dirichletC3\n      = \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 := rfl\n    _ \u2264 \u2211' n : \u2115, (1 / 2) *\n          \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n        Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_three_le_half n) hsum3\n          (hsum2.mul_left (1 / 2))\n    _ = (1 / 2) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n    _ \u2264 1 / 2 := by linarith [dirichletC2_le_one]\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 dirichletC3 for re s \u2265 3 (the s = 3 clone of the\nDirichlet-series majorant). -/\nlemma norm_logDeriv_zeta_le_dirichletC3 {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 dirichletC3 := by\n  have hs1 : (1 : \u211d) < s.re := by linarith\n  have h1 : -logDeriv riemannZeta s\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum3 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016\n      \u2264 dirichletC3 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (3 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => LSeries.norm_term_le_of_re_le_re _ (by\n            simp\n            exact hs) n) hsumS hsum3\n      _ = dirichletC3 := rfl\n  calc \u2016logDeriv riemannZeta s\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) s\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 dirichletC3 := hle\n\n/-- \u2016\u03b6\u2032/\u03b6 s\u2016 \u2264 1/2 for re s \u2265 3 (the charged C_zeta3 = 0.5). -/\nlemma norm_logDeriv_zeta_le_half {s : \u2102} (hs : 3 \u2264 s.re) :\n    \u2016logDeriv riemannZeta s\u2016 \u2264 1 / 2 :=\n  (norm_logDeriv_zeta_le_dirichletC3 hs).trans dirichletC3_le_half\n\n/-- **The left-lift bound** (D-074 \u00a73.3 V_left): for 0 < T \u2264 U and\nn \u2264 T\u00b2, \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U \u2212 T)\u00b7(e^{5/2}+1)/2. The kernel\n\u2264 e^{5/2}+1 (the 1+5/(4+t\u00b2) computation), the zeta factor \u2264 1/2\n(certified, no perimeter). -/\ntheorem vIntegral_Jlag_three_norm_le {n : \u2115} {T U : \u211d}\n    (hT0 : (0 : \u211d) < T) (hTU : T \u2264 U) (hTn : (n : \u211d) \u2264 T ^ 2) :\n    \u2016VIntegral (Jlag n) 3 T U\u2016 \u2264 (U - T) * (Real.exp (5 / 2) + 1) / 2 := by\n  have hnorm : \u2016VIntegral (Jlag n) 3 T U\u2016 =\n      \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 := by\n    unfold VIntegral\n    rw [norm_smul, Complex.norm_I, one_mul]\n  rw [hnorm]\n  have hbound : \u2200 t \u2208 Set.Ioc T U,\n      \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264 (Real.exp (5 / 2) + 1) * (1 / 2) := by\n    intro t ht\n    have htT : T < t := ht.1\n    have ht2 : (n : \u211d) \u2264 t ^ 2 := by nlinarith [hTn, hT0]\n    have hre : (3 : \u211d) \u2264 ((3 : \u211d) + t * Complex.I).re := by simp\n    have h1 := kFun_three_add_it_norm_le_exp_five_halves_add_one ht2\n    have h2 := norm_logDeriv_zeta_le_half (s := (3 : \u211d) + t * Complex.I) hre\n    have hnorm3 : \u2016Jlag n ((3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hnorm3]\n    exact mul_le_mul h1 h2 (norm_nonneg _) (by positivity)\n  have hint : \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016 \u2264\n      ((Real.exp (5 / 2) + 1) * (1 / 2)) * |U - T| := by\n    apply intervalIntegral.norm_integral_le_of_norm_le_const\n    intro t ht\n    rw [Set.uIoc_of_le hTU] at ht\n    exact hbound t ht\n  have habs : |U - T| = U - T := abs_of_nonneg (by linarith)\n  rw [habs] at hint\n  calc \u2016\u222b t in T..U, Jlag n ((3 : \u211d) + t * Complex.I)\u2016\n      \u2264 ((Real.exp (5 / 2) + 1) * (1 / 2)) * (U - T) := hint\n    _ = (U - T) * (Real.exp (5 / 2) + 1) / 2 := by ring\n\n/-! ## 4. The high-horizontal stepping (DL-3, D-074 \u00a77 + D-073 \u00a74) -/\n\n/-- Termwise \u03c3-vs-2 comparison for the \u039b L-series (the (6.10) halving):\n\u039b(m)/m^\u03c3 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7\u039b(m)/m\u00b2 for \u03c3 \u2265 2. -/\nlemma norm_term_vonMangoldt_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) (m : \u2115) :\n    \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) m\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) m\u2016 := by\n  have h\u03c3re : ((\u03c3 : \u211d) + t * Complex.I).re = \u03c3 := by simp\n  have h2re : ((2 : \u2102).re) = 2 := rfl\n  simp only [LSeries.norm_term_eq, h\u03c3re, h2re]\n  split\n  \u00b7 norm_num\n  \u00b7 next hm =>\n    have h\u039b : \u2016(ArithmeticFunction.vonMangoldt m : \u2102)\u2016 =\n        ArithmeticFunction.vonMangoldt m :=\n      Complex.norm_of_nonneg ArithmeticFunction.vonMangoldt_nonneg\n    rw [h\u039b]\n    rcases eq_or_ne m 1 with rfl | hm1\n    \u00b7 simp [ArithmeticFunction.vonMangoldt_apply_one]\n    \u00b7 have hm2 : 2 \u2264 m := by omega\n      have e : ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ \u03c3 =\n          (1 / (m : \u211d) ^ (\u03c3 - 2)) * (ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d)) := by\n        rw [show (\u03c3 : \u211d) = (\u03c3 - 2) + 2 by ring,\n          Real.rpow_add (by positivity : (0 : \u211d) < (m : \u211d))]\n        field_simp [show (m : \u211d) \u2260 0 by positivity]\n        ring_nf\n      rw [e]\n      have hle : (1 : \u211d) / (m : \u211d) ^ (\u03c3 - 2) \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) := by\n        rw [Real.rpow_neg (by norm_num : (0 : \u211d) \u2264 2), \u2190 one_div]\n        apply one_div_le_one_div_of_le (Real.rpow_pos_of_pos (by norm_num : (0 : \u211d) < 2) _)\n        exact Real.rpow_le_rpow (by norm_num : (0 : \u211d) \u2264 2)\n          (by exact_mod_cast hm2 : (2 : \u211d) \u2264 (m : \u211d)) (by linarith : (0 : \u211d) \u2264 \u03c3 - 2)\n      have hpos : (0 : \u211d) \u2264 ArithmeticFunction.vonMangoldt m / (m : \u211d) ^ (2 : \u211d) :=\n        div_nonneg ArithmeticFunction.vonMangoldt_nonneg\n          (Real.rpow_nonneg (by positivity : (0 : \u211d) \u2264 (m : \u211d)) _)\n      exact mul_le_mul_of_nonneg_right hle hpos\n\n/-- \u2016\u03b6\u2032/\u03b6(\u03c3+it)\u2016 \u2264 2^{\u2212(\u03c3\u22122)}\u00b7dirichletC2 for \u03c3 \u2265 2 (the (6.10)\nhalving in LSeries form; dirichletC2 \u2264 1 makes the tail free). -/\nlemma norm_logDeriv_zeta_le_two_pow {\u03c3 t : \u211d} (h\u03c3 : 2 \u2264 \u03c3) :\n    \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n  have hs1 : (1 : \u211d) < ((\u03c3 : \u211d) + t * Complex.I).re := by simp; linarith\n  have h1 : -logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\n      = LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) ((\u03c3 : \u211d) + t * Complex.I) := by\n    have h2 := ArithmeticFunction.LSeries_vonMangoldt_eq_deriv_riemannZeta_div hs1\n    rw [logDeriv, Pi.div_apply, h2]\n    ring\n  have hsum2 : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt (by norm_num)\n  have hsumS : Summable (fun n : \u2115 =>\n      \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n        ((\u03c3 : \u211d) + t * Complex.I) n\u2016) := by\n    rw [summable_norm_iff]\n    exact ArithmeticFunction.LSeriesSummable_vonMangoldt hs1\n  have hle : \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by\n    show \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n      ((\u03c3 : \u211d) + t * Complex.I) n\u2016 \u2264 _\n    calc \u2016\u2211' n : \u2115, LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I) n\u2016\n        \u2264 \u2211' n : \u2115, \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n            ((\u03c3 : \u211d) + t * Complex.I) n\u2016 :=\n          norm_tsum_le_tsum_norm hsumS\n      _ \u2264 \u2211' n : \u2115, (2 : \u211d) ^ (-(\u03c3 - 2)) *\n            \u2016LSeries.term (fun n => (ArithmeticFunction.vonMangoldt n : \u2102)) (2 : \u2102) n\u2016 :=\n          Summable.tsum_le_tsum (fun n => norm_term_vonMangoldt_le_two_pow h\u03c3 n) hsumS\n            (hsum2.mul_left _)\n      _ = (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := by rw [dirichletC2, tsum_mul_left]\n  calc \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      = \u2016LSeries (fun n => (ArithmeticFunction.vonMangoldt n : \u2102))\n          ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n        rw [\u2190 h1, norm_neg]\n    _ \u2264 (2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2 := hle\n\n/-- **Kernel envelope** (D-074 \u00a77, the single-exponential form that\nreplaces the unit-step geometric series): \u2016(1+1/((\u03c3\u22121)+iU))\u207f\u2016 \u2264\ne^{(4/9)\u03c3} for \u03c3 \u2265 3 and n \u2264 (4/9)U\u00b2. From the (6.11) core\n\u20161+1/s\u2016 \u2264 1+(re s+1)/normSq s \u2264 1+\u03c3/U\u00b2. -/\ntheorem one_add_div_pow_norm_le_exp_four_ninths {n : \u2115} {\u03c3 U : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) :\n    \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 Real.exp ((4 / 9) * \u03c3) := by\n  have hs0 : (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + U * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hle := norm_one_add_one_div_le hs0\n  have hre : (((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1 = \u03c3 := by\n    simp [Complex.add_re, Complex.ofReal_re, Complex.mul_re, Complex.I_re, Complex.I_im,\n      Complex.sub_re, Complex.one_re]\n  have hns : Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) = (\u03c3 - 1) ^ 2 + U ^ 2 := by\n    simp [Complex.normSq_apply]\n    ring\n  have hstep : ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 \u03c3 / U ^ 2 := by\n    rw [hre, hns]\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h1 : (0 : \u211d) \u2264 (\u03c3 - 1) ^ 2 := sq_nonneg _\n    exact (div_le_div_iff_of_pos_left (by linarith : (0 : \u211d) < \u03c3)\n      (by positivity) hU2).mpr (by linarith [h1])\n  have hstep1 : 1 + ((((\u03c3 : \u211d) - 1) + U * Complex.I).re + 1) /\n      Complex.normSq (((\u03c3 : \u211d) - 1) + U * Complex.I) \u2264 1 + \u03c3 / U ^ 2 := by\n    linarith [hstep]\n  have hpow1 : \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n \u2264 (1 + \u03c3 / U ^ 2) ^ n :=\n    pow_le_pow_left\u2080 (norm_nonneg _) (hle.trans hstep1) n\n  have hpow2 : (1 + \u03c3 / U ^ 2) ^ n \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := by\n    calc (1 + \u03c3 / U ^ 2) ^ n \u2264 (Real.exp (\u03c3 / U ^ 2)) ^ n := by\n          have h := Real.add_one_le_exp (\u03c3 / U ^ 2)\n          exact pow_le_pow_left\u2080 (by positivity) (by linarith) n\n      _ = Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := (Real.exp_nat_mul (\u03c3 / U ^ 2) n).symm\n  have hexp : (n : \u211d) * (\u03c3 / U ^ 2) \u2264 (4 / 9) * \u03c3 := by\n    have hU2 : (0 : \u211d) < U ^ 2 := by positivity\n    have h\u03c30 : (0 : \u211d) < \u03c3 := by linarith\n    have h1 : (n : \u211d) / U ^ 2 \u2264 4 / 9 := by\n      have h2 := div_le_div_of_nonneg_right hnU hU2.le\n      rwa [mul_div_cancel_right\u2080 _ hU2.ne'] at h2\n    rw [show (n : \u211d) * (\u03c3 / U ^ 2) = ((n : \u211d) / U ^ 2) * \u03c3 by ring]\n    exact mul_le_mul_of_nonneg_right h1 h\u03c30.le\n  calc \u2016(1 + 1/(((\u03c3 : \u211d) - 1) + U * Complex.I))\u2016 ^ n\n      \u2264 Real.exp ((n : \u211d) * (\u03c3 / U ^ 2)) := hpow1.trans hpow2\n    _ \u2264 Real.exp ((4 / 9) * \u03c3) := Real.exp_le_exp.mpr hexp\n\n/-! ## 5. The product envelope and the integral assembly (DL-3c/d) -/\n\n/-- **The product envelope** (D-074 \u00a77): for \u03c3 \u2265 3, 0 < t, n \u2264 (4/9)t\u00b2,\n\u2016Jlag n (\u03c3+it)\u2016 \u2264 (4\u00b7e^{\u2212c\u03c3} + 4\u00b72^{\u2212\u03c3})\u00b7dirichletC2, c = log 2 \u2212 4/9.\nThe kernel envelope (e^{(4/9)\u03c3}) times the zeta halving (2^{\u2212(\u03c3\u22122)})\ncollapses to the single exponential 4\u00b7e^{\u2212c\u03c3}: no geometric series. -/\ntheorem Jlag_dogleg_norm_le_envelope {n : \u2115} {\u03c3 t : \u211d}\n    (h\u03c3 : 3 \u2264 \u03c3) (ht : 0 < t) (hnU : (n : \u211d) \u2264 (4 / 9) * t ^ 2) :\n    \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := by\n  have hw1 : ((\u03c3 : \u211d) + t * Complex.I) - 1 = ((\u03c3 : \u211d) - 1) + t * Complex.I := by\n    push_cast\n    ring\n  have hs1ne : (((\u03c3 : \u211d) - 1) + t * Complex.I) \u2260 0 := by\n    intro h\n    have him : (((\u03c3 : \u211d) - 1) + t * Complex.I).im = 0 := by rw [h]; simp\n    simp at him\n    linarith\n  have hwid : ((\u03c3 : \u211d) + t * Complex.I) / (((\u03c3 : \u211d) + t * Complex.I) - 1) =\n      1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I) := by\n    rw [hw1]\n    field_simp [hs1ne]\n    ring\n  have hker := one_add_div_pow_norm_le_exp_four_ninths h\u03c3 ht hnU\n  have hzeta := norm_logDeriv_zeta_le_two_pow (show (2 : \u211d) \u2264 \u03c3 by linarith) (t := t)\n  have hk : \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by\n    unfold kFun\n    rw [hwid]\n    calc \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n - 1\u2016\n        \u2264 \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I)) ^ n\u2016 + \u2016(1 : \u2102)\u2016 := norm_sub_le _ _\n      _ = \u2016(1 + 1 / (((\u03c3 : \u211d) - 1) + t * Complex.I))\u2016 ^ n + 1 := by rw [norm_pow, norm_one]\n      _ \u2264 Real.exp ((4 / 9) * \u03c3) + 1 := by linarith [hker]\n  have hprod : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 \u2264\n      (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := by\n    have hn3 : \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016 =\n        \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I)\u2016 *\n          \u2016logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I)\u2016 := by\n      show \u2016kFun n ((\u03c3 : \u211d) + t * Complex.I) *\n          (-logDeriv riemannZeta ((\u03c3 : \u211d) + t * Complex.I))\u2016 = _\n      rw [norm_mul, norm_neg]\n    rw [hn3]\n    exact mul_le_mul hk hzeta (norm_nonneg _)\n      (add_nonneg (Real.exp_nonneg _) (by norm_num))\n  have h2b : (2 : \u211d) ^ (-\u03c3) = Real.exp (-(Real.log 2) * \u03c3) := by\n    rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n    congr 1\n    ring\n  have h22 : (2 : \u211d) ^ (2 : \u211d) = 4 := by\n    rw [Real.rpow_two]\n    norm_num\n  have h2a : (2 : \u211d) ^ (-(\u03c3 - 2)) = 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [show (-(\u03c3 - 2)) = -\u03c3 + 2 by ring, Real.rpow_add (by norm_num : (0 : \u211d) < 2), h2b, h22]\n    ring\n  have hexp_alg : Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3) =\n      Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) := by\n    rw [\u2190 Real.exp_add]\n    congr 1\n    ring\n  have halg : (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2))) =\n      4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3) := by\n    rw [h2a, h2b]\n    calc (Real.exp ((4 / 9) * \u03c3) + 1) * (4 * Real.exp (-(Real.log 2) * \u03c3))\n        = 4 * (Real.exp ((4 / 9) * \u03c3) * Real.exp (-(Real.log 2) * \u03c3)) +\n          4 * Real.exp (-(Real.log 2) * \u03c3) := by ring\n      _ = 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * Real.exp (-(Real.log 2) * \u03c3) := by\n        rw [hexp_alg]\n  calc \u2016Jlag n ((\u03c3 : \u211d) + t * Complex.I)\u2016\n      \u2264 (Real.exp ((4 / 9) * \u03c3) + 1) * ((2 : \u211d) ^ (-(\u03c3 - 2)) * dirichletC2) := hprod\n    _ = dirichletC2 * ((Real.exp ((4 / 9) * \u03c3) + 1) * (2 : \u211d) ^ (-(\u03c3 - 2))) := by ring\n    _ = dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := by\n        rw [halg]\n\n/-- The FTC-bound \u222b\u2083^XR e^{\u2212c\u03c3}d\u03c3 \u2264 e^{\u22123c}/c for c > 0. -/\nlemma integral_exp_neg_le {c XR : \u211d} (hc : 0 < c) (_hXR : 3 \u2264 XR) :\n    \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-c * \u03c3) \u2264 Real.exp (-3 * c) / c := by\n  have hF : \u2200 x \u2208 Set.uIcc (3 : \u211d) XR,\n      HasDerivAt (fun \u03c3 => -Real.exp (-c * \u03c3) / c) (Real.exp (-c * x)) x := by\n    intro x hx\n    have h2 : HasDerivAt (fun \u03c3 => Real.exp (-c * \u03c3)) (Real.exp (-c * x) * (-c)) x := by\n      have h := ((hasDerivAt_id' x).const_mul (-c)).exp\n      rwa [mul_one] at h\n    have h3 := h2.const_mul (-1 / c)\n    rw [show (-1 / c) * (Real.exp (-c * x) * (-c)) = Real.exp (-c * x) by\n      field_simp [hc.ne']] at h3\n    have h5 : (fun \u03c3 => (-1 / c) * Real.exp (-c * \u03c3)) =\n        (fun \u03c3 => -Real.exp (-c * \u03c3) / c) := by\n      funext \u03c3\n      field_simp [hc.ne']\n    rw [h5] at h3\n    exact h3\n  have hint : IntervalIntegrable (fun \u03c3 => Real.exp (-c * \u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (Real.continuous_exp.comp (continuous_const.mul continuous_id)).continuousOn\n  have e : Real.exp (-c * 3) = Real.exp (-3 * c) := by\n    congr 1\n    ring\n  rw [intervalIntegral.integral_eq_sub_of_hasDerivAt hF hint, e]\n  have h1 : (0 : \u211d) \u2264 Real.exp (-c * XR) := (Real.exp_pos _).le\n  have h2 : (0 : \u211d) < c := hc\n  rw [show -Real.exp (-c * XR) / c - -Real.exp (-3 * c) / c =\n      (Real.exp (-3 * c) - Real.exp (-c * XR)) / c by\n    field_simp [h2.ne']\n    ring]\n  rw [show Real.exp (-3 * c) / c = (Real.exp (-3 * c) - (0 : \u211d)) / c by ring]\n  exact div_le_div_of_nonneg_right (by linarith [h1]) h2.le\n\n/-- The certified exponent-decay constant c = log 2 \u2212 4/9 \u2265 0.2487. -/\nlemma cdog_gt : (0.2487 : \u211d) \u2264 Real.log 2 - 4 / 9 := by\n  have h := Real.log_two_gt_d9\n  norm_num at h\n  linarith\n\n/-- The certified e^{4/3} \u2264 3.8073 (the (1\u2212x/16)\u207b\u00b9\u2076 route + d9 e). -/\nlemma exp_four_thirds_le : Real.exp (4 / 3) \u2264 (3.8073 : \u211d) := by\n  have he13 : Real.exp (1 / 3) \u2264 (1.4006 : \u211d) :=\n    le_trans (exp_le_inv_sub_sixteen (by norm_num) (by norm_num)) (by norm_num)\n  rw [show (4 / 3 : \u211d) = 1 + 1 / 3 by norm_num, Real.exp_add]\n  calc Real.exp 1 * Real.exp (1 / 3) \u2264 2.7182818286 * 1.4006 :=\n        mul_le_mul Real.exp_one_lt_d9.le he13 (Real.exp_pos _).le (by norm_num)\n    _ \u2264 3.8073 := by norm_num\n\n/-- **THE HIGH-HORIZONTAL BOUND** (D-074 \u00a77 capstone; D-073 Cor 4.2's\nR(1.5) in single-exponential-envelope form): for 0 < U, n \u2264 (4/9)U\u00b2\n(i.e. U \u2265 (3/2)\u221an) and 3 \u2264 XR, \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 8.38\n(charged; the true value \u2264 1.2 at n = 10\u2075, E-034 V5). Charged with\ndirichletC2 \u2264 1 \u2014 the tight R(1.5) = 5.94 would need a dirichletC2 \u2264\n0.57 build (documented as the tightening path; the fold is\nindifferent: \u0394 \u2248 +2.4 per side). -/\ntheorem hIntegral_Jlag_dogleg_norm_le {n : \u2115} {U XR : \u211d}\n    (hU : 0 < U) (hnU : (n : \u211d) \u2264 (4 / 9) * U ^ 2) (hXR : 3 \u2264 XR) :\n    \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264 (8.38 : \u211d) := by\n  have hc : (0 : \u211d) < Real.log 2 - 4 / 9 := by\n    have h := cdog_gt\n    linarith\n  have hpt : \u2200 \u03c3 \u2208 Set.Ioc 3 XR,\n      \u2016Jlag n ((\u03c3 : \u211d) + U * Complex.I)\u2016 \u2264\n        dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) :=\n    fun \u03c3 h\u03c3 => Jlag_dogleg_norm_le_envelope (by linarith [h\u03c3.1]) hU hnU\n  have hcontA : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) :=\n    Real.continuous_exp.comp (continuous_const.mul continuous_id)\n  have hcontB : Continuous (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) := by\n    have h1 : Continuous (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) :=\n      Real.continuous_exp.comp (continuous_const.mul continuous_id)\n    have h2 : (fun \u03c3 : \u211d => (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2]\n    exact h1\n  have hIntA : IntervalIntegrable (fun \u03c3 : \u211d => 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3))\n      MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontA.const_mul 4).continuousOn\n  have hIntB : IntervalIntegrable (fun \u03c3 : \u211d => 4 * (2 : \u211d) ^ (-\u03c3)) MeasureTheory.volume 3 XR := by\n    apply ContinuousOn.intervalIntegrable\n    exact (hcontB.const_mul 4).continuousOn\n  have hIntG : IntervalIntegrable (fun \u03c3 : \u211d =>\n      dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)))\n      MeasureTheory.volume 3 XR := by\n    have h := (hIntA.add hIntB).const_mul dirichletC2\n    convert h using 1\n  -- step 1: \u2016H\u2016 \u2264 \u222b envelope\n  have h1 : \u2016HIntegral (Jlag n) 3 XR U\u2016 \u2264\n      \u222b \u03c3 in (3 : \u211d)..XR,\n        dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := by\n    unfold HIntegral\n    apply intervalIntegral.norm_integral_le_of_norm_le hXR _ hIntG\n    exact Filter.Eventually.of_forall (fun \u03c3 h\u03c3 => hpt \u03c3 h\u03c3)\n  -- step 2: \u222b envelope = dirichletC2\u00b7(4\u222be^{\u2212c\u03c3} + 4\u222b2^{\u2212\u03c3})\n  have h2 : \u222b \u03c3 in (3 : \u211d)..XR,\n        dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3))\n      = dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n          (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))) := by\n    rw [intervalIntegral.integral_const_mul, intervalIntegral.integral_add hIntA hIntB]\n  -- step 3: the two integral bounds\n  have h3a : \u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) \u2264\n      Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n    rw [intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le hc hXR\n    have he3c : Real.exp (-3 * (Real.log 2 - 4 / 9)) = Real.exp (4 / 3) / 8 := by\n      have h3l2 : Real.exp (-(3 * Real.log 2)) = 1 / 8 := by\n        have e1 : -(3 * Real.log 2) = Real.log (1 / 8) := by\n          rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n          push_cast\n          ring\n        rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n      calc Real.exp (-3 * (Real.log 2 - 4 / 9))\n          = Real.exp ((4 / 3) + -(3 * Real.log 2)) := by congr 1; ring\n        _ = Real.exp (4 / 3) * Real.exp (-(3 * Real.log 2)) := by rw [Real.exp_add]\n        _ = Real.exp (4 / 3) / 8 := by rw [h3l2]; ring\n    rw [he3c] at h\n    calc 4 * \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)\n        \u2264 4 * ((Real.exp (4 / 3) / 8) / (Real.log 2 - 4 / 9)) :=\n          mul_le_mul_of_nonneg_left h (by norm_num)\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by\n        field_simp [hc.ne']\n        ring\n  have h3b : \u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3) \u2264 1 / (2 * Real.log 2) := by\n    have h2e : (fun \u03c3 : \u211d => 4 * (2 : \u211d) ^ (-\u03c3)) =\n        (fun \u03c3 : \u211d => 4 * Real.exp (-(Real.log 2) * \u03c3)) := by\n      funext \u03c3\n      rw [Real.rpow_def_of_pos (by norm_num : (0 : \u211d) < 2)]\n      congr 1\n      ring\n    rw [h2e, intervalIntegral.integral_const_mul]\n    have h := integral_exp_neg_le (Real.log_pos (by norm_num : (1 : \u211d) < 2)) hXR\n    have h3l2 : Real.exp (-3 * Real.log 2) = 1 / 8 := by\n      have e1 : (-3 * Real.log 2) = Real.log (1 / 8) := by\n        rw [show ((1 : \u211d) / 8) = (2 ^ 3 : \u211d)\u207b\u00b9 by norm_num, Real.log_inv, Real.log_pow]\n        push_cast\n        ring\n      rw [e1, Real.exp_log (by norm_num : (0 : \u211d) < 1 / 8)]\n    rw [h3l2] at h\n    calc 4 * \u222b \u03c3 in (3 : \u211d)..XR, Real.exp (-(Real.log 2) * \u03c3)\n        \u2264 4 * ((1 / 8) / Real.log 2) := mul_le_mul_of_nonneg_left h (by norm_num)\n      _ = 1 / (2 * Real.log 2) := by\n        field_simp [Real.log_pos (by norm_num : (1 : \u211d) < 2)].ne'\n        ring\n  -- step 4: the certified assembly\n  have hlog2 : (0.6931471803 : \u211d) \u2264 Real.log 2 := Real.log_two_gt_d9.le\n  have h48 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 (7.6545 : \u211d) := by\n    have hcge := cdog_gt\n    have h1 : Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) \u2264 3.8073 / (2 * 0.2487) :=\n      div_le_div\u2080 (by norm_num : (0 : \u211d) \u2264 3.8073) exp_four_thirds_le\n        (by norm_num : (0 : \u211d) < 2 * 0.2487) (by linarith [hcge])\n    calc Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9))\n        \u2264 3.8073 / (2 * 0.2487) := h1\n      _ \u2264 7.6545 := by norm_num\n  have h72 : 1 / (2 * Real.log 2) \u2264 (0.7214 : \u211d) := by\n    have h1 : 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) :=\n      one_div_le_one_div_of_le (by positivity) (by linarith)\n    calc 1 / (2 * Real.log 2) \u2264 1 / (2 * 0.6931471803) := h1\n      _ \u2264 0.7214 := by norm_num\n  have hC2 : dirichletC2 \u2264 1 := dirichletC2_le_one\n  have hsum : dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n      (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))) \u2264 (8.38 : \u211d) := by\n    have hA0 : (0 : \u211d) \u2264 Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by positivity\n    have hB0 : (0 : \u211d) \u2264 1 / (2 * Real.log 2) := by positivity\n    calc dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n          (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)))\n        \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by\n          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)\n      _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2) := by ring\n      _ \u2264 7.6545 + 0.7214 := add_le_add h48 h72\n      _ \u2264 8.38 := by norm_num\n  calc \u2016HIntegral (Jlag n) 3 XR U\u2016\n      \u2264 \u222b \u03c3 in (3 : \u211d)..XR,\n          dirichletC2 * (4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3) + 4 * (2 : \u211d) ^ (-\u03c3)) := h1\n    _ = dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +\n          (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))) := h2\n    _ \u2264 8.38 := hsum\n\nend NguyenRH1\n\nend\n",
  "structuredPatch": [
    {
      "oldStart": 700,
      "oldLines": 10,
      "newStart": 700,
      "newLines": 19,
      "lines": [
        "       (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3))) \u2264 (8.38 : \u211d) := by",
        "     have hA0 : (0 : \u211d) \u2264 Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) := by positivity",
        "     have hB0 : (0 : \u211d) \u2264 1 / (2 * Real.log 2) := by positivity",
        "+    have hIntAB : (0 : \u211d) \u2264 (\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +",
        "+        (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)) := by",
        "+      apply add_nonneg",
        "+      \u00b7 apply intervalIntegral.integral_nonneg hXR",
        "+        intro \u03c3 h\u03c3",
        "+        positivity",
        "+      \u00b7 apply intervalIntegral.integral_nonneg hXR",
        "+        intro \u03c3 h\u03c3",
        "+        positivity",
        "     calc dirichletC2 * ((\u222b \u03c3 in (3 : \u211d)..XR, 4 * Real.exp (-(Real.log 2 - 4 / 9) * \u03c3)) +",
        "           (\u222b \u03c3 in (3 : \u211d)..XR, 4 * (2 : \u211d) ^ (-\u03c3)))",
        "         \u2264 1 * (Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2)) := by",
        "-          apply mul_le_mul hC2 (add_le_add h3a h3b) (by positivity) (by norm_num)",
        "+          apply mul_le_mul hC2 (add_le_add h3a h3b) hIntAB (by norm_num)",
        "       _ = Real.exp (4 / 3) / (2 * (Real.log 2 - 4 / 9)) + 1 / (2 * Real.log 2) := by ring",
        "       _ \u2264 7.6545 + 0.7214 := add_le_add h48 h72",
        "       _ \u2264 8.38 := by norm_num"
      ]
    }
  ],
  "userModified": false,
  "replaceAll": false
}

{
  "command": "cd /d/Python/Quantum && git log --oneline | head -3 && git status --short && date \"+%H:%M %Y-%m-%d\"",
  "description": "Verify archive integrity at session start"
}

NguyenRH1/LiDogLeg.lean:679:34: error: invalid 'by' tactic, expected type has not been provided

{
  "query": "select:HistorySearch"
}

matches=['HistorySearch'] query='select:HistorySearch' total_deferred_tools=18 pending_mcp_servers=None functions=[{'name': 'HistorySearch', 'description': 'FIRST tool for past conversations, prior sessions, last updates, or what we did. This queries agent.db (the conversation index). Do NOT Grep/Read/Bash session JSONL transcripts first — JSONL is a last resort only after this tool returns nothing. Search stored conversations in this project when you need information that is not in your current context: prior decisions, earlier implementations, previous sessions\' work, or anything lost to compaction. Multi-word queries are AND of terms ("llama server port" matches a message that contains all three, even non-contiguous); wrap the whole query in double quotes for an exact phrase. Prefer scope=summaries first (titles + session summaries — cheap); only then scope=messages for a phrase or decision, scope=notes for Remember notes / compact anchors, scope=sessions for a piece of work. Add since= (today / yesterday / 24h / 7d / 30d / Nh / Nd) when they give a time hint. Then use HistoryGet to read a session in depth. scope=all also searches other projects (capped: 5 DBs, 2 hits each); page a foreign hit with HistoryGet project=<slug>. mode=hybrid (default) fuses lexical + local vectors when embeddings are enabled; mode=lexical forces exact-match FTS. Results are excerpts from stored history, not live files — verify against the codebase before acting on them.', 'parameters': {'additionalProperties': False, 'properties': {'query': {'description': 'Full-text search terms. Multi-word queries AND the terms (non-contiguous). Wrap in double quotes for an exact phrase. Use 2–4 specific words from the decision or implementation.', 'title': 'Query', 'type': 'string'}, 'scope': {'default': 'messages', 'description': '"summaries" searches titles/summaries only (cheap); "sessions" is an alias of summaries; "messages" (default) searches message bodies; "notes" searches Remember notes and compact anchors; "all" does summaries first, then notes, then messages, then capped pointers from other projects.', 'enum': ['messages', 'sessions', 'summaries', 'notes', 'all'], 'title': 'Scope', 'type': 'string'}, 'role': {'anyOf': [{'enum': ['user', 'assistant'], 'type': 'string'}, {'type': 'null'}], 'default': None, 'description': 'Optional role filter: "user" or "assistant".', 'title': 'Role'}, 'sessionId': {'anyOf': [{'type': 'string'}, {'type': 'null'}], 'default': None, 'description': 'Optional public session id to scope the search.', 'title': 'Sessionid'}, 'since': {'anyOf': [{'type': 'string'}, {'type': 'null'}], 'default': None, 'description': 'Human time window: today, yesterday, 24h, 7d, 30d, Nh, Nd, or an ISO-8601 timestamp.', 'title': 'Since'}, 'before': {'anyOf': [{'type': 'string'}, {'type': 'null'}], 'default': None, 'description': 'Optional ISO-8601 cutoff; only messages created before this.', 'title': 'Before'}, 'after': {'anyOf': [{'type': 'string'}, {'type': 'null'}], 'default': None, 'description': 'Optional ISO-8601 cutoff; only messages created after this.', 'title': 'After'}, 'limit': {'default': 8, 'description': 'Max hits to return (default 8, max 20).', 'title': 'Limit', 'type': 'integer'}, 'mode': {'default': 'hybrid', 'description': '"hybrid" (default) fuses FTS + local vectors when embeddings are available, otherwise lexical; "lexical" forces FTS only.', 'enum': ['hybrid', 'lexical'], 'title': 'Mode', 'type': 'string'}}, 'required': ['query'], 'title': 'HistorySearchInput', 'type': 'object'}}]