Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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 polynomial homogeneous set in the auxiliary pattern yields a y4-restricted union

Statement

Let y∈(0,12), let c∈(0,1), and let a≥5/c+1. Let B=(B1,…,Bℓ) be a blockade in a finite graph G such that:

  1. ℓ≥y−a;
  2. all blocks have the same size;
  3. for every distinct i,j∈[ℓ], either Bi is complete to Bj, or both Bi is ya-sparse to Bj and Bj is ya-sparse to Bi.

Let I⊆[ℓ] satisfy ∣I∣≥yℓ, and let J be the graph on I defined by

ij∈E(J)⟺Bi is complete to Bj.

If J has a clique or stable set R⊆I with ∣R∣=r≥∣I∣c, then the induced subgraph on

S:=⋃i∈RBi

is y4-restricted and has at least the common block size of the selected blocks.

Facts & Assumptions

Given: The graph G, the blockade B, the subset I, the auxiliary graph J, and the homogeneous set R⊆I from the Statement.

[L1]

A set is y4-restricted exactly when it is y4-sparse or y4-dense (c-sparse, c-dense and c-restricted vertex sets).

[L2]

If Bi is ya-sparse to Bj, then each vertex of Bi has at most ya∣Bj∣ neighbours in Bj (Sparsity of one vertex set to another, and weak sparsity of a pair).

[L3]

If Bi is complete to Bj, then every vertex of Bi is adjacent to every vertex of Bj (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).

Proof

technique · estimate the internal and external neighbour counts in the union of the selected equal-size blocks
1.1givenalgebra

Let m be the common block size. Since ∣I∣≥yℓ, ℓ≥y−a, and r≥∣I∣c, we have r−1≤∣I∣−c≤(yℓ)−c≤yc(a−1)≤y5.

1.2L2givenalgebra

Now suppose that R is a stable set in J. For any x∈Bi⊆S, the neighbours of x inside its own block contribute fewer than m=r−1∣S∣ vertices. If j∈R∖{i}, then ij∉E(J), so the pairs (Bi,Bj) are mutually ya-sparse and [L2] gives at most ya∣Bj∣ neighbours of x in Bj. Summing over all other selected blocks, x has at most r−1∣S∣+ya∑j∈R∖{i}∣Bj∣≤(r−1+ya)∣S∣ neighbours in S.

2.1step 1.1L1L3

First suppose that R is a clique in J. Then [L3] makes every two distinct selected blocks complete. For any x∈Bi⊆S, the only possible nonneighbours of x inside S lie in Bi, so x has fewer than m=r−1∣S∣ nonneighbours in S. Step 1.1 gives r−1∣S∣≤y5∣S∣≤y4∣S∣, so S is y4-dense and hence y4-restricted by [L1].

2.2step 1.1step 1.2L1algebra

Since a≥5/c+1 and y<12, step 1.1 yields r−1+ya≤y5+ya≤y5+y5≤y4. Hence every vertex of S has at most y4∣S∣ neighbours inside S, so S is y4-sparse and therefore y4-restricted by [L1].

3.1step 2.1step 2.2∎

Steps 2.1 and 2.2 show that whether R is a clique or a stable set, the union S is y4-restricted. Also ∣S∣=rm≥m, so S has at least the common block size.

Depends on

Used by

Dependency tree · two levels

9 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