Alphabeta Math
TheoremStatement: 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.

Under MA(aleph_1), arbitrary products of ccc spaces are ccc

Statement

In ZFC, MA(1) implies the product of two ccc spaces is ccc and consequently every product of ccc spaces is ccc.

Proof

1.1

To prove the Knaster consequence, let {pα:α<ω1} lie in a ccc order. Some p has the property that every extension of p is compatible with uncountably many pα. Otherwise, for each α choose qαpα compatible with only countably many of the pβ, and choose a bound bα<ω1 above all their indices. Recursively select αξ above every earlier bαη. Then for η<ξ, qαη is incompatible with pαξ and hence with qαξ, producing an uncountable antichain, contrary to ccc. Below p, each Dξ={q:αξ,qpα} is dense open. Let an MA filter meet all Dξ. For each ξ, select qξ in the filter and αξξ with qξpαξ. The indices αξ are unbounded, hence yield uncountably many distinct pαξ; any two are compatible because directedness gives a common extension of their corresponding qξ. Thus the order is Knaster.

F4
2.1

Given uncountably many nonempty rectangles Uα×Vα in X×Y, order the nonempty open subsets of X by reverse inclusion. step 1.1 thins the Uα to an uncountable pairwise-intersecting family. Since Y is ccc, two corresponding Vα,Vβ intersect; the two rectangles then intersect. Thus binary, and by induction every finite, product is ccc.

F1step 1.1
3.1

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 ω1 opens with pairwise distinct finite supports, as required by F3, and apply F3 to obtain a delta system with finite root r. Their root projections form an uncountable family in the finite product over r, which is ccc by step 2.1, so two root projections intersect. Outside r 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.

F2F3step 2.1

Depends on

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