Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

A nonzero left-null datum passes the series test but is not in the range

Statement refuted

With standard Euclidean inner products, take K:R→R2 given by Kx=(x,0). Define K∗:R2→R by K∗(a,b)=a; for all x∈R and z∈R2 it satisfies ⟨Kx,z⟩=⟨x,K∗z⟩, the defining adjoint identity. For this map let R(K):={Kx:x∈R} and N(K∗):={z∈R2:K∗z=0}. Its sole positive singular pair is s1=1, v1=1, u1=(1,0): these are unit vectors spanning the input and range, and Kv1=s1u1, K∗u1=s1v1. Define the Picard sum for this pair by PK(y):=∣⟨y,u1⟩∣2s12. Then y=(0,1) satisfies PK(y)=0<∞ and y∈N(K∗)∖{0}, but y∉R(K).

Facts & Assumptions

Given: The real spaces X=R and Y=R2 with their standard Euclidean inner products, the linear map Kx=(x,0), and y=(0,1).

[F1]

A compact inverse model has Hilbert parameter/data spaces and a compact forward map, and exact solvability means finding x with Kx=y (Compact linear inverse model between Hilbert spaces).

[F2]

A bounded linear map whose range has a finite ordered basis is compact (Bounded finite rank operators are compact).

[F3]

A real inner product is linear in the first argument, symmetric and positive definite, and its induced norm is ∥x∥=⟨x,x⟩ (Real and complex inner-product spaces and their induced length).

[F4]

Every Cauchy sequence of real numbers converges in R (The reals are complete).

[F5]

A real inner-product space is Hilbert when it is complete in its induced norm (Hilbert space).

Counterexample

technique · direct
1.1givenF1F2F3F4F5algebra

The standard dot products on R and R2 satisfy the inner-product axioms [F3] by coordinatewise addition, multiplication and ∑ixi2=0⇒xi=0 for each coordinate. The standard Euclidean spaces R and R2 are complete: if a sequence is Cauchy in Euclidean norm, each coordinate is Cauchy because its absolute difference is bounded by the Euclidean distance; each coordinate converges by [F4], and the finite sum of squared coordinate errors tends to zero. Thus they are real Hilbert spaces by [F3] and [F5]. The map K is linear and ∥Kx∥=∣x∣, so it is bounded; its range is the one-dimensional span of (1,0), and [F2] makes it compact. It therefore gives the stated compact linear inverse model by [F1].

1.2givenF3algebra

For a∈R and (b,c)∈R2, ⟨Ka,(b,c)⟩=ab=⟨a,K∗(b,c)⟩. Hence N(K∗)={(0,c):c∈R}, while R(K)={(a,0):a∈R}. In particular y is a nonzero element of N(K∗), and no scalar x satisfies Kx=y.

2.1givenstep 1.2F3algebra∎

The vector v1=1 spans the input and u1=(1,0) spans R(K)‾; they satisfy Kv1=u1 and K∗u1=v1. Thus the positive singular pair has s1=1. The Picard sum defined in the statement has sole term ∣⟨(0,1),(1,0)⟩∣2/12=0. Step 1.2 shows that y∈N(K∗)∖{0}, so the missing orthogonality condition allows finite Picard sum without exact solvability.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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