Alphabeta Math
Pipeline-generated
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.

PCF Scales and ZFC Dowker Spaces: Examples and Counterexamples

1 · Prerequisites

2 · Summary

The discrete-space calculation starts with a decreasing closed sequence whose open expansions have empty intersection. Rudin’s ordinal box space supplies the opposite behavior: its explicit initial-top points leave successive slices, yet the neighborhood obstruction prevents shrinking the whole sequence. The scale example constructs actual representatives, computes their first stages and takes a supremum of cofinality omega one. Finally the Rudin space witnesses the failure of normality under product with the closed unit interval. All three ordinal-space examples state their use of the Axiom of Choice.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

A countable shrinking computed

Example

In a discrete space every decreasing closed sequence (Fn) with empty intersection is its own open expansion: Gn=Fn has Gn‾=Fn. Explicitly, on discrete ω take Fn={m∈ω:m≥n} and Gn=Fn. No choice axiom is needed.

Facts & Assumptions

Given: A discrete space X (every subset is open), and decreasing closed Fn⊆X with empty intersection; in the displayed instance X=ω and Fn={m:m≥n}.

[F1]

Countable paracompactness asks for a locally finite open refining cover of each countable open cover (Countable paracompactness and Dowker spaces).

Verification

1.1givenalgebra

In a discrete space complements of subsets are open, so every subset is also closed. Thus Gn=Fn is open, contains Fn, and has Gn‾=Fn. Consequently ⋂nGn‾=⋂nFn=∅. The same equations hold when Fn or X is empty.

2.1F1step 1.1

For the instance on ω, F0=ω, F1=ω∖{0}, and Fn+1⊆Fn. For each m∈ω, m∉Fm+1, proving the empty intersection despite every Fn being nonempty. The singleton family {{m}:m∈ω} is an open refining cover of every open cover: a member containing m also contains {m}. The neighborhood {m} meets exactly one singleton, so the family is locally finite, verifying countable paracompactness directly. No simultaneous selection of cover members is involved. QED.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

A concrete Rudin slice

Example

Assume AC. Take B={2,3,4,…} and a natural number k. Define

hk(n)={ℵn2≤n≤k,ω1n>k.

Then hk∈XR(B) and lies in the initial-top slice Fk. For every l>k with l≥2, it does not lie in Fl. For instance h3=(ω2,ω3,ω1,ω1,…) belongs to F3∖F4.

Facts & Assumptions

Given: The displayed function and k<ω.

[F1]

Rudin points require uncountable coordinate cofinalities bounded strictly by some finite aleph (Rudin ordinal box spaces on infinite index sets).

[F3]

Fj imposes h(n)=ℵn on coordinates n≤j (Neighborhoods of Rudin initial-top slices contain tails).

[A1]

AC is assumed for F2 and the Rudin setting (The Axiom of Choice).

Verification

1.1F1F2A1

All coordinates of hk are in [0,ℵn]: the prefix equals its tops and the tail has ω1<ℵn since n≥2. By F2 and A1 their cofinalities are respectively ℵn and ℵ1. Set m=max⁡(k,1)+1. These cofinalities are above ω and strictly below ℵm, including for k=0,1 when the prefix is empty and m=2. F1 therefore gives hk∈XR(B).

2.1step 1.1F3

For every n≤k in B the defining value is ℵn, so F3 gives hk∈Fk. If l>k and l∈B, its l-th coordinate is ω1<ℵl, violating the equality required for Fl. At k=3, the first two coordinates are ω2,ω3, and the next is ω1<ω4, giving the asserted concrete instance. QED.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

A scale used in the Dowker subspace

Example

Assume AC and fix the normalized scale on its infinite coordinate set B. Starting above the concrete bound b(n)=0, the recursion below produces an actual point h∈X with cf⁡(h(n))=ω1 at every coordinate. The same calculation works for any prescribed b∈∏n∈Bℵn upon replacing the initial value 1 by b(n)+1.

Facts & Assumptions

Given: λ=ℵω+1 and the normalized scale (fα)α<λ; initially b(n)=0.

[F1]

The scale is strictly eventually increasing and cofinal, and Rudin points eventually equal to its terms form X (Kojman-Shelah scale subspace).

[F2]

Strictly increasing ω1-long product representatives with increasing scale indices have a coordinate supremum in the product, of cofinality ω1 at each coordinate and eventually equal to a scale term (Tail suprema and normalized scales, m=k=1).

[F5]

Specified rules admit transfinite recursion (Transfinite recursion).

[A1]

AC is assumed for regularity and the normalized-scale construction (The Axiom of Choice).

Verification

1.1F1F3F4F5A1

Given the earlier gη for η<ξ<ω1, define tξ(n)=sup⁡({1}∪{gη(n)+1:η<ξ}). By F3–F4 each countable supremum is below ℵn; thus tξ is in the strict product. The earlier indices are countable and bounded below λ by F3–F4. F1 supplies a scale term strictly eventually above tξ with index above all earlier indices, by cofinality followed by a later scale term if necessary. Let αξ be the least eligible index and put gξ(n)=max⁡(tξ(n),fαξ(n)). This is in the product, is eventually equal to fαξ, and is above every earlier gη pointwise. F5 now supplies the sequence by the specified rule. At stage zero, t0(n)=1 and g0(n)=max⁡(1,fα0(n))≥1>0. At stage one, t1(n)=g0(n)+1 and g1(n)≥g0(n)+1. These are the first two calculations of the instance.

2.1step 1.1F1F2

Set h(n)=sup⁡ξ<ω1gξ(n) and δ=sup⁡ξ<ω1αξ. The sequence in step 1.1 satisfies every hypothesis of F2, and n>1 for every n∈B, so its tail is the entire coordinate set. Therefore h(n)<ℵn, cf⁡(h(n))=ω1, δ<λ, and h=∗fδ. The cofinalities have uniform strict bound ℵ2, so h is a Rudin point and F1 gives h∈X. The calculation h(n)≥g1(n)>g0(n)≥1>0 verifies strict domination of the chosen zero bound.

3.1step 1.1step 2.1F3F4

For a prescribed b replace 1 in step 1.1 by b(n)+1. This value is below the limit cardinal ℵn, so the same countable-supremum and least-index arguments still apply. Then g0(n)≥b(n)+1>b(n) and the resulting supremum satisfies h(n)≥g0(n)>b(n) for every n. Thus the example exhibits the actual representative construction behind pointwise cofinality, with no choice of a member from a possibly empty scale class. QED.

False statementConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Normality need not survive product with the interval

Statement

False: Every normal T1 space X has normal product X×[0,1], with the ordinary product topology and usual real interval.

Facts & Assumptions

Given: We refute the assertion under AC.

[F1]

For infinite B⊆ω∖{0,1}, the Rudin space XR(B) is T1, normal and not countably paracompact (Rudin ZFC Dowker space and its size).

[F2]

For T1 spaces, normality of the interval product implies normality and countable paracompactness of the factor (Dowker product characterization).

[A1]

AC is assumed for both cited constructions (The Axiom of Choice).

Refutation

1.1F1A1

Set B={2,3,4,…} and take the specific witness X=XR(B). Explicitly its points are functions h(n)≤ℵn whose coordinate cofinalities are all uncountable and strictly bounded by one finite aleph, with the relative ordinal box topology. The set B is infinite and avoids zero and one, so F1 and A1 apply and verify that X satisfies the asserted normality and T1 hypotheses while failing countable paracompactness.

2.1step 1.1F2A1

If this X×[0,1] were normal, F2 would imply that X is countably paracompact, contradicting step 1.1. Thus the witness has a nonnormal interval product and refutes the universal assertion. The product in the conclusion is the ordinary product of the already defined space X and the entire interval, including its endpoints. QED.

Sources