Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Prop. 2.1.1 — bounded sets in strict colimits

Proved
GarrettFA.isVonNBounded_iff_of_isStrictColimit

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysistopological-vector-spaces

Let VVV be a locally convex space over K=R\mathbb K=\mathbb RK=R or C\mathbb CC that is the strict colimit of a chain of closed subspaces V0⊊V1⊊⋯V_0\subsetneq V_1\subsetneq\cdotsV0​⊊V1​⊊⋯. Then a subset B⊆VB\subseteq VB⊆V is bounded if and only if

∃ i:B⊆Vi  and B is bounded in Vi.\exists\, i:\quad B\subseteq V_i\ \text{ and } B \text{ is bounded in } V_i .∃i:B⊆Vi​  and B is bounded in Vi​.

This is the Dieudonné–Schwartz description of bounded sets. It reduces boundedness, and hence quasi-completeness, in an LF-space to its Fréchet steps.

Formalization Note ViV_iVi​ carries the subspace topology from VVV, and "bounded in ViV_iVi​" is von Neumann boundedness of the preimage of BBB in the subtype ViV_iVi​.

Preamble
import Definitions.Def_GarrettFA_IsStrictColimit
Formal statement
namespace GarrettFA
theorem isVonNBounded_iff_of_isStrictColimit {𝕜 : Type*} [RCLike 𝕜] {V : Type*} [AddCommGroup V] [Module 𝕜 V] [Module ℝ V]
    [IsScalarTower ℝ 𝕜 V] [TopologicalSpace V] [IsTopologicalAddGroup V] [ContinuousSMul 𝕜 V]
    [T2Space V] {F : ℕ → Submodule 𝕜 V} (hF : IsStrictColimit 𝕜 F)
    (B : Set V) :
    Bornology.IsVonNBounded 𝕜 B ↔
      ∃ i, B ⊆ F i ∧ Bornology.IsVonNBounded 𝕜 {y : F i | (y : V) ∈ B} := by sorry
end GarrettFA
Source
Paul Garrett, *Completeness and quasi-completeness* (lecture notes, April 24, 2014), http://www.math.umn.edu/~garrett/m/fun/notes_2012-13/07d_quasi-completeness.pdf, p. 4, Proposition 2.1.1
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let K\mathbb KK be a real-or-complex scalar field (in practice R\mathbb RR or C\mathbb CC), and let VVV be a K\mathbb KK-vector space that is also a real vector space with compatible scalar multiplications (multiplying by a real number rrr is the same as multiplying by r∈Kr\in\mathbb Kr∈K), carrying a topology in which addition and negation are continuous, scalar multiplication K×V→V\mathbb K\times V\to VK×V→V is jointly continuous, and which is Hausdorff. Let F0,F1,…F_0,F_1,\dotsF0​,F1​,… be a sequence of K\mathbb KK-subspaces of VVV forming a strict colimit presentation of VVV. Strict colimit of the sequence of K\mathbb KK-subspaces F0,F1,F2,…F_0,F_1,F_2,\dotsF0​,F1​,F2​,… of VVV (the bundle's definition): (i) Fn⊊FmF_n\subsetneq F_mFn​⊊Fm​ whenever n<mn<mn<m; (ii) every x∈Vx\in Vx∈V lies in some FnF_nFn​; (iii) for each nnn, FnF_nFn​ is a closed subset of Fn+1F_{n+1}Fn+1​, where Fn+1F_{n+1}Fn+1​ has the subspace topology from VVV; (iv) VVV is locally convex as a real topological vector space; (v) every subset U⊆VU\subseteq VU⊆V that is balanced over K\mathbb KK (i.e. cU⊆UcU\subseteq UcU⊆U whenever ∣c∣≤1|c|\le1∣c∣≤1) and convex in the real sense, and whose trace U∩FnU\cap F_nU∩Fn​ is a neighbourhood of 000 in FnF_nFn​ (subspace topology from VVV) for every nnn, is a neighbourhood of 000 in VVV.

Then for every subset B⊆VB\subseteq VB⊆V:

B is bounded in V  ⟺  ∃i: B⊆Fi and B (viewed inside Fi) is bounded in Fi,B \text{ is bounded in } V \iff \exists i:\ B\subseteq F_i \text{ and } B \text{ (viewed inside } F_i\text{) is bounded in } F_i,B is bounded in V⟺∃i: B⊆Fi​ and B (viewed inside Fi​) is bounded in Fi​,

where FiF_iFi​ carries the subspace topology from VVV. Here bounded means von Neumann bounded over K\mathbb KK: every neighbourhood of 000 absorbs the set (for each neighbourhood UUU of 000 there is r>0r>0r>0 such that the set is contained in cUcUcU for all scalars c∈Kc\in\mathbb Kc∈K with ∣c∣≥r|c|\ge r∣c∣≥r).

Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me