Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Compact operator sends weakly convergent sequences to norm convergent sequences

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field, let T:X→Y be a compact operator (Compact linear operator) and let (xn) be a sequence in X (Sequences of reals: bounded, eventually, frequently, tails, subsequences) with xn⇀x weakly (Weak convergence of nets and sequences). Then ∥Txn−Tx∥→0 (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

Facts & Assumptions

[A1]

Under the Axiom of Dependent Choice, a family of bounded linear operators on a Banach space that is pointwise bounded is norm bounded (Uniform boundedness principle, Banach space); the continuous dual X∗ is Banach even when X is incomplete (The continuous dual, its completeness, and evaluation), and the canonical map JX:X→X∗∗ is a linear isometry (The canonical bidual map is an isometry).

[A2]

xn⇀x means f(xn)→f(x) for every f∈X∗; the transpose satisfies (T∗g)(x)=g(Tx) and T∗g∈X∗ for g∈Y∗ (Weak convergence of nets and sequences, The transpose of a bounded operator, A bounded linear operator between normed spaces).

[A3]

Assume DC: if a sequence fails to converge to a point then there are a real ε>0 and a strictly increasing index map j with ∥Txnj−Tx∥≥ε for all j (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, A strictly increasing index map satisfies nk≥k, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A4]

Under DC, a compact operator sends bounded sequences to sequences with convergent subsequences (Sequential characterization of compact operators, Compact linear operator).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a compact operator T:X→Y, a sequence (xn) in X with xn⇀x.

1.1A1A2A5

The sequence (xn) is norm bounded: the operators JXxn:X∗→K are pointwise bounded because f(xn)→f(x) makes (f(xn))n a bounded scalar sequence for each f∈X∗, so [A1] and the isometry property give sup⁡n∥xn∥=sup⁡n∥JXxn∥<∞.

1.2A2

The sequence (Txn) converges to Tx weakly: for g∈Y∗ one has g(Txn)=(T∗g)(xn)→(T∗g)(x)=g(Tx) by [A2].

1.3A3

If ∥Txn−Tx∥↛0, then by [A3] there are ε>0 and a strictly increasing j with ∥Txnj−Tx∥≥ε for every j.

2.1step 1.1step 1.3A4

Assume ∥Txn−Tx∥↛0 and take ε and (xnj) as in [step 1.3]. The subsequence (xnj) is bounded by [step 1.1], so [A4] gives a further subsequence (xnjk) with Txnjk→y for some y∈Y.

3.1step 1.2step 2.1A2A5

For every g∈Y∗ the scalar sequence g(Txnjk) converges to g(y) because g is bounded hence continuous, and to g(Tx) by [step 1.2]; hence g(y)=g(Tx) for every g, and [A5] gives y=Tx.

4.1step 1.3step 3.1

But ∥Txnjk−Tx∥≥ε for every k by [step 1.3], contradicting Txnjk→Tx=y from [step 3.1].

5.1step 4.1∎

Hence the assumption ∥Txn−Tx∥↛0 is false, that is, ∥Txn−Tx∥→0.

Depends on

Used by

Dependency tree · two levels

69 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