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 , a family of many below- subsets has a -sized delta subsystem.
Facts & Assumptions
Given: AC and the stated cardinal hypotheses.
Delta systems and roots fixes the common-root conclusion.
Transfinite recursion supplies the recursive thinning.
Proof
Well-order the family as . 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 .
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 has unbounded values; let be least. For every the coordinate values are bounded, and regularity gives Recursively choose for so that exceeds and every element of the earlier chosen sets. The unboundedness of the th values makes each choice possible. Consequently distinct chosen sets meet only below .
There are at most possible intersections . Regularity therefore yields a set of size on which this intersection is one fixed . Step 1.2 then gives for distinct . AC was used to well-order, enumerate, choose recursively, and thin.
Suppose now that is regular, , and . For every , a function uses fewer than members of the union ; regularity bounds all their lengths below one . Coding the function by a binary array of size below shows . Thus , and for one has . The main clause applies.