Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Euler identity for Clarke subgradients of homogeneous margins

Statement

Let q:Rd→R be locally Lipschitz and positively homogeneous of degree L>0, meaning q(cθ)=cLq(θ) for every c>0. For every θ≠0 and every h∈∂∘q(θ), one has ∂∘q(cθ)=cL−1∂∘q(θ) for c>0 and ⟨θ,h⟩=Lq(θ).

Facts & Assumptions

Given: The locally Lipschitz map q, its positive homogeneity degree L, a nonzero parameter θ, and the Clarke subdifferential convention.

[F1]

Clarke subdifferential and gradient-flow trajectory: for locally Lipschitz maps, the Clarke subdifferential is the closed convex hull of limits of ordinary gradients along differentiability points.

Proof

technique · differentiate the homogeneity identity on the dense differentiability set, then pass to the Clarke closure
1.1givenalgebra

If q is differentiable at x, then q is differentiable at cx and the homogeneity identity gives Dq(cx)[v]=cL−1Dq(x)[v] for every direction v, by writing q(cx+tv)=cLq(x+(t/c)v) and taking the difference-quotient limit as t→0.

1.2givenalgebra

At every differentiability point x≠0, differentiating q(cx)=cLq(x) with respect to c at c=1 gives ⟨x,∇q(x)⟩=Lq(x).

2.1F1step 1.1construct

Conversely, differentiability at cx implies differentiability at x by applying the same argument with scale 1/c. Thus scaling by c bijects the differentiability points and sends each gradient to cL−1 times that gradient. Taking all gradient limits as x→θ, and then their closed convex hull as in [F1], proves ∂∘q(cθ)=cL−1∂∘q(θ).

3.1F1step 1.2construct∎

For any gradient limit h=lim⁡k∇q(xk) with differentiability points xk→θ, continuity of q gives ⟨θ,h⟩=Lq(θ). This identity is preserved by convex combinations and limits, so [F1] yields it for every h∈∂∘q(θ).

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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