Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 minimum-TV truth can lack an L² source certificate

Statement refuted

Assume Countable Choice. The claim that every minimum-TV exact truth in a two-dimensional Neumann model has an L2 source certificate is false. Let Ω=(−1,1)2, let X=Y=L2(Ω;R), let A:X→Y be the identity, let f=u† with u†(x1,x2)=∣x1∣, and let the regularizer be the Neumann total variation R(u)=∣Du∣(Ω) on BV(Ω)∩L2(Ω) and R(u)=+∞ otherwise. The exact equation Au=f has the unique solution u†, so it is a minimum-TV exact truth. Nevertheless, there is no p∈L2(Ω;R) such that A∗p=p∈∂R(u†), where p∈∂R(u†) means R(v)≥R(u†)+∫Ωp(v−u†) dx for every v∈L2(Ω;R).

Facts & Assumptions

Given: Ω=(−1,1)2, X=Y=L2(Ω;R), A=I, u†(x1,x2)=∣x1∣, f=u†, and R=TVN as specified in the Statement.

[F1]

Spatial BV and distributional total variation: Du is the vector of distributional derivatives and TV(u;Ω) is the partition variation ∣Du∣(Ω).

[F2]

Full-space, Dirichlet, and Neumann TV conventions: in the Neumann convention, R(u)=TV(u;Ω) for u∈BV(Ω).

[F3]

Banach-space convex subgradients and dual pairings: p∈∂R(u) exactly when R(v)≥R(u)+⟨p,v−u⟩L2 for every v∈L2(Ω).

[F4]

Real and complex inner-product spaces and their induced length: the real L2 inner product is ⟨p,v⟩=∫Ωpv dx; Cauchy–Schwarz bounds its absolute value by ∥p∥2∥v∥2. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[F5]

Tonelli and Fubini for the completed product, with only almost-everywhere section measurability: integrable functions on this rectangle may be integrated by iterated one-dimensional integration.

[F6]

Lebesgue measure is a Radon measure on R^n: Lebesgue measure on R2 is Radon; an integrable density gives a finite Radon measure on the bounded domain.

[F7]

Variation of a finite vector Radon measure is Radon: the partition variation of a finite vector Radon measure is a finite positive Radon measure.

[F8]

Dominated convergence: pointwise convergence almost everywhere under an integrable majorant permits convergence of integrals; it applies to the difference quotients bounded by ∣∇φ∣.

[F9]

Integrable simple functions are dense in L1(μ): every real integrable function admits integrable finite-valued simple approximants in L1; apply it separately to the two coordinates of a vector-valued density.

Counterexample

technique · direct directional-derivative contradiction

For any integrable real vector density g=(g1,g2) and ε>0, apply [F9] to each coordinate with L1 error less than ε/2 and refine the two finite partitions in common. The resulting finite-valued vector simple function s satisfies ∥g−s∥L1<ε, since the Euclidean pointwise norm is at most the sum of the absolute coordinate errors. Thus the vector approximation used in step 1.2 follows from the scalar supplier coordinatewise. The dominated-convergence supplier [F8] also applies there: the difference quotients are bounded by the integrable function ∣∇φ∣.

1.1F1F2F5F6givenalgebra

The function u†=∣x1∣ is bounded on the bounded Lipschitz domain Ω, hence belongs to L2(Ω). Fubini and one-dimensional integration by parts show that its distributional gradient is Du†=sgn⁡(x1)e1 dx: for every compactly supported smooth vector field φ, the x1 derivative pairing is −∫∣x1∣∂1φ=∫sgn⁡(x1)φ1, and the x2 derivative pairing vanishes. This bounded density defines a finite vector Radon measure by [F6], so u†∈BV(Ω). Since A=I, its Hilbert adjoint is also I. The equation Au=f forces u=f=u†, so u† is the unique exact solution and therefore minimizes R among exact solutions.

1.2F1F2F5F6F7F8F9givenalgebra

For φ∈Cc∞(Ω;R) and t∈R, the distributional gradient of u†+tφ has density gt=sgn⁡(x1)e1+t∇φ. For any integrable vector density g, its partition variation mass is ∫∣g∣: every partition gives ∑j∣∫Bjg∣≤∫∣g∣; conversely, for ε>0 choose a finite-valued measurable simple function s=∑k=1Nck1Bk with ∥g−s∥1<ε, where the disjoint Bk partition the set and s=0 off their union. Then this partition gives ∑k∣∫Bkg∣≥∑k∣ck∣∣Bk∣−∥g−s∥1=∥s∥1−∥g−s∥1≥∥g∥1−2ε. Taking arbitrary ε proves the formula. Consequently R(u†+tφ)=∫Ω∣sgn⁡(x1)e1+t∇φ∣ dx. For almost every x, the vector q=sgn⁡(x1)e1 has norm one and lim⁡t↓0(∣q+th∣−∣q∣)/t=q⋅h. The quotient is bounded in absolute value by ∣h∣, by the reverse triangle inequality. Dominated convergence with h=∇φ therefore yields the one-sided derivative L(φ):=lim⁡t↓0R(u†+tφ)−R(u†)t=∫Ωsgn⁡(x1)∂1φ dx=−2∫−11φ(0,x2) dx2, where the last equality is integration by parts on (−1,0) and (0,1); compact support removes the endpoint terms. Replacing φ by −φ gives directional derivative −L(φ).

2.1F3step 1.2given

Suppose a certificate p∈L2(Ω) existed. The subgradient inequality [F3] applied to u†+tφ for t>0, divided by t and passed to the limit in step 1.2, gives ∫Ωpφ≤L(φ). Applying the same inequality to u†−tφ gives −∫Ωpφ≤−L(φ). Thus ∫Ωpφ=L(φ) for every compactly supported smooth φ.

3.1F4step 1.2step 2.1choosealgebra∎

Choose η,ψ∈Cc∞((−1,1)) with η(0)=1 and ∫−11ψ≠0, and for 0<ε<1 set φε(x1,x2)=η(x1/ε)ψ(x2). Then φε∈Cc∞(Ω) and ∥φε∥2=ε ∥η∥2∥ψ∥2→0. But step 2.1 and the formula in step 1.2 give ∫Ωpφε=−2∫−11ψ(x2) dx2, a fixed nonzero number, whereas Cauchy–Schwarz [F4] forces these integrals to tend to zero. This contradiction proves that no L2 source certificate exists.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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