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

Injective transpose does not imply surjectivity

Statement refuted

An injective transpose does not force surjectivity of the original bounded operator. On real 2, define (Tx)n=xnn+1(n0). Under the real counting-measure dual identification, T=T. Both maps are injective with dense nonclosed range, and neither is onto.

Facts & Assumptions

Given: The spaces, maps, scalar field, and hypotheses in the statement above. All duals consist of linear functionals over the ambient field; evaluation has no conjugation.

[F1]

From The transpose of a bounded operator, with its stated hypotheses: Let K=R or C. Let T:XY be bounded and linear between normed spaces. Its transpose, or Banach adjoint, is T:YX,(Tg)(x)=g(Tx). The duals are def-dual-space-of-a-normed-space. Composition is bounded by lem-composition-operator-norm-inequality, so this has the displayed codomain. It is linear in g over K. No complex conjugation is inserted; a Hilbert adjoint uses a separate inner-product identification.

[F2]

From Counting measure specializes the representation theorem to p and q, with its stated hypotheses: Let 1p< and let q be conjugate to p. Every bounded linear functional Λ:pR is of the form Λ(a)=n=0anbn for a unique sequence bq. Moreover, Λ=bq.

[F3]

From p is the Lp space of counting measure, with its stated hypotheses: On (N,P(N),#) with counting measure, every function f:NR is measurable. Writing ak:=f(k), one has fpd#=k=0akp(0<p<), by the counting-measure integral dictionary, so Lp(#) is exactly the usual sequence class p. Also f=supkNak, because a subset of N has counting measure zero only when it is empty. Hence the quotient by almost-everywhere equality does nothing: for counting measure on N, equality almost everywhere means equality everywhere.

Counterexample

1.1

The real counting-measure model has x22=nxn2. Thus Tx2x2 and T is linear and injective. Every finite-support y has the finite-support preimage xn=(n+1)yn; truncating a square-summable sequence approximates it because the squared tail sums tend to zero. Therefore the range is dense.

F3
2.1

For a,x2, the pairing is nanxn. Absolute convergence follows, for example, from 2anxnan2+xn2. Hence (Ta)(x)=nanxn/(n+1)=n(Ta)nxn, and uniqueness in the real duality theorem at p=2 gives T=T.

F1F2step 1.1
3.1

The sequence yn=1/(n+1) lies in 2: the zeroth squared term is one and for n1, 1/(n+1)21/n1/(n+1), whose sums telescope. A preimage would satisfy xn=1 for all n, which is not square summable. Thus T is not onto and its dense range is proper, hence nonclosed. By step 2.1 the same is true of T. The formula is defined at index zero, and zero is in both ranges.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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