Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Bounded sequences in a separable Hilbert space have weakly convergent subsequences

Statement

Assume Countable Choice. Every bounded sequence in a separable real Hilbert space X has a weakly convergent subsequence. If V is a separable real Hilbert space, then L2(0,T;V) and L2(0,T;V∗) are separable real Hilbert spaces, their product is a separable Hilbert space, and the graph of the weak time-derivative operator is closed there. Consequently W(0,T;V) is a closed Hilbert subspace of that product and every bounded sequence in W(0,T;V) has a weakly convergent subsequence.

Facts & Assumptions

Given: A separable real Hilbert space X and a sequence (xn) with sup⁡n∥xn∥X≤C<∞.

[F1]

L2(0,T;X) consists of strongly measurable equivalence classes with the square-integral norm, and the weak time derivative is the scalar test identity stated for the parabolic energy space (Evolution triples and the parabolic energy space).

[F2]

Riesz representation identifies the continuous dual of a real Hilbert space isometrically with that space; hence V∗ is separable when V is separable (Riesz representation for Hilbert spaces).

[F3]

Rational box-step functions are countable and dense in scalar L2(R) under Countable Choice; restricting them to (0,T) gives a countable dense subset of L2(0,T) (Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞).

[F4]
[F5]

A countable union of measurable null sets is null (Finite and countable subadditivity of measures).

[F6]

Measures of increasing sets converge to the measure of their union (Continuity from below for measures).

[F7]

Every closed subspace of a Hilbert space and its orthogonal complement decompose the whole space (Orthogonal decomposition by a closed subspace).

[F8]

A Hilbert space is complete in its induced norm (Hilbert space).

[A1]

Countable Choice supplies representatives for countably many L2 classes and the assumptions of [F2], [F3] and [F7]; the coordinate extraction below is deterministic (The Axiom of Countable Choice (ACω)).

[F9]

Every bounded real sequence has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

Proof

1.1F9givenconstruct

Apply Gram–Schmidt to a countable dense sequence in X, omitting zero remainders, to obtain a finite or countable orthonormal family (ej) with dense span. Use the following deterministic extraction for each bounded real sequence (bn) with ∣bn∣≤C. Start with [−C,C]; at each bisection retain the left closed half if it contains infinitely many terms, and otherwise the right closed half, which then contains infinitely many terms. From the kth retained interval select the least index larger than the preceding selected index whose term lies in that interval. The selected terms lie in nested intervals of diameters tending to zero, hence are Cauchy; [F9] gives a convergent subsequence, so the entire selected sequence converges. This rule determines the extracted indices uniquely, including when C=0, and can therefore be recursively applied to successive coordinates (xn,ej)X without dependent choice. For finitely many coordinates use the last extracted subsequence; for infinitely many take the diagonal of the nested subsequences, whose indices are strictly increasing and whose tail lies in every earlier subsequence. If the family is empty retain the original sequence. The resulting (xnk) has a limit aj=lim⁡k(xnk,ej)X for each coordinate present.

1.2A1F1F4F5F6givenchoose

Let E be any separable real Hilbert space. The formula (f,g)L2(E)=∫0T(f(t),g(t))E dt is well-defined by pointwise Cauchy–Schwarz and Holder [F4], and its induced norm is the square-integral norm. To prove completeness, let (fn) be Cauchy. By [A1], choose a subsequence (fnk) with summable successive L2(E) distances and representatives for that countable subsequence. Put hk(t)=∥fnk+1(t)−fnk(t)∥E. Minkowski bounds partial-sum L2 norms by the sums of the norms; monotone convergence [F4] gives h=∑khk∈L2(0,T). Its infinite-value set is null, since positive measure would force ∫h2≥N2∣{h=∞}∣ for every N. Thus fnk(t) converges in complete E for a.e. t to f(t). The limit is strongly measurable: because E is separable, distances to a countable dense set are measurable; first-dense-point approximants are countably valued, and finite truncations with summable exceptional-set measures converge a.e. by [F5]–[F6]. The pointwise tail estimate and Minkowski give ∥f−fnm∥L2(E)≤∑k≥m∥fnk+1−fnk∥L2(E)→0. The original Cauchy sequence then converges to f. This proves that L2(0,T;E) is Hilbert.

1.3A1F1F2F3F4givenconstruct

Finite-valued simple functions are dense in L2(0,T;E): take the pointwise simple approximants from [F1], replace values by zero where their norm exceeds twice the target norm, and use dominated convergence [F4]; the squared error is at most nine times the target's squared norm. Approximate the finitely many values by a countable dense subset of E, and each scalar indicator by the countable dense family [F3]. Since (0,T) has finite measure, these approximations produce a countable dense family of finite sums in L2(0,T;E). With [F2], this proves that both L2(0,T;V) and L2(0,T;V∗), and therefore their product, are separable Hilbert spaces.

2.1F8step 1.1algebra

For each m, orthogonality gives ∑j=1maj2=lim⁡k∑j=1m(xnk,ej)X2≤C2. Thus (aj) is square-summable, so its partial sums form a Cauchy sequence; completeness [F8] gives the Hilbert-series limit x=∑jajej in X.

3.1step 1.1step 2.1algebra

Inner products (xnk,y)X converge to (x,y)X when y lies in the finite span of the ej, by coordinate convergence. For arbitrary y∈X, approximate it by such a finite-span vector ym using the dense span from step 1.1; the uniform bound gives ∣(xnk−x,y−ym)X∣≤(C+∥x∥X)∥y−ym∥X. First choose m large, then k large. Therefore xnk⇀x.

4.1F1F2F7step 1.1step 2.1step 3.1given∎

The derivative graph is closed in the product: if (un,gn)→(u,g) strongly in both factors, continuous embedding V→H and Cauchy–Schwarz let every scalar test identity [F1] pass to the limit. Thus the graph is a closed Hilbert subspace. It is weakly closed: a weak limit is orthogonal to the graph's orthogonal complement, so [F7] gives (S⊥)⊥=S for that closed subspace. Apply steps 1.1–3.1 to the separable product Hilbert space. Every bounded graph sequence has a weakly convergent subsequence by that argument, and its limit remains in the graph. This proves the asserted weak subsequential compactness in W(0,T;V).

Depends on

Used by

Dependency tree · two levels

72 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