Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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.

Riemann data uL=3, uR=1: shock speed and entropy coefficients, and a rarefaction check

Example

Assume ACω (The Axiom of Countable Choice (ACω)) for the cited Lebesgue weak/entropy formulation.

Take uL=3>uR=1 in the shock of Riemann shock and rarefaction waves for ut+(u2/2)x=0 are weak solutions, and the shock is an entropy solution. The shock speed is s=uL+uR2=2. For the entropy pair (ηk,qk):

  • for k=2, which lies strictly between uR=1 and uL=3, the interface coefficient is s[η2]−[q2]=1;
  • for k=0, which lies outside the interval [1,3], the coefficient is s[η0]−[q0]=0;

both nonnegative, in accordance with the theorem's closed formula s[ηk]−[qk]=−(k−uL)(k−uR) in the interior case and =0 in the exterior case.

For the rarefaction with uL=1<uR=3, the fan u=x/t satisfies ut+uux=0 identically, and the entropy residuals vanish because the fan is continuous.

Facts & Assumptions

Verification

technique · direct; substitute the explicit data into the closed formulas
1.1givenL1algebra

For k=2: [η2]=∣uR−2∣−∣uL−2∣=1−1=0, and [q2]=sgn⁡(uR−2)uR2−42−sgn⁡(uL−2)uL2−42=(−1)1−42−(1)9−42=32−52=−1. Hence s[η2]−[q2]=0−(−1)=1=−(2−3)(2−1), the interior formula.

1.2givenL1algebra

For k=0: [η0]=1−3=−2 and [q0]=12−92=−4, so s[η0]−[q0]=2(−2)−(−4)=0, the exterior value; both computed coefficients are ≥0 as the theorem requires.

1.3givenL2algebra

For the rarefaction at t=1 and 1<x<3: u=x, and by [L2] with t=1, ut=−x, ux=1, so ut+uux=−x+x=0.

2.1step 1.1step 1.2step 1.3L1L2algebra∎

The computations instantiate the theorem's weak-solution and entropy identities at explicit data: the interior entropy coefficient is positive, the exterior one vanishes, and the rarefaction branch satisfies the equation pointwise.

Remarks

  • This is a finite check of the closed formulas; it does not test the general weak formulation beyond the stated Riemann profiles, and the numerical values 3,1,2,0 are chosen only to exhibit both the interior and the exterior case of the entropy coefficient.

Depends on

Dependency tree · 2 levels

Sources