Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (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.

The Kruzhkov entropy inequality across a shock

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the analytic prerequisites used below.

Let f(u)=12u2, let uL>uR, and let u be the shock of The Burgers shock Riemann solution with speed s=uL+uR2. For the Kruzhkov entropy ηk(u)=∣u−k∣ with flux qk(u)=sgn⁡(u−k)(f(u)−f(k)), the entropy-production distribution in space--time is ∂tηk(u)+∂xqk(u)=([qk]−s[ηk]) δ(x−st), where δ(x−st) denotes the distribution paired by ⟨δ(x−st),φ⟩=∫φ(t,st) dt (equivalently, the density with respect to arclength on Γ is divided by 1+s2). Direct computation gives, for every k∈R, [qk]−s[ηk]={0,k≤uR or k≥uL,(k−uR)(k−uL)<0,uR<k<uL, so the distribution is nonpositive, with strict dissipation exactly for uR<k<uL. For uL=1, uR=0, k=12, the coefficient is −14 (Kruzhkov entropy solutions, The convex entropy condition for a single shock is the chord condition, The Rankine--Hugoniot jump condition in space--time normal form).

Facts & Assumptions

Given: Countable Choice, the flux f(u)=12u2, states uL>uR, the shock u with speed s=(uL+uR)/2, the Kruzhkov pairs ηk,qk, and the jumps [h]=h(uR)−h(uL) across the interface.

[F1]

The shock is the entropy solution of the Riemann problem with speed s=(uL+uR)/2: the Rankine--Hugoniot condition s[u]=[f] holds and the jump is admissible; it is a distributional weak solution with the Riemann data (The Burgers shock Riemann solution).

[F2]

Entropy production at a single jump: for a piecewise constant profile with one jump of speed s, ∂tη(u)=(−s)[η] δ(x−st) and ∂xq(u)=[q] δ(x−st) with the pairing convention of the statement, so ∂tη(u)+∂xq(u)=([q]−s[η])δ(x−st); the entropy inequality requires this coefficient to be nonpositive, which is exactly the chord criterion (Kruzhkov entropy solutions, The convex entropy condition for a single shock is the chord condition, The Rankine--Hugoniot jump condition in space--time normal form).

[F3]

For f(u)=12u2 the Kruzhkov flux is qk(u)=sgn⁡(u−k)u2−k22=(u+k)∣u−k∣2 by the identity u2−k2=(u−k)(u+k) and the definition of the absolute value (Absolute value in an ordered field, Kruzhkov entropy solutions).

Proof

technique · direct
1.1F1F2

The production measure. On {x<st} the profile equals the constant uL and on {x>st} it equals uR; for a piecewise constant function with a single jump of speed s the distributional derivatives are the jump measures described in [F2]. Hence ∂tηk(u)+∂xqk(u)=([qk]−s[ηk])δ(x−st) with [qk]=qk(uR)−qk(uL) and [ηk]=ηk(uR)−ηk(uL); positive coefficients violate the entropy inequality.

2.1F3step 1.1

The cases k≤uR and k≥uL. If k≤uR, then both states lie above k, so ηk(uL)=uL−k, ηk(uR)=uR−k, qk(uL)=uL2−k22, qk(uR)=uR2−k22 by [F3], and [qk]−s[ηk]=uR2−uL22−uL+uR2(uR−uL)=0. If k≥uL, then both states lie below k, so ηk(u)=k−u and qk(u)=k2−u22 at both states by [F3]; hence [qk]=uL2−uR22 and [ηk]=uL−uR, and the same subtraction again gives 0.

2.2F3step 1.1

The case uR<k<uL. Here qk(uL)=(uL2−k2)/2 and qk(uR)=(k2−uR2)/2, so [qk]=k2−(uL2+uR2)/2. Also [ηk]=2k−uR−uL. Therefore [qk]−s[ηk]=k2−uL2+uR22−uL+uR2(2k−uR−uL)=(k−uR)(k−uL)<0. The strict sign follows from k−uR>0 and k−uL<0.

3.1step 1.1step 2.2∎

The unit example. For uL=1, uR=0, k=12: s=12 and (k−uR)(k−uL)=12⋅(−12)=−14, so the production distribution is −14δ(x−t/2), nonpositive as required.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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