Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (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.

F4 Bare Nodal Evaluation Supercharge Not Closable

Physical scope

Pure local functional-analysis counterexample under the explicit Euclidean disk and H1 graph-norm hypotheses; no actual physical degeneration is assumed.

Statement

Assume the Axiom of Choice. Let B={x∈R2:∣x∣<1} be the open unit disk with Lebesgue measure, let H=L2(B;C), and write Cc∞(B;C) for the compactly supported smooth complex functions on B. A function vj∈L2(B;C) is the weak derivative ∂ju of u∈L2(B;C) when ∫Bu ∂jϕ=−∫Bvjϕ for every ϕ∈Cc∞(B;C). Define H1(B):={u∈L2(B;C):∂1u,∂2u∈L2(B;C)} with norm ∥u∥H12=∥u∥22+∥∂1u∥22+∥∂2u∥22. Let K be a complex Hilbert space and regard D as an unbounded complex-linear map D:Dom⁡(D)=H1(B)⊂H→K. Assume that D is densely defined and closed and that constants c,C>0 satisfy c∥u∥H1(B)≤(∥u∥L2(B)2+∥Du∥K2)1/2≤C∥u∥H1(B)(u∈H1(B)). Let D={F∣B‾:F∈C∞(R2;C)} be the smooth test space, and for a fixed λ∈C∖{0} define A:D⊕D⊂H⊕H→K⊕K⊕C by A(u+,u−)=(Du+,Du−,u+(0)−λu−(0)).

For a densely defined linear operator T:Dom⁡(T)⊂X→Y between Hilbert spaces, write Γ(T)={(x,Tx):x∈Dom⁡(T)}. Call T closable when the closure of Γ(T) in X⊕Y is the graph of an operator; equivalently, every sequence xn∈Dom⁡(T) with xn→0 and Txn→y has y=0. The smooth test space D is dense in H, but A is not closable from H⊕H to K⊕K⊕C. Moreover, the smooth branch pairs satisfying u+(0)=λu−(0) are dense in H1(B)⊕H1(B). Thus a bare point-matching condition is lost under this graph-norm completion. This result uses the Euclidean disk and the stated H1-equivalent graph norm; it is not a claim about every physical singular metric or domain.

Facts & Assumptions

Given: The Axiom of Choice, disk, Sobolev and Hilbert spaces, operator D, graph-norm equivalence, and nonzero scalar λ in the Statement.

[A1]

The Axiom of Choice is the stated set-theoretic hypothesis (The Axiom of Choice).

[F1]

For a bounded smooth domain, integer k≥1 and 1≤p<∞, restrictions of ambient smooth functions are dense in Wk,p (Ambient smooth restrictions are dense on bounded Ck domains). In particular this supplies the H1(B) density used below, but its statement does not include k=0.

[F2]

Under countable choice, complex Cc∞(Rn) is dense in Euclidean Lebesgue Lp for n≥1 and 1≤p<∞ (Complex finite-simple and smooth compact-support density for finite p). The full Axiom of Choice in [A1] supplies this countable-choice hypothesis.

Proof

Given: The hypotheses in the Statement.

1.1givenA1F2constructalgebra

For f∈L2(B;C), let f~ be its zero extension to R2. Then f~∈L2(R2;C) with the same norm. For each ε>0, [F2] with n=2, p=2 gives g∈Cc∞(R2;C) such that ∥g−f~∥L2(R2)<ε. Its restriction to B‾ lies in D, and ∥g∣B−f∥L2(B)≤∥g−f~∥L2(R2)<ε. Thus D is dense in H.

1.2givenconstructalgebra

Define ρ(t)=0 for t≤0 and ρ(t)=e−1/t for t>0, and put χ(t)=ρ(t)/(ρ(t)+ρ(1−t)). The denominator is positive, χ is smooth, χ=0 on (−∞,0], χ=1 on [1,∞), and χ′ is supported in [0,1]. For 0<ε<1, set Lε=log⁡(1/ε) and ηε(r)=χ ⁣(log⁡(r/ε2)Lε)(r>0),ηε(0)=0. It is smooth and radial because it is constant for r≤ε2 and for r≥ε. It equals zero near 0 and one for r≥ε. The function ψε=1−ηε has support in B‾ε, so ∥ψε∥22≤πε2. In polar coordinates, with t=log⁡(r/ε2)/Lε, ∫B∣∇ηε∣2=2πLε∫01∣χ′(t)∣2 dt⟶0. Therefore ψε→0 in H1(B), while ψε(0)=1.

2.1givenstep 1.2construct

The graph closure criterion in the Statement is equivalent to the usual closed-extension definition: a graph closure that is a graph is a closed extension, and any closed extension contains the graph closure. Its being a graph is equivalent to having no nonzero vector (0,v); such a vector belongs to the graph closure exactly when a sequence of domain elements tends to zero while their outputs tend to v. Put ψε on the plus branch and zero on the minus branch. The inputs tend to zero in L2⊕L2, and graph-norm equivalence gives Dψε→0 in K. Their point-difference output is always 1. Hence the graph of A contains ((ψε,0),(Dψε,0,1))→(0,(0,0,1)). It also contains the zero graph pair (0,(0,0,0)). The closure of the graph therefore contains two distinct outputs over the same zero input, so it is not the graph of an operator. Thus A is not closable.

3.1A1F1step 1.2algebra∎

For smooth u on B‾, ∥(1−ηε)u∥22≤∥u∥∞2πε2, and the product rule gives ∥∇((1−ηε)u)∥22≤2∥∇u∥∞2πε2+4π∥u∥∞2Lε∫01∣χ′(t)∣2dt→0. Thus ηεu→u in H1(B). For a smooth pair (u+,u−), (ηεu+,ηεu−) is zero at both origins, so it satisfies the matching condition and converges to the pair in H1⊕H1. By [F1], smooth pairs are dense in H1(B)⊕H1(B). The closure of the matched smooth pairs is consequently the whole direct-sum space. This proves the claimed loss of point matching under completion.

Depends on

Dependency tree · 2 levels

Sources