Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 singleton Bird family is generalized nice

Statement

The singleton finite family {Bird} is generalized nice.

Facts & Assumptions

Given: The singleton family {Bird}.

[L1]

The singleton family {Bird} has property (∗), with its special-vertex comb trigger in co-Bird-free graphs (The singleton Bird family has property (*)).

[L2]

The singleton family {Bird} is leaf-reducible: deleting the added leaf w from Bird gives the bull, and the reduced singleton family has the Erdős-Hajnal property (The E-graph and Bird singleton families are leaf-reducible).

[L3]

If a finite family has property (∗) and is leaf-reducible, then it is generalized nice (Property (*) and leaf reducibility imply generalized niceness).

[L4]

Generalized niceness of a finite family F is the four-outcome schema quantified over F‾-free graphs (Generalized nice finite graph families).

[L5]

Property (∗) for a finite family F is a condition on F‾-free graphs, and leaf-reducibility asks that deleting one leaf from one member produce a family with the Erdős-Hajnal property (Property (*) for a finite graph family, Leaf-reducible finite graph families).

[L6]

co-Bird is the complement of the Bird graph (The Bird graph and co-Bird).

Proof

technique · direct specialization of the property-$(*)$-plus-leaf-reducibility implication to the family $\{\mathrm{Bird}\}$
1.1

The family {Bird} satisfies both hypotheses of [L3]: property (∗) by [L1] and leaf-reducibility by [L2].

L1L2L5
2.1

Applying [L3] to the finite family {Bird} gives that {Bird} is generalized nice.

step 1.1L3
3.1

The ambient class of that generalized-niceness condition is the class of graphs free of {Bird}‾={co-Bird} by [L4] and [L6], and step 2.1 is exactly the assertion of the statement.

step 2.1L4L6∎

Remarks

  • This is the direct specialization of the source's Lemma 4.5 to F={Bird}; the companion E corollary is the analogous specialization to {E}, and the two are independent instances of the same published implication.
  • No Choice. The argument is finite and makes no selection from a family of nonempty sets.

Depends on

Used by

Dependency tree · two levels

32 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