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

Open and closed balanced convex zero-neighborhood refinements

Statement

For every zero-neighborhood U in a locally convex real or complex TVS, there is an open balanced convex zero-neighborhood V with V‾⊆U. Consequently U contains a closed balanced convex zero-neighborhood. Balanced sets are symmetric. No Hausdorffness, Hahn–Banach or choice principle is assumed.

Facts & Assumptions

Given: A locally convex TVS X and a zero-neighborhood U.

[F1]

Local convexity supplies an open convex zero-neighborhood inside each zero-neighborhood; convex hulls consist of finite convex combinations (Local convexity, convex and balanced sets, and the continuous dual).

[F2]

Symmetric small neighborhoods, open translations and dilations, and joint vector continuity are available (Translations, dilations and absorption in a topological vector space).

[F3]

Closures preserve convexity and balance (Convex closures and hulls of finitely many compact convex sets).

Proof

1.1F1F2

Choose a symmetric open zero-neighborhood O with O+O⊆U, then an open convex zero-neighborhood C⊆O. Joint scalar continuity at (0,0) supplies δ>0 and an open zero-neighborhood W with {a:∣a∣<δ}W⊆C. Put W0=(δ/2)W, which is open and contains zero.

2.1F2step 1.1

Define B=⋃∣a∣≤1aW0. If aw∈B and ∣λ∣≤1, then λ(aw)=(λa)w∈B, so B is balanced. It contains W0. For w=(δ/2)v∈W0, aw=(aδ/2)v∈C since ∣aδ/2∣<δ, so B⊆C. Moreover B is open: all nonzero dilates are open, and the zero dilate contributes only zero, which already belongs to W0.

3.1F1F2step 2.1

Put V=co⁡(B). Then W0⊆B⊆V⊆C⊆O, and V is convex. For ∣λ∣≤1, distributing λ through a finite convex sum leaves its summands in B, proving balance of V. To prove openness, represent v=∑jtjbj∈V. Some tk>0, and tkB+∑j≠ktjbj is an open subset of V containing v. Thus V is an open balanced convex zero-neighborhood. Zero coefficients cause no problem because the sum of the coefficients is one.

4.1F2F3F4step 1.1step 3.1∎

If x∈V‾, then x−O is an open neighborhood of x and meets V. Write v=x−o∈V with o∈O; hence x=v+o∈V+O⊆O+O⊆U. Thus V‾⊆U. By closure preservation, V‾ is convex and balanced; it is closed and contains the open zero-neighborhood V. Finally balance implies −V⊆V and applying negation again gives V=−V; the same applies to every balanced set, including the empty set.

Depends on

Used by

Dependency tree · two levels

23 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