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

A Gronwall bound for retarded-delay inequalities

Statement

Let τ,T>0, L,H≥0, let q:[0,T]→[0,∞) be continuous, and let u:[−τ,T]→[0,∞) be continuous with u(s)≤H for s∈[−τ,0]. Suppose that u(t)≤H+∫0t(q(s)+L(u(s)+u(s−τ))) ds(0≤t≤T). Then, writing U(t)=max⁡{H,sup⁡0≤r≤tu(r)}, one has U(t)≤(H+∫0tq(s) ds)e2Lt(0≤t≤T).

Facts & Assumptions

Given: The nonnegative continuous functions, constants, history bound, and integral inequality in the Statement.

[F1]

A continuous real function on a compact subset of R is uniformly continuous (Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous).

[F2]

If continuous nonnegative v,a,b satisfy v(t)≤a(t)+∫0tb(s)v(s) ds and a is nondecreasing, then v(t)≤a(t)e∫0tb(s) ds (Gronwall's integral inequality with variable and constant coefficients).

[F3]

A continuous real-valued function on a nonempty compact metric space is bounded (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

Proof

1.1givenF1F3

The running maximum U is finite because [F3] bounds u on the compact interval [0,T]. It is continuous because [F1] gives a modulus of continuity: when t increases by at most δ, any newly included value of u can exceed the old maximum by at most that modulus at δ. Also u(s)≤U(s) and u(s−τ)≤U(s) for s≥0: the latter is bounded by H when s−τ≤0, and otherwise its argument lies in [0,s].

2.1givenstep 1.1algebra

Put A(t)=H+∫0tq(s) ds, which is continuous and nondecreasing. For each r∈[0,t], the assumed inequality and step 1.1 give u(r)≤A(r)+2L∫0rU(s) ds≤A(t)+2L∫0tU(s) ds. Since the same upper bound is at least H, taking the maximum over r∈[0,t] yields U(t)≤A(t)+2L∫0tU(s) ds.

3.1F2step 2.1∎

Apply [F2] to step 2.1 with v=U, a=A, and the constant coefficient b=2L. It gives U(t)≤A(t)e2Lt, the required bound.

Depends on

Used by

Dependency tree · two levels

37 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