Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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.

In a connected and anticonnected graph, the union of two proper modules that meet is again a proper module

Statement

Let G be a finite simple graph that is both connected and anticonnected, and let M,N be proper modules of G with M∩N≠∅. Then M∪N is a proper module of G.

Facts & Assumptions

Given: A connected and anticonnected finite simple graph G, and proper modules M,N of G with M∩N≠∅.

[F1]

M is a module of G when the pair ({v},M) is pure for every v∈V(G)∖M, and M is proper when M≠V(G) (Modules of a graph, and the trivial modules).

[L1]

The union of two modules with a common vertex is a module (The union of two modules with a common vertex is a module).

[L2]

In a connected graph, if M is a module with ∅≠M≠V(G), then some vertex outside M is complete to M (In a connected graph, some vertex outside a nonempty proper module is complete to it).

[L3]

A vertex set is a module of G if and only if it is a module of G‾ (A vertex set is a module of G exactly when it is a module of G‾).

[L4]

For a module N of G: for all p,q∈N and all x∈V(G)∖N, xp∈E(G) if and only if xq∈E(G) (Three equivalent descriptions of a module: purity of every outside vertex, equality of outside neighbourhoods, and indistinguishability of the members).

[F3]

A disjoint pair is complete when every cross pair is an edge and anticomplete when no cross pair is an edge; distinct vertices are adjacent in G‾ exactly when they are not adjacent in G (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs, Graph isomorphisms, automorphisms and graph complements).

Proof

technique · contradiction
1.1L1assume-contragiven

The set M∪N is a module of G by [L1], since M∩N≠∅. Suppose for contradiction that M∪N=V(G).

1.2F1given

The set M is nonempty, since it contains a vertex of M∩N, and M≠V(G) because M is proper.

2.1step 1.1F1

If M∖N were empty then M⊆N, so N=M∪N=V(G) by step 1.1, which is false because N is proper; hence M∖N≠∅, and V(G)∖M=N∖M, again by step 1.1.

2.2step 1.2L2given

Since G is connected and M is a module with ∅≠M≠V(G), some vertex v∈V(G)∖M is complete to M.

2.3step 1.2L2L3F2F3

The set M is a module of G‾ as well, and G‾ is connected with the same vertex set as G, so some vertex v′∈V(G)∖M is complete to M in G‾; that is, v′ is adjacent in G to no vertex of M.

3.1step 2.1step 2.2step 2.3L4choose

Choose x∈M∖N. Then x∉N, while v and v′ both lie in V(G)∖M=N∖M⊆N, so [L4] applied to the module N gives that xv∈E(G) if and only if xv′∈E(G).

4.1step 1.1step 3.1F3discharge-contradiction∎

But v is complete to M and x∈M, so xv∈E(G), while v′ is adjacent to no vertex of M, so xv′∉E(G); this contradicts step 3.1. Hence M∪N≠V(G), and being a module it is a proper module.

Depends on

Used by

Dependency tree · two levels

20 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