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

Entropy variables leave compact positive-state tubes near vacuum

Example

Take R=1, γ=2, cv=1, and s0=0 in one dimension. For each integer n≥1, let Un=(ρn,mn,En)=(1/n,0,1/n). Every state is admissible and has pn=1/n, Tn=1, and sn=log⁡n. Its density entropy variable is vρ,n=2−log⁡n, which tends to −∞ as the positive density and pressure tend to zero. The sequence approaches the excluded vacuum state (0,0,0), so no compact set C⋐G contains all Un.

Verification

Given: The model and entropy-variable formulas with R=1, γ=2, cv=1, s0=0, and Un=(1/n,0,1/n).

[F1] Ideal-gas compressible Navier–Stokes–Fourier model: G={ρ>0,E>∣m∣2/(2ρ)}, p=(γ−1)(E−∣m∣2/(2ρ)), T=p/(Rρ), and s=cvlog⁡(p/ργ)+s0.

[F2] Strict convexity and entropy variables for the ideal-gas Euler flux: vρ=cvγ−s−β∣u∣2/2, vE=−β, and β=1/T.

1.1F1givenalgebra

For Un, ρn>0, εn=En=1/n>∣0∣2/(2ρn), so Un∈G. The formulas [F1] give pn=1/n, Tn=1, and sn=log⁡((1/n)/(1/n)2)=log⁡n.

2.1F2step 1.1algebra

Here un=0 and βn=1. Substitution into [F2] gives vρ,n=2−log⁡n and vE,n=−1, hence ∣vρ,n∣→∞.

3.1F1step 1.1step 2.1algebra∎

The states satisfy Un→(0,0,0), which is outside G because its density is zero. Every compact subset of Euclidean state space is closed, so a compact C⋐G containing every Un would also contain their limit, a contradiction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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