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.
The Logan-Shepp-Vershik-Kerov limit profile
Definition
Define the function by with the principal arcsine of Principal inverse sine and inverse cosine. Its elementary properties, all used below, are as follows.
(a) Evenness. The functions , and are even, so is even.
(b) Values and continuity at the junctions. At the first formula gives because , agreeing with ; the arcsine branch and are continuous on their closed domains, and the two branches agree at the two junction points, so is continuous on all of .
(c) First derivative. For differentiability of on (Principal inverse sine and inverse cosine, Derivative of an inverse: if is continuous and injective on a nondegenerate interval and differentiable at with , then the inverse is differentiable at with ; and if then is not differentiable at , The derivatives of sine and cosine are cosine and minus sine) and the chain and product rules (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when ) applied to give For the derivative of the restriction is . As the formula tends to for , and as it tends to for ; hence is differentiable at every real point with and the one-sided derivatives at both equal (they are the limits of from within and from outside).
(d) Lipschitz bound and smoothness. Since for , one has for , while for . On each of the intervals , , the function is continuous and differentiable on the interior, so the mean value theorem (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ) gives for in the same interval, and the continuity at gives the same bound across the junctions; thus is -Lipschitz. On the arcsine branch is with so is there with strictly increasing. Since for all and for , we have in the sense of Continual diagrams, Russian profiles, and the -scaling of a Young diagram, with supported in and . No choice principle is used.
Depends on
- Continual diagrams, Russian profiles, and the $\sqrt n$-scaling of a Young diagram
- Principal inverse sine and inverse cosine
- The derivative $f'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c}$ of $f : A \to \mathbb{R}$ at a point $c \in A$ that is a limit point of $A$, and differentiability on a set
- Derivative of an inverse: if $f$ is continuous and injective on a nondegenerate interval $I$ and differentiable at $c \in I$ with $f'(c) \ne 0$, then the inverse $g$ is differentiable at $f(c)$ with $g'(f(c)) = 1/f'(c)$; and if $f'(c) = 0$ then $g$ is not differentiable at $f(c)$
- The derivatives of sine and cosine are cosine and minus sine
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- Basic properties of the absolute value
Used by
Dependency tree · two levels
44 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.