Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

G-invariant block systems are exactly the invariant equivalence relations

Statement

Let G act on a set Ω.

  1. If B is a G-invariant partition of Ω into blocks, then the relation xBy defined by “x and y lie in the same member of B” is a G-invariant equivalence relation.
  2. If is a G-invariant equivalence relation on Ω, then its equivalence classes form a G-invariant block system.

Here G-invariance of a partition means that gB is again a member of the partition for every part B and every gG.

Facts & Assumptions

Given: A left action of G on Ω.

[L1]

A block system is a partition of Ω into blocks, and a block B satisfies: for every gG, either gB=B or (gB)B= (Blocks and block systems for a group action).

Proof

technique · direct
1.1

For the forward direction, let B be a G-invariant partition into blocks. The relation B is reflexive because every point lies in its own part, symmetric because “lying in the same part” is symmetric, and transitive because two parts that meet are equal.

L1given
1.2

For the converse direction, let be a G-invariant equivalence relation. Its equivalence classes partition Ω: every point lies in its own class, and two classes that meet are equal because symmetry and transitivity identify every element of one with every element of the other.

givenalgebra
1.3

For the converse direction, fix an equivalence class C=[x]. Invariance gives gC=[gx] for every gG, so G permutes the equivalence classes. In particular, if (gC)C, the two equivalence classes are equal; otherwise they are disjoint. Thus every class is a block and the class partition is G-invariant.

givenalgebra
2.1

For the forward direction, if xBy and both lie in a part B, then gx and gy lie in the part gB of the same partition by its G-invariance. Thus B is G-invariant.

step 1.1given
3.1

Step 1.3 shows that the equivalence classes form a G-invariant block system, and steps 1.1 and 2.1 give the converse construction.

step 1.1step 2.1step 1.2step 1.3

Depends on

Used by

Dependency tree · two levels

2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources