Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 nonconvex gradient energy can lose weak lower semicontinuity

Statement refuted

Counterexample. Assume the Axiom of Choice, the ultrafilter lemma, DC and HB (The Axiom of Choice, The ultrafilter extension principle (UL/BPI), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF). On Ω=(0,1) let w:R→R be the 1-periodic function with w(t)=t on [0,12] and w(t)=1−t on [12,1], and put uk(x)=1kw(kx) for integers k≥1. Then uk→0 uniformly, uk′∈{±1} almost everywhere, and uk⇀0 in H1(0,1). For the nonnegative integrand f(ξ)=(ξ2−1)2, which is not convex since f(0)=1>12f(−1)+12f(1)=0, The integral is interpreted in [0,+∞] on H1(0,1); it need not be finite for every H1 function. I(u)=∫01(u′(x)2−1)2dx satisfies I(uk)=0 for every k, while I(0)=∫011 dx=1. Hence I(0)>lim⁡kI(uk)=0 and I is not weakly sequentially lower semicontinuous. Also I is not convex: I(u1)=I(−u1)=0<I((u1−u1)/2)=1, so A convex norm-lower-semicontinuous functional is weakly lower semicontinuous does not apply. Nevertheless I attains its minimum 0 at every uk. This example does not refute the existence conclusion of The direct method for convex integral functionals with convexity removed: it also lies outside that theorem's n≥2 and p=2 upper-growth hypotheses.

Facts & Assumptions

Given: The Axiom of Choice (for ACL), the ultrafilter lemma, DC and HB; the interval Ω=(0,1); the 1-periodic continuous function w with w(t)=t on [0,12] and w(t)=1−t on [12,1]; the functions uk(x)=1kw(kx); and the integrand f(ξ)=(ξ2−1)2 with I(u)=∫01(u′(x)2−1)2dx. The weak compactness step uses the ultrafilter lemma, DC and HB (The ultrafilter extension principle (UL/BPI), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

The function w is continuous, 1-periodic, satisfies ∣w∣≤12 and w(0)=w(1)=0, and is piecewise linear with ∣w′∣=1 almost everywhere. Hence uk(x)=1kw(kx) is absolutely continuous on [0,1] with a.e. derivative uk′(x)=w′(kx)∈{±1}; by the ACL characterisation uk∈W1,2(0,1) with weak derivative uk′ (The ACL characterisation of W1,p, Integer-order Sobolev spaces and their norms).

[F2]

For φ∈L2(0,1) the maps u↦∫01uφ and u↦∫01u′φ are bounded linear functionals on W1,2(0,1) with operator norm at most ∥φ∥L2, by Cauchy-Schwarz against the two components of the Sobolev norm (Integer-order Sobolev spaces and their norms).

[F3]

W1,2(0,1) is a reflexive Banach space, so every norm-bounded sequence in it has a weakly convergent subsequence under the ultrafilter lemma, DC and HB (W^{1,p}(Omega) is reflexive for 1<p<infinity, Reflexivity is equivalent to weak subsequential compactness of bounded sequences).

[F4]

If y∈L2(0,1;R) has ∫yφ=0 for all real φ∈L2, take φ=y to obtain ∥y∥22=0, so y=0 as an L2 class. This directly identifies the subsequential Sobolev limit; uniqueness of weak probability-measure limits is not used.

[F5]

The weak lower semicontinuity lemma assumes convexity of the functional (A convex norm-lower-semicontinuous functional is weakly lower semicontinuous). The convex integral existence theorem also assumes n≥2 and a p-growth upper bound (The direct method for convex integral functionals); the present interval and quartic integrand fail these hypotheses for p=2. Nonconvexity is checked by the midpoint inequality (Convex and strictly convex functionals on a convex subset of a real vector space), and existence here is decided by the explicit values of I.

Counterexample

technique · direct computation along the oscillating sawtooth sequence
1.1F1algebra

The sequence and its bounds. By [F1] the functions uk lie in W1,2(0,1) with ∣uk∣≤12k and ∣uk′∣=1 almost everywhere; hence ∥uk∥L2≤12k→0 and ∥uk′∥L2=1 for every k, so (uk) converges to 0 in L2 and is norm bounded in W1,2(0,1).

1.2F1algebra

The values of I. Since ∣uk′∣=1 almost everywhere, I(uk)=∫01(uk′2−1)2=0 for every k; and I(0)=∫01(0−1)2dx=1. Hence lim inf⁡kI(uk)=0<1=I(0).

2.1F2F3F4step 1.1

uk⇀0 in W1,2(0,1). Suppose not; then there are a bounded linear functional F on W1,2(0,1) and ε>0 with ∣F(uk)∣≥ε for infinitely many k. Along that subsequence, which stays norm bounded, [F3] provides a further subsequence with ukl⇀y for some y∈W1,2(0,1). For every φ∈L2(0,1) the bounded functional of [F2] gives ∫01uklφ→∫01yφ, while ∫01uklφ→0 because ukl→0 in L2 by step 1.1; passing to the limit, ∫01yφ=0 for all φ∈L2, so y=0 by taking φ=y in [F4]. But then F(ukl)→F(0)=0, contradicting ∣F(ukl)∣≥ε. Hence uk⇀0 in W1,2(0,1).

3.1F5step 1.2step 2.1algebra∎

Conclusion and scope. Steps 1.2 and 2.1 give I(0)=1>0=lim inf⁡kI(uk) along a sequence converging weakly to 0, so I is not weakly sequentially lower semicontinuous. Since I(−u1)=I(u1)=0 but I(0)=1, I is not convex. Yet I≥0 and I(u1)=0, so its minimum is attained. Thus the example shows loss of weak lower semicontinuity for a nonconvex gradient energy, without asserting necessity of convexity for existence; the cited convex integral theorem also has dimensional and growth hypotheses absent here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

88 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