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

Coordinate evaluations converge weak star to zero in ell one star

Example

For real or complex scalars, the coordinate functionals En(x)=xn on ℓ1 are weak-star null and satisfy ∥En∥=1. Under (ℓ1)∗=ℓ∞, these are the coordinate unit sequences.

Facts & Assumptions

[F1]

The complex identification is the bilinear isometry b↦(x↦∑kbkxk) (The complex continuous dual of ell-one is ell-infinity).

[F2]

The sequence norm is ∑k∣xk∣ (ℓp is the Lp space of counting measure).

[F3]

Weak-star convergence means convergence on each fixed primal vector (Weak star convergence).

Verification

Given: the coordinate functionals on real or complex ℓ1.

1.1givenF1F2

The complex coefficient identification is F1. For real scalars, a bounded sequence b defines hb(x)=∑kbkxk with ∣hb(x)∣≤∥b∥∞∥x∥1. Conversely if h is bounded, bk=h(ek) satisfies ∣bk∣≤∥h∥; finite truncations of x converge in norm because their error is the absolute series tail, so h(x)=∑kbkxk. Testing ek gives ∥hb∥≥sup⁡k∣bk∣, proving isometry and uniqueness. Thus the identification holds over either field.

2.1step 1.1F2F3

For every x∈ℓ1, convergence of ∑k∣xk∣ forces xn→0. Hence En(x)→0 for each fixed x, proving weak-star convergence. The inequality ∣En(x)∣≤∥x∥1 and equality En(en)=1 give ∥En∥=1 exactly. □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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