Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-14
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 ℓ2(N) and ℓ∞(N) coordinates. Under the pairing ⟨y,x⟩=∑n≥1ynxn,

J∗={y∈ℓ2:∥y∥J∗:=sup⁡0≠x∈ℓ2∣⟨y,x⟩∣∥x∥J<∞},

and finite-support sequences are norm dense in J∗. For a bounded real sequence z and a nonempty positive tuple p=(p1<⋯<pk), let qp(z) be the cyclic expression in James space (the same finite formula makes sense without assuming z∈c0), and define the endpoint variation by

rp(z)2:=12(∣zp1∣2+∑j=1k−1∣zpj−zpj+1∣2+∣zpk∣2).

For k=1 this gives r(p1)(z)=∣zp1∣. Then

J∗∗={z∈ℓ∞:∥z∥J∗∗:=sup⁡pmax⁡{qp(z),rp(z)}<∞}

isometrically. Every such z has a unique representation z=x+λ1 with x∈J and λ∈R, and the canonical image of J is the summand with λ=0.

Facts & Assumptions

[A1]
[L1]

J is Banach, c00 is dense, and its coordinate truncations and tails are contractions converging strongly to the identity (James space is complete and separable).

[L2]

The defining James formula contains ℓ2 and satisfies ∥x∥J≤2∥x∥2 for every x∈ℓ2 (The James formula defines a norm).

[L3]

The real dual of ℓ2 is represented uniquely by ℓ2 sequences under the series pairing (Counting measure specializes the representation theorem to ℓp and ℓq).

Proof

technique · direct

Given: The objects and hypotheses in the Statement.

1.1L1L2L3algebra

If Λ∈J∗, then [L2] makes Λ∣ℓ2 bounded on ℓ2 because ∣Λ(x)∣≤∥Λ∥∥x∥J≤2∥Λ∥∥x∥2. [given, L1, L2, L3] By [L3] it is pairing with a unique y∈ℓ2. Density of ℓ2 in J makes y determine Λ, and the displayed supremum is exactly its operator norm. Conversely, any y with finite displayed supremum extends by continuity from dense ℓ2 to J.

2.1L1step 1.1

Dual coordinate truncation is pairing with ΠNx. The two contraction [given, L1, step 1.1] estimates in [L1] therefore give ∥ΠNy∥J∗≤∥y∥J∗ and ∥y−ΠNy∥J∗≤∥y∥J∗. The coordinate interpretation follows directly from the series pairing.

3.1A1L1step 2.1

We prove the latter tails tend to zero. If instead their decreasing norms [given, A1, L1, step 2.1] stay above ε>0, then [A1] is used exactly here to choose, for each N, a finite-support u(N)∈J with ΠNu(N)=0, ∥u(N)∥J=1, and ⟨y,u(N)⟩>ε (change sign if needed). Starting at N1=1, put Nj+1=max⁡supp⁡u(Nj).

4.1givenL1step 3.1

Form ξ∈c0 by placing j−1u(Nj) on the coordinate block (Nj,Nj+1]. To verify ξ∈J, split any finite increasing tuple into its intersections with these blocks. Each within-block endpoint variation is at most 1/j, and ∣a−b∣2≤2∣a∣2+2∣b∣2 bounds every transition between blocks by the two adjacent endpoint terms. Consequently

R(ξ)2≤2∑j≥1j−2<∞,

where R=sup⁡prp; the equivalence in [L1]'s proof gives ξ∈J. But ⟨y,ΠNkξ⟩≥ε∑j<kj−1 is unbounded, whereas [L1] makes ∥ΠNkξ∥J≤∥ξ∥J. This contradicts y∈J∗, proving ΠNy→y. [L1, step 3.1, block calculation]

5.1givenstep 4.1

Let Λ∈J∗∗ and set zn=Λ(en). Since ∥en∥J∗=1, z is bounded. By step 4.1,

Λ(y)=lim⁡NΛ(ΠNy)=lim⁡N∑n≤Nynzn.

For each p, the gradients of the finite Euclidean seminorms qp and rp are explicit finite-support functionals of J∗ of norm at most one (because qp(x),rp(x)≤∥x∥J). Evaluating them on z gives qp(z),rp(z)≤∥Λ∥. Hence sup⁡pmax⁡{qp(z),rp(z)}≤∥Λ∥. [step 4.1, finite Euclidean duality]

6.1algebra

Conversely, suppose bounded z has [given, step 5.1] B:=sup⁡pmax⁡{qp(z),rp(z)}<∞. It is Cauchy: otherwise some ε>0 permits recursively choosing the lexicographically least p1<q1<p2<q2<⋯ with ∣zpj−zqj∣≥ε; then the cyclic variation on the first 2k indices is at least εk/2, contradicting B<∞. Let λ=lim⁡nzn and x=z−λ1. Then x∈c0 and qp(x)=qp(z), so x∈J.

7.1givenstep 4.1step 6.1

For y∈J∗, the partial-sum functionals hN(y)=∑n≤Nyn=⟨y,1{1,…,N}⟩ have norm at most one because that initial-block vector has James norm one. They converge on dense c00, and the uniform bound plus step 4.1 makes hN(y) converge for every y∈J∗. Hence

Λz(y):=⟨y,x⟩+λlim⁡NhN(y)=lim⁡N⟨y,ΠNz⟩

is well-defined and linear. A tuple crossing the truncation point turns its cyclic variation into rp′(z), while a tuple on one side gives either zero or qp(z); therefore ∥ΠNz∥J≤B. Taking limits yields ∣Λz(y)∣≤B∥y∥J∗. [step 4.1, step 6.1, truncation cases]

8.1step 5.16.17.1∎

Step 5.1 applied to Λz gives the reverse norm inequality, so [given, step 5.1, step 6.1, step 7.1] ∥Λz∥=B. Steps 5.1 and 7.1 are inverse constructions and prove the isometric bidual model. Step 6.1 gives the unique splitting z=(z−λ1)+λ1; since elements of J tend to zero, the canonical image is exactly λ=0.

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