Finite Congruence Checks

QUESTION / UNARY OPERATIONS ON 1–4 OBJECTS

Finite congruence constructions
and verification.

Which complete families of valid groupings can unary operations produce on 1–4 objects? Each operation maps each object to an object in the same set. A grouping is valid when inputs in the same group have outputs in the same group under every operation.

Compare constructions

Method: exhaustive enumeration with a separate checker for the saved families and their minimum operation counts. Each minimum fixes the exact grouping family and carrier.

Atlas / recorded finite constructions

Explore the 39 grouping-family representatives.

One to four objects

Choose an exact entry to synchronize the map, catalog, detail and JSON export. Filters apply to both views. Each entry represents a complete relation family up to simultaneous carrier relabeling.

Loading the atlas…

Comparison / fixed-carrier operation cost

Two C4 families need different numbers of rules.

Both systems below use four objects and make a four-level chain, called C4. Their groupings differ. One family needs one rule; the other needs two.

RESULT / FIXED FOUR-OBJECT CARRIER

One exact C4 family needs one unary operation; the other needs two. The same order shape can therefore have different minimum rule counts when its grouping family changes.

“Needs” here means the fewest unary operations for that particular grouping family on that particular carrier. Four objects are necessary for a four-level chain: each strict step must merge at least two groups.

Worked example / inspect a local witness

A three-object witness.

A complete, three-object example
1

Give them a rule

A stays A. B stays B. C becomes B.

AAstays
BBstays
CBchanges

Each letter is one object. An arrow means “apply the rule once.”

2

Try a grouping

Objects in the same group must have outputs in the same group.

Choose a grouping to see what happens.

A bar separates groups. “BC” means B and C are together.

3

See the whole pattern

Exactly four of the five possible groupings work. Together, they form this square.

New kind of diagram: each node is a whole grouping. Moving upward merges groups. Lines connect neighboring allowed groupings.

THE IDEA

The tool searches for operations whose complete family of valid groupings has the selected shape.

Now give those ideas their mathematical names
Carrier
The objects the rules act on. Here, A, B, and C.
Unary operation
A rule taking one object as input and returning one object.
Partition
A division of all the objects into separate, nonempty groups.
Congruence
A partition that respects every rule: inputs together stay together after each rule.
Congruence lattice
The complete pattern of valid groupings, ordered from finer to coarser.
B2
The name of the four-node square above. Its two middle groupings are incomparable.

Any two nodes of a lattice have a greatest common refinement (their meet) and a least common coarsening (their join). Here, the two middle nodes meet at the bottom and join at the top.

This example relabels the saved B2 construction: A = 2, B = 0, C = 1. The saved operation is (0, 0, 2); the friendly-label operation is (A, B, B).

04 / A second kind of small system

Same stopping time.
Same result?

Four exact machine pairs

A Turing machine reads a cell, follows a rule, and may write or move. Compare two encodings on a blank tape: stopping together can still leave different tape contents or head positions.

Loading the saved machine comparisons…

05 / A plan that adapts

Can one reply block every route?

Snaky · family 187

Maker tries to build a six-square shape while Breaker claims squares in the way. Follow one complete play on the exact finite board, with the available continuation and remaining move bound shown at every turn.

Follow the Snaky strategy →

The recorded play illustrates one branch. The separate Lean theorem gives a guarantee within 21 Maker claims against every legal reply under the formal game rules.

06 / Methods and verification

Enumeration checks and exact Lean proof scope.

01

Computed and independently checked

The atlas enumerates representable grouping families through four objects. A separate verifier checks the saved grouping families, minima, renaming classes, and abstract shapes. The browser also checks grouping examples directly.

Query the atlas and its claim records ↗
02

Formal proofs have a precise scope

The repository’s Lean bridge covers the exact saved N5 and B3 graphs and their upstream criterion. Atlas entries carry computational evidence; the Lean record specifies which constructions have formal proofs.

Read the Lean verification record ↗
03

Source: OpenAI Math, family 206

The original graph search applies a criterion selected from family 206. This atlas explores the finite algebras and grouping patterns around that work.

See the exact claims and boundaries ↗
Reproduce the atlas and inspect its source record

Run these commands from a checkout of the repository. Browsing this page explores saved data; it does not rerun the exhaustive search or Lean.

python scripts/build_atlas_data.py --check
python scripts/check_atlas.py --check-receipt evidence/atlas-review.json
python scripts/check_atlas.py --out runs/atlas-review.json
python scripts/query_atlas.py build-claims --check
python -m unittest discover -s scripts -p "test_atlas*.py" -v
node scripts/check_atlas_ui.cjs
node scripts/check_atlas_map.cjs
node scripts/check_atlas_selection.cjs

Source and generator hashes
Download the complete browser data ↓