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.
Dual and bidual models for James space
Statement
Assume Countable Choice. Use the positive coordinate labels fixed in James space, and use the same relabeling for the underlying and coordinates. Under the pairing ,
and finite-support sequences are norm dense in . For a bounded real sequence and a nonempty positive tuple , let be the cyclic expression in James space (the same finite formula makes sense without assuming ), and define the endpoint variation by
For this gives . Then
isometrically. Every such has a unique representation with and , and the canonical image of is the summand with .
Facts & Assumptions
Countable Choice holds (The Axiom of Countable Choice ()).
is Banach, is dense, and its coordinate truncations and tails are contractions converging strongly to the identity (James space is complete and separable).
The defining James formula contains and satisfies for every (The James formula defines a norm).
The real dual of is represented uniquely by sequences under the series pairing (Counting measure specializes the representation theorem to and ).
Proof
Given: The objects and hypotheses in the Statement.
If , then [L2] makes bounded on because . [given, L1, L2, L3] By [L3] it is pairing with a unique . Density of in makes determine , and the displayed supremum is exactly its operator norm. Conversely, any with finite displayed supremum extends by continuity from dense to .
Dual coordinate truncation is pairing with . The two contraction [given, L1, step 1.1] estimates in [L1] therefore give and . The coordinate interpretation follows directly from the series pairing.
We prove the latter tails tend to zero. If instead their decreasing norms [given, A1, L1, step 2.1] stay above , then [A1] is used exactly here to choose, for each , a finite-support with , , and (change sign if needed). Starting at , put .
Form by placing on the coordinate block . To verify , split any finite increasing tuple into its intersections with these blocks. Each within-block endpoint variation is at most , and bounds every transition between blocks by the two adjacent endpoint terms. Consequently
where ; the equivalence in [L1]'s proof gives . But is unbounded, whereas [L1] makes . This contradicts , proving . [L1, step 3.1, block calculation]
Let and set . Since , is bounded. By step 4.1,
For each , the gradients of the finite Euclidean seminorms and are explicit finite-support functionals of of norm at most one (because ). Evaluating them on gives . Hence . [step 4.1, finite Euclidean duality]
Conversely, suppose bounded has [given, step 5.1] . It is Cauchy: otherwise some permits recursively choosing the lexicographically least with ; then the cyclic variation on the first indices is at least , contradicting . Let and . Then and , so .
For , the partial-sum functionals have norm at most one because that initial-block vector has James norm one. They converge on dense , and the uniform bound plus step 4.1 makes converge for every . Hence
is well-defined and linear. A tuple crossing the truncation point turns its cyclic variation into , while a tuple on one side gives either zero or ; therefore . Taking limits yields . [step 4.1, step 6.1, truncation cases]
Step 5.1 applied to gives the reverse norm inequality, so [given, step 5.1, step 6.1, step 7.1] . Steps 5.1 and 7.1 are inverse constructions and prove the isometric bidual model. Step 6.1 gives the unique splitting ; since elements of tend to zero, the canonical image is exactly .
Depends on
Used by
Dependency tree · two levels
15 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
- Theo Bühler and Dietmar Salamon, Functional Analysis (standard reference, not scraped)