Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Serial Dependent Choice implies the complete-metric Baire principle over ZF

Statement

In ZF, assume DC. Then CM-Baire holds: for every complete metric space (X,d) and every sequence (Un)nω of open dense subsets, nUn is dense.

Facts & Assumptions

Given: DC, a complete metric space (X,d) and open dense sets Un for nω.

[F1]

DC has the equivalent prescribed-start form for every nonempty serial set (Prescribed-start and starting-point-free serial choice are equivalent in ZF).

[F2]

Density is tested by nonempty open sets, and the four Baire formulations are equivalent in ZF (Open-dense and closed-nowhere-dense Baire forms are equivalent in ZF).

[F3]

B(c,r)={x:d(c,x)<r} and Bˉ(c,r)={x:d(c,x)r} for r>0 (Open ball, closed ball and sphere in a metric space).

[F5]

Given any positive real ε, some positive integer t satisfies 1/t<ε (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[F6]

Metric symmetry and the triangle inequality hold, and d(c,c)=0 (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F7]

A sequence is Cauchy if all distances on a sufficiently late tail are less than any positive rational tolerance (Cauchy sequence in a metric space).

[F10]

In a complete metric space each Cauchy sequence has a limit in X (Complete metric space: every Cauchy sequence converges in the space).

[F11]

Convergence puts distances to the limit eventually below any positive rational tolerance (Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R).

[F8]

Natural-number induction proves a property from its zero and successor cases (The principle of mathematical induction).

Proof

1.1

If X=, the intersection is empty and dense. Otherwise it suffices to meet an arbitrary nonempty open VX. Set C(c,r)=Bˉ(c,r). For any nonempty open W, fix cW and δ>0 with B(c,δ)W. Given a bound b>0, take t1 with r=1/t<min(δ,b). Then r is positive rational, rb, and C(c,r)B(c,δ)W, directly from d(c,x)r<δ.

F2F3F4F5given
2.1

By ZF Separation, let S consist of all triples (n,c,r)ω×X×Q with 0<r1/(n+1) and C(c,r)VUn. The set VU0 is nonempty by density and open. The preceding construction with b=1 gives an initial state s0=(0,c0,r0)S.

F2F4F9step 1.1
3.1

Relate (n,c,r) to (n+1,c,r) when both lie in S and C(c,r)B(c,r)Un+1. For each state, cB(c,r), so density of Un+1 makes W=B(c,r)Un+1 nonempty; it is open. The construction with b=1/(n+2) supplies c,r. Since B(c,r)C(c,r)V, this triple belongs to S. Thus the displayed relation is serial on the nonempty set S. Only one centre and radius were fixed for this one existence assertion.

F2F3F4F6step 1.1step 2.1
4.1

Apply prescribed-start DC to S with initial state s0. The resulting chain has stage coordinate n at position n: this holds at zero, and each relation step increments that coordinate by one. Write its states (n,cn,rn) and Cn=C(cn,rn). Then Cn+1B(cn,rn)Cn, rn1/(n+1), and CnVUn. This application is the proof's sequence-selection use of DC; centres are already components of the selected states.

F1F3F8step 2.1step 3.1
5.1

For fixed n, induction on mn gives CmCn for all mn: equality is the base, and the next containment follows from nesting. Since cmCm, for m,kn the triangle inequality gives d(cm,ck)d(cm,cn)+d(cn,ck)2rn2/(n+1). For any positive rational ε, choose t1 with 1/t<ε/2 and take n=t; then the displayed bound is less than ε. Hence (cn) is Cauchy. Completeness supplies a single limit xX.

F3F5F6F7F8F10step 4.1
6.1

Fix n. If d(x,cn)>rn, put η=d(x,cn)rn>0 and fix a positive reciprocal e<η. Convergence gives mn with d(x,cm)<e. The tail bound and triangle inequality yield d(x,cn)d(x,cm)+d(cm,cn)<e+rn<η+rn=d(x,cn), which is impossible. Therefore d(x,cn)rn and xCn. In particular equality on a closed-ball boundary is allowed.

F3F5F6F11step 5.1
7.1

Thus xVnUn. Since V was an arbitrary nonempty open set, the intersection is dense. This proves CM-Baire, and hence also its equivalent category formulations.

F2step 4.1step 6.1step 1.1

Depends on

Used by

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