Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22 rests on later material
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 symmetric closed operator that is not self-adjoint

Statement refuted

Assume the Axioms of Countable Choice and Dependent Choice. On the Hilbert space H=L2((0,1);C) (The space Lp(μ) as the quotient by null functions) let T:=id/dx with domain D(T)={fAC[0,1]:fL2(0,1), f(0)=f(1)=0}, where complex-valued absolute continuity and the derivative are read on real and imaginary parts (Absolute continuity on a compact interval). Domain notation means the L2 classes having the indicated absolutely continuous representative; endpoint values refer to that representative. Then:

  1. T is densely defined, closed and symmetric, so T refutes the reading "closed and symmetric implies self-adjoint";
  2. D(T)={gAC[0,1]:gL2(0,1)} and Tg=ig, so T is a proper closed extension of T; T itself is not symmetric, and TT;
  3. the periodic domain D2={gAC[0,1]:gL2(0,1), g(0)=g(1)} carries a closed symmetric extension of T, strictly between T and T.

Facts & Assumptions

[A1]

A densely defined operator is symmetric when TT and self-adjoint when T=T; the adjoint of a densely defined operator is always closed (Symmetric, self-adjoint and essentially self-adjoint operators, The adjoint is well defined, closed, and reverses inclusions).

[A2]

For real-valued absolutely continuous functions the fundamental theorem of calculus and integration by parts hold, and the indefinite integral of an L1 function is absolutely continuous; applied to real and imaginary parts this gives the same calculus for complex-valued absolutely continuous functions (Absolute continuity on a compact interval, Fundamental theorem of calculus for absolutely continuous functions, Integration by parts for absolutely continuous functions, The indefinite integral of an L1 function is absolutely continuous, The indefinite integral of an L1 function is differentiable almost everywhere).

[A3]

Cc(R) is dense in L2(R) under Countable Choice, applied componentwise for complex functions. There exists a smooth χ on R with 0χ1, equal to one on [1,1] and zero off [2,2]. Dominated convergence applies under an integrable majorant (Cc(Rn) is dense in Lp(Rn) for 1p<, Explicit compactly supported smooth cutoffs , Dominated convergence).

[A4]

yD(T) exactly when xTx,y is bounded on D(T), and then Tx,y=x,Ty for all xD(T) (Adjoint of a densely defined operator, The adjoint is well defined, closed, and reverses inclusions).

[A5]

Under Countable Choice, complex L2 is a Hilbert space of almost-everywhere classes with first-variable-linear pairing f,g=fg (L2 with the integral pairing is a Hilbert space, The space Lp(μ) as the quotient by null functions). The pairing satisfies Cauchy–Schwarz; taking h and 1 on an interval of length at most one gives hh2 (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

Counterexample

technique · direct

Given: H=L2((0,1);C) and T=id/dx on the domain D(T) above.

1.1

An absolutely continuous representative is continuous and unique in its almost-everywhere class: a nonzero difference at a point would stay nonzero on a relative interval of positive length. It is bounded on [0,1] and thus belongs to L2; its a.e. derivative is independent of the representative. The stated domains are linear and define linear operators. Complex absolutely continuous calculus is obtained componentwise from the real theory. If F,G are complex-valued with absolutely continuous real and imaginary parts, then F(x)F(0)=0xF for all x, and 01FG=F(1)G(1)F(0)G(0)01FG; if hL2(0,1) then x0xh is of this kind with derivative h almost everywhere by the first L1 fundamental theorem, using the inclusion L2L1 in [A5]. These are the uses of the stated Countable Choice and Dependent Choice through the calculus and Hilbert-space suppliers.

A2A5
2.1

Given uH, extend it by zero to u0 on R. By [A3] and Countable Choice, choose complex φnCc(R) with φnu02<1/n, using real and imaginary approximations if necessary. For n5 put ζn(x)=(1χ(nx))(1χ(n(x1))) on (0,1) and extend it by zero outside. It vanishes in neighborhoods of both endpoints, so this extension is smooth with compact support in (0,1). Also 0ζn1 and ζn(x)1 for every x(0,1). Then ψn=ζnφnCc(0,1)D(T) and ψnu21/n+(ζn1)u20 by domination by u2 for the squared error. Thus D(T) is dense.

A3A5step 1.1
2.2

Symmetry: for f,gD(T) the boundary term in 1.1 vanishes because f(0)=f(1)=0, so Tf,g=i01fg=01fig=f,Tg; hence TT, and T is symmetric.

A1step 1.1
2.3

Closedness: let fnD(T) with fnf and Tfnw in L2. Then fniw in L2, so by 1.1 the functions Gn(x):=0xfn converge uniformly to G(x):=0xiw on [0,1], since supxGn(x)G(x)fniw2 by [A5], with Gn=fnfn(0)=fn; hence fnG pointwise and in L2, so f=G, that is, f is absolutely continuous with f=iw almost everywhere, f(0)=G(0)=0 and f(1)=G(1)=limnfn(1)=0. Thus fD(T) and Tf=if=i(iw)=w, so T is closed. The sequential graph criterion applies in this metric product under the assumed Countable Choice.

A5step 1.1
2.4

Adjoint computed. If gAC[0,1] has gL2(0,1), then for every fD(T) the identity in step 1.1 read backwards gives Tf,g=f,ig, so gD(T) and Tg=ig.

A4step 1.1
2.5

Conversely let gD(T) and put h:=Tg; by 1.1 the function H(x):=0xh is absolutely continuous with H=h and H(0)=0. For every fD(T) integration by parts in the form of 1.1 gives 01fh=f(1)H(1)f(0)H(0)01fH=01fH, while 01fh=f,Tg=Tf,g=i01fg. Hence 01f(Hig)=0 for every fD(T).

A4step 1.1
3.1

The derivatives of elements of D(T) are exactly E={φL2(0,1):01φ=0}: one inclusion follows from step 1.1, and conversely f(x)=0xφ has derivative φ, vanishes at both endpoints, and belongs to D(T). Set k=H+igL2 and m=01k. Step 2.5 says φk=0 for every φE. Taking φ=km gives 0=(km)k=km2, since (km)=0. Thus k=m as a class and g=iHim. This supplies an absolutely continuous representative of g with g=ih a.e., so h=ig. No unproved orthogonal-hyperplane assertion is needed.

A5step 1.1step 2.5
4.1

By steps 2.4 and 3.1, D(T)={gAC[0,1]:gL2(0,1)} and Tg=ig. This is strictly larger than D(T): the constant function 1 lies in D(T) but not in D(T). Hence TT, and T is a proper closed extension of T by [A4]. Moreover T is not symmetric: for g1(x)=x, g2=1 one computes from step 1.1 that Tg1,g2g1,Tg2=i(g1(1)g2(1)g1(0)g2(0))=i0.

A4step 2.2step 2.4step 3.1
5.1

Let Sg=ig on the periodic domain D2. It is densely defined because it extends T. For f,gD2 the boundary form in step 1.1 vanishes, so S is symmetric. If gD(S), the adjoint identity restricted to D(T) gives gD(T) and Sg=Tg=ig by [A4] and step 4.1. For arbitrary fD2, integration by parts therefore gives 0=i(f(1)g(1)f(0)g(0)). Choose f=1D2: then g(1)=g(0), so gD2. Conversely the boundary form vanishes for every periodic g, giving gD(S) and Sg=Sg. Hence S=S with equality of domains; S is self-adjoint and therefore closed by [A1]. The constant function lies in D2D(T), and xx lies in D(T)D2, proving both strict inclusions.

A1A4step 1.1step 2.1step 4.1
6.1

Every claim is witnessed: T is densely defined and closed by steps 2.1 and 2.3, symmetric by step 2.2, and TT by step 4.1; the failure of "symmetric implies self-adjoint" is therefore established, and no claim is made that a self-adjoint extension does not exist: the periodic domain of step 5.1 provides one by its explicitly computed adjoint.

step 2.1step 2.2step 2.3step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

73 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