Betti DiscoveryMulti-Agent Algebraic-Topological Invariant Discovery
Formal Lean 4 proofs certifying the provability oracle used by a multi-agent system that autonomously discovers Betti numbers and Euler characteristic from triangulated surface data. Based on the open challenge of recovering homology from polyhedral data using only knowledge of linear algebra.
Formal Verification Certificate
Every theorem in this project has been machine-checked by the Lean 4 kernel. No axiom is assumed without proof. No gap exists in the verification chain.
Betti Discovery • Lean 4 + Mathlib • Apoth3osis Labs
Key Mathematics
GF(2) CHAIN COMPLEX
Boundary matrices d1 (V×E) and d2 (E×F) over the two-element field. 8 features extracted via Gaussian elimination.
EULER CHARACTERISTIC
BETTI NUMBERS
PROVABILITY ORACLE
Deterministic template matching against 5 formally verified Lean 4 theorems. No neural network, no heuristic.
Paper ↔ Proof Correspondence
| PAPER | PROOF | STATUS | NOTES |
|---|---|---|---|
| §1.2 Euler's conjecture for polyhedra | sphereEuler, torusEuler | PROVED | Chi = V - E + F for sphere (=2) and torus (=0) |
| §1.7 Learning problem and mathematical background | rankNullityD1, rankNullityD2 | PROVED | Rank-nullity over arbitrary division rings and finite-dimensional modules |
| §1.10 Conjecturing agent | SRTranslation (AST, render, featureArity) | PROVED | Symbolic regression expression tree with 8 features and 5 operators |
| §1.11 Skeptical agent | N/A (implemented in Python) | N/A | Attention steering over data distribution — runtime component |
| §1.12 Environment and provability | vanishingMiddleBetti, bettiOneValue2, twoComponentB0 | PROVED | Certified provability oracle: 5 theorem templates |
| §2.1 Premises and data (D₀–D₃) | N/A (Python surface generators) | N/A | Sphere, torus, Klein bottle, disjoint union generators |
| §2.2–2.4 Ablation results | evaluate.py (4-variant ablation) | N/A | M₀ (full), M₁ (no oracle), M₂ (no SA), Only CA |
Proof Blueprint
“Once men turned their thinking over to machines in the hope that this would set them free. But that only permitted other men with machines to enslave them.”
Frank Herbert, Dune
A janitor who proves a theorem outranks a tenured professor who publishes noise.
Not as a slogan. As a structural fact of how the network operates. The only currency that matters is the quality of your contribution, measured not by committee but by mathematics.
A valid, original framing or conjecture
Formal argument with paper-level rigor
Connecting theory to observable outcomes
Working software the project depends on
Reproducible research with methodology and data
Machine-verified claim checked by a proof assistant
Foundational, load-bearing implementation
Connecting subsystems or knowledge domains end-to-end
Strategic direction & roadmaps
Writing, documentation & papers
Visual, UX & information design
Teaching, tutorials & workshops
Community, outreach & events
Partnerships, governance & policy
Translation, media & accessibility
Ethics, review & quality assurance
Every accepted contribution receives a MENTAT Contribution Record — cryptographically signed, IPFS-pinned, permanently yours. No committee decides your worth. The type checker does.
Module Dependencies
Hover over a module to trace its imports. RankNullityPremises depends on Mathlib for linear algebra primitives; SRTranslation uses only the standard library.
Verified C Artifacts
Generated via CAB pipeline: Lean 4 → LambdaIR → MiniC → C. Each file carries a correctness certificate verifying semantic preservation.
Safe Rust Artifacts
Transpiled from verified C to idiomatic safe Rust. Raw pointers replaced with owned types, slices, and iterators. Correctness inherited from the C verification chain. Download the full crate (includes Cargo.toml and lib.rs) and run cargo test.
rank_nullity_premises.rs
ChainDimensions struct + Betti computation + 7 tests | from RankNullityPremises
sr_translation.rs
SRExpr enum + Display + featureArity + 4 tests | from SRTranslation
lib.rs
Crate root re-exporting both modules | from —
Cargo.toml
Package manifest (edition 2021, 0 dependencies) | from —
Provenance Chain
Research Paper
Aggarwal, Kim, Ek & Mishra. “Discovering mathematical concepts through a multi-agent system.” arXiv:2603.04528, March 2026. Multi-agent framework for computational mathematical discovery from polyhedral data.
Lean 4 Formalization
2 modules, 3 theorems, 186 lines. Certified provability oracle for Betti numbers and Euler characteristic + SR expression AST. Mathlib dependency. Zero sorry/admit.
CAB-Certified C
Lean 4 → LambdaIR → MiniC → C. Each transformation step carries a certificate hash verifying semantic preservation. gcc -std=c11 -Wall -Wextra -Werror: 0 warnings.
Safe Rust
C → Rust transpilation. Ownership semantics, no unsafe blocks. Correctness inherited from verified C source. cargo test: 11/11 pass.
IPFS Pinned
All artifacts content-addressed and pinned to IPFS. CID: bafybeiexph6w6zx4r3wq7muuqxrbrx64ouho33v3bwxkngcjdhu3yjnida. Immutable, globally retrievable via any IPFS gateway.
IPFS Permanent Storage
All artifacts content-addressed and pinned to IPFS. Immutable, globally retrievable via any IPFS gateway. No server dependency — the proofs persist on the distributed web.
Root CID: bafybeiexph6w6zx4r3wq7muuqxrbrx64ouho33v3bwxkngcjdhu3yjnida
Download Archives
Betti Discovery | Paper → Proof → Code | Apoth3osis
All proofs machine-verified using Lean 4 and Mathlib
