lemma 11.68 Jensen's inequality for the logarithm

open in the book · parts/02-mathematical-methods/09-probability-statistics.tex:2025 · p. 395

Rests on

Supports

Nothing declares a dependency on this node yet.

Neighborhood

Every logical edge within two steps of this node.

lemma 11.68: Jensen's inequality for the logarithm11.68theorem 7.35: Mean value theorem7.35proof : ch:09-probability-statistics@proof-28proofproposition 7.29: Linearity7.29theorem 7.34: Rolle7.34corollary 7.36: cor:ana-mvt-consequences7.36lemma 7.93: A polynomial has at most n roots7.93lemma A.500: Graphs and C^1 images have zero contentA.500lemma A.73: Differentiation under the integral signA.73lemma A.287: The Newton map contractsA.287lemma A.290: h is LipschitzA.290lemma A.440: Grönwall's inequalityA.440lemma A.226: The level factorA.226lemma A.468: The kernel is well defined, symmetric and LipschitzA.468proposition 7.105: Clairaut–Schwarz7.105theorem 7.100: C^1 implies differentiable7.100theorem 7.109: Leibniz integral rule7.109theorem 17.9: Dirichlet17.9proof : ch:05-real-analysis@proof-19proof

Edges

typedirectionnode provenancewhere
depends_on Mean value theorem declared parts/02-mathematical-methods/09-probability-statistics.tex:2033
proves ch:09-probability-statistics@proof-28 declared parts/02-mathematical-methods/09-probability-statistics.tex:2036