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 in a locally convex real or complex TVS, there is an open balanced convex zero-neighborhood with . Consequently 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 and a zero-neighborhood .
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).
Symmetric small neighborhoods, open translations and dilations, and joint vector continuity are available (Translations, dilations and absorption in a topological vector space).
Closures preserve convexity and balance (Convex closures and hulls of finitely many compact convex sets).
Every open neighborhood of a closure point meets the set; closure is closed and contains the set (A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set).
Proof
Choose a symmetric open zero-neighborhood with , then an open convex zero-neighborhood . Joint scalar continuity at supplies and an open zero-neighborhood with . Put , which is open and contains zero.
Define . If and , then , so is balanced. It contains . For , since , so . Moreover is open: all nonzero dilates are open, and the zero dilate contributes only zero, which already belongs to .
Put . Then , and is convex. For , distributing through a finite convex sum leaves its summands in , proving balance of . To prove openness, represent . Some , and is an open subset of containing . Thus is an open balanced convex zero-neighborhood. Zero coefficients cause no problem because the sum of the coefficients is one.
If , then is an open neighborhood of and meets . Write with ; hence . Thus . By closure preservation, is convex and balanced; it is closed and contains the open zero-neighborhood . Finally balance implies and applying negation again gives ; the same applies to every balanced set, including the empty set.
Depends on
- Local convexity, convex and balanced sets, and the continuous dual
- Translations, dilations and absorption in a topological vector space
- Convex closures and hulls of finitely many compact convex sets
- A point lies in the closure of $A$ iff every basic neighbourhood of it meets $A$; the closure is the smallest closed superset and equals $A$ together with its derived set
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
- Gerald Teschl, Topics in Real and Functional Analysis, section 5.1 (standard reference, not scraped)