A machine-checked raster bridge for Trees Cannot Cut: single-pixel insertion preserves enc - C8 + chi

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 barrier raster B in Z^2 with 8-connected barriers and a 4-connected complement, the expected discrete Alexander duality is enc(B) = C8(B) - chi(K(B)): the number of enclosed (finite) 4-components of the complement equals the number of 8-components of B minus the Euler characteristic of its cubical complex. It would replace the assumed topological hypothesis FaceCount of Trees Cannot Cut. We give a Lean proof of the sealed statement P1.Insertion (rung L2): inserting any pixel into any finite raster leaves enc - C8 + chi unchanged. Earlier sessions reduced L2, via an induction in raster-scan order and explicit counts of the changes in C8, chi and the enclosed count, to one direction of a half-plane digital Jordan lemma. If the 4-component of the pixel S below the inserted pixel p is finite, then the left neighbour of p and the pixel SE are 8-connected in B. We prove that direction by following the crack boundary of the 8-component C of SE. The (8,4) crack-successor map has an explicit left inverse, so it permutes the finite set of cracks and every orbit closes. If the left neighbours of p are not in C, then p touches C only at one corner. Injectivity then forces the orbit from the crack between S and SE to reach the crack between SE and E before it turns around that corner. The outside pixels along the way form a free 4-path from S to E, and E escapes along a free ray. As a corollary we give a Lean proof of the bridge equation enc = C8 - chi for every finite raster. The proof uses no planar-topology library: crossing parity for one direction and a finite permutation for the other. The Aristotle prover was unavailable (invalid API key). Verification. a Lean 4 proof of P1.Insertion, 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-09_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

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24281786
Primary Topic
Digital Image Processing Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A machine-checked raster bridge for Trees Cannot Cut: single-pixel insertion preserves enc - C8 + chi

Justin Hart
4 links
Zenodo (CERN European Organization for Nuclear Research)
Digital Image Processing Techniques
preprint

A machine-checked raster bridge for Trees Cannot Cut: single-pixel insertion preserves enc - C8 + chi

Justin Hart
preprint en

Abstract

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 barrier raster B in Z^2 with 8-connected barriers and a 4-connected complement, the expected discrete Alexander duality is enc(B) = C8(B) - chi(K(B)): the number of enclosed (finite) 4-components of the complement equals the number of 8-components of B minus the Euler characteristic of its cubical complex. It would replace the assumed topological hypothesis FaceCount of Trees Cannot Cut. We give a Lean proof of the sealed statement P1.Insertion (rung L2): inserting any pixel into any finite raster leaves enc - C8 + chi unchanged. Earlier sessions reduced L2, via an induction in raster-scan order and explicit counts of the changes in C8, chi and the enclosed count, to one direction of a half-plane digital Jordan lemma. If the 4-component of the pixel S below the inserted pixel p is finite, then the left neighbour of p and the pixel SE are 8-connected in B. We prove that direction by following the crack boundary of the 8-component C of SE. The (8,4) crack-successor map has an explicit left inverse, so it permutes the finite set of cracks and every orbit closes. If the left neighbours of p are not in C, then p touches C only at one corner. Injectivity then forces the orbit from the crack between S and SE to reach the crack between SE and E before it turns around that corner. The outside pixels along the way form a free 4-path from S to E, and E escapes along a free ray. As a corollary we give a Lean proof of the bridge equation enc = C8 - chi for every finite raster. The proof uses no planar-topology library: crossing parity for one direction and a finite permutation for the other. The Aristotle prover was unavailable (invalid API key). Verification. a Lean 4 proof of P1.Insertion, 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-09_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.

Zenodo (CERN European Organization for Nuclear Research)
Digital Image Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon