Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

Assuming choice, two paracompact lower-limit lines can have a nonparacompact product

Statement refuted

Assuming the Axiom of Choice, a product of paracompact spaces is paracompact.

Facts & Assumptions

Given: The lower-limit line L under the Axiom of Choice.

[L1]

The lower-limit line is regular and Lindelöf; under countable choice every regular Lindelöf space is paracompact (The lower-limit line has a clopen basis, is regular, and is Lindelöf under countable choice, Under countable choice, every regular Lindelöf space is paracompact).

[L3]

The product of Hausdorff spaces is Hausdorff (Arbitrary products preserve T0, T1, and Hausdorffness).

[L4]

A paracompact Hausdorff space is normal (Every paracompact Hausdorff space is normal).

Counterexample

technique · direct
1.1

By [A1] and [L1], both factors L are paracompact.

A1L1
2.1

If L2 were paracompact, [F1] and [L3] would make it Hausdorff, and [L4] would then make it normal, contradicting [L2].

F1L2L3L4step 1.1
3.1

Thus two paracompact spaces have a nonparacompact product, refuting the displayed assertion.

step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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