Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

Logarithmic halfline heat mass loss at the pressure endpoint

Statement

Assume the Axiom of Choice. Fix ν>0, 1/2<α≤3/4, and nonnegative η∈C∞([0,∞)) supported in [0,1/16) and equal to 1 on [0,1/32]. Define w0(y)=η(y)y−1/2(log⁡(1/y))−α for 0<y<1/16, and w0(y)=0 for y≥1/16. Put Gt(s)=(4πνt)−1/2e−s2/(4νt), w(t,y)=∫0∞[Gt(y−z)−Gt(y+z)]w0(z) dz. Then w0∈L1∩L2(0,∞), w≥0, w(t,0)=0, wt=νwyy, and w is smooth for positive time, including at y=0. Moreover sup⁡t>0∥w(t)∥j≤∥w0∥j(j=1,2),w(t)→w0 in L2 as t↓0, ∫0T∥wy(t)∥22 dt≤(2ν)−1∥w0∥22,∫0T∥w(t)∥44 dt<∞. Write M(t)=∫0∞w(t,y) dy, M0=∫0∞w0, m(t)=M(t)−M0, and h(t,y)=−∫y∞w(t,z) dz. Then hy=w, ht=νhyy, h(t,0)=−M(t), and m(0)=0. For some t∗>0 and c,C>0, writing L(t)=log⁡(1/t), ct−3/4L(t)−α≤−m′(t)≤Ct−3/4L(t)−α,∣m(t)∣≤Ct1/4L(t)−α(0<t<t∗). Consequently m′∈L1(0,T)∖L4/3(0,T) and ∫0T(∣m′(t)∣t1/4+∣m(t)∣t−3/4)2 dt<∞ for every finite T>0. On each bounded y interval, h(t,⋅)→h0(⋅)=−∫⋅∞w0 uniformly as t↓0. On each closed interval separated from supp⁡w0, all spatial derivatives of w are bounded for small positive time by CNt−Ne−c/t, with constants allowed to depend on the derivative.

Facts & Assumptions

Given: The Axiom of Choice and the data in the Statement.

[A1]

The Axiom of Choice supplies the Countable and Dependent Choice hypotheses of the integration and approximation suppliers. (The Axiom of Choice, AC supplies the countable and dependent choices used in Banach integration)

[F1]

Gaussian kernels have unit mass, solve the heat equation, and have Gaussian spatial derivative bounds. They form an approximate identity, which converges in L2; convolution obeys Young's inequality. (Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel, Gaussian kernels form an approximate identity, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, Young's convolution inequality under Countable Choice)

[F2]

Dominated convergence and Holder's inequality apply to the displayed Lebesgue integrals. (Dominated convergence, Holder's inequality for integrals, including the endpoint cases)

Proof

1.1A1F1F2givenalgebra

The square of w0 near zero is y−1(log⁡(1/y))−2α, integrable because 2α>1; its first power is also integrable. For y,z>0, Gt(y−z)≥Gt(y+z), proving positivity. Its integral in either positive variable is at most 1. Thus the positive kernel is an L1 contraction; Jensen's inequality in its subprobability measure, followed by integration in y, proves the L2 contraction. Equivalently the latter follows by Young applied to the odd extension w~0 on the line, whose heat evolution remains odd; restricting the equal two halfline norms gives the same bound. The Gaussian derivative bounds justify differentiating the convolution for every t>0, and give wt=νwyy and the zero boundary value. Approximate-identity convergence applied to w~0 gives strong L2 initial convergence.

2.1F1F2step 1.1construct

Fix a smooth β:[0,∞)→[0,1] equal to 0 on [0,1] and 1 on [2,∞). The explicit w0,j(y)=β(jy)w0(y) are smooth and compactly supported away from zero and converge to w0 in L2 by dominated convergence. Evolve their odd extensions. Integration by parts on the line, with Gaussian tails, gives ∥w(t)∥22+2ν∫0t∥wy∥22=∥w0∥22 for each approximant. Applying this identity to differences makes the evolutions Cauchy in Lt∞Ly2 and their derivatives Cauchy in Lt,y2. Their limit is the kernel evolution by its contraction, and its weak derivative is the derivative limit by integration against compactly supported tests. This gives the stated energy inequality. For a smooth halfline function vanishing at zero and decaying at infinity, the fundamental theorem gives ∥w∥∞2≤2∥w∥2∥wy∥2, hence ∥w∥44≤2∥w∥23∥wy∥2. Time integration, the energy bound and Holder prove the L4 assertion; approximation passes the inequality to this w.

2.2F1F2step 1.1algebra

Integrating the Gaussian kernel first in y gives M(t)=∫0∞erf⁡(z/(2νt))w0(z) dz, where erf⁡(r)=2π−1/2∫0re−s2 ds. Dominated convergence gives M(t)→M0, and differentiation for positive time gives m′(t)=−t−3/22πν∫0∞ze−z2/(4νt)w0(z) dz. After z=t r, the prefactor is t−3/4. The integral on 1≤r≤2 is bounded below by cL(t)−α for small t. For r≤t−1/4, log⁡(1/(tr))≥L(t)/4, so the integral is bounded above by CL(t)−α∫0∞r1/2e−r2/(4ν) dr. For r>t−1/4 the Gaussian tail is exponentially small; on the support of η(tr) the logarithmic factor is uniformly bounded above, which gives the same upper bound. This proves both derivative bounds. Integrating the upper bound from zero gives ∣m(t)∣≤Ct1/4L(t)−α.

3.1step 2.2algebra

The upper derivative bound is integrable. The lower bound gives ∫0t∗∣m′∣4/3≥c∫0t∗t−1L(t)−4α/3 dt=∞, since 4α/3≤1. In contrast the squared critical-corrector expression is at most Ct−1L(t)−2α, which is integrable since 2α>1. Away from time zero every quantity is smooth, proving all stated time-integral conclusions.

4.1F1F2step 1.1step 2.2algebra∎

Differentiating the tail integral gives hy=w and ht=νwy=νhyy; the boundary term at infinity vanishes by Gaussian decay. Also h(t,y)=∫0yw(t,z) dz−M(t). Thus on [0,B] its difference from h0 is at most B∥w(t)−w0∥2+∣M(t)−M0∣, which tends to zero. Finally a positive separation between y and supp⁡w0 puts every differentiated Gaussian convolution under the bound CNt−Ne−c/t∥w0∥1. These arguments prove the remaining assertions.

Depends on

Used by

Dependency tree · two levels

53 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