The two operation tables
f swaps the objects in each pair. g sends the second pair onto the first.
f0 ⇄ 12 ⇄ 3
g0 → 0 1 → 12 → 0 3 → 1
Here 0 and 1 name individual objects. Lattice labels ⊥ and ⊤ below mean entire groupings.
SOURCE CONTEXT / 01 · FAMILY 206
For the two saved unary operations on four objects, exactly five of the 15 possible groupings are valid. Their inclusion order is N5. The separate Lean classification covers all equivalence relations for these exact operations.
Explore the saved construction ↓Method: check every grouping, then inspect the exact Lean classification and its verification record.
01 / Follow the rules
A grouping works when any two objects in the same group still land in the same group after each rule. The output group may differ from the input group.
f swaps the objects in each pair. g sends the second pair onto the first.
f0 ⇄ 12 ⇄ 3
g0 → 0 1 → 12 → 0 3 → 1
Here 0 and 1 name individual objects. Lattice labels ⊥ and ⊤ below mean entire groupings.
A bar separates groups: {0, 1} | {2} | {3} keeps 0 and 1 together.
This small check runs in your browser. It illustrates the rule; the Lean proof is linked separately.
02 / Account for every possibility
Each listed grouping survives both rules. For example, in {0, 2} | {1, 3}, f swaps the two groups and g sends each group into itself. Inputs that were together remain together.
The order is ⊥ < a < b < ⊤ and ⊥ < c < ⊤. Neither a nor b is comparable to c.
Read the exact Lean classification ↗f forces the other pair. Then g forces 0 with 1. Together these identifications connect all four objects, so only the one-group partition survives.
f forces both pairs, giving {0, 2} | {1, 3}. Any further merge combines its two blocks into one.
Only the pairs {0, 1} and {2, 3} can merge. g forces a merge of 0 with 1 whenever 2 and 3 merge. That leaves exactly ⊥, a, and b.
We have both directions: all five displayed groupings work, and every possible valid grouping is one of them. That is what “the full congruence lattice” requires.
finite_classification checks the 64 symmetric reflexive Boolean relations on four points. Many are not transitive. relation_complete proves that every equivalence relation has such an encoding; all_relations lifts the classification to proposition-valued relations. The proof uses Lean kernel reduction with decide.
The browser lists the 15 partitions instead. Its calculation and the human explanation are distinct from that formal proof.
PROOF REUSE / TWO REGISTERED RENAMINGS
A consistent renaming carries every object, rule, and grouping together. We can then reuse the original classification: exactly five groupings work, with the same inclusion order. A matching shape alone would not justify that step.
ORIGINAL CONSTRUCTION
TRANSPORTED CONSTRUCTION
Applying a rule and then renaming gives the same object as renaming first and applying the corresponding target rule. This equation is what lets valid groupings travel with the construction.
All five groupings, their order, and their distinctness. The Lean theorem establishes this for these exact operations. This does not transfer operation minimality, a different graph certificate, or a theorem about another construction.
TRY A DELIBERATE MISTAKE
These are constructed teaching cases. They are not recorded model errors or additional registered claims.
FOLLOW THIS EXACT CLAIM
A curated reading map. Every edge names its relationship; the map does not establish a proof dependency.
The browser illustrates finite equations. The query interface checks the registered record. Lean checks the mathematical theorem in the separate verification run.
03 / Place the example in the argument
Family 206 asks which finite lattices can occur as all the congruences of a nonempty finite algebra. Finding a few valid groupings is not enough: there must be no extra ones.
The original paper defines this question in §1.1, page 4. Its Theorem 2.2, pages 7–8, gives a colored-graph criterion for representation. Open the pinned paper ↗
For two objects x and y, d(x,y) is the smallest valid grouping that puts them together. It is a lattice label, not a number measuring distance.
For instance, d(2,3) = b: any valid grouping that merges 2 and 3 must also merge 0 and 1. For a lattice label ℓ, recover its grouping by the rule x ~ y exactly when d(x,y) ≤ ℓ.
This is the threshold relation θℓ. At threshold b, the two groups are {0, 1} and {2, 3}; at threshold c, they are {0, 2} and {1, 3}.
Colors must be symmetric, equal to bottom exactly on the diagonal, obey a join-valued triangle inequality, and distinguish lattice order.
The remaining condition is about paths: choose any nonempty set of seed edges. Apply all maps that can only decrease colors. Every pair whose color is below the join of the seed colors must be connected by the resulting marked edges.
That condition makes the recovered grouping list complete. In the reverse construction the theorem uses all color-decreasing maps as unary operations. Our saved example has 12 such maps, and the two displayed rules already give exactly its five groupings.
See how the local N5 bridge proves the full predicate ↗Fintype Lat supplies finiteness; Lattice Lat supplies meets and joins; OrderBot Lat supplies a least element. Representable requires a positive carrier size and an order isomorphism onto every congruence of a finite list of total finite-arity operations. An empty operation list is permitted.
The local N5 bridge proves this for the saved two-operation algebra. The general theorem relates representability and existence of a graph witness; it does not supply a stopping rule for a search that has found no witness.
04 / Follow the evidence
Select a node or use the source selector. Dashed links provide context; solid links point to proofs; dotted links identify definitions or a statement comparison. Every line names its relationship.
A curated reading map, not an automatically extracted dependency graph. “Shares definitions” does not mean the N5 proof depends on the general equivalence theorem.
The upstream comparator intentionally ends its target theorem with sorry. It tells the checker what must be proved. The completed upstream graph_criterion proof lives in a separate file. Its comparator acceptance record is also separate from the local N5 build and kernel-replay record.
Scope: these records support the selected graph criterion and exact concrete example. They do not validate the paper’s undecidability or subgroup-interval conclusions. The Turing examples belong to separate family 376; their machine checks do not validate the fluid-flow argument.
Matching hashes establish which files a record refers to. They do not prove the explanation, and this page does not rerun Lean. Consult the recorded toolchain, axioms, and checks.
05 / Return to the collection
The saved Lean proof is attached to the four objects and two tables on this page. The atlas entry retains its computational evidence status.
Local record: python scripts/build_n5_context.py --show. See the written walkthrough for the full explanation.