Functional analysis Normed and Banach spaces Theorem
James's theorem
Statement
Let be a Banach space over or , and let be its continuous dual space. Then is reflexive if and only if every attains its norm on the closed unit ball. That is, for every there is with and .
Remarks
The direction "reflexive implies norm attaining" is short. In a reflexive space the closed unit ball is weakly compact, and is weakly continuous, so it attains its maximum . The converse is the deep part, and its proof by James is long and combinatorial.
The theorem gives a concrete test for non-reflexivity. On , the functional has norm . For with , some coordinate has , so . So does not attain its norm, and is not reflexive.
Going deeper
For a student
James's theorem is used in optimization and convex analysis, where the existence of maximizers of linear functionals on the unit ball matters. It contrasts with the Bishop–Phelps theorem, which says that in every Banach space the norm-attaining functionals are dense in . It sits beside the Eberlein–Šmulian theorem and the Goldstine theorem as a main characterization of weak compactness and reflexivity.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Banach space concept
- Continuous dual space concept
- Reflexive space concept
- James's theorem statement
Further reading
About this page
| Tag | G1VWNQSAK5 |
|---|---|
| URI | m2://G1VWNQSAK5 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 46B10 |
| Status | This copy of the site has no build data. Run m2 status G1VWNQSAK5. |
| About | Reflexive space |
| Uses | Banach space, Continuous dual space, Reflexive space |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.