Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

The simple dichotomy for omega-one-generated ideals

Definition

Work in ZFC. Let S be uncountable. An ideal of countable subsets of S is a family I[S]ω that contains every finite subset of S and is closed under taking subsets and finite unions. For a,bS, write ab when ab is finite.

The ideal I is generated modulo finite by ω1 members if there are AξI for ξ<ω1 such that

aIu[ω1]<ω  aξuAξ

for every countable aS. This is equivalent to having an explicit family closed under finite unions: replace the displayed family by the sets ξuAξ for finite uω1. The resulting family has cardinality at most ω1 in ZFC; if an ω1-indexed family is desired, repeat members to pad the enumeration. Membership in I then means almost containment in one member of that family. No increasing sequence is asserted: an ideal need not contain the union of countably many of its members.

For XS:

  • X is inside I when [X]ωI;
  • X is outside, or orthogonal to, I when Xa<ω for every aI.

Equivalently, X is outside exactly when its intersection with every chosen generator is finite: one direction uses that generators belong to the ideal; the other uses the finite-union and finite-error formula above. Also IX={aX:aI} then consists only of finite sets.

The simple dichotomy for ω1-generated ideals is the assertion that for every such S and I, either some uncountable XS is inside I, or some uncountable XS is outside I. “Either” is inclusive: different witnesses can in principle satisfy the two clauses. One uncountable X cannot satisfy both in ZFC, because AC gives a countably infinite aX; inside gives aI, while outside says Xa=a is finite. This extraction of a is the only choice used in the definitional discussion. Empty and finite X are allowed by the two local predicates but are not witnesses to the dichotomy.

Depends on

Used by

Dependency tree · two levels

16 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