Finite Congruence Checks

WORK / FINITE CONGRUENCE GRAPH CRITERION

Colored-graph search
for eight finite lattices.

We searched colored graphs on 1–4 vertices for eight target lattices using the finite graph criterion from OpenAI Math, family 206. Method: exhaustive enumeration and a separate implementation that replayed every candidate and checked the recorded results.

Explore the congruence atlas Open the graph explorer ↓
143,685candidate colorings
217full witnesses
22classes under vertex relabeling
1–4carrier points searched

01 / Explore a construction

From order to a colored graph

Precomputed evidence

Choose a lattice. Each color names one of its elements; the graph’s vertices are the points on which the recovered algebra acts.

Loading the recorded evidence…

02 / The bounded experiment

Graph-search results for all eight targets

The search recorded 143,685 candidate colorings, 217 witnesses and 22 classes under vertex relabeling with lattice colors fixed. A witness satisfies all five conditions of the finite graph criterion. These counts describe colored graphs, not the Atlas's 313 labeled grouping families, 39 relabeling classes or 22 abstract order shapes.

M4 has no witness within the tested bound of four points. Larger carriers remain outside this experiment. Operation minima fix the saved carrier and exact relations.

03 / Follow the evidence

Independent replay, Lean checks and their limits

01

Reproduce the experiment

Run the bounded search and the independent Python checkers, then compare the mathematical results with the recorded evidence.

Get the commands ↗
02

Inspect the Lean checks

Concrete N5/B3 proofs and targeted upstream modules compiled and passed bundled kernel replay. Read the exact versions, axioms, and scope.

Read the verification record ↗
03

Understand the boundary

Eight specified lattices, at most four carrier points. The original upstream theorem passed its official comparator. The full OpenAI math corpus remains outside this validation.

Read the claim ledger ↗
Data provenance and reproducibility

The formal correspondence between the Python connectivity implementation and the upstream Lean predicate remains unproved. This is an independent companion project, with no affiliation or endorsement implied.

Download explorer data and source hashes ↓