Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

K3K_3 has ν(K3)=1<2=τ(K3)\nu(K_3)=1<2=\tau(K_3), so König's equality needs bipartiteness

Counterexample

In the triangle K3K_3, every matching has at most one edge, while every vertex cover has at least two vertices. Hence ν(K3)=1<2=τ(K3)\nu(K_3)=1<2=\tau(K_3).

Facts & Assumptions

Given: The complete graph K3K_3 on three vertices.

[L1]

Verification

Verification technique: direct.

1.1

Any two edges of K3K_3 share a vertex, so a matching has at most one edge; any one edge gives ν(K3)=1\nu(K_3)=1.

given
1.2

Deleting one vertex leaves an edge, so one vertex is not a cover; two vertices cover all edges, giving τ(K3)=2\tau(K_3)=2.

1.3

Thus ν(K3)<τ(K3)\nu(K_3)<\tau(K_3), and [L1] shows precisely why this does not contradict König's theorem: K3K_3 is not bipartite.

L1
2.1

This triangle is a finite witness that bipartiteness is a necessary hypothesis for the equality.

step 1.1step 1.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 13 results over 6 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.