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.
Under MA(aleph_1), arbitrary products of ccc spaces are ccc
Statement
In ZFC, implies the product of two ccc spaces is ccc and consequently every product of ccc spaces is ccc.
Facts & Assumptions
Given: AC and .
The countable chain condition: every pairwise-disjoint family of nonempty open sets is at most countable gives the topological and open-set form of ccc.
The finite delta-system lemma at a regular uncountable cardinal thins their supports.
Martin's Axiom at a cardinal and Martin's Axiom is used through the standard consequence that every ccc order is Knaster.
Proof
To prove the Knaster consequence, let lie in a ccc order. Some has the property that every extension of is compatible with uncountably many . Otherwise, for each choose compatible with only countably many of the , and choose a bound above all their indices. Recursively select above every earlier . Then for , is incompatible with and hence with , producing an uncountable antichain, contrary to ccc. Below , each is dense open. Let an MA filter meet all . For each , select in the filter and with . The indices are unbounded, hence yield uncountably many distinct ; any two are compatible because directedness gives a common extension of their corresponding . Thus the order is Knaster.
Given uncountably many nonempty rectangles in , order the nonempty open subsets of by reverse inclusion. step 1.1 thins the to an uncountable pairwise-intersecting family. Since is ccc, two corresponding intersect; the two rectangles then intersect. Thus binary, and by induction every finite, product is ccc.
In an arbitrary product, refine an alleged uncountable disjoint family to basic opens with finite supports. If one support occurs uncountably often, those opens project to an uncountable family in its finite ccc product; two projections intersect, and the corresponding basic opens intersect. Otherwise thin to opens with pairwise distinct finite supports, as required by F3, and apply F3 to obtain a delta system with finite root . Their root projections form an uncountable family in the finite product over , which is ccc by step 2.1, so two root projections intersect. Outside their supports are disjoint; choose points in their finitely many constrained coordinates and use an AC-chosen base point in every remaining nonempty factor to obtain a point in both basic opens, contradiction. AC supplies that base point as well as the refinements and thinning. If a factor is empty, the whole product is empty and hence ccc.
Depends on
- Martin's Axiom at a cardinal and Martin's Axiom
- The countable chain condition: every pairwise-disjoint family of nonempty open sets is at most countable
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- The finite delta-system lemma at a regular uncountable cardinal
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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
- Karagila, Forcing & Symmetric Extensions, Theorem 7.8 and Lemma 7.9 (standard reference, not scraped)