§4 — products of quasi-complete spaces are quasi-complete
ProvedGarrettFA.isQuasiComplete_piLet be a family of quasi-complete topological vector spaces over or . Then the product
with the product topology is quasi-complete. Finite sums are the special case of a finite index set.
Formalization Note The index type and the factors live in one common universe.
import Definitions.Def_GarrettFA_IsQuasiComplete universe u
namespace GarrettFA
theorem isQuasiComplete_pi {𝕜 : Type*} [RCLike 𝕜] {ι : Type u}
{E : ι → Type u} [∀ i, AddCommGroup (E i)] [∀ i, Module 𝕜 (E i)] [∀ i, Module ℝ (E i)]
[∀ i, IsScalarTower ℝ 𝕜 (E i)] [∀ i, TopologicalSpace (E i)]
[∀ i, IsTopologicalAddGroup (E i)] [∀ i, ContinuousSMul 𝕜 (E i)] [∀ i, T2Space (E i)]
(hE : ∀ i, IsQuasiComplete 𝕜 (E i)) :
IsQuasiComplete 𝕜 (∀ i, E i) := by sorry
end GarrettFARead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a real-or-complex scalar field (in practice or ). Let be any index type, and for each let be a -vector space that is also a real vector space with compatible scalar multiplications (multiplying by a real number is the same as multiplying by ), carrying a topology in which addition and negation are continuous, scalar multiplication is jointly continuous, and which is Hausdorff, where and all the live in one common universe. Assume every is quasi-complete over . Then the product (all functions choosing a point of each ), with the product topology and coordinatewise operations, is quasi-complete over . Quasi-complete over (the bundle's definition): for every index type (in the same universe as the space) carrying a partial order in which any two elements have a common upper bound, and every family whose set of values is von Neumann bounded over and which is Cauchy (for every neighbourhood of there is with for all ), there is a point with eventually (for all some ) for every neighbourhood of . The index set may be empty or infinite (of any cardinality within the universe).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.