Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Increasing-cover and decreasing-closed-set criteria

Statement

Assume AC. For any space X the following are equivalent, with indices in ω:

  • (i) X is countably paracompact.
  • (ii) Every increasing open cover (Un) has closed sets CnUn such that X=nintCn.
  • (iii) Every decreasing closed sequence (Fn) with empty intersection has open sets GnFn such that nGn=.

If X is normal, these are also equivalent to (iv): every such (Fn) has open expansions GnFn with nGn=.

Facts & Assumptions

Given: A topological space X, and AC. Normality is assumed only for (iv) implying (iii).

[F1]

Countable paracompactness supplies a locally finite open refining cover, including its covering condition (Countable paracompactness and Dowker spaces).

[F2]

In a normal space a closed A inside an open U admits open H with AHHU (A space is normal if and only if every closed A inside an open U admits an open V with AVVU).

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

1.1

Assume (i), and let (Un) be an increasing open cover. Take a locally finite open refining cover R. For each RR let a(R) be the least n with RUn, and set Cn=X{R:a(R)>n}. This is closed. If xCn, some R contains x because R covers; necessarily a(R)n, so xUn. If xX, choose an open neighborhood meeting only finitely many members of R. At least one meets it because x is covered. The maximum N of their assigned indices exists, and the neighborhood is contained in CN. Thus the interiors cover and (ii) holds. All index assignments are least natural numbers, without choice.

F1construct
1.2

Assume (ii) and let (On) be any countable open cover; finite nonempty covers can be extended by empty entries. Put Un=inOi, obtain closed CnUn as in (ii), and replace Cn by Dn=inCi. Then Dn is closed and increasing, is contained in Un, and its interiors cover. With D1= put Vn=UnDn1. For each x, the least n with xDn gives xVn, so these open sets cover. If a neighborhood Nx lies in DN, it misses every Vn with nN+1. The family {VnOi:in<ω} covers X, refines (On), and near x has at most nN(n+1) possibly meeting indexed members. It is the locally finite open refining cover required for (i). If the original cover is empty, X is empty and its empty refining cover suffices.

F1construct
1.3

Complementation proves (ii) implies (iii): given decreasing closed Fn with empty intersection, use Un=XFn, and put Gn=XCn. Then FnGn and nGn=XnintCn=. Conversely, given increasing Un covering X, put Fn=XUn, take the expansions of (iii), and set Cn=XGn. These are closed subsets of Un, and the same identity says their interiors cover. The identity uses XC=XintC, which follows because a point has a neighborhood contained in C exactly when it is outside that closure.

givenalgebra
2.1

Condition (iii) implies (iv), since GnGn. Suppose now that X is normal and (iv) holds. For a given decreasing closed sequence with empty intersection, take its open expansions Gn with empty intersection. For each n, the closed set Fn lies in the open Gn, so normal shrinking provides an open Hn with FnHnHnGn. AC selects these witnesses for all n simultaneously. Hence nHnnGn=, proving (iii). Steps 1.1–1.3 prove the other equivalences; empty sets cause no exception to these inclusions. QED.

F2A1step 1.1step 1.2step 1.3

Depends on

Used by

Dependency tree · two levels

10 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