Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + 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.

Gallai's modular decomposition theorem: a graph on at least two vertices is disconnected, or has a disconnected complement, or has a modular partition into its maximal proper modules whose quotient is prime

Statement

Let G be a finite simple graph with V(G)2. Then exactly one of the following holds.

  1. G is disconnected. The vertex sets of its connected components form a modular partition of G, and the quotient by that partition has no edge.
  2. G is disconnected. The anticomponents of G form a modular partition of G, and the quotient by that partition has every pair of distinct vertices as an edge.
  3. G and G are both connected. The maximal proper modules M(v), vV(G), form a modular partition of G with at least two parts, and the quotient by that partition is prime.

Facts & Assumptions

Given: A finite simple graph G with V(G)2.

[L1]

In a connected and anticonnected graph with at least two vertices, each vertex v lies in a largest proper module M(v), any two of these are equal or disjoint, and they cover V(G) (In a connected and anticonnected graph with at least two vertices, each vertex lies in a largest proper module, and two such modules are equal or disjoint).

[L2]

Every union of vertex sets of connected components is a module, with every outside vertex anticomplete to it, and every union of anticomponents is a module, with every outside vertex complete to it (Every union of connected components is a module, and so is every union of anticonnected components).

[L3]

Every finite graph with at least two vertices is connected or anticonnected (Every graph with at least two vertices is connected or anticonnected, Anticonnected graphs and anticonnected components).

[F1]

A modular partition of G is a set of nonempty, pairwise disjoint modules of G whose union is V(G); the quotient G/P has vertex set P, with distinct parts M,N adjacent exactly when (M,N) is a complete pair in G (Modular partitions and the quotient graph they define).

[L4]

For a modular partition P and XP, the set X is a module of G/P if and only if MXM is a module of G (For a modular partition, a set of parts is a module of the quotient exactly when the union of those parts is a module of the graph).

[F2]

G is prime when every module of G is trivial, the trivial modules being , the singletons and the whole vertex set (Prime graphs: those whose only modules are the trivial ones, Modules of a graph, and the trivial modules).

[L5]

The vertex sets of the connected components are nonempty, cover V(G), and any two are equal or disjoint; a graph is disconnected when it has a vertex and two of its vertices are joined by no path, and then it has at least two components (The connected components of a graph partition its vertex set and are its maximal connected subgraphs, Connected graphs and connected components defined by the existence of vertex paths).

[L6]

The anticomponents of G are exactly the vertex sets of the connected components of G, and they partition V(G) (The anticonnected components of G are exactly the connected components of G).

[L7]

Distinct connected components are anticomplete to one another, and distinct anticomponents are complete to one another (Distinct connected components are anticomplete, and distinct anticonnected components are complete).

Proof

technique · cases
1.1

By [L3] the graph is connected or anticonnected, so it is not the case that both G and G are disconnected; the three listed situations are therefore mutually exclusive, and they are exhaustive because G is disconnected, or G is disconnected, or both are connected.

L3
1.2

First case: G is disconnected. By [L5] the vertex sets of its components are nonempty, pairwise disjoint and cover V(G), and by [L2] each is a module, so they form a modular partition P.

assume-case discL2L5F1
1.3

Second case: G is disconnected, that is, G is not anticonnected. By [L6] the anticomponents are nonempty, pairwise disjoint and cover V(G), and by [L2] each is a module, so they form a modular partition Q.

assume-case codiscL2L6F1
1.4

Third case: G and G are both connected, so G is connected and anticonnected. By [L1] the sets M(v) are proper modules, pairwise equal or disjoint, and cover V(G); they are nonempty since vM(v), so the distinct ones form a modular partition R.

assume-case bothL1F1
2.1

In the first case, distinct components are anticomplete to one another by [L7], so no pair of distinct parts of P is complete and the quotient G/P has no edge.

step 1.2L7F1
2.2

In the second case, distinct anticomponents are complete to one another by [L7], so every pair of distinct parts of Q is complete and every pair of distinct vertices of G/Q is an edge.

step 1.3L7F1
2.3

In the third case R has at least two parts: a single part would be M(v)=V(G) for some v, contradicting that M(v) is proper.

step 1.4L1F1
3.1

Still in the third case, let X be a module of G/R that is neither nor R, and put U=MXM. By [L4] the set U is a module of G, and UV(G) because some part outside X is nonempty and disjoint from U, so U is a proper module.

step 1.4step 2.3L4F1
4.1

Choose MX, possible because X, and xM, possible because parts are nonempty. Then M=M(u) for some u, and M(x) meets M(u) at x, so M(x)=M by [L1]; the set U is a proper module containing x, so maximality gives UM(x)=M. Every MX therefore satisfies MM, and a part distinct from M is disjoint from M and nonempty, so no such part lies in X: that is, X={M}.

step 3.1L1F1choose
5.1

So in the third case every module of G/R is , a singleton or all of R, that is, G/R is prime; with steps 1.1, 2.1, 2.2 and 2.3 this proves all three clauses and their mutual exclusion.

step 1.1step 2.1step 2.2step 2.3step 4.1F2cases-exhaustive

Depends on

Used by

Dependency tree · two levels

28 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