Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Sobolev maxima and minima form a lattice

Sources

  • Juha Kinnunen, Sobolev Spaces, Chapter 2 §2.2, Remark 2.4(3) (printed p. 31), where the lattice property of W1,p is recorded: max⁡{u,v} and min⁡{u,v} lie in W1,p, the gradients are Du and Dv on the respective comparison regions, and Du=Dv almost everywhere on {u=v}. The source derives the rule from max⁡{u,v}=12(u+v+∣u−v∣) and the absolute-value rule; the proof below instead uses the positive-part calculus of the preceding corollary together with the pointwise identities u∨v=v+(u−v)+ and u∧v=u−(u−v)+, as the design directs.
  • John K. Hunter, Notes on Partial Differential Equations, Chapter 3, §§3.1–3.5, for the weak-derivative convention, the Sobolev spaces and the lattice operations on Sobolev functions.
  • Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, Chapter 8 §8.2, where the corresponding truncation and absolute-value rules appear as exercises; the argument below is reconstructed from the library interfaces cited in the Facts block and does not import those statements.

Statement

Assume the Axiom of Choice. Let Ω⊆Rn be open, n≥1, let 1≤p≤∞, and let u,v∈W1,p(Ω;R) be real Sobolev classes. On measurable representatives define u∨v:=max⁡{u,v} and u∧v:=min⁡{u,v} pointwise; the resulting almost-everywhere classes are well defined. Then u∨v∈W1,p(Ω) and u∧v∈W1,p(Ω), and for every i∈{1,…,n}, almost everywhere on Ω, Di(u∨v)=1{u>v}Diu+1{u≤v}Div,Di(u∧v)=1{u<v}Diu+1{u≥v}Div. Moreover the two gradients agree on the coincidence set: on {u=v} one has Di(u∨v)=Di(u∧v) almost everywhere, equivalently Diu=Div almost everywhere there. If Ω=∅ every assertion holds vacuously, the endpoints p=1 and p=∞ are included, and no assertion is made about the pointwise derivative of an arbitrary representative.

Facts & Assumptions

Given: The Axiom of Choice; an open Ω⊆Rn with n≥1; an exponent 1≤p≤∞; real Sobolev classes u,v∈W1,p(Ω;R); and the pointwise lattice operations of the Statement, applied to measurable representatives.

[F1]

W1,p(Ω;K) is the set of classes u∈Lp(Ω;K) such that for every first-order multi-index there is an Lp class with a locally integrable representative satisfying the signed test identity for every test function, and each such derivative determines one class Diu (Integer-order Sobolev spaces and their norms).

[F2]

For a function f one has f+=max⁡{f,0}, f−=max⁡{−f,0}, f=f+−f− and ∣f∣=f++f− pointwise (The positive and negative parts of a function).

[F3]

If S⊆R and m∈R, then m is a maximum of S when m∈S and s≤m for every s∈S, and a minimum of S when m∈S and m≤s for every s∈S; a set has at most one maximum and at most one minimum, written max⁡S and min⁡S (Maximum and minimum of a set).

[F4]

An ordered field is a field with a positive cone P satisfying trichotomy and closure, with a<b defined by b−a∈P and a≤b by a<b or a=b (Ordered field).

[F5]

Assume Countable Choice. If two locally integrable classes agree almost everywhere, then one is a weak α-derivative of a class if and only if the other is; in particular this applies to representatives of Lp(Ω) classes for every 1≤p≤∞, which are locally integrable on each compact test support (Weak differentiation ignores null-set changes).

[F6]

Assume Countable Choice. Weak differentiation is complex-linear and passes to open subsets: if vj=Dαuj weakly for j=1,2 and a,b∈C, then av1+bv2=Dα(au1+bu2) weakly (Linearity, locality, and commutation of weak derivatives).

[F7]

Assume the Axiom of Choice. For w∈W1,p(Ω;R) one has w+∈W1,p(Ω) with Diw+=1{w>0}Diw almost everywhere, and Diw=0 almost everywhere on {w=0} (Positive, negative, and truncated Sobolev functions).

[F8]

If f,g:X→R‾ are measurable on a measurable space, then max⁡(f,g), min⁡(f,g), f+g (where defined) and the pointwise product fg are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).

[F9]

If f is measurable and g is Borel measurable on its codomain, then g∘f is measurable (Composition with a Borel measurable outer map preserves measurability).

[F10]

For nonnegative measurable f≤g one has ∫f≤∫g, and ∫cf=c∫f for c≥0 (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F11]

For 1≤p<∞ the class Lp(μ) is a real vector space under pointwise addition and scalar multiplication, and so is L∞(μ) (Lp and L∞ are vector spaces for p≥1).

[F12]

For 1≤p<∞, Lp(μ) consists of the measurable f with ∫∣f∣p dμ<∞, and Lp(μ) denotes the quotient of Lp(μ) by the almost-everywhere-zero functions (The function space Lp(μ) for 0<p<∞).

[F13]

On a measure space, Lp(μ) for 0<p<∞ and for p=∞ is the set of almost-everywhere classes of Lp(μ) respectively L∞(μ), and for 1≤p≤∞ the displayed quotient agrees with the usual quotient-vector-space construction (The space Lp(μ) as the quotient by null functions).

[F14]

L∞(μ)={f:X→R:f measurable and ∥f∥∞<∞} for a measure space (X,A,μ) (The space L∞(μ) of essentially bounded measurable functions).

[F15]

If f is measurable with ∥f∥∞<∞, then ∣f∣≤∥f∥∞ almost everywhere; and if ∣f∣≤M almost everywhere, then ∥f∥∞≤M (The essential supremum is attained as the least essential bound).

[F16]

In ZF the Axiom of Choice implies Countable Choice and the prescribed-start form of Dependent Choice (AC supplies the countable and dependent choices used in Banach integration).

[F17]

The Axiom of Choice asserts a choice function for every family of nonempty sets (The Axiom of Choice).

Proof

technique · direct: write $u\vee v=v+(u-v)^+$ and $u\wedge v=u-(u-v)^+$, apply the positive-part calculus of the preceding corollary to $u-v$, and use the level-set identity on $\{u=v\}$ to make the two indicator conventions agree almost everywhere
1.1F5F12F13F16F17given

By [F16] the Axiom of Choice [F17] yields Countable Choice and Dependent Choice in ZF, so the choice hypotheses of [F5] and [F6] and the Axiom-of-Choice hypothesis of [F7] are in force. Fix one measurable representative u^ of u, one measurable representative v^ of v, and for each i one measurable representative ui of Diu and one vi of Div; these are finitely many selections and need no choice principle. The classes here are the almost-everywhere classes of [F12] and [F13], and by [F5] every one of these representatives is locally integrable on each compact subset of Ω.

1.2F2F3F4given

For all real a,b one has max⁡{a,b}=b+(a−b)+ and min⁡{a,b}=a−(a−b)+: if a≥b then a−b≥0 by [F4], so (a−b)+=max⁡{a−b,0}=a−b by [F2] and [F3], giving b+(a−b)=a=max⁡{a,b} and a−(a−b)=b=min⁡{a,b}; and if a<b then a−b<0, so (a−b)+=0 and the two right-hand sides are b and a.

2.1F1F6F11F12F13step 1.1given

Put w:=u−v. By step 1.1 the classes u,v,Diu,Div are locally integrable, so [F6] with a=1, b=−1 gives Diu−Div=Di(u−v) weakly on Ω, hence almost everywhere on Ω; and w∈Lp(Ω) with each Diw∈Lp(Ω) by [F11], [F12] and [F13]. By [F1] this says w∈W1,p(Ω;R) with the weak derivatives Diw=Diu−Div.

3.1F7step 2.1given

The corollary [F7] applied to the class w=u−v of step 2.1 gives w+∈W1,p(Ω) with Diw+=1{w>0}Diw almost everywhere on Ω, and Diw=0 almost everywhere on {w=0}, so 1{w=0}Diw=0 and Diu=Div almost everywhere on {u=v}={w=0}.

4.1F1F2F6F8F12F13step 1.2step 2.1step 3.1given

Define the classes u∨v:=v+w+ and u∧v:=u−w+. Both lie in W1,p(Ω) with weak derivatives Di(u∨v)=Div+Diw+ and Di(u∧v)=Diu−Diw+ almost everywhere, by [F6] and [F1]; and by step 1.2 the pointwise identities max⁡{u^,v^}=v^+(u^−v^)+ and min⁡{u^,v^}=u^−(u^−v^)+ hold everywhere on Ω with (u^−v^)+=max⁡{u^−v^,0} by [F2]. Since u^−v^ represents w, the function (u^−v^)+ represents w+, so max⁡{u^,v^} and min⁡{u^,v^} are representatives of u∨v and of u∧v; they are measurable by [F8], so [F12] and [F13] make the pointwise maximum and minimum legitimate almost-everywhere classes with the same members as u∨v and u∧v.

5.1F8F9F10F11F12F13F14F15step 2.1step 3.1step 4.1given

First derivative formula. By steps 2.1 and 3.1 the class Di(u∨v) has the representative vi+1{w^>0}(ui−vi) almost everywhere, where w^:=u^−v^; on {w^>0} this equals ui and on {w^≤0} it equals vi, so it agrees pointwise everywhere with 1{w^>0}ui+1{w^≤0}vi, which is measurable by [F8] and [F9]. Each product lies in Lp(Ω): for p<∞ one has ∣1{w^>0}ui∣≤∣ui∣ pointwise and ∫Ω∣ui∣p<∞, so [F10] gives ∫Ω∣1{w^>0}ui∣p≤∫Ω∣ui∣p<∞, and similarly for vi; for p=∞ one has ∣1{w^>0}ui∣≤∣ui∣≤∥ui∥∞ almost everywhere by [F15], so ∥1{w^>0}ui∥∞≤∥ui∥∞<∞ and the product lies in L∞(Ω) by [F14]. Hence both products and their sum lie in Lp(Ω) by [F11], [F12] and [F13], and therefore Di(u∨v)=1{u>v}Diu+1{u≤v}Div almost everywhere on Ω.

6.1F8F9F10F11F12F13F14F15step 2.1step 3.1step 4.1given

Second derivative formula. Likewise Di(u∧v) has the representative ui−1{w^>0}(ui−vi), which agrees pointwise everywhere with 1{w^≤0}ui+1{w^>0}vi; the same measurability and Lp membership arguments as in step 5.1 apply, and on {w^=0} step 3.1 gives ui=vi almost everywhere, so this representative also agrees almost everywhere with 1{w^<0}ui+1{w^≥0}vi. Therefore Di(u∧v)=1{u<v}Diu+1{u≥v}Div almost everywhere on Ω.

7.1step 3.1step 5.1step 6.1given

Coincidence set. On {u=v}={w^=0}, step 3.1 gives Diu=Div almost everywhere, while the formulas of steps 5.1 and 6.1 give Di(u∨v)=Div and Di(u∧v)=Diu there; hence Di(u∨v)=Di(u∧v) almost everywhere on {u=v}, and the two gradient descriptions agree there.

8.1F5F6F7F10F14F15step 1.1step 2.1step 3.1step 4.1step 5.1step 6.1step 7.1given

Degenerate cases and accounting. If Ω=∅ the only classes are zero and every assertion holds vacuously. If u=v, then w=0, w+=0, u∨v=u∧v=u, the two formulas both reduce to Diu=Div almost everywhere, and step 7.1 is consistent with that. The endpoints p=1 and p=∞ are included: step 3.1 uses [F7] for every 1≤p≤∞, and step 5.1 separates the finite and infinite exponent cases only through [F10], [F14] and [F15]. The case n=1 is included because no step uses more than one coordinate direction. Only Countable Choice (through [F5] and [F6]) and the Axiom of Choice (through [F7]) are used, the representative selections of step 1.1 are finite, and no further selection is made. ∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

58 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