Published October 18, 2026 | Version v2

Machine-Checked Simplicial Chain Complexes over F_2 and Metric Filtration Invariants for Relational Resolution Theory in Lean 4⁠

Authors/Creators

  • 1. Independent Researcher

Description

We present a self-contained, machine-checked formalization in the Lean 4 theorem prover (Mathlib4) of the core algebraic-topological invariants underlying discrete metric filtrations in Relational Resolution Theory (TRR 3.0). Specifically, we formalize: (1) the monotonicity and downward closure of Vietoris-Rips metric filtration complexes over arbitrary types with decidable equality, (2) the ungraded simplicial chain module modeled via finitely supported functions, (3) the linearity and nilpotency (d^2 = 0) of the simplicial boundary operator, (4) the fundamental cycle inclusion (im d <= ker d), and (5) grading and subcomplex invariance. All ten theorems in the development are verified with zero unproven assumptions (sorryAx is absent) and depend solely on the standard axioms [propext, Classical.choice, Quot.sound].

The underlying algorithmic pipeline and machine-checked formalization for TRR 3.0 are strictly licensed under the GNU Affero General Public License v3.0 (AGPL-3.0). Source code repository: https://github.com/RW-101/TRR3-formalization-

Files

TRR3_Preprint.pdf

Files (432.7 kB)

Name Size
md5:d8088fe61f85e6cb8f66bc7f669c1e30
432.7 kB Preview Download

Additional details

Related works

Is supplemented by
Software: https://github.com/RW-101/TRR3-formalization- (URL)