Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)
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 long blockade has a wide support-invariant, support-uniform minor

Statement

For integers k,τ≥1 and 0<κ≤1, some integer K≥k has the following property. Every blockade B of length at least K and width W has an equicardinal minor of length k and width at least κ2KττW which is τ-support-uniform and (κ,τ)-support-invariant.

Facts & Assumptions

Given: k,τ,κ and B as in the Statement. We may discard surplus blocks and take its length to be exactly K.

[L1]

Finite uniform Ramsey guarantees, for any finite coloring of the s-subsets of a sufficiently large index set, a prescribed-size monochromatic subset (For positive k,c,r there is an N such that every c-colouring of [N]k has a monochromatic r-element set).

Proof

technique · finite trace-cost descent followed by iterated finite Ramsey
1.1

List the finitely many ordered trees on at most τ vertices. By repeated application of [L1], one tree at a time, choose K large enough that every K-block blockade has a k-block sub-blockade whose trace is monochromatic for every tree on this list. This is a backward iteration of finitely many finite Ramsey numbers; when an order has fewer than s blocks, its s-vertex trace is empty.

L1choose
1.2

For this K, there are at most ττ ordered-tree types on at most τ vertices: root each tree at its first ordered vertex; for size s the parent map on the other s−1 ordered positions has at most ss−1 possibilities, and ∑s=1τss−1≤ττ. Each trace has at most 2K supports. Thus the sum cτ of all trace cardinalities is an integer in [0,M], where M=2Kττ.

algebra
2.1

Start by trimming all blocks to width W. Choose the largest integer t∈[0,M] for which an equicardinal contraction C of the original K-block blockade has width at least κtW and cτ(C)≤M−t. Such a t exists because t=0 works. If C were not (κ,τ)-support-invariant, some contraction of it of width at least κwidth⁡(C) would remove a support from the trace of an ordered tree of size at most τ. Trim its blocks to equal size. Trimming can only remove further supports, so the new equicardinal contraction has width at least κt+1W and cost at most M−t−1. This contradicts maximality of t. Hence C is invariant and has width at least κMW.

step 1.2choose
3.1

Apply the Ramsey choice of step 1.1 to C: for each ordered tree J of size s≤τ, color every s-subset of block indices by whether it belongs to its trace, and successively retain a monochromatic sub-blockade. Keep exactly k blocks. Each trace is empty or contains every s-subset, so this minor is τ-support-uniform.

step 1.1step 2.1
4.1

Support-invariance survives taking a sub-blockade: extend any contraction of the sub-blockade to the discarded blocks unchanged; since all original blocks of C have the same size, the extended contraction retains at least the same κ fraction of its width. A copy on retained indices survives in the extended contraction if and only if it survives in the restricted one. Thus the sub-blockade is also (κ,τ)-support-invariant, equicardinal, and retains the width lower bound from step 2.1.

step 2.1step 3.1∎

Depends on

Used by

Dependency tree · two levels

10 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