Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck pendingverified 2026-10-23 (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.

Burgers shock entropy and Lax speeds

Example

Assume the Axiom of Countable Choice. Let T>0, let a,b∈R with a>b, and set F(z)=z2/2 and s=(a+b)/2. For t>0 define u(t,x)=a for x<st and u(t,x)=b for x>st; assign any value at x=st. Let u0(x)=a for x<0 and u0(x)=b for x>0, with an arbitrary value at x=0. Then u satisfies the initial-value weak identity for ut+∂xF(u)=0. For every convex η∈C2(R) and every q∈C1(R) with q′=η′F′, it satisfies the initial-value entropy inequality with the convention that the distributional entropy residual is nonpositive. It also satisfies every Kružkov inequality for ηk(z)=∣z−k∣ and qk(z)=sgn⁡(z−k)(F(z)−F(k)), where sgn⁡(0)=0. Its shock speed obeys F′(b)<s<F′(a).

Facts & Assumptions

Given: Countable Choice; the states a>b; the flux, profile, initial data, and entropy pairs in the Example.

[F1]

Strictly convex scalar Riemann construction: for a C2 scalar flux with F′′>0 between the two states, the stated shock profile is an initial-value weak solution, satisfies every compatible convex C2 entropy inequality and every Kružkov inequality, and has the scalar Lax speed inequalities.

[F2]

Riemann shock and rarefaction waves for ut+(u2/2)x=0 are weak solutions, and the shock is an entropy solution: assuming Countable Choice, for F(z)=z2/2 and left state greater than right state, the same shock profile satisfies the Lebesgue weak formulation and all stated convex C1 and Kružkov entropy inequalities.

[F3]

The Axiom of Countable Choice (ACω): Countable Choice is the choice assumption used by the imported Lebesgue weak formulation.

[F4]

Distributional systems and entropy flux pairs: for smooth tests compactly supported in [0,T)×R, the scalar initial weak identity is ∫0T ⁣∫R(uφt+F(u)φx) dx dt+∫Ru0φ(0,x) dx=0; the entropy inequality replaces (u,F,u0) by (η,q,η(u0)), requires a nonnegative test, and requires the whole integral to be nonnegative.

[A1]

a>b.

Proof

1.1givenF1F2F3F4A1

The Burgers flux is C2 and F′′(z)=1>0 on [b,a]. Therefore [F1] applies to these states and this profile, giving the initial weak identity, the compatible convex entropy inequalities, the Kružkov inequalities, and the scalar Lax pattern in the formulations fixed by [F4]. The imported formulation in [F2] has the same profile and explicitly assumes the Countable Choice recorded in [F3].

2.1givenF2A1step 1.1algebra∎

Directly, s=(a2−b2)/(2(a−b))=(a+b)/2, while F′(b)=b and F′(a)=a; hence F′(b)<s<F′(a). For b≤k≤a, put C(z)=F(b)+s(z−b), the chord of F joining the endpoint fluxes. Then F(k)−C(k)=12(k−a)(k−b), so the Kružkov interface coefficient is [qk]−s[ηk]=2(F(k)−C(k))=(k−a)(k−b)≤0; for k∉[b,a], ηk is affine on the state interval and qk is a constant-sign multiple of F−F(k), so the coefficient is zero by the Rankine–Hugoniot equality. This agrees with the nonpositive residual convention.

Depends on

Dependency tree · 2 levels

Sources