Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

A tau-critical graph has no wide pure blockade with cograph pattern

Statement

Let τ>0, and let G be a τ-critical graph. Then for every integer t>0, there is no pure blockade in G with cograph pattern, of length t and width at least V(G)t1/τ, such that each block is a proper subset of V(G).

Facts & Assumptions

Given: A real τ>0, a τ-critical graph G, and an integer t>0.

[L1]

A τ-critical graph satisfies κ(G)<V(G)τ, while every proper induced subgraph H satisfies κ(H)V(H)τ (A tau-critical graph).

[L2]

A pure blockade with cograph pattern has additive κ on its support (A pure blockade with a cograph pattern has additive kappa).

[L3]

If XV(G), then every clique or stable set in G[X] is also one in G, so κ(G)κ(G[X]) (Subgraphs, induced subgraphs and spanning subgraphs, The parameter kappa(G)=alpha(G)omega(G), Cliques, stable sets, the clique number ω(G) and stability number α(G)).

[L4]

For positive reals, (ab)r=arbr and (ar)s=ars (The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).

[F1]

If a blockade has width w, then each of its blocks has cardinality at least w (Blockades, their length, their width, and their support).

Proof

technique · contradiction
1.1

Suppose for contradiction that B=(B1,,Bt) is a pure blockade in G with cograph pattern, length t, width at least V(G)t1/τ, and each Bi a proper subset of V(G). By [L1], each proper induced subgraph G[Bi] satisfies κ(G[Bi])Biτ. Since each block has size at least the width, [F1] gives BiV(G)t1/τ>0, so [L5] and [L4] yield κ(G[Bi])Biτ(V(G)t1/τ)τ=V(G)τt1 for every i.

L1L4L5F1givenassume-contra
2.1

Let X:=V(B)=B1Bt. Applying [L2] to the blockade and then using step 1.1 yields κ(G[X])i=1tκ(G[Bi])i=1tV(G)τt1=V(G)τ. Then [L3] gives κ(G)V(G)τ, contradicting the first clause of [L1].

step 1.1L1L2L3
3.1

This contradiction proves that no such blockade exists.

step 2.1discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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