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

Adjoints of shifts, multiplication and integral operators

Example

Assume the Axiom of Countable Choice. Then:

  1. On ℓ2(N;K) the right shift S(x0,x1,x2,… )=(0,x0,x1,… ) has Hilbert adjoint the left shift L(y0,y1,y2,… )=(y1,y2,y3,… ).
  2. For m∈L∞(X,μ;C) the multiplication operator Mm[f]=[mf] on complex L2(μ) is bounded and Mm∗=Mm‾.
  3. Let (X,A,μ) and (Y,B,ν) be σ-finite measure spaces and let k represent a class in L2(μ×ν;C). Then (Kf)(x)=∫Yk(x,y)f(y) dν(y) defines a bounded operator K:L2(ν)→L2(μ) independently of the representatives of k and f, and its adjoint is K∗g(y)=∫Xk(x,y)‾g(x) dμ(x).

Facts & Assumptions

[A1]

The Hilbert adjoint of T is the unique operator with ⟨Tx,y⟩=⟨x,T∗y⟩ (The Hilbert-space adjoint of a bounded operator).

[A2]

ℓ2 carries the first-variable-linear pairing ⟨x,y⟩=∑kxkyk‾ and is a Hilbert space; the complex L2 pairing is ⟨f,g⟩=∫fg‾ with Cauchy–Schwarz ∣⟨f,g⟩∣≤∥f∥2∥g∥2 (The standard inner products make K n, ell two and quotient L two Hilbert spaces, Complex completeness, density, and inner product: the consumer interface, Complex Lp classes and Euclidean test-function conventions).

[A3]

For m∈L∞ and f∈L2 the product mf lies in L2 with ∥mf∥2≤∥m∥∞∥f∥2 (Complex Holder, Minkowski, and the quotient norm).

[A4]

On a σ-finite product, Tonelli applies to nonnegative measurable functions and Fubini to L1 functions, with the iterated integrals equal to the product integral (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L1 functions on a sigma-finite product, Finite, sigma-finite, and semifinite measures).

[A5]

Countable Choice is the hypothesis under which the adjoint and the L2 completions are available (The Axiom of Countable Choice (ACω)).

Verification

technique · direct

Given: The spaces and operators of the statement.

1.1A1A2

For x,y∈ℓ2 the series in ⟨Sx,y⟩=∑n≥0(Sx)nyn‾=∑n≥1xn−1yn‾=∑k≥0xkyk+1‾=⟨x,Ly⟩ converge absolutely by Cauchy–Schwarz, so S∗=L by uniqueness of the adjoint.

1.2A1A2A3

The multiplication operator satisfies ∥Mmf∥2≤∥m∥∞∥f∥2 by [A3], and ⟨Mmf,g⟩=∫mfg‾=∫fm‾g‾=⟨f,Mm‾g⟩ for all f,g∈L2, so Mm is bounded with Mm∗=Mm‾.

1.3A2A4

For f∈L2(ν) put h(x):=(∫Y∣k(x,y)∣2dν(y))1/2∈[0,+∞]. Wherever the section integral converges absolutely, the Cauchy–Schwarz inequality in the y-variable gives ∣∫Yk(x,y)f(y) dν(y)∣≤∫Y∣k(x,y)f(y)∣ dν(y)≤h(x)∥f∥2; by Tonelli [A4] applied to the nonnegative (μ×ν)-measurable function ∣k∣2, the function h2 is μ-measurable with ∫Xh(x)2dμ(x)=∥k∥22<+∞, so h∈L2(μ) and h(x)<+∞ for μ-almost every x. Hence (Kf)(x)=∫Yk(x,y)f(y) dν(y) is defined and finite for μ-almost every x, and it is μ-measurable after zero extension: Tonelli [A4] makes the section integrals of the positive and negative parts of Re⁡(kf) and Im⁡(kf) μ-measurable, and on the conull set where the integral of kf is finite the real and imaginary parts of (Kf)(x) are differences of these measurable functions. Since ∣Kf∣≤h∥f∥2 almost everywhere and h∥f∥2∈L2(μ), the class of Kf lies in L2(μ) with ∥Kf∥2≤∥k∥2∥f∥2. Finally, if k=k′ and f=f′ almost everywhere, then the function (x,y)↦∣k(x,y)f(y)−k′(x,y)f′(y)∣ is nonnegative and measurable with vanishing product integral, so for μ-almost every x its section vanishes ν-almost everywhere by Tonelli [A4], that is, Kf=Kf′ μ-almost everywhere.

2.1step 1.3A1A2A4

For f∈L2(ν) and g∈L2(μ) the function (x,y)↦k(x,y)f(y)g(x)‾ lies in L1(μ×ν): with h as in step 1.3, Tonelli and Cauchy–Schwarz in L2(μ) give ∫X×Y∣k(x,y)f(y)g(x)‾∣ d(μ×ν)=∫X∣g(x)∣(∫Y∣k(x,y)f(y)∣ dν(y))dμ(x)≤∥f∥2∫Xh(x)∣g(x)∣ dμ(x)≤∥f∥2∥h∥2∥g∥2=∥k∥2∥f∥2∥g∥2<+∞. Hence Fubini [A4] applies and ⟨Kf,g⟩=∫X∫Yk(x,y)f(y)g(x)‾ dν(y)dμ(x)=∫Yf(y)∫Xk(x,y)‾g(x) dμ(x)‾ dν(y)=⟨f,K∗g⟩ with K∗g(y)=∫Xk(x,y)‾g(x)dμ(x); applying the same estimate to the conjugate kernel k‾, which also lies in L2(μ×ν) with the same norm, gives ∥K∗g∥2≤∥k∥2∥g∥2, so K∗ is a bounded operator and is the Hilbert adjoint of K.

3.1step 1.1step 1.2step 2.1A5∎

Steps 1.1, 1.2 and 2.1 exhibit the three displayed adjoints, so the claimed formulas hold, under the countable-choice hypothesis recorded in [A5].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

64 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