Proposition 11.6.5 — Pointwise subsequence on a countable set
ProvedLeblRA.pointwise_subsequence_11_6_5Let be any countable set and let be a sequence of functions. Assume pointwise boundedness:
Then there exist a strictly increasing map and a function such that
This is the countable-domain subsequence result in Lebl’s Proposition 11.6.5.
Formalization Note. carries no topology, and no continuity assumption is made. Finite and empty sets are included. The formal sequence starts at zero rather than one; this is only a reindexing. Strict increase is represented by StrictMono, and the pointwise limit is explicit.
import Mathlib.Topology.UniformSpace.Ascoli import Mathlib.Topology.MetricSpace.UniformConvergence import Mathlib.Topology.MetricSpace.Equicontinuity import Mathlib.Topology.UniformSpace.HeineCantor import Mathlib.Topology.Sequences import Mathlib.Analysis.Complex.Basic import Mathlib.Tactic set_option autoImplicit false set_option maxHeartbeats 200000 open Filter Set Topology open scoped UniformConvergence universe u
namespace LeblRA
theorem pointwise_subsequence_11_6_5 {X : Type u} [Countable X]
(F : ℕ → X → ℂ) (hF : ∀ x, ∃ M : ℝ, ∀ n, ‖F n x‖ ≤ M) :
∃ (φ : ℕ → ℕ) (f : X → ℂ), StrictMono φ ∧
∀ x, Tendsto (fun n => F (φ n) x) atTop (𝓝 (f x)) := by sorry
end LeblRARead-back
What the Lean code literally says, in plain math · Codex (exact model identifier unavailable in auditor runtime)
For every at most countable type , of any universe and with no topology assumed, and every sequence of functions indexed by all natural numbers including , assume that for every there exists a real number such that for every natural number . The bound may depend on and is not required explicitly to be positive. Then there exist a function and a function such that is strictly increasing, meaning whenever , and for every the complex sequence converges to as . Explicitly, for each and each real , there is a natural number , which may depend on and , such that for every . The same works for every , and its value at is not prescribed. Here is the usual complex modulus. Finite and empty are included; when is empty, the boundedness and convergence conditions over are vacuous. At any point that exists, the bound in the hypothesis must be nonnegative because it bounds a modulus for .
Exact runtime model ID: unavailable; it was not exposed to this auditor.
Confirmed by the mission captain (proposal self-audit).