Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Generalized delta systems for small supports

Statement

In ZFC, let κ be infinite and θ>κ regular with ∣α∣<κ<θ for every α<θ. Every θ-sized family of sets of cardinality below κ has a θ-sized delta subsystem. In particular, if κ is regular and ρ=2<κ, a family of ρ+ many below-κ subsets has a ρ+-sized delta subsystem.

Proof

1.1F2

Well-order the family as ⟨xξ:ξ<θ⟩. Its union has cardinality at most θ⋅κ=θ, so transport its elements into θ. Since θ is regular and there are only κ<θ possible order types below κ, thin to constant order type η<κ and enumerate each remaining set increasingly as xξ={xξ(i):i<η}.

1.2F2F3

Fewer than θ members of the thinned family can lie wholly below any fixed α<θ, because there are only ∣α∣<κ<θ such sets. Its union is therefore unbounded in θ, so some coordinate i<η has unbounded values; let i0 be least. For every i<i0 the coordinate values are bounded, and regularity gives α0=sup⁡{xξ(i)+1:ξ<θ, i<i0}<θ. Recursively choose xξμ for μ<θ so that xξμ(i0) exceeds α0 and every element of the earlier chosen sets. The unboundedness of the i0th values makes each choice possible. Consequently distinct chosen sets meet only below α0.

2.1F1F2step 1.2

There are at most ∣α0∣<κ<θ possible intersections xξμ∩α0. Regularity therefore yields a set J⊆θ of size θ on which this intersection is one fixed r. Step 1.2 then gives xξμ∩xξν=r for distinct μ,ν∈J. AC was used to well-order, enumerate, choose recursively, and thin.

3.1F2∎

Suppose now that κ is regular, ρ=2<κ, and θ=ρ+. For every μ<κ, a function μ→ρ uses fewer than κ members of the union ρ=⋃ν<κν2; regularity bounds all their lengths below one ν<κ. Coding the function by a binary array of size below κ shows ρμ≤2<κ=ρ. Thus ρ<κ=ρ, and for α<θ one has ∣α∣<κ≤ρ<κ=ρ<θ. The main clause applies.

Depends on

Dependency tree · 2 levels

Sources