A machine-checked raster bridge for Trees Cannot Cut: enclosed 4-components equal C8 minus the Euler characteristic on every finite raster
Working paper, not peer reviewed. Nothing in this record is field-validated. Scope and novelty. Project P1 aims to replace the assumed topological step (FaceCount) in Trees Cannot Cut (doi:10.5281/zenodo.21686446) with machine-checked theorems about finite rasters. Its first result, Gray's 1971 bit-quad formula for the Euler characteristic of an 8-connected binary image (IEEE Transactions on Computers C-20(5):551-561, doi:10.1109/T-C.1971.223289), is a Lean 4 formalization of a known formula, not a new result. We are not aware of an earlier machine-checked proof, but we have not searched exhaustively and claim no novelty. Until the remaining rungs (L2 and L3) are proved, the FaceCount assumption is not discharged. For a finite set B of barrier pixels in Z^2, with 8-connected barriers and a 4-connected complement, we give a Lean 4 proof of the raster bridge enc(B) = C8(B) - chi(K(B)). Here enc(B) is the number of finite 4-components of Z^2 minus B, C8(B) is the number of 8-components of B, and chi = V - E + F is the Euler characteristic of the cubical complex formed by the pixel squares. The proof targets the sealed statement P1.Bridge (rung L3), which also asserts that only finitely many components are enclosed. It completes a three-rung ladder. L1 is Gray's bit-quad formula. L2 (single-pixel insertion preserves enc - C8 + chi) was proved in earlier sessions by a raster-scan induction, crossing parity and a crack-boundary permutation. L3 follows by induction from the empty raster, with a bounding-box argument for finiteness. In the same file we also give a Lean proof that the complement has exactly one infinite 4-component, so the total number of compartments is C8 - chi + 1. We state precisely what this discharges in Trees Cannot Cut. The FaceCount hypothesis there says that compartments = circuit rank + 1 for an abstract corridor graph, justified by Alexander duality. On rasters, the duality step is now a theorem with no hypotheses, with C8 - chi in the role of the first Betti number. FaceCount as stated is not discharged. Three links are not formalised: a corridor-graph-to-raster correspondence matching circuit rank to C8 - chi (the solid 2x2 block shows that the pixel-adjacency graph is the wrong choice), the identification of C8 - chi with rank H1, and anchoring at the landscape boundary. Verification. a Lean 4 proof of P1.Bridge, a statement fixed before the proof attempt, machine-checked against Mathlib and replayed through the Lean kernel using only the standard axioms Run record, certification page and reproducible package: https://github.com/jdhart81/viridis-research/tree/main/runs/2026-11-10_P1 AI use: this version was drafted by an AI research agent (Claude, by Anthropic) running the Viridis research engine. Formal claims are checked by the Lean 4 kernel, empirical claims by re-running their analysis in a sandbox, and all are labelled by an automated verifier. The agent may call the Aristotle prover (Harmonic) for help with proof search; a proof counts only if the Lean kernel accepts it. Justin D. Hart directs the research and is the accountable author. No AI system is listed as an author or contributor, which Zenodo does not allow.
Authors
- Justin Hart (ORCID: https://orcid.org/0009-0008-3082-2482)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24281795
- Primary Topic
- Digital Image Processing Techniques
- Type
- preprint