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.

Geometric Hahn Banach and Convex Separation Examples

1 · Prerequisites

2 · Summary

These examples compute gauges, show why balancedness and compactness hypotheses matter, and give both a dual distance formula and the classical closed, uncomplemented inclusion c0.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

The sequence spaces c_0 and ell-infinity

Definition

Let K=R or C, with absolute value in the real case and modulus a+ib=a2+b2 in the complex case. A scalar sequence here is a function x:NK, including index zero. Let

={x=(xn)nN:supnNxn<},c0={x:xn0},

both equipped with x=supnNxn. Thus c0 is a specified linear subspace of the bounded-sequence space .

Here xn0 means that for every real ε>0 there is NN such that xn<ε for all nN. Addition and scalar multiplication are coordinatewise. The scalar triangle inequality makes bounded sequences and null sequences linear spaces and gives the triangle inequality for the displayed supremum norm. Absolute homogeneity follows coordinatewise, and a zero supremum forces every coordinate to vanish.

LemmaStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-06Open item page →

c_0 is a closed subspace of ell-infinity

Statement

c0 is a closed linear subspace of in the sup norm.

Facts & Assumptions

Given: The sequence spaces c0.

[F1]

c0 consists of bounded sequences tending to zero, with the sup norm (The sequence spaces c_0 and ell-infinity).

Proof

technique · direct
1.1

Sums and scalar multiples of null sequences are null, so c0 is a linear subspace.

F1given
1.2

If x(j)c0 and x(j)x0, choose j with this norm below ε/2, then N with xn(j)<ε/2 for nN. Thus xn<ε for nN.

F1givenchoose
2.1

Hence xc0 and the subspace is closed.

step 1.2
LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

An uncountable almost-disjoint family of subsets of the naturals

Statement

There is an uncountable family A of infinite subsets of N such that AB is finite whenever A,BA are distinct.

Facts & Assumptions

Given: A fixed enumeration (qn)nN of Q and the set I of irrational real numbers.

[F1]

Every nonempty subset of N has a least element (The well-ordering principle).

[F2]

Proof

technique · direct
1.1

For xI, recursively let nk(x) be the least unused index n with qn(x1/k,x+1/k), and put Ax={nk(x):k1}. Such an index exists by [F2] because every interval contains infinitely many rationals; [F1] makes the choice deterministic.

F1F2givenconstruct
2.1

Each Ax is infinite since its indices are chosen unused. If xy, then for sufficiently large k, the intervals (x1/k,x+1/k) and (y1/,y+1/) are disjoint; any common selected index must therefore arise among finitely many early choices. Thus AxAy is finite.

step 1.1given
3.1

The map xAx is injective by the finite-intersection conclusion, so {Ax:xI} is uncountable by [F2] and has the required property.

step 2.1F2
LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The quotient ell-infinity/c_0 has no countable separating family

Statement

Assume ACω. The dual of /c0 has no countable family that separates its points.

Facts & Assumptions

Given: Q=/c0 and an uncountable almost-disjoint family A of infinite subsets of N.

[F1]

c0 is closed in , so the quotient seminorm on Q is a norm (c_0 is a closed subspace of ell-infinity, The quotient seminorm is a norm exactly when the subspace is closed).

[F2]

There is an uncountable almost-disjoint family of infinite subsets of N (An uncountable almost-disjoint family of subsets of the naturals).

[F3]

Assuming ACω, a countable union of countable sets is countable (Countable unions of at most countable sets, assuming ACω).

Proof

technique · direct
1.1

For AA, let uA be its indicator sequence. Then [uA]0 in Q, and for distinct A1,,Am the quotient norm of cj[uAj] is maxjcj, since the supports are disjoint after deleting finitely many coordinates.

F1F2given
2.1

For gQ and r>0, the set {A:g([uA])r} is finite: choose scalar phases on any finite subfamily and apply g(cj[uAj])g. Thus {A:g([uA])0} is countable as a union over positive reciprocal integers.

step 1.1F1algebra
3.1

Given a countable family (gn) in Q, [F3] makes n{A:gn([uA])0} countable. By [F2] choose A outside it; then nonzero [uA] is annihilated by every gn.

step 2.1F2F3choose
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

c_0 is not complemented in ell-infinity

Statement

Assuming ACω, the closed subspace c0 is not complemented in .

Facts & Assumptions

Given: The quotient map π:/c0.

[F1]

Under ACω, (/c0) has no countable separating family (The quotient ell-infinity/c_0 has no countable separating family).

Proof

technique · contradiction
1.1

Suppose a bounded projection P:c0 exists. For each coordinate n, define φn(πx)=xn(Px)n. This is well defined because Pz=z for zc0, and it is a bounded functional on the quotient.

assume-contragivenconstruct
2.1

If φn(πx)=0 for every n, then (IP)x=0 coordinatewise, so x=Pxc0 and πx=0. Thus (φn) is a countable separating family.

step 1.1given
3.1

This contradicts [F1]. Hence no such projection exists, and c0 is not complemented.

step 2.1F1discharge-contradiction
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Two results called Mazur's lemma

Remark

This page proves the result usually called Mazur's theorem: norm and weak closures of a convex set coincide (Mazur theorem: weak and norm closure agree for convex sets). Another result often called Mazur's lemma says that suitable convex combinations of a weakly convergent sequence converge in norm. That sequence-level result is not proved or used here.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Gauges of norm balls and finite-dimensional ellipsoids

Example

For B(0,r)={x:x<r}, pB(x)=x/r. For a positive-definite real quadratic form q on Rn and E={x:q(x)<1}, pE(x)=q(x). Both are norms: the first is a positive scalar multiple of the given norm, and the second is the norm induced by the inner product associated with the positive-definite quadratic form q.

Facts & Assumptions

Given: A radius r>0 and a positive-definite quadratic form q.

[F1]

The gauge of an absorbing set is the infimum of its admissible positive dilates (Minkowski functional of an absorbing set).

Verification

technique · direct
1.1

xtB(0,r) exactly when x<tr, whose infimum over t>0 is x/r.

F1givenalgebra
2.1

Likewise xtE exactly when q(x)<t2, so the infimum is q(x). Positive definiteness gives zero only at x=0, and the displayed formulas give norm homogeneity and triangle inequality.

F1givenalgebra
CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

A gauge of a nonbalanced set need not be a seminorm

Statement refuted

An absorbing convex set need not have a seminorm as its gauge.

Facts & Assumptions

Given: The convex absorbing set C=(1,2)R.

[F1]

The gauge is the infimum of positive t for which xtC (Minkowski functional of an absorbing set).

Counterexample

technique · direct
1.1

From xt(1,2)t<x<2t, [F1] gives pC(x)=x/2 for x0 and pC(x)=x for x<0.

F1givenalgebra
2.1

Hence pC(1)=1/2 while pC(1)=1, contradicting the required equality pC(1)=1pC(1). The missing hypothesis is balancedness.

step 1.1
CounterexampleConstruction: AI-generatedVerification: AI-generatedaudited 2026-09-06Open item page →

Two closed convex sets can have no strong separator

Statement refuted

Two disjoint closed convex sets in a normed space always admit a strong separator.

Facts & Assumptions

Given: A=R×{0} and B={(s,t):tes} in R2.

Counterexample

technique · direct
1.1

A is closed convex. By [F1], B is the closed epigraph of a convex function, hence closed and convex; it is disjoint from A because es>0.

givenF1
2.1

The points (n,0)A and (n,en)B have distance en0. A strong gap βα>0 for f would imply ab(βα)/f for all aA,bB, impossible.

step 1.1algebra
ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Distance to a subspace via annihilating functionals

Example

For a subspace MX and xX,

dist(x,M)=sup{f(x):fM, f1}.

Facts & Assumptions

Given: A subspace MX and xX.

[F1]

A bounded linear functional on a subspace extends to the ambient normed space without changing its norm (A bounded linear functional on an arbitrary subspace extends with the same norm, without assuming the subspace is closed).

Verification

technique · direct
1.1

For fM with f1, continuity gives fM=0. Hence, for every mM, f(x)=f(xm)xm. Taking infima gives the direction.

givenalgebra
2.1

Put δ=dist(x,M). If δ>0, define g:M+KxK by g(m+λx)=λδ. This is well defined, and g(m+λx)=λδm+λx, so g1. By [F1], g extends to an fX with f1; this extension lies in M and satisfies f(x)=δ. If δ=0, then xM, so continuity makes every annihilator vanish at x. Thus equality holds in both cases.

F1givenconstructalgebra
ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

A closed uncomplemented subspace

Example

Assuming ACω, the inclusion c0 is a concrete closed subspace that is not complemented.

Facts & Assumptions

Given: The standard inclusion c0.

[F1]

c0 is closed in (c_0 is a closed subspace of ell-infinity).

[F2]

c0 is not complemented in under ACω (c_0 is not complemented in ell-infinity).

Verification

technique · direct
1.1

The inclusion in the statement is a closed-subspace inclusion by [F1].

F1given
2.1

It is uncomplemented by [F2], so it has both advertised properties.

F2given

Sources