Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 indexed delta-system lemma

Statement

In ZFC, for any family (aξ)ξ<ω1 of finite sets, there are an uncountable J⊆ω1 and a finite set r such that aξ∩aη=r whenever ξ,η∈J are distinct. The sets aξ may repeat.

Facts & Assumptions

Given: The indexed family above; assume AC, including countable choice.

[F1]

The finite delta-system theorem applies to a family of κ distinct finite sets at regular uncountable κ. The finite delta-system lemma at a regular uncountable cardinal

[F2]

Under countable choice a countable union of countable sets is countable. Countable unions of at most countable sets, assuming ACω

[F4]

The indexed delta condition allows repeated values. Delta systems and roots

[A1]

Proof

1.1givenF4

If some finite set a has uncountable fiber J={ξ:aξ=a}, put r=a. For distinct ξ,η∈J one has aξ∩aη=a∩a=a. This includes the case a=∅.

2.1F2A1step 1.1

Otherwise every fiber is countable. Let A={aξ:ξ<ω1}. If A were countable, enumerate its values and apply F2 to their countable fibers; their union is all of ω1, which is uncountable. Hence A is uncountable. The map a↦m(a)=min⁡{ξ:aξ=a} injects A into ω1, so ∣A∣=ℵ1. AC supplies the countable choice used in F2; the least-index map itself needs no choices.

3.1F1F3F4A1step 1.1step 2.1∎

Every ordinal below ω1 is countable; F3 therefore excludes every cofinal subset of cardinality below ℵ1. Thus ℵ1 is regular, and F1 gives an uncountable delta subsystem B⊆A with finite root r. Set J={m(a):a∈B}. The map m is injective, so J is uncountable, and distinct indices in J represent distinct members of B, whose intersection is r. Together with the repeated-value alternative this proves the indexed assertion.

Depends on

Used by

Dependency tree · two levels

26 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