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

Weight and character of the Kojman-Shelah scale subspace

Statement

Assume AC. For the Kojman–Shelah scale subspace X,

w(X)=ω+1,χ(X)=ω.

The character uses the raw supremum convention χ(X)=supxXχ(x,X). In fact every point has local character strictly below ω, while d(X)=ω+1.

Facts & Assumptions

Given: X and its defining normalized scale (fα)α<λ, where μ=ω and λ=μ+=ω+1.

[F1]

Points of X have uncountable coordinate cofinalities bounded strictly by one finite aleph and are eventually equal to scale terms; admissible finite modifications preserve X (Kojman-Shelah scale subspace).

[F2]

X=λ, and every gnBn is strictly below a point of X at every coordinate (Cofinality and size of the scale subspace).

[F3]

Half-open boxes give the local bases in the Rudin space and hence, upon intersection, in X (Clopen boxes and the P-space property).

[F6]

Weight and density are least sizes of global bases and dense subsets; local character is the least size of a neighborhood base, and character is their raw supremum (Under choice, weight w(X), density d(X), local character χ(x,X), and character χ(X) as raw cardinal minima and a supremum).

[F7]

The weight minimum and the local-character minima and supremum exist under AC (Under choice, w(X) is a well-defined cardinal, Under choice, χ(x,X) and χ(X) are well-defined cardinals).

[F10]

δ+ω1 is the order type of a copy of δ followed by a copy of ω1 (α+β is the order type of α followed by β).

[A1]

AC is assumed for cofinal-map choices, local-neighborhood choices and cardinal bounds for the resulting families (The Axiom of Choice).

Proof

1.1

Fix xX and a finite m with ω<cf(x(n))<m for every nB, as in F1. Necessarily m2. Partition B into Bi={n:cf(x(n))=i}, 1i<m, using F4. For every nBi choose by F4 and A1 a strictly increasing cofinal map en:ix(n). For each tuple γ=(γi) with γi<i at each nonempty stratum define bγ(n)=en(γi) for nBi. Then bγ<x, and Vγ=(bγ,x]X is an open neighborhood of x by F3. Given any g<x, for each nBi take the least ηn<i with g(n)<en(ηn); this exists because x(n) is a limit and en is cofinal. Countability of Bi and uncountable regularity F5 give γi=supnBiηn<i by F4. Monotonicity yields bγ(n)en(ηn)>g(n), so Vγ(g,x]X. F3 shows the Vγ form an actual local base. Empty strata contribute no tuple coordinate.

F1F3F4F5A1
1.2

By F2 choose x0X, for example a point above the zero product function. For nB let xn agree with x0 except that xn(n)=n. F5 gives cofinality n at that coordinate, and a finite aleph bound greater than both this cardinal and the old uniform bound makes xn a Rudin point. Hence F1 gives xnX. Suppose a neighborhood base (Uj)jJ at xn had size ρ<n. It is nonempty, since the neighborhood X must contain a base member. By F3 and A1 choose gj<xn with (gj,xn]XUj. F4–F5 give δ=supjJgj(n)<n. Put ζ=δ+ω1. F10 and F9 show ζmax(δ,1)<n, since n2; therefore ζ<n. The final ω1 block is cofinal, and each smaller set is bounded in it by F4–F5, so cf(ζ)=ω1. Also ζ>δ, including when δ=0. Let y agree with xn except for y(n)=ζ. The new cofinality is ω1, so it is an admissible finite modification and belongs to X by F1. It lies in every chosen box: at n its value exceeds δgj(n) and is below the top, and elsewhere it equals xn. Thus yUj for every j. But the open box at xn with lower value ζ at coordinate n and zero elsewhere excludes y. No Uj is contained in it, contradicting the base property. We conclude χ(xn,X)n.

F1F2F3F4F5F6F9F10A1
1.3

Let DX have size less than λ. Each dD has a unique index α(d) with d=fα(d): existence follows from F1, and two different indices would force eventual strict self-inequality on infinite B. By F4–F5 there is β<λ above all those indices; use β=0 if D is empty. Consequently every dD satisfies d<fβ. By F2 choose yX with fβ<y pointwise. F3 makes O=(fβ,y]X open, and it is nonempty since yO. It misses D: if dO, it would be strictly above fβ everywhere and strictly below it at all but finitely many coordinates, impossible on the infinite B. Thus no set of size below λ is dense. The whole X is dense in itself and has size λ by F2, so d(X)=λ by F6 and F8.

F1F2F3F4F5F6F8A1
2.1

The tuple family of step 1.1 has cardinality at most the finite product of the i for nonempty strata. At least one stratum is nonempty, since B is infinite. F9 bounds this product by m1<μ. By F6–F8, χ(x,X)<μ for every x, whence χ(X)μ. Choose these local bases for all points, using A1 on the proved nonempty sets of suitable choices. Their union is a global basis: for any open O and xO, a member of the base at x is contained in O. Its size is at most Xμ=λμ=λ by F2 and F9. Therefore w(X)λ.

step 1.1F2F6F7F8F9A1
3.1

The infinite Bω is unbounded; hence supnBn=μ. Step 1.2 and the raw-supremum convention F6 give χ(X)μ. Combined with step 2.1, this proves χ(X)=μ, although each local character is strictly smaller. The lower bound uses the specially constructed top-coordinate points; it does not assert a coordinate-cofinality lower bound at an arbitrary point.

step 1.2step 2.1F6F7
4.1

If a global basis had size less than λ, choose one point from each nonempty member using A1. The resulting set has size less than λ and is dense: each nonempty open set contains a nonempty basis member and hence its chosen point. This contradicts step 1.3. Therefore w(X)λ by F6–F8. Together with step 2.1 this proves w(X)=λ, while step 3.1 gives the asserted character and step 1.3 gives the density. QED.

step 1.3step 2.1step 3.1F6F7F8A1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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