Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-02
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.

The middle edge of P4 is a maximal matching but the two end edges form a larger matching

Counterexample

Let P4 have consecutive vertices 1,2,3,4 and let M={23}. Then M is maximal but not maximum: {12,34} is a matching of size two.

Facts & Assumptions

Given: The path P4 and its middle-edge matching M={23}.

[L1]

A matching is maximum exactly when it has no augmenting path (Berge's theorem: a matching is maximum if and only if it has no augmenting path).

Verification

Verification technique: direct.

1.1

The two remaining edges 12 and 34 each meet 23, so neither can be added to M; hence M is maximal.

given
1.2

The path 1,2,3,4 is M-augmenting, and [L1] therefore also shows that M is not maximum.

L1
2.1

Independently, {12,34} is a disjoint two-edge matching, so the maximal and maximum notions differ in this finite path.

step 1.1step 1.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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.