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 be continuous, , , and . Suppose that as : explicitly, there are such that for . Define , with the infimum of the empty set taken as . Then as : that is, their ratio tends to . If , this inversion gives no conclusion.
Statement references
Facts & Assumptions
A nonempty real set bounded below has an infimum; that infimum is a lower bound at least as large as every other lower bound. Every nonempty set bounded below has an infimum Greatest lower bound (infimum)
For positive bases, real powers are defined by and obey and . Real powers for positive bases, with the zero-base positive-exponent convention The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
For , the derivative of on is ; hence is strictly increasing there. Continuity and derivatives of positive-base real powers On an interval I, for f continuous on I and differentiable at every interior point: f' ≥ 0 throughout gives f nondecreasing, f' > 0 gives f increasing, f' ≤ 0 and f' < 0 give the two decreasing forms; conversely a nondecreasing f has f' ≥ 0 and a nonincreasing f has f' ≤ 0 wherever it is differentiable, and no strict converse is claimed
Proof
Given: The function and constants satisfy the stated hypotheses.
Goal: Prove that as .
Fix and set . Choose with . The remainder bound then gives for .
Put . For all sufficiently small , : indeed this follows whenever , by the power laws and strict increase. At , the lower bound in step 1.1 is strictly greater than , since . Thus belongs to the crossing set.
For , the upper bound in step 1.1 is strictly less than , because . At , . Hence every member of the crossing set is greater than . The set is nonempty by step 2.1 and bounded below by , so its infimum exists and .
Dividing by gives for all sufficiently small positive . Since every positive error tolerance contains such an , the ratio tends to . The proof used ; it asserts no inversion when .
Depends on
- Greatest lower bound (infimum)
- Every nonempty set bounded below has an infimum
- Real powers for positive bases, with the zero-base positive-exponent convention
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
- Continuity and derivatives of positive-base real powers
- On an interval I, for f continuous on I and differentiable at every interior point: f' ≥ 0 throughout gives f nondecreasing, f' > 0 gives f increasing, f' ≤ 0 and f' < 0 give the two decreasing forms; conversely a nondecreasing f has f' ≥ 0 and a nonincreasing f has f' ≤ 0 wherever it is differentiable, and no strict converse is claimed
- Continuity of f : A → ℝ at a point of A and on A: the ε-δ condition, its agreement with lim_x → c f(x) = f(c) at a limit point, and continuity at an isolated point
- The ε-δ limit lim_x → c f(x) = L of f : A → ℝ at a limit point c of A
- The extended real line ℝ̄ = ℝ ∪ {-∞, +∞}, its order, and the arithmetic that is left undefined
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.