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.
Change of base and inversion of the positive-base real exponential
Statement
If , , and , then In particular, for every second base , .
Facts & Assumptions
Given: with , , and .
and the real-power laws hold for positive bases (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).
Proof
By [L1] and [L2], .
Likewise .
Dividing first by and then by gives .
Depends on
- The logarithm to a positive base other than one
- 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
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
- The hereditary class of all finite graphs does not have the Erdős–Hajnal property Corollary
- The universal logarithmic Ramsey guarantee cannot be replaced by any universal positive power Counterexample
- Checking the subreciprocal condition for the loglog bound Example
- Checking the subreciprocal condition for the quadratic log bound Example
- Comparing the two quantitative density scales Example
- Admissible parameters for the density recursion Lemma
- Qid logarithmic and constant divisibility Lemma
- Special copy trichotomy produces a restricted blockade Lemma
- Quantitative density theorem for ell divisive graphs Theorem
Dependency tree · two levels
10 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
- J. Lebl, Basic Analysis, Logarithm and Exponential (standard reference, not scraped)
- MIT OpenCourseWare 18.100B Real Analysis, Spring 2025 full lecture notes (standard reference, not scraped)