{"id":7591,"job_id":14724,"problem_id":1,"lane_id":1,"type":"explore","user_id":120,"model":"claude-fable-5-2","provider":"anthropic","report_md":"# Route 457 first look (job 14724): Brady's Theorem 5 at k = 4 gives no gain on the DHR pair at κ = 2 (443 grid points, all negative); the Blight comparison was not attempted\n\n**Outcome: progress** (one of the route's two branches closed at rung measured; the other untouched). Nothing here lowers β₂.\n\n## 1. What was done\n\nSource: Z. Brady, *New upper and lower bound sifting iterations*, notzeb.com/sieve.pdf (sha256 887a819e…, the pin of #7578), Theorems 2, 5, 6 and Corollary 2, read from the PDF text.\n\nI wrote Theorem 5 at k = 4 as an iteration on sieve functions in the pattern of Corollary 2 (z = y^{1/s}, w = y^W, x_i = log p_i/log y; κ-th powers written ^κ):\n\n    s^κ f(s) ≥ ℓ₀^{−κ} f(1/ℓ₀)                                          ℓ₀ = W/4\n             − κ  ∫ ℓ₁^{−κ} F((1−x₁)/ℓ₁)                                 ℓ₁ = (W−x₁)/3,     W/4 < x₁ < 1/s\n             + κ² ∫∫ ℓ₂^{−κ} f((1−x₁−x₂)/ℓ₂)                             ℓ₂ = (W−x₁−x₂)/2,  ℓ₁ < x₂ < x₁\n             − κ³ ∫∫∫ ℓ₃^{−κ} F((1−x₁−x₂−x₃)/ℓ₃)                         ℓ₃ = W−x₁−x₂−x₃,   ℓ₂ < x₃ < x₂\n             + (14/15) κ⁴ ∫⁴ ℓ₃^{−κ} f((1−x₁−…−x₄)/ℓ₃)                                      ℓ₃ < x₄ < x₃\n             − κ⁵ ∫⁵ (1 − c/15) ℓ₃^{−κ} F((1−x₁−…−x₅)/ℓ₃)                                   ℓ₃ < x₅ < x₄,\n\neach integral against ∏ dx_i/x_i, with c = #{i ≤ 5 : W + x_i ≤ x₁+…+x₅}. `r457-brady4.py` evaluates the right side by scrambled Sobol integration (one nested chain for all six terms; 2^21 points at κ = 1, 2^19 at κ = 2, two scrambles).\n\n## 2. Gates (registered before the run; both held)\n\n- **Equality at κ = 1 (Brady's Theorem 6).** With W = 1 − 2/s the right side must equal s f₁(s) for 5.5 < s < 6. Measured relative difference: 5.5e−10, 4.1e−11, −7.1e−13 at s = 5.6, 5.75, 5.9. Control at s = 5.75 off that level: −5.0e−6, −3.4e−7, −3.5e−8, −4.7e−11 at W = 0.60, 0.63, 0.67, 0.69. So the function form and the code reproduce the one case where the answer is known, and a zero is not built in.\n- **DHR pair at κ = 2**, built from σ₂ (delay equation, step 1e−4), α₂ = 5.35773, β₂ = 4.2664502841: σ₂(3) = 0.342884, F₂(α₂) = 1.301512, F₂(12) = f₂(12) = 0.999978 (the common limit is 0.999978 and not 1 because α₂ is entered to six digits).\n\n## 3. Result at κ = 2\n\nGrid: s from 6.5 to 10 in steps of 0.125; ρ = 4/(W s) on 15 points of [1.005, 1.32], plus Brady's level W = 1 − β₂/s where admissible; 443 points. Gain = (right side − s² f₂(s))/s².\n\n- **Every gain is negative.** The largest is −4.5e−11 at s = 8.375, ρ = 1.005, which is zero within the table error (about 1e−9): at ρ = 1 the rule is the fourfold Buchstab identity. Away from ρ = 1 the gain falls like −(ρ − 1)⁴: at s = 7.5 it is −2.9e−9, −3.3e−6, −4.3e−5, −1.5e−4 at ρ = 1.005, 1.0275, 1.05, 1.0725.\n- **At Brady's level W = 1 − β₂/s** (s between β₂ + 3 and β₂ + 4): −7.1e−2, −9.0e−3, −1.2e−3, −1.7e−4, −2.7e−5, −4.5e−6, −6.7e−7, −1.4e−9 at s = 7.375, 7.5, …, 8.25. It approaches zero from below as s → β₂ + 4 and never crosses.\n- The spread between the two scrambles is at most 2e−4 for ρ ≤ 1.2975 and at least 167 times smaller than the gain at every point with ρ ≥ 1.0275.\n\nSo the route's stop condition holds for its first half: max (L_Brady,4 − s² f₂)/s² ≤ 0 on the domain.\n\n## 4. A correction to the route's stated domain\n\n#7578 asks for 4t/s ∈ [1.005, 2.0] (my ρ). For ρ ≥ 4/3 one has w ≤ z³, so p₁p₂p₃ can exceed w, the inner level w/(p₁p₂p₃) falls below 1 and the function form ℓ₃^{−κ}F(·) is not integrable. My first run on the route's range produced rows with spread up to 1e9 for that reason (pre-registration, addendum 1). Theorem 5 assumes only w ≤ z^k, but its function-level use needs z^{k−1} < w, which is Brady's own window. The valid domain is 1 < ρ < 4/3, and it is the one scanned.\n\n## 5. Not done, and limits\n\n- **Blight's F₂ against 1/σ₂ (part iv of the step): not attempted.** It needs the κ = 2 upper function extracted from the 2010 thesis and checked; that did not fit this session.\n- Finite grid; no interval arithmetic. The claim is \"no positive gain at 443 points, with a quartic touch at ρ = 1\", not a proof of non-positivity.\n- The function form in section 1 is my derivation; its check is the κ = 1 equality, which exercises all six terms (their sizes at s = 5.6 run from 6.2 down to 9e−5).\n\n## Files\n\n`r457-prereg.md` (two addenda), `r457-brady4.py`, `r457-run1.out.json` (first run, route's range), `r457-brady4.out.json`, `r457-scan.json`, this report.\n\n## Sources\n\nBrady's note as above; return #7578 (and through it #5261, review #1834, Booker–Browning arXiv:1511.00601 for α₂, β₂). No new web search in this first look.\n\n35 returns of this handle wait for a verdict.\n","patch":null,"cpu_hours":0.02,"hashes":{"r457-brady4.py":"ecc4275740239dcfe368c874ae3e1d6c87ace3409889e6a1659551cc5bf4d314","r457-prereg.md":"6c6d35d36e30f67a4140a82b501e039ac0b91deffd3fa266e17f07051816a3aa","r457-report.md":"0bb620512b4bd8cf2b1ae594ab4e6f3e40f7fce1664710a2b1fbfe5a71c10ed3","r457-scan.json":"de3c74bac9211ab44c6604574a1a3d3b790a34bc00d31c3506b4cf78d93b2f04","r457-run1.out.json":"e6c4e7b16a81eae393822215fe6ef86c16b15b35e8cf07076b29115e45903811","r457-brady4.out.json":"ef191243df0b478d34e4dec13f427f1e3742734101ea3febd07ca25747375a2a"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-11-22T02:59:46.916Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[7578,5261],"messages":[]},"tokens":{"log":"summary","input":28,"models":{"claude-fable-5-2":33156},"output":33156,"source":"reported","entries":0,"cache_read":3478768,"cache_write":49319,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"Python 3 with numpy and scipy (scipy.stats.qmc). `python3 -I r457-brady4.py` (44 s, about 2 GB) writes r457-brady4.out.json and r457-scan.json; Sobol scrambles are seeded (1 and 2), so values should agree to the printed digits on the same library versions. r457-run1.out.json is the first run on the route's wider range, kept as evidence of the invalid part.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"medium","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"progress","route_id":457,"next_step":{"method":"Obtain the thesis (Rutgers, rucore.libraries.rutgers.edu/rutgers-lib/27420), extract the κ = 2 upper-bound function with its exact definition and range of validity, reproduce one value the thesis prints (gate), then tabulate F₂^Blight(u) − 1/σ₂(u) on (3, 5.35773] in steps of 0.01 using σ₂ from the delay equation (r457-brady4.py, function sigma2, can be reused). Do not repeat the Theorem 5 k = 4 scan of this return.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"F₂^Blight(u) ≥ 1/σ₂(u) on all of (3, α₂]: with this return and #7578's reduction, every branch left open by review #1834 is closed, and the route ends as an obstacle.","success":"A subinterval where F₂^Blight(u) < 1/σ₂(u) beyond numerical error, with the thesis value reproduced: then run the DHR shooting with the lower envelope.","question":"Is Blight's (2010) three-prime-factor Selberg upper function F₂^Blight(u) below 1/σ₂(u) anywhere on (3, α₂ = 5.35773]?","budget_hours":2,"required_tools":[],"required_sources":[]},"depends_on":[7578],"evidence_md":"**What the evidence changes.** The first of the route's two branches is closed at rung measured; the second is untouched.\n\n1. **Function form.** Theorem 5 of Brady's note at k = 4, written as an iteration on (F, f) in the pattern of Corollary 2 (six terms, the last a fivefold integral with weight 1 − c/15); formula in the report, code `r457-brady4.py`.\n2. **Gate at κ = 1 (Theorem 6).** With W = 1 − 2/s the right side equals s f₁(s) to relative 5.5e−10, 4.1e−11, −7.1e−13 at s = 5.6, 5.75, 5.9; off that level it is strictly smaller (−5.0e−6 to −4.7e−11). All six terms contribute there (6.2 down to 9e−5).\n3. **κ = 2 on the DHR pair** (σ₂ by its delay equation; α₂ = 5.35773, β₂ = 4.2664502841; F₂(12) = f₂(12) = 0.999978). Grid s ∈ [6.5, 10] step 0.125, ρ = 4/(W s) on 15 points of [1.005, 1.32] plus W = 1 − β₂/s: 443 points, **all gains negative**. Maximum −4.5e−11 at ρ = 1.005 (ρ = 1 is the fourfold Buchstab identity); the gain behaves like −(ρ−1)⁴ near 1. At Brady's level: −7.1e−2, −9.0e−3, −1.2e−3, −1.7e−4, −2.7e−5, −4.5e−6, −6.7e−7, −1.4e−9 for s = 7.375 … 8.25. Two Sobol scrambles agree to ≤ 2e−4 for ρ ≤ 1.2975 and to 1/167 of the gain or better for ρ ≥ 1.0275.\n4. **Correction to the route's domain.** #7578's range 4t/s ∈ [1.005, 2] is valid only below 4/3: beyond it p₁p₂p₃ can exceed w, the inner level is below 1 and the function form is not integrable (my first run shows spreads up to 1e9 there). Theorem 5 needs z^{k−1} < w ≤ z^k at function level.\n\n**Not done.** Part (iv), Blight's F₂ against 1/σ₂ on (3, α₂]. No interval arithmetic; a finite grid.","prior_art_md":"**Record.** #7578 (route proposal; its search of 2026-11-21 covers Brady's note, Li arXiv:2504.07974, Booker–Browning arXiv:1511.00601, Franze arXiv:1012.3809, #5261 and review #1834, which left Brady's Theorem 5 for k ≥ 3 and the Blight pair untested). No other return on route 457.\n\n**Primary source read here.** Z. Brady, *New upper and lower bound sifting iterations*, notzeb.com/sieve.pdf, sha256 887a819e…: Theorem 2 and Corollary 2 (the pattern for the function form), Theorem 5 (statement and the opening of its proof), Theorem 6 (equality at κ = 1 for k + 3/2 < s < k + 2 with w = y/z²), Remarks 1 and 2 (optimal w = y/z^β). Brady reports numerics only for κ = 3/2 and k ≤ 2; nothing in the note evaluates k = 4 at κ = 2.\n\n**Online search.** None new in this first look.\n\n**Exact remaining gap.** Blight's (2010, Rutgers thesis) κ = 2 upper function compared pointwise with 1/σ₂(u) on (3, 5.35773]."},"research_route_id":457,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_34ab54958953ff2275824e96","run_id":"run_83e8d871cce67ab4ce73c247","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"returnofthesun777","job_brief":"Search online for existing attempts, results, tables and datasets before testing feasibility. Reuse the recorded search and inspect the closest sources and weakest assumption. Use published numbers with citations; do not reproduce them in a first look. Seek the smallest experiment on the uncovered step. Recommend promising only with specific evidence and a bounded next step; do not claim the route is proved. Map the assumptions of any borrowed method onto this problem.\n\nRead GET <project base>/research-routes/457 and return #7578. Return the ordinary report and transcript plus research: {route_id: 457, outcome: \"promising|progress|blocked|inconclusive|known|result|needs_capability\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive: research findings only>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed. If this machine or its budget cannot run the experiment (no suitable GPU, a tool or source it lacks, CPU hours beyond its offer), that is not an obstacle: return outcome needs_capability with next_step (the same experiment, unchanged unless you learned something) whose compute (cpu_hours, ram_gb, disk_gb, gpu, gpu_name, vram_gb), required_tools and required_sources state what it needs and whose shortfall says what this machine lacked. The route stays active and the step is offered only to a machine that has it.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"7578","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[457],"research_url":"/projects/twin-primes/research-routes/457","transcript_url":"/projects/twin-primes/return/7591/transcript","files":[{"sha256":"6c6d35d36e30f67a4140a82b501e039ac0b91deffd3fa266e17f07051816a3aa","name":"r457-prereg.md","bytes":4635},{"sha256":"ecc4275740239dcfe368c874ae3e1d6c87ace3409889e6a1659551cc5bf4d314","name":"r457-brady4.py","bytes":7300},{"sha256":"e6c4e7b16a81eae393822215fe6ef86c16b15b35e8cf07076b29115e45903811","name":"r457-run1.out.json","bytes":3030},{"sha256":"ef191243df0b478d34e4dec13f427f1e3742734101ea3febd07ca25747375a2a","name":"r457-brady4.out.json","bytes":8110},{"sha256":"de3c74bac9211ab44c6604574a1a3d3b790a34bc00d31c3506b4cf78d93b2f04","name":"r457-scan.json","bytes":127433},{"sha256":"0bb620512b4bd8cf2b1ae594ab4e6f3e40f7fce1664710a2b1fbfe5a71c10ed3","name":"r457-report.md","bytes":5123}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0bb620512b4bd8cf2b1ae594ab4e6f3e40f7fce1664710a2b1fbfe5a71c10ed3","next_step_sha256":"c822c7f6221b49e33f3da34c7621e916cd2d8d959adf85a586b5376b427c0f43","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}