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

Local inversion of a fidelity first crossing

Statement

Let F:[0,∞)→R be continuous, F(0)=1, a>0, and p>0. Suppose that 1−F(t)=atp+O(tp+1) as t↓0: explicitly, there are C,δ0>0 such that ∣1−F(t)−atp∣≤Ctp+1 for 0<t<δ0. Define τ(1−ϵ)=inf⁡{t≥0:F(t)<1−ϵ}, with the infimum of the empty set taken as +∞. Then τ(1−ϵ)∼(ϵ/a)1/p as ϵ↓0: that is, their ratio tends to 1. If a=0, this inversion gives no conclusion.

Facts & Assumptions

Proof

Given: The function and constants satisfy the stated hypotheses.

Goal: Prove that τ(1−ϵ)/(ϵ/a)1/p→1 as ϵ↓0.

1.1givenF3algebra

Fix 0<η<1 and set b=12min⁡{1−(1−η)p,(1+η)p−1}>0. Choose 0<δ<δ0 with Cδ≤ab. The remainder bound then gives (a−ab)tp≤1−F(t)≤(a+ab)tp for 0<t<δ.

2.1step 1.1F2F3algebra

Put x=(ϵ/a)1/p. For all sufficiently small ϵ>0, (1+η)x<δ: indeed this follows whenever ϵ<a(δ/(1+η))p, by the power laws and strict increase. At t+=(1+η)x, the lower bound in step 1.1 is strictly greater than ϵ, since (1−b)(1+η)p>1. Thus t+ belongs to the crossing set.

3.1givenstep 1.1step 2.1F1F2F3algebra

For 0<t≤t−=(1−η)x, the upper bound in step 1.1 is strictly less than ϵ, because (1+b)(1−η)p<1. At t=0, 1−F(0)=0<ϵ. Hence every member of the crossing set is greater than t−. The set is nonempty by step 2.1 and bounded below by 0, so its infimum exists and t−≤τ(1−ϵ)≤t+.

4.1step 3.1algebra∎

Dividing by x>0 gives 1−η≤τ(1−ϵ)/x≤1+η for all sufficiently small positive ϵ. Since every positive error tolerance contains such an η, the ratio tends to 1. The proof used a>0; it asserts no inversion when a=0.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.