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.

Locally Convex Spaces and Continuous Separation: Examples

1 · Prerequisites

2 · Summary

Coordinate constraints give concrete locally convex spaces even for arbitrary index sets. The product example checks joint continuity, convex balanced neighborhoods and Hausdorff separation, including the empty product. Coordinate functionals then provide an explicit uniform gap between two half-spaces without invoking Hahn–Banach.

The final example calculates the maximum set of the convex function t squared on the interval from minus one to one. Its two maximizers satisfy the extremal endpoint property, but their midpoint is not a maximizer. Consequently that maximum set is not a face, because a face is required to be convex.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Arbitrary products of the scalar field are locally convex

Example

For any set I and K=R or C, the vector space KI of all functions IK, with pointwise operations and the product topology, is a Hausdorff locally convex TVS. Its zero-neighborhood base consists of N(F,ε)={x:xi<εi for every iF}, where FI is finite and each εi>0. The case I= is included. No choice principle is needed.

Facts & Assumptions

Given: A set I and K=R or C.

[F1]

A TVS requires joint addition and scalar multiplication continuity (Topological vector spaces over the real and complex fields).

[F2]

Local convexity is a convex zero-neighborhood base, and balance means stability under scalars of modulus at most one (Local convexity, convex and balanced sets, and the continuous dual).

[F5]

Scalar addition and multiplication are jointly continuous (Translations, dilations and absorption in a topological vector space).

[F7]

Verification

1.1

The function i0 is a specified element of KI, and (x+y)(i)=x(i)+y(i), (ax)(i)=ax(i) and (x)(i)=x(i) define functions on I. Associativity, commutativity and the zero/inverse laws follow at each coordinate from the scalar field; the two distributive laws, associativity of scalar action and the unit action also follow at each coordinate. Function equality is coordinatewise, so these give every vector-space axiom.

F1F3
2.1

The i-th component of addition is (x,y)xi+yi, a composite of the continuous coordinate maps and scalar addition. The i-th component of scalar multiplication is (a,x)axi, similarly continuous by joint scalar multiplication. Therefore both vector operations are jointly continuous by product universality. This uses neither projection surjectivity nor nonemptiness of an arbitrary product of unrelated factors.

F4F5step 1.1
3.1

Each N(F,ε) is open, being a finite intersection of inverse images of open scalar disks, and contains zero. If x,y are in it and 0t1, then (1t)xi+tyi(1t)xi+tyi<εi for 0<t<1, with t=0,1 immediate. If a1, then axixi<εi, including a=0. Thus these neighborhoods are convex and balanced. Given any basic zero-neighborhood, choose a positive radius inside each of its finitely many coordinate neighborhoods, by finite choice after listing those coordinates. The resulting N(F,ε) is contained in it. Hence these sets form a base and the TVS is locally convex. For F=, the set is the whole space.

F2F3F4F7step 2.1
4.1

If xy, some coordinate i has d=xiyi>0. The inverse images of the disks of radius d/3 about xi,yi are open neighborhoods of x,y. They are disjoint, since a common scalar value would imply d<2d/3 by the triangle inequality. Thus the space is Hausdorff. For I=, its only element is the empty function; its only zero-neighborhood is the whole singleton, the vector operations are constant, and the Hausdorff assertion is vacuous.

F3F4F6step 3.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Coordinate functionals give an explicit uniform separating gap

Example

Fix i0I and real a<b. In KI with the product topology, the nonempty closed convex half-spaces A={x:Rexi0a},B={x:Rexi0b} have a uniform separating gap supplied by f(x)=xi0. Also, any distinct x,y are separated in real part by one coordinate functional multiplied by a unit scalar. These constructions use neither HB nor compactness.

Facts & Assumptions

Given: i0I, a<b, and K=R or C.

[F1]

The scalar product space is a Hausdorff locally convex TVS with pointwise operations (Arbitrary products of the scalar field are locally convex).

[F2]

The continuous dual is closed under scalar multiplication, and real part is continuous and real-linear (Local convexity, convex and balanced sets, and the continuous dual).

[F4]

Verification

1.1

Pointwise operations give f(x+y)=f(x)+f(y) and f(cx)=cf(x), so the projection f is scalar-linear; it is continuous. Thus u=Ref is continuous and real-linear. The rays (,a] and [b,) are closed: their complements are unions of open intervals. Their inverse images under u are therefore closed, since inverse images of their open complements are open. They are convex because real-linear maps preserve real convex combinations and each ray is convex.

F1F2F3
2.1

The constant functions with values a and b belong to A and B, respectively, so both sets are nonempty. Their intersection is empty since b>a. Set α=(a+b)/2 and ε=(ba)/2>0. Then for every xA,yB, Ref(x)a=αε<α+ε=bRef(y). The constant-one function has f(1)=1, so f is nonzero.

step 1.1algebra
3.1

For distinct x,y, fix one index i with z=xiyi0. Over C put c=z/z; then c=1 and cz=z>0. Over R put c=z/z, which gives the same identities. Thus g(w)=cwi is continuous and scalar-linear, and Reg(x)Reg(y)=z>0. The index and unit scalar are chosen for this one supplied pair; there is no simultaneous choice. If I is empty there is no i0 and no pair of distinct functions, so the respective hypotheses do not arise.

F1F2F3F4step 2.1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

A convex function can have a nonconvex maximum set

Statement refuted

The maximum set of a continuous convex real function on a compact convex set is always a face.

Here a face of a convex set K means a convex subset FK such that, whenever x,yK, 0<r<1 and (1r)x+ryF, both x,y belong to F. A subset with just this endpoint property is called extremal; convexity is an additional requirement for being a face.

Facts & Assumptions

Given: K=[1,1]R and q:KR, q(t)=t2.

[F1]

Convexity uses real coefficients in [0,1] (Local convexity, convex and balanced sets, and the continuous dual).

Counterexample

1.1

The interval [1,1] is convex since 1s,t1 implies 1(1r)s+rt1 for 0r1. It is closed, its complement being the open rays (,1) and (1,), and bounded by one in absolute value. Hence it is nonempty compact convex. For s,tK, q(s)q(t)=sts+t2st, which proves continuity on K directly.

F1F2algebra
1.2

For s,tK and 0r1, (1r)s2+rt2((1r)s+rt)2=r(1r)(st)20. Thus q((1r)s+rt)(1r)q(s)+rq(t), the defining convexity inequality for a function. It includes r=0,1 and s=t, where equality holds.

F1algebra
2.1

On K, q(t)1 with equality exactly when t=1 or t=1, because 1t2=(1t)(1+t) and both factors are nonnegative. The maximum set is therefore M={1,1}. Its midpoint is zero, and q(0)=0<1, so 0M. Thus M is not convex and cannot be a face. This refutes the claim with a continuous convex function on a compact convex set.

step 1.1step 1.2algebra
3.1

Nevertheless M is extremal. If (1r)s+rt=1 with s,tK and 0<r<1, then (1r)(1s)+r(1t)=0. Each summand is nonnegative and each coefficient is positive, so s=t=1. Similarly a combination equal to 1 gives (1r)(s+1)+r(t+1)=0 and forces s=t=1. Thus the endpoint property holds even though convexity fails. All witnesses and computations are explicit and choice-free.

step 2.1algebra

Sources