Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Under choice, c(X)≤d(X)≤w(X) and χ(X),L(X)≤w(X)

Statement

Assuming choice, c(X)≤d(X)≤w(X) and χ(X),L(X)≤w(X).

Facts & Assumptions

Given: A topological space X, the Axiom of Choice, a basis B of cardinality w(X), and a dense subset D of cardinality d(X).

[L1]

The raw definitions make w(X) and d(X) the least cardinalities of a basis and a dense subset, make χ(X) the supremum of the local characters, make L(X) the least cardinal bounding subcovers, and make c(X) the supremum of sizes of pairwise-disjoint nonempty open families (Under choice, weight w(X), density d(X), local character χ(x,X), and character χ(X) as raw cardinal minima and a supremum, Under choice, Lindelöf degree L(X) and cellularity c(X) as raw cardinal functions).

[A1]

The Axiom of Choice chooses one member from each nonempty set in a family (The Axiom of Choice).

Proof

technique · direct
1.1

Choose one point from each nonempty B∈B; the chosen set meets every nonempty open set because B is a basis, so it is dense and has cardinality at most ∣B∣.

A1L1
1.2

For each x∈X, the subfamily {B∈B:x∈B} is a local base at x and has cardinality at most ∣B∣, so every local character, and therefore its supremum χ(X), is at most w(X).

L1
1.3

Given an open cover, choose for each B∈B that lies in a cover member one such member; these at most ∣B∣ chosen sets still cover X, so L(X)≤w(X).

A1L1
1.4

For a pairwise-disjoint family U of nonempty open sets, choose a point of D∩U for each U∈U; disjointness makes this assignment injective into D, so ∣U∣≤d(X) and c(X)≤d(X).

A1L1
2.1

Steps 1.1, 1.2, 1.3 and 1.4 give c(X)≤d(X)≤w(X) and χ(X),L(X)≤w(X).

step 1.1step 1.2step 1.3step 1.4∎

Depends on

Used by

Dependency tree · two levels

21 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