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
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Locally Convex Spaces and Continuous Separation
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Complex Exponential and Euler's Formula
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Arbitrary products of the scalar field are locally convex
Example
For any set and or , the vector space of all functions , with pointwise operations and the product topology, is a Hausdorff locally convex TVS. Its zero-neighborhood base consists of where is finite and each . The case is included. No choice principle is needed.
Facts & Assumptions
Given: A set and or .
A TVS requires joint addition and scalar multiplication continuity (Topological vector spaces over the real and complex fields).
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).
Basic product opens restrict only finitely many coordinates (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
Projections are continuous, and componentwise continuity characterizes maps into a product (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, clauses 1–2).
Scalar addition and multiplication are jointly continuous (Translations, dilations and absorption in a topological vector space).
Hausdorffness means distinct points have disjoint open neighborhoods (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).
A finite indexed list of nonempty sets permits choice in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
Verification
The function is a specified element of , and , and define functions on . 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.
The -th component of addition is , a composite of the continuous coordinate maps and scalar addition. The -th component of scalar multiplication is , 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.
Each is open, being a finite intersection of inverse images of open scalar disks, and contains zero. If are in it and , then for , with immediate. If , then , including . 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 is contained in it. Hence these sets form a base and the TVS is locally convex. For , the set is the whole space.
If , some coordinate has . The inverse images of the disks of radius about are open neighborhoods of . They are disjoint, since a common scalar value would imply by the triangle inequality. Thus the space is Hausdorff. For , 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.
Coordinate functionals give an explicit uniform separating gap
Example
Fix and real . In with the product topology, the nonempty closed convex half-spaces have a uniform separating gap supplied by . Also, any distinct are separated in real part by one coordinate functional multiplied by a unit scalar. These constructions use neither HB nor compactness.
Facts & Assumptions
Given: , , and or .
The scalar product space is a Hausdorff locally convex TVS with pointwise operations (Arbitrary products of the scalar field are locally convex).
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).
Complex conjugation and modulus satisfy and multiplicativity (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Verification
Pointwise operations give and , so the projection is scalar-linear; it is continuous. Thus is continuous and real-linear. The rays and are closed: their complements are unions of open intervals. Their inverse images under 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.
The constant functions with values and belong to and , respectively, so both sets are nonempty. Their intersection is empty since . Set and . Then for every , The constant-one function has , so is nonzero.
For distinct , fix one index with . Over put ; then and . Over put , which gives the same identities. Thus is continuous and scalar-linear, and . The index and unit scalar are chosen for this one supplied pair; there is no simultaneous choice. If is empty there is no and no pair of distinct functions, so the respective hypotheses do not arise.
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 means a convex subset such that, whenever , and , both belong to . A subset with just this endpoint property is called extremal; convexity is an additional requirement for being a face.
Facts & Assumptions
Given: and , .
Convexity uses real coefficients in (Local convexity, convex and balanced sets, and the continuous dual).
Closed bounded subsets of are compact in its usual product topology (A subset of with the product topology is compact exactly when it is closed and bounded, the product topology being the Euclidean metric topology, dimension one).
Counterexample
The interval is convex since implies for . It is closed, its complement being the open rays and , and bounded by one in absolute value. Hence it is nonempty compact convex. For , , which proves continuity on directly.
For and , Thus , the defining convexity inequality for a function. It includes and , where equality holds.
On , with equality exactly when or , because and both factors are nonnegative. The maximum set is therefore . Its midpoint is zero, and , so . Thus is not convex and cannot be a face. This refutes the claim with a continuous convex function on a compact convex set.
Nevertheless is extremal. If with and , then . Each summand is nonnegative and each coefficient is positive, so . Similarly a combination equal to gives and forces . Thus the endpoint property holds even though convexity fails. All witnesses and computations are explicit and choice-free.