Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Fleissner's construction of a normal nonmetrizable Moore space from level data

Statement

Let κ be an infinite cardinal, let (κn)nω be increasing with 2κn<κ for every n and supnκn=κ, let 2κ=κ+, and let E{δ<κ+:cf(δ)=ω} be stationary in κ+. Fix, for each δE, an increasing sequence (δi)iω of nonlimit ordinals cofinal in δ (Fleissner's HYP covering interface), and assume the ladder separation conclusion of Fleissner's Lemma 1: for every β<κ+ there is mβ:Eβω such that δiηi for all distinct δ,ηEβ and all imax(mβ(δ),mβ(η)).

Then there is a normal nonmetrizable Moore space (Moore spaces and developments, Metrizable spaces are collectionwise normal). The same space carries the stated uniform base, hence is metacompact.

Facts & Assumptions

Given: κ,(κn),E and the ladders as in the Statement. By passing to a cofinal tail-subsequence and then prepending 0, we may and do assume that κ0=0, that κm1 for m1, and, when κ>ω, that every κm with m1 is infinite. These reindexings preserve the power bounds and the supremum κ.

[F1]

κ+ is a regular cardinal with cf(κ+)=κ+>ω; sums and products of infinite cardinals absorb, in particular μμ=μ. From the given 2κ=κ+ and the cardinal exponent laws, for every cardinal λ with 1λκ one has (κ+)λ=(2κ)λ=2κλ=2κ=κ+. (Cardinal (initial ordinal) and cardinality, Cardinal sum κλ, product κλ and exponentiation κλ, and why they are written apart from the ordinal operations, Absorption: for cardinals κ,λ with κ infinite and λκ, κλ=κ, and κλ=κ when λ0, Assuming the Axiom of Choice, 2κ=P(κ), and Cantor's theorem in cardinal form: κ<2κ).

[F2]

Every set can be well-ordered, so a set of cardinality μ can be enumerated as {xα:α<μ} (Well-order and well-ordered set, Injection, surjection, bijection, The Axiom of Choice).

[F3]

Clubs and stationary sets in κ+: a set is closed if it contains the sup of each of its bounded subsets, clubs are the closed unbounded sets, stationary means meeting every club; a club is stationary; supersets of stationary sets are stationary; a stationary set minus a non-stationary set is stationary; and a countable union of non-stationary subsets of κ+ is non-stationary (Closed unbounded subsets of ordinals, The club filter and nonstationary ideal, Basic stationary-set calculus).

[F4]

Fodor's pressing-down lemma: if Sκ+{0} is stationary and f:Sκ+ is regressive (f(α)<α throughout), then some fibre of f is stationary (Fodor’s pressing-down lemma, Regressive functions on ordinals).

[F5]

For κ>ω the Erdős–Rado theorem gives 1(κn)+=(2κn)+(κn+)κn2, and for κ=ω the infinite Ramsey theorem gives ω(ω)r2 for every finite r1; the arrow means that every colouring of pairs admits a homogeneous set of the target size (Erdős–Rado for arbitrary infinite cardinals and finite arity, Infinite Ramsey theorem for fixed finite arity and colors, Partition arrows and homogeneous sets, Cardinal (initial ordinal) and cardinality).

[F8]

A function with domain ω and values in E is exactly an element of Eω; finite sequences from E are functions on natural numbers with range in E; the wood Σ below is the set of all finite such sequences (A function is a relation f with (a,b)f and (a,c)f implying b=c; f:AB, the value f(a), domain and codomain, The natural numbers N (von Neumann)).

Proof

technique · construction, with the acceptability recursion in steps 2.2, 3.3, 4.3 and 5.2 and the later Ramsey/Erdős–Rado argument
1.1

Fix a well-ordering of the universe and enumerate the family Z:={ZΣ:cardZκ and ZΣk for some kω} as {Zα:α<κ+}, arranged so that Z0=. Here Σ:=nωΣn with Σn:={fn:fEω}, and [σ]:={fF:σf} for F:=Eω; write a for the greatest ordinal in the range of a nonempty aΣ, and put Σβ:={σΣ:σ= or σ<β} and Z(β):={Zα:α<β}. Enumerating Z is legitimate: stationarity gives E=κ+, so [F1] with λ=0 gives Eω=Σ=κ+; and [F1] with λ=κ gives at most (κ+)κ=κ+ subsets of size at most κ on every finite level. Conversely, the singletons of Σ1 already give κ+ members of Z.

givenF1F2F3F8
1.2

With κ, (κn) and the enumeration {Zα:α<κ+} fixed as above, let level(Z) be the least k with ZΣk (0 for Z=), and for nonempty θΣ of length r put Fθ:=Z(θ){Z:level(Z)<r}. This set has cardinality at most κ. Using [F2], fix an enumeration eθ:μθFθ with μθκ, arranged with eθ(0)=; the latter is possible because Z0=Fθ. Let P(θ,m):=eθ[min(κm,μθ)] and, for σΣ of length , define A(σ,m):={P(θ,m):θσ}, with A(,m)=A(σ,0)=. Then mA(σ,m)=Fσ: an element of Fσ has an index ξ<μσκ in eσ, and cofinality of (κm) gives an m with ξ<κm. Also, if σσ and mm, then A(σ,m)A(σ,m). Finally, σ has only finitely many nonempty prefixes, so A(σ,m)λ,m, where λ,m:=κm if κm is infinite and λ,m:=(+1)κm if κm is finite. Thus the source's special κ=ω clause gives finite A(σ,m); it does not assert the false bound A(σ,m)κm.

givenF1F2
1.3

Construction requirement (well-definedness). The condition (12) below is imposed only at traces lying in dom(g)=Z(ρ): for σΣn, a triple g,ρ,τ satisfies (12) at index σ iff ZA(σ,n), ZΣm, ZΣρ(m)Z(ρ)  g(ZΣρ(m))=1    σmZ. No instance of (12) is used anywhere below at a trace outside Z(ρ), and the §6 instances are proved in Case 1 below, so this guard is a definition of the space, not an assumption. This is the documented discharge of the trace-domain obligation.

givenF8
1.4

Lemma 3(a). If TΣ satisfies {[σ]:σT}=F, then for some n the set TΣn has a stafull subset, where SΣn is stafull iff for all σS and j<n the set {τ(j):σjτS} is stationary in κ+.

given
2.1

Let Qk be the set of triples g,ρ,τ such that ρ,τΣk, ρ(i)<τ(i)<ρ(i+1)<τ(i+1) for all i<k1, and g is a function from Z(ρ) to {0,1} (for k=0 read ρ=0), and let Q:=kQk. For σΣn let C(σ) be the set of g,ρ,τQ satisfying: σρ or στ; ρ(0)i=τ(0)i for all i<n; and the guarded (12) of step 1.3 at index σ. Put B(σ):=[σ]C(σ), and let X:=FQ with basis {B(σ):σΣ}{{q}:qQ}.

givenF6F7
2.2

Suppose, for contradiction, that TΣn has no stafull subset for every n; then every nonempty STΣn is non-stafull, because a stafull subset of S would be a stafull subset of TΣn. Call a finite ρΣ acceptable iff for every n>ρ and every nonempty STΣn with σρ for all σS, there are σS and j with ρj<n such that {τ(j):σjτS} is non-stationary. Then is acceptable by non-stafullness of S itself. We construct fF whose every finite prefix is acceptable; then f0=T (else TΣ0 would be stafull) and f(i+1)T for all i, so f{[σ]:σT}, contradicting the covering hypothesis.

givenstep 1.4F3
2.3

Lemma 3(b) in the form used. If SΣn is stafull and h(σ)=σ(0)i for a fixed i<n, then there is a stafull SS on which h is constant. Indeed Ai:={τ(0):τS}E is stationary, h restricted to Ai is regressive (ladder values are below their ordinal), so Fodor's lemma (F4) provides a stationary AAi on which h is constant; then S:={τS:τ(0)A} is stafull: for j<n the branching set {τ(j):σjτS} equals the corresponding branching set of S when j1 (the first coordinate is determined by σj) and equals A when j=0. Iterating for i=0,,n1 gives a stafull SS with σ(0)i=σ(0)i for all σ,σS and all i<n.

step 1.4F4given
2.4

Lemma 3(c). If SΣn is stafull and β<κ+, then there is W={σα:α<β}S with σα(i)<σα(i) iff i<i or (i=i and α<α). Construct the coordinates level by level: having chosen levels <i so that all level-(i1) values lie below a common bound <κ+ and each prefix σαi extends to a member of S, stafullness of S makes each set Aα:={τ(i):σαiτS} stationary, hence unbounded above the bound; choose σα(i)Aα strictly increasing in α and above the sup of the level-(i1) values, possible because that sup is <κ+ by regularity (F1) since β<κ+; the final level's choice lies in S by the definition of Aα.

step 1.4F1given
3.1

The family {B(σ)} together with the singletons is a basis: for xF and xB(σ)B(σ) the sequences σ,σ are both initial segments of x, hence comparable, and the longer one σ satisfies B(σ)B(σ)B(σ) because C(σ)C(σ)C(σ): the conditions (10) and (11) transfer downwards, and a guarded (12)-instance at σ restricts to the corresponding instance at σ since A(σ,σ)A(σ,σ) by step 1.2 and σm=σm for m<σ. For xQ the singleton {x} is a basis element contained in every basis element containing x.

step 1.2step 2.1F7
3.2

X is T1, and Q is open, hence F=XQ is closed. To see the T1 property, distinct branches in F have incompatible finite initial segments, while every qQ has the open singleton {q}. Conversely, for fixed q=g,ρ,τQk and fF, choose n>k; then qB(fn) because condition (10) cannot make a length-n sequence an initial segment of either length-k coordinate. Thus every point other than q has a neighbourhood avoiding q, so {q} is also closed.

step 2.1F6F7
3.3

Successor step of the acceptability recursion. Let ρ be acceptable with ρ=i. Call S dangerous for v if, for some n>i+1, STΣn is nonempty, every σS extends ρ ^v, and {τ(j):σjτS} is stationary for all σS and i+1j<n; let B1:={vE: some S is dangerous for v}, and B2:={vE:ρ ^vTΣi+1}. Then B1B2E.

step 2.2
4.1

The branch neighbourhoods have the star property needed below. If xF and open Dx, choose σ0x with B(σ0)D. For nσ0, the unique length-n initial segment σ=xn satisfies B(σ)B(σ0) by step 3.1, so every length-n basic member containing x lies in D. At a point of Q the singleton is a basic neighbourhood.

step 2.1step 3.1F7
4.2

For disjoint closed H,KX, it is enough to find disjoint open U,V with HFU and KFV. Indeed U:=(UK)(HQ),V:=(VH)(KQ) are open, contain H,K respectively, and are disjoint: Q is discrete open, removing a closed set preserves openness, and each added isolated part lies in its own closed set and outside the other. Since F is closed by step 3.2, the two traces are closed subsets of F.

step 3.2F7
4.3

Suppose B1B2=E. If B1 is stationary, choose for each vB1 the least level nv of a dangerous Sv and a least such Sv in the fixed well-order; some E:={vB1:nv=n0} is stationary by the countable case split, and V:=vESvTΣn0 is nonempty with all members extending ρ. Acceptability of ρ gives σV and j[i,n0) with B(σ,j,V) non-stationary. Pick vE with σSv. If ji+1 then B(σ,j,V)B(σ,j,Sv) is stationary because Sv is dangerous, a contradiction; if j=i then B(σ,i,V)={τ(i):τV}E, because Svσ witnesses vB(σ,i,V) for every vE, so B(σ,i,V) is stationary, again a contradiction. If B1 is non-stationary then EB1 is stationary and contained in B2, so B2 is stationary; applying acceptability of ρ to the nonempty S:={ρ ^vTΣi+1:vE} and n=i+1 gives B(σ,i,S) non-stationary for some σS, but B(σ,i,S)={τ(i):τS}B2 is stationary. Both cases are contradictory, so B1B2E.

step 3.3step 2.2F3
5.1

Define Gn:={B(σ):σΣn}{{q}:qQ}. Each Gn is an open cover: a point fF lies in [fn]B(fn), and every qQ lies in its singleton. At xF, step 4.1 gives St(x,Gn)D at every sufficiently large level. If x=qQk, then for n>k no B(σ) with σ=n contains q, because condition (10) would require σ to be an initial segment of one of the length-k sequences ρ,τ; thus St(q,Gn)={q}. Moreover nGn is a uniform base in the source's sense. A point qQk belongs only to its singleton and to the finitely many B(σ) whose σ is an initial segment of its two length-k coordinates, so it cannot lie in the intersection of an infinite subfamily. If an infinite subfamily R has xR, then xF has a branch ρ, and the members of R are the sets B(ρk) at arbitrarily large levels. Given open Dx, choose n with B(ρn)D; any member B(ρk) of R with kn lies in D. Hence R is a neighbourhood base at x. By the Aleksandrov-Arhangel'skij equivalence of uniform bases with metacompact Moore spaces recorded in the source's Section 2, X is a regular Moore space and is metacompact.

step 4.1step 2.1step 3.2F6
5.2

Choosing vE(B1B2) gives that ρ ^v is acceptable — any nonempty STΣn above ρ ^v failing the acceptability witness would be dangerous for v — and ρ ^vT. The recursion produces an infinite sequence fEω with every prefix acceptable and f(i+1)T for all i; since f[σ] means σ=fσT, the covering hypothesis is contradicted. Therefore some TΣn has a stafull subset, proving Lemma 3(a).

step 2.2step 4.3contradiction
6.1

For nω and ZΣn put HZ:={[σ]:σZ} and KZ:=FHZ. It suffices to separate HZ and KZ by disjoint open subsets of X for every n,Z (the source's Lemma 2). Here is the countable reduction. For disjoint closed H,KF, let Hn={[σ]:σ=n, [σ]H=},Kn={[σ]:σ=n, [σ]K=}. Then KnHn and HnKn, because the cylinders are a base for F. By the assumed HZ--KZ separation, choose disjoint open On,Pn containing Hn,FHn, and disjoint open Rn,Sn containing Kn,FKn. Thus OnH= and RnK=, since the corresponding Pn,Sn are open and disjoint. The open sets U=n(RninOi),V=n(OninRi) contain H,K respectively and are disjoint: if a point lay in the nth piece of U and the mth piece of V, the case nm contradicts removal of Rn from the latter, and mn contradicts removal of Om from the former. Step 4.2 then handles isolated points.

step 4.2step 5.1F7
6.2

Non-metrizability. For δE put Yδ:={fF:f(0)=δ}, a closed discrete family in X. If X were metrizable it would be collectionwise normal (F6), so there would be pairwise disjoint open sets UδYδ.

step 5.1F6
7.1

Fix n1 and ZΣn with HZ as in step 6.1, and let C:={γ<κ+:if β<γ then ZΣβ=Zα for some α<γ}. Then C is a club: it is closed because for a limit γ of C-points and β<γ some γC has β<γ<γ, so ZΣβ=Zα with α<γ<γ; and it is unbounded because the assignment γsup{α+1:β<γ, ZΣβ=Zα} can be iterated countably many times, remains below κ+ by regularity, and its limit lies in C. This uses cardZκ, so that at most κ distinct truncations occur, and cf(κ+)>ω.

step 1.1step 1.2F1F3
7.2

Assume such {Uδ} exist. Put T:={σΣ:B(σ)Uσ(0)}. Then {[σ]:σT}=F: for fF one has fYf(0)Uf(0), and since fQ some basic neighbourhood B(σ)f lies in the open set Uf(0); then f[σ]F, so σf and σ(0)=f(0), giving B(σ)Uσ(0) and f[σ] with σT.

step 6.2step 2.1F7
8.1

Let γ(β) be the least element of C greater than β, and for σΣn+3 choose j(σ):=1+max(n+3, mγ(σ(n+1))(σ(0)), m(σ)), where m(σ) is the least m with ZΣσ(n)A(σ,m) if γ(σ(n))<σ(n+2), and m(σ):=0 otherwise; this is a definable choice from the given data. Then j(σ)>mγ(σ(n+1))(σ(0)) strictly, and whenever γ(σ(n))<σ(n+2) the transfer of step 1.2 gives ZΣσ(n)A(σ,j(σ)) (and even in A(σ,j(σ)1), which is what the applications at index ρσ of level j(σ) need). Put W(σ):={B(ρ):σρΣj(σ)}.

step 1.2step 7.1given
8.2

By Lemma 3(a) proved above there are n1 and a stafull STΣn. Apply step 2.3 n times to get a stafull SS with σ(0)i=σ(0)i for all σ,σS and i<n, and apply step 2.4 with β:=κ to obtain W={σα:α<κ}S with the interleaving property. Put λn:=κn when κ>ω and λn:=(n+1)κn when κ=ω. For σW, step 1.2 gives 0<A(σ,n)λn: nonemptiness follows from n1, κn1, and eσ(0)=. Enumerate it, repeating entries if necessary, as {Z(σ,δ):δ<λn}. Notice that λn=κn is infinite when κ>ω, while λn is finite when κ=ω.

step 4.3step 2.3step 2.4step 1.2step 7.2
9.1

Claim (Case 1). Let σ,νΣn+3 and suppose σnZ, νnZ, and γ(ν(n))<σ(n+2); assume σ(0)<ν(0). Then W(σ)W(ν)=.

step 8.1
9.2

For ρ,τW with ρ(0)<τ(0), the triple g,ρ,τ for any g:Z(ρ){0,1} satisfies (7), (8), (10), (11) of step 2.1: ρ,τΣn; the interleaving of step 2.4 gives (8); ρρ gives (10); and (11) is exactly the constancy of σ(0)i from step 2.3. Since B(ρ)g,ρ,τ would put it into Uρ(0)Uτ(0)= (as ρ(0)τ(0)), the guarded (12) must fail at index ρ or at index τ for every g.

step 8.2step 6.2step 2.3step 2.1
10.1

Let g,ρ,τW(σ)W(ν): then there are ρσ, νν with ρ=j(σ), ν=j(ν) and g,ρ,τC(ρ)C(ν), because []F and FQ=. By condition (10) at both indices the cases (ρρ and νρ) and (ρτ and ντ) force σ(0)=ν(0), so after interchanging σ and ν if necessary we have ρρ and ντ; hence ρ(0)=σ(0), τ(0)=ν(0), and ρ(i)=σ(i) for i<j(σ), τ(i)=ν(i) for i<j(ν).

step 9.1step 2.1
10.2

Claim (Case 2). If σ(n+2)γ(ν(n)) under the hypotheses of step 9.1 (same membership assumptions), then W(σ)W(ν)=.

step 9.1
10.3

For a fixed pair ρ,τ consider the two systems of constraints on g, with the exponent always the triple's first component ρ, and include only guarded instances whose trace lies in Z(ρ): the first system requires g(ZΣρ(m))=[ρmZ] for Z=Z(ρ,δ)A(ρ,n) of level m, and the second requires the analogous value [τmZ] for Z=Z(τ,η)A(τ,n). Each guarded system is internally consistent: by step 2.3 and (ρm)=ρ(m1)<ρ(m), the required value depends only on the trace ZΣρ(m); the same holds for the τ-system because τ(m1)<ρ(m) by interleaving. No single total g:Z(ρ){0,1} satisfies both guarded systems, by step 9.2. Hence a conflict exists: there are δ,η<λn and m<n whose common trace belongs to Z(ρ) and for which Z(ρ,δ)Σρ(m)=Z(τ,η)Σρ(m) but [ρmZ(ρ,δ)][τmZ(τ,η)]. Otherwise the function assigning each constrained trace its required value and 0 to every other member of Z(ρ) would satisfy both systems. This is (17) in trace form together with (18a) or (18b).

step 9.2step 8.2step 2.3step 1.3
11.1

Condition (8) at the coordinates below j(σ)ρ and j(ν)τ, together with step 10.1, gives σ(n)<ν(n)<σ(n+1)σ(n+2). Before applying guarded (12), verify its domain condition. Since γ(σ(n)) and γ(ν(n)) are club points and σ(n)<ν(n), step 7.1 gives indices index(ZΣσ(n))<γ(σ(n))γ(ν(n)),index(ZΣν(n))<γ(ν(n)). The Case-1 hypothesis gives γ(ν(n))<σ(n+2)ρ, so both traces belong to Z(ρ). Step 8.1 now puts ZΣσ(n) in A(ρ,j(σ)) and ZΣν(n) in A(ν,j(ν)). Their condition-(12) traces both reduce to ZΣρ(n) because ρ(n)=σ(n)<ν(n), while ρnZ and νnZ. Thus guarded (12) yields 1=g(ZΣρ(n))=0, a contradiction. Hence Case 1 holds.

step 7.1step 8.1step 10.1step 1.3
11.2

Assume g,ρ,τ=:qW(σ)W(ν) and argue as in step 10.1 to get ρρ, ντ; then (8) gives the chain ν(n)<σ(n+1)<ν(n+1)<σ(n+2)γ(ν(n)), so both σ(n+1) and ν(n+1) lie in the interval [ν(n),γ(ν(n))), which contains no C-point by the minimality of γ(ν(n)); applying the definition of γ inside that gap gives γ(σ(n+1))=γ(ν(n+1))=γ(ν(n)). By step 8.1, j(σ)>mγ(σ(n+1))(σ(0)),j(ν)>mγ(ν(n+1))(ν(0)). Put m:=max{j(σ),j(ν)} and m:=max{mγ(σ(n+1))(σ(0)),mγ(ν(n+1))(ν(0))}; then m<m, and condition (11) at the indices ρ, ν gives ρ(0)i=τ(0)i for every i<m.

step 8.1step 10.1step 10.2
11.3

Define U:={W(σ):σΣn+3, σnZ},V:={W(ν):νΣn+3, νnZ}. These sets are open and contain HZ,KZ respectively: extend the length-n initial segment of any branch to length n+3 and use B(σ)W(σ). If Cases 1 and 2 both hold, every cross-pair of their displayed constituents is disjoint, according as γ(ν(n))<σ(n+2) or σ(n+2)γ(ν(n)) (interchange the two sequences first when their zeroth coordinates are reversed). Hence the two cases imply UV=.

step 8.1step 9.1step 10.2
11.4

Colour each pair {ρ,τ}W with ρ(0)<τ(0) by the least conflict witness (δ,η,m,alt) in a fixed well-ordering of λn×λn×n×2. If κ=ω, this is a finite colour set and the infinite Ramsey theorem (F5) gives an infinite homogeneous set. If κ>ω, then λn=κn is infinite and, since 2κn<κ, the Erdős–Rado theorem (F5) applied to a subset of W of size (2κn)+ gives a homogeneous set of size κn+. Either way there are ρ,σ,τW with ρ(0)<σ(0)<τ(0) and one common alternative of (18), common indices δ,η, and a common m such that (17) holds for each of the three pairs.

step 10.3step 2.4F5F2
12.1

The trace-domain verification in step 11.1 is symmetric for the two listed sets: their enumeration indices are below γ(σ(n)) and γ(ν(n)), respectively, and both club successors lie below ρ in Case 1. Thus every evaluation of g made there is inside Z(ρ), as required by step 1.3.

step 7.1step 8.1step 10.1step 11.1
12.2

Since σ(0)ν(0) (they are distinct elements of the interleaved family W) and both lie in Eγ(σ(n+1)), the ladder separation hypothesis applied at β=γ(σ(n+1)) gives (σ(0))i(ν(0))i for every im, in particular at i=m<m. This contradicts the agreement of step 11.2 at level m, because ρ(0)=σ(0) and τ(0)=ν(0). Hence Case 2 holds.

step 11.2given
13.1

Step 11.1 proves Case 1 and step 12.2 proves Case 2, so step 11.3 gives disjoint open sets separating HZ and KZ for every n and ZΣn. The countable reduction of step 6.1 then separates arbitrary disjoint closed subsets of F, and step 4.2 adds their isolated parts. Hence X is normal.

step 4.2step 6.1step 11.1step 11.3step 12.2
14.1

With the triple of step 11.4 the printed chain computes: from (17) for the pairs (ρ,σ), (ρ,τ) and the monotonicity Σρ(m)Σσ(m) from the interleaving, Z(σ,η)Σρ(m)=Z(ρ,δ)Σρ(m)=Z(τ,η)Σρ(m)=Z(σ,δ)Σρ(m). Under the common alternative (18a), the pair (σ,τ) gives σmZ(σ,δ) and the pair (ρ,σ) gives σmZ(σ,η); since σmΣρ(m) by step 2.3, the chain transfers membership across Σρ(m) and yields σmZ(σ,η), a contradiction. Under (18b) the same two lines run with the membership signs exchanged. This contradiction establishes that {Uδ:δE} is not disjoint, so X is not collectionwise normal and hence not metrizable; with step 13.1 it is a normal nonmetrizable Moore space.

step 11.4step 10.3step 2.3step 6.2step 13.1discharge-contradiction

Remarks

  • Two documented readings of the printed notation. (12) is used with the bound ρ(m) for a level-m set, which is how the source's own Case 1 display on printed p. 370 uses it; the printed notation sentence after (12) is off by one restriction step. (17) is used in trace form Z(ρ,δ)Σρ(m)=Z(τ,η)Σρ(m), which is what the printed four-term chain displays. Both are recorded as local repairs, not source attributions.
  • The two local repairs to the §6 parameters. j(σ) is chosen strictly above the printed lower bounds, and the entry level of ZΣσ(n) is arranged one step below j(σ); without the strictness the printed Case 2 does not close. Recorded as a local repair.
  • The trace-domain condition of step 1.3 is the guarded reading of (12); §6's instances are proved in step 12.1, and §7's instances are the applicable ones by definition, so no trace outside Z(ρ) is ever evaluated.
  • The finite-cardinal clause in (4). When κ=ω, the source asks only that each A(σ,m) be finite. Step 1.2 supplies the uniform finite bound (σ+1)κm, and step 11.4 uses that finite bound as the Ramsey colour set. No absorption identity is applied to a finite κm.
  • AC is used in the enumeration of Z and of Eβ, in the choice of the ladders and the j(σ), in the countable recursion of step 3.3, and in the Ramsey/Erdős–Rado step; it is declared as a dependency and no choice-free reading is claimed.

Depends on

Used by

Dependency tree · two levels

104 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