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.

Dowker product characterization

Statement

Assume AC. For a T1 space X, the product X×[0,1] is normal if and only if X is normal and countably paracompact. The interval has its usual relative real topology and the product has the product topology.

Facts & Assumptions

Given: A T1 space X, K=[0,1], and AC. Closures of subsets of K are relative to K.

[F1]

A normal space is countably paracompact exactly when every decreasing closed sequence with empty intersection has open expansions with empty intersection (Increasing-cover and decreasing-closed-set criteria).

[F3]

Closed subspaces of normal spaces are normal (Every closed subspace of a normal space is normal).

[F4]

Normality gives open V with A⊆V⊆V‾⊆U whenever A is closed and contained in open U (A space is normal if and only if every closed A inside an open U admits an open V with A⊆V⊆V‾⊆U).

[F5]

A locally finite union has closure equal to the union of the closures; taking closures preserves local finiteness (Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed).

[F6]

Every open cover of a closed bounded real interval has a finite subcover (Heine-Borel by bisection: every closed bounded interval [a,b] is compact, proved there by canonical bisection).

[F8]

For every real r there is a natural number greater than r (Every complete ordered field is Archimedean, applied to R).

[A1]

AC supplies choices from sets of nonempty witness sets (The Axiom of Choice).

Proof

1.1F6F2A1

The interval K is compact also for relative open covers: write each relative open set as K∩O with O real-open, and apply F6 to the resulting real-open cover. One can use all possible O with a specified trace, so this needs no choice. A closed subset L of K is compact: adjoin K∖L to any relative open cover and then remove that member from a finite subcover. For any compact space L and closed C⊆X×L, its projection to X is closed. Indeed, if x is outside the projection, for each t∈L the product basis gives a rectangle Ut×Vt about (x,t) missing C. Using AC to select these rectangles, finitely many Vt cover L, and their corresponding finite intersection of Ut is an open neighborhood of x missing the projection. If L is empty, the projection is empty and the empty intersection is X.

1.2F2F3F4

Suppose X×K is normal. The slice X×{0} is closed and its projection to X is a homeomorphism: a relative basic rectangle on the slice is either empty or U×{0}, with U open in X. By closed heredity X is normal. Given closed Fn⊇Fn+1 with ⋂n≥1Fn=∅, put D=⋃n≥1(Fn×[2−n,1]). This is closed: at a point outside D, choose N with x∉FN. The neighborhood (X∖FN)×K misses every strip with n≥N; intersect it with the complements of the finitely many earlier closed strips. This remains an open neighborhood avoiding D. Also D misses the closed slice at zero. Normal shrinking gives an open V containing that slice with V‾∩D=∅.

2.1step 1.2F2F8F1

In the setting of step 1.2, define Gn={x:(x,2−n)∉V‾}. The fixed-height inclusion is continuous by the rectangle basis, so Gn is open, and Fn⊆Gn because Fn×{2−n}⊆D. For each x, a rectangle about (x,0) inside V contains (x,t) for all sufficiently small t≥0. The inequality 2n≥n+1 follows by induction, and F8 therefore gives 2−n→0. Consequently (x,2−n)∈V for all sufficiently large n, whence x∉Gn then. Thus ⋂nGn=∅, and F1 applied to the normal space from step 1.2 gives countable paracompactness.

2.2F8step 1.1

We next prepare the converse. Dyadic intervals form a countable real basis, directly from F8. Given x∈R and ε>0, choose n with 2−n<ε/4, using 2n≥n+1 and F8. There is an integer k with k≤2nx<k+1: F8 gives integer bounds on 2nx in both directions, and the finite set of integers between those bounds and at most 2nx has a greatest element. Then x lies in ((k−1)2−n,(k+2)2−n), whose closed endpoints are within ε of x. All dyadic intervals with endpoints k2−n and l2−n, where k<l are integers, form a countable family: enumerate triples (n,k,l) by increasing n+∣k∣+∣l∣, each level finite. Finite subsets of this enumerated family are countable by encoding the finite index set E as ∑i∈E2i. Enumerate as (Bj)j<ω all finite unions of their traces on K, including ∅ and K. If disjoint closed sets P,Q⊆K are given, each t∈P has a relative interval neighborhood whose closure misses Q: choose ε>0 with (t−ε,t+ε)∩K⊆K∖Q, and use the dyadic interval just constructed, whose closure lies inside that neighborhood. Compactness of P from step 1.1 gives finitely many such intervals covering it. Their union is some Bj with P⊆Bj and Bj‾∩Q=∅. If P is empty use Bj=∅; if Q is empty one may use Bj=K.

3.1step 1.1step 2.2F2F1

Suppose now that X is normal and countably paracompact, and let F,G be disjoint closed subsets of X×K. Their fibers Fx,Gx are closed in K because fixed-coordinate inclusions are continuous by F2. Put Oj={x:Fx⊆Bj and Gx∩Bj‾=∅}. The complement of Oj is the union of the projections of F∩(X×(K∖Bj)) and G∩(X×Bj‾). Both projections are closed by step 1.1, since their compact factors are closed in K. Hence Oj is open; the fiber separation in step 2.2 shows these sets cover X. Take a locally finite open refining cover R and assign each R its least index a(R) with R⊆Oa(R). Set Vj=⋃{R:a(R)=j}. These sets form a countable open cover and Vj⊆Oj. Near a point only finitely many R meet a fixed neighborhood, so only their finitely many assigned Vj can meet it. Thus (Vj) is locally finite even as an indexed family.

4.1step 3.1F4A1F5

Shrink this locally finite cover as follows. After Wi for i<j have been defined, put Aj=X∖(⋃i<jWi∪⋃i>jVi). Inductively the earlier Wi together with Vi for i≥j cover X, initially because (Vi) covers, so the closed set Aj lies in Vj. Choose open Wj with Aj⊆Wj⊆Wj‾⊆Vj by F4. This replacement preserves that covering invariant. AC fixes a choice function on all nonempty sets of open shrinking witnesses in X, so ordinary recursion makes the choices simultaneously. If a point missed every Wj, the finite nonempty set {j:x∈Vj} would have a largest index j; that point would lie in Aj⊆Wj, a contradiction. Thus (Wj) covers. Because Wj⊆Vj, this family and, by F5, its closures are locally finite.

5.1step 4.1step 3.1step 2.1F2F5

Put H=⋃j(Wj×Bj). It is open by the rectangle basis. If (x,t)∈F, choose j with x∈Wj; then x∈Oj and t∈Fx⊆Bj, so (x,t)∈H. The rectangles form a locally finite family because a neighborhood N in X meeting only finitely many Wj gives N×K with the same property. Also Wj×Bj‾=Wj‾×Bj‾: every basic rectangle about a pair of closure points meets the product, whereas outside either closure a rectangle misses it. By F5, H‾=⋃j(Wj‾×Bj‾). If (x,t) belongs to one of these products, then x∈Vj⊆Oj and t∈Bj‾, so (x,t)∉G. Hence H and (X×K)∖H‾ are disjoint open neighborhoods of F and G, proving normality. If X is empty, both sides of the asserted equivalence hold by the empty covers and empty separation; the constructions also allow empty fibers and shrinking sets. Together with step 2.1 this proves both directions. QED.

Depends on

Used by

Dependency tree · two levels

37 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