The Rellich-Kondrachov Compactness Theorem and the Poincaré Inequalities
Anchor (Master): Evans §5.7-§5.8; Adams-Fournier, Sobolev Spaces, 2e (Academic Press 2003), Ch. 6 (compact embeddings); Gilbarg-Trudinger, Elliptic Partial Differential Equations of Second Order, 2e (Springer 1983), §7.10; Maz'ya, Sobolev Spaces, 2e (Springer 2011), Ch. 1-2; Hanche-Olsen-Holden, The Kolmogorov-Riesz compactness theorem (Expositiones Mathematicae 2010)
Intuition Beginner
Imagine a family of functions that all live in a fixed box and all obey the same speed limit on their slope. They can wiggle, they can shift around, but they cannot be too tall and they cannot change too fast. The compactness theorem of this unit says that such a family is, in a strong sense, crowded: you can always pull out a sequence from it that settles down and converges. No matter how the functions in the family scatter, the slope budget plus the fixed box prevent them from running off to infinity or oscillating forever, so some sequence must bunch up around a single limiting function.
Why is this worth a theorem? Because most existence proofs in physics and geometry work by setting up a sequence that gets closer and closer to solving a problem, then extracting a limit and showing the limit is the answer. The danger is that the sequence might not have a limit at all: it could spread its energy thinner and thinner, or push a bump out toward the edge and lose it. Controlling the slope inside a bounded region is exactly the ticket that forbids these escapes and guarantees a usable limit.
The companion inequalities of this unit are the slope-budget bookkeeping made precise. The Poincaré inequality says that if a function is pinned to zero on the boundary of a bounded region, then its overall size is controlled entirely by the size of its slope: a function that starts at zero on the edge and never changes fast cannot grow large in the middle. The slope alone caps the height.
There is a wrinkle when the function is not pinned at the boundary. A constant function has zero slope but is not zero, so slope alone cannot control size. The fix is to measure size after subtracting the average value: the spread of a function around its own average is controlled by its slope. This is the Poincaré-Wirtinger inequality, and it says a function with a small slope budget cannot stray far from its mean.
A picture for all three: think of a taut sheet clamped along the rim of a frame. If the clamp holds the edge at height zero and the sheet cannot crease too sharply, the whole sheet stays close to zero. If instead the sheet floats free, it can sit at any height, but its bumps above and below its own resting level are still limited by how sharply it is allowed to crease. And a whole family of such sheets, all clamped in the same frame with the same crease limit, has the crowding property: some sequence of them must converge.
Visual Beginner
The single picture to hold is a bounded box holding a crowded family of slope-limited functions, with the two Poincaré statements drawn alongside.
Read the three panels left to right. The left panel is the compactness statement: a whole family of functions sharing one height cap and one slope limit inside a fixed box is so crowded that you can always extract a converging sequence. The thing that prevents escape is the combination of the box, which stops bumps from drifting away, and the slope limit, which stops endless oscillation.
The middle panel is the Poincaré inequality. The curve is clamped to zero at the edges of the frame, so it cannot float up; its only way to gain height is to climb away from the baseline, which costs slope. The shaded area, a stand-in for the total size of the function, is therefore bounded by how much slope the function spends.
The right panel is the Poincaré-Wirtinger inequality, the version for functions that are not clamped. Now the curve can float to any height, so we measure its size not from the baseline but from its own average, the dashed line. The bumps above and below that average line are again paid for in slope, so the spread around the average is capped by the slope budget.
Worked example Beginner
We test the Poincaré idea on the simplest clamped function and watch the slope-controls-size bookkeeping work out. Take the region to be the interval from zero to one on the number line, and the function , a single hump that is zero at both ends, which is exactly the clamped-at-the-boundary condition.
Step 1. Confirm the clamp. At the left end, . At the right end, . The function is pinned to zero on the boundary of the interval, so the Poincaré inequality applies.
Step 2. Measure the size of the function. The peak is at the middle, where . So the largest the function ever gets is one quarter. Its size is modest, capped at .
Step 3. Measure the size of the slope. The slope is . At the left end it is ; at the right end it is . So the slope ranges between minus one and plus one, and its largest magnitude is one.
Step 4. Compare the two. The size of the function, one quarter, is smaller than the size of the slope, one. The Poincaré inequality is the promise that this direction of comparison always holds for clamped functions on this interval: the function's size is at most a fixed constant times the slope's size. Here a constant of one already works comfortably, with room to spare.
Step 5. See why the clamp matters. Replace the hump by the constant function . Its slope is zero everywhere, but its size is five, not zero. A constant times zero can never reach five, so no Poincaré inequality can hold for it. The escape is allowed precisely because the constant is not clamped to zero at the boundary; remove the clamp and slope stops controlling size.
What this tells us: when a function is held at zero on the edge of a bounded region, its slope budget alone caps how big it can get, and the constant in the cap depends only on the region. The constant-function failure in the last step is the warning that the clamp, or in the unclamped version the subtraction of the average, is what makes the inequality possible.
Check your understanding Beginner
Formal definition Intermediate+
Throughout, , , and is open and bounded. We write for the Sobolev space with norm , and for the closure of in this norm; both, together with the machinery, Hölder's inequality, and Minkowski's inequality, are taken as available 02.07.06. The critical Sobolev exponent for is from 02.16.01, and the bounded extension operator on a bounded domain is from 02.16.02. For and a measurable with we write for the average. For the translation operator is .
Definition (compact embedding). A continuous embedding of Banach spaces is compact, written , if the inclusion map sends bounded subsets of to precompact subsets of : every sequence bounded in the -norm has a subsequence converging in the -norm. Equivalently, the inclusion is a compact operator in the sense of 02.11.05.
Definition (Fréchet-Kolmogorov / Kolmogorov-Riesz precompactness). A subset , , is precompact (has compact closure) if and only if three conditions hold:
- (boundedness) ;
- (uniform equicontinuity of translation) as ;
- (uniform decay at infinity) as .
This is the analogue of the Arzelà-Ascoli theorem: equicontinuity of translation replaces equicontinuity of values, and uniform decay at infinity replaces a uniform domain bound [Kolmogorov 1931] [Riesz 1933] [Hanche-Olsen-Holden 2010].
Definition (Poincaré inequality). admits a Poincaré inequality at exponent if there is a constant with The smallest admissible is the reciprocal of the square root of the first Dirichlet eigenvalue of when ; the inequality fails without the zero-boundary restriction, since constants are excluded only by it.
Definition (Poincaré-Wirtinger inequality). A bounded connected open with boundary (more generally an extension domain) admits a Poincaré-Wirtinger inequality at exponent if there is a constant with Connectedness is essential: on a disconnected a function constant on each piece has zero gradient but nonzero variance around the global mean, defeating the bound.
Counterexamples to common slips Intermediate+
Compactness is strictly subcritical. The embedding is compact for but only bounded, never compact, at . The dilating bubble stays bounded in yet has no -convergent subsequence: its mass concentrates at a point. Compactness is exactly the gap between the bound and the critical exponent.
Poincaré needs the boundary condition; Poincaré-Wirtinger needs the mean subtraction. On without either device the constant has but positive norm, so neither inequality can hold with the bare gradient on the right. The zero trace (for Poincaré) and the subtraction of (for Poincaré-Wirtinger) are the two distinct ways to quotient out the constants.
Boundedness of is essential. On an unbounded the Poincaré inequality fails: rescaling a fixed bump makes as . A finite diameter is what gives the constant; on a slab bounded in one direction the inequality survives, using only the bounded direction.
Connectedness is essential for Poincaré-Wirtinger. On (two disjoint balls) the function equal to on the first ball and on the second has but . No Poincaré-Wirtinger constant can hold; connectedness forbids exactly this locally-constant-but-globally-varying escape.
Key theorem with proof Intermediate+
Theorem (Rellich-Kondrachov). Let be bounded with boundary and . Then for every with , the embedding is compact: every sequence bounded in has a subsequence converging strongly in . (For the embedding is compact for every .) [Rellich 1930] [Kondrachov 1945] [Evans 2010 §5.7].
Proof. Let be bounded in , say .
Step 1 (extend and cut off). Apply the extension operator of 02.16.02: the functions are supported in a fixed bounded open set and satisfy , with on . It suffices to show is precompact in ; restriction to then gives the conclusion. Because is bounded the uniform-decay-at-infinity condition is automatic, so by the Fréchet-Kolmogorov criterion it remains to establish the uniform translation estimate.
Step 2 (translation estimate for smooth functions). First suppose . For , write , so by Minkowski's integral inequality and a change of variables By density of in and in , the same estimate holds for every : where is a fixed bounded neighbourhood containing all the translates and Hölder's inequality converts the gradient norm to the one on the finite-measure set .
Step 3 (upgrade the translation estimate to by interpolation). Fix with . The Sobolev embedding 02.16.01 gives , hence as well. Choose with (possible exactly because , so interpolates between and ). The interpolation inequality for norms gives
The right side is independent of and tends to zero as : the family has uniformly equicontinuous translation in .
Step 4 (apply Fréchet-Kolmogorov and extract). The family is bounded in (by the bound and finite measure of ), supported in the fixed bounded set (uniform decay), and uniformly equicontinuous under translation in (Step 3). By the Fréchet-Kolmogorov compactness criterion the family is precompact in , so has a subsequence converging in . Restricting that subsequence to gives a subsequence of converging in .
Bridge. The compactness is exactly the strict-subcriticality gap of the Sobolev embedding 02.16.01 turned into a compact operator 02.11.05: at the embedding is only bounded, and the dilation symmetry that fixes also produces the concentrating bubbles that destroy compactness, so the foundational reason the theorem stops short of is the same scaling invariance that forced in the first place. The engine is the translation estimate , which is the integral form of the fundamental theorem of calculus and is dual to the trace estimate of 02.16.02 — there one integrated the normal derivative to the boundary, here one integrates the gradient along the translation vector. Putting these together, the central insight is that a bounded slope budget converts a bounded family into a precompact one, and this is exactly what the direct method of the calculus of variations needs: it builds toward the existence of weak solutions in 02.16.04, where a minimizing sequence's weak limit is upgraded to a strong limit precisely by Rellich-Kondrachov, and it appears again in the spectral theory of the Laplacian, whose discrete spectrum is the compactness of this same embedding read through 02.11.05.
Exercises Intermediate+
Advanced results Master
The compactness theorem and the Poincaré inequalities organize a larger structure: the sharp range of compact embeddings across the Sobolev scale, the spectral identification of the optimal constants, the failure profile at the critical exponent, the role of the embedding in Fredholm theory and the direct method, and the geometric content of the Poincaré constant. Each refines the translation-estimate and quotient-out-the-constants arguments of the Intermediate tier.
Theorem 1 (full Rellich-Kondrachov scale; Rellich 1930, Kondrachov 1945). Let be bounded with boundary, , . If , the embedding is compact for , where ; if it is compact into for all ; if it is compact into for , and into for the appropriate when [Rellich 1930] [Kondrachov 1945] [Adams-Fournier 2003]. The strictness is sharp: at the endpoint the embedding is bounded (the Sobolev embedding of 02.16.01) but loses compactness to concentration. The compact embeddings are exactly the bounded ones at a strictly smaller integrability index, the difference between the two being the scaling-invariant endpoint.
Theorem 2 (spectral form; Poincaré 1890, Courant-Fischer). For and bounded , the optimal Poincaré constant on is , where
is the first Dirichlet eigenvalue of , with the minimizing the first Dirichlet eigenfunction [Poincaré 1890]. The optimal Poincaré-Wirtinger constant is , where is the first nonzero Neumann eigenvalue (the spectral gap above the constant Neumann eigenfunction). That the minimum is attained — rather than merely an infimum — is precisely Rellich-Kondrachov: a minimizing sequence is bounded in , so a subsequence converges strongly in , and lower semicontinuity of the Dirichlet energy promotes the weak limit to a genuine minimizer. The discreteness of the entire Dirichlet spectrum follows by applying 02.11.05 to the compact resolvent .
Theorem 3 (Rellich-Kondrachov and the Fredholm alternative). The compactness of makes the solution operator of a uniformly elliptic problem a compact perturbation of the identity on : writing and inverting the leading part, the lower-order terms factor through the compact embedding, so with compact governs solvability. The Fredholm alternative of 02.11.05 then applies: either has a unique weak solution for every , or the homogeneous problem has a finite-dimensional solution space and is solvable exactly when is orthogonal to the cokernel. Compactness is the single structural input converting an infinite-dimensional boundary-value problem into the linear algebra of finite-rank obstructions.
Theorem 4 (Maz'ya capacitary and measure-theoretic characterizations). The Poincaré and compactness phenomena persist far beyond domains. Maz'ya's theory characterizes the domains and measures for which is bounded or compact in terms of isocapacitary and isoperimetric inequalities: boundedness corresponds to a capacity-volume inequality uniformly over compact , and compactness to the same with the constant tending to zero on small sets [Maz'ya 2011]. For the relevant inequality is isoperimetric, tying the Poincaré constant to the Cheeger constant via (Cheeger's inequality). Domains with sufficiently sharp outward cusps fail the extension property of 02.16.02 and can lose both the compact embedding and the Poincaré inequality.
Theorem 5 (concentration-compactness; the failure at made quantitative). At the critical exponent the loss of compactness is not arbitrary but structured: a -bounded sequence with weakly fails to converge strongly in only through a countable sum of concentrating bubbles, and as measures, with the masses linked by the Sobolev inequality . This is the concentration-compactness principle: strong convergence holds if and only if no mass escapes into Dirac bubbles, and the bubbles are dilates of the Aubin-Talenti extremals of 02.16.01. It restores a usable substitute for compactness in critical variational problems, where Rellich-Kondrachov alone is unavailable.
Synthesis. The compactness theorem is the foundational reason the direct method of the calculus of variations produces actual minimizers rather than mere infima, and the whole structure is generated by the same single principle as the Sobolev inequalities of 02.16.01: a derivative integrated along a segment controls the function, here in the translation form that feeds the Fréchet-Kolmogorov criterion. This translation estimate is dual to the normal-direction integration of the trace theorem 02.16.02, one estimate run along the translation vector and the other run inward to the boundary. The compact embedding is exactly the strictly-subcritical Sobolev embedding read as a compact operator through 02.11.05; the Poincaré inequality is this same control with the constants quotiented out by the zero-boundary condition, and the Poincaré-Wirtinger inequality quotients them out instead by subtracting the mean — putting these together, both optimal constants are eigenvalues, the Dirichlet and the Neumann . The central insight at this stage is that the attainment of those eigenvalues, rather than their being mere infima, is itself the compactness theorem applied to a minimizing sequence: this is exactly the upgrade from weak to strong convergence that the direct method demands.
The central insight is that a bounded slope budget on a bounded region is precisely a precompactness certificate, and this is exactly why the theorem stops at : the dilation symmetry that forces the critical exponent also manufactures the concentrating bubbles of Theorem 5 that no slope budget can prevent. From Poincaré's 1890 inequality through Rellich's 1930 mean-convergence lemma and Kondrachov's 1945 extension across the subcritical range to the Maz'ya capacitary theory and the concentration-compactness method, the subject is one continuous refinement of a single fundamental-theorem-of-calculus estimate, generalised until it became the compactness engine of elliptic Fredholm theory and the spectral theory of the Laplacian, and it appears again in 02.16.04 as the device that turns a minimizing sequence into a weak solution.
Full proof set Master
Proposition 1 (Poincaré inequality on a bounded domain, general constant). Let be bounded with diameter . Then for all , .
Proof. By density it suffices to treat , extended by zero to . Enclose in a slab of width (possible since ). For each fixed , the function vanishes for , so . By Hölder with conjugate exponents , Integrate in over the slab width : . Integrating over and using yields , i.e. . The constant uses only the slab width, so boundedness in a single direction suffices.
Proposition 2 (Poincaré-Wirtinger inequality). Let be bounded, connected, with boundary, . There is with for all .
Proof. Argue by contradiction using Rellich-Kondrachov. If the inequality fails for every , choose with . Normalize , so , , and . Then for , so is bounded in . By the Key Theorem (Rellich-Kondrachov, taking , valid since is a extension domain) a subsequence converges strongly in to some with and . For every and each , , the last equality since and is bounded. Thus weakly. On the connected open set a weak gradient that vanishes forces constant a.e.; with this constant is , contradicting . The inequality therefore holds for some finite .
Proposition 3 (translation estimate in ). For , , and , .
Proof. For , . By Minkowski's integral inequality, viewing the difference as an integral over of the -valued map , using pointwise and translation invariance of the norm. For general , approximate by with , in ; translation is an -isometry, so both sides converge and the estimate persists.
Proposition 4 (discreteness of the Dirichlet spectrum via compactness). Let be bounded with boundary. The operator on with zero Dirichlet boundary data has compact resolvent, hence a discrete spectrum with an -orthonormal basis of eigenfunctions.
Proof. For the weak problem for all has, by the Poincaré inequality of Proposition 1 (which makes an equivalent norm on ) and the Riesz representation theorem 02.11.05, a unique solution with . Thus is bounded. Composing with the compact inclusion from the Key Theorem (), the operator is compact. It is also self-adjoint and positive (from the symmetric, coercive bilinear form). The spectral theorem for compact self-adjoint operators 02.11.05 gives an orthonormal eigenbasis with eigenvalues ; setting gives with , and by the Poincaré inequality.
Connections Master
The compact embedding is the strictly-subcritical Sobolev embedding of
02.16.01read as a compact operator: the boundedness proved there is upgraded here to compactness for every , and the concentration phenomenon that obstructs compactness at is exactly the Aubin-Talenti bubbling of that unit's sharp-constant theory. This unit owns the compactness;02.16.01owns the boundedness and the sharp constant.The extension operator of
02.16.02is the indispensable first step of the compactness proof: it transfers the bounded sequence to a fixed bounded set in where the Fréchet-Kolmogorov criterion can be run, and it is the device whose failure on cuspidal domains makes both the compact embedding and the Poincaré inequality fail there. The trace operator of that unit also supplies the boundary control that the Poincaré inequality complements in the interior.The abstract framework — compact operators, the Fredholm alternative, and the spectral theorem for compact self-adjoint operators — is supplied by
02.11.05; this unit provides the single concrete compact operator (the Sobolev embedding) that makes elliptic boundary-value problems Fredholm and gives a discrete spectrum, so the abstract theory of02.11.05acquires its principal application here.The apparatus on which the translation estimate and the interpolation step rest — Hölder's inequality, Minkowski's integral inequality, and the interpolation of norms between and — is developed in
02.07.06; the mollification argument behind Fréchet-Kolmogorov is the same approximate-identity machinery used there.The compactness theorem is the existence engine for weak solutions of elliptic boundary-value problems in
02.16.04: the direct method minimizes an energy over , and Rellich-Kondrachov is exactly what upgrades a minimizing sequence's weak limit to a strong limit, while the Poincaré inequality supplies the coercivity that keeps the minimizing sequence bounded.
Historical & philosophical context Master
Henri Poincaré introduced the inequality bearing his name in his 1890 American Journal of Mathematics memoir on the partial differential equations of mathematical physics [Poincaré 1890], where he needed to bound a function by its gradient to control the eigenvalue problems arising in heat conduction and potential theory. The one-dimensional sharp form, bounding a periodic mean-zero function by its derivative with the optimal constant attained by the first trigonometric mode, is attributed to Wilhelm Wirtinger and was popularized through Wilhelm Blaschke's 1916 Kreis und Kugel [Wirtinger 1916]; the combined name Poincaré-Wirtinger reflects this dual ancestry in potential theory and in the isoperimetric problem.
The compactness theorem originates with Franz Rellich's 1930 Göttingen note Ein Satz über mittlere Konvergenz [Rellich 1930], which proved that an -bounded sequence on a bounded domain has an -convergent subsequence — the case . Vladimir Kondrachov extended the result across the full subcritical range of exponents in his 1945 Doklady note [Kondrachov 1945], establishing the compact embedding for . The compactness criterion underlying the modern proof is the Fréchet-Kolmogorov / Kolmogorov-Riesz theorem, whose threads run from Maurice Fréchet's 1907 work on compact sets of functions [Fréchet 1907] through Andrei Kolmogorov's 1931 Göttingen note characterizing precompact families in by mean continuity [Kolmogorov 1931] and Marcel Riesz's 1933 Acta Szeged completion to general exponents [Riesz 1933]; the consolidated statement and its history are surveyed by Harald Hanche-Olsen and Helge Holden [Hanche-Olsen-Holden 2010]. Vladimir Maz'ya's capacitary theory later identified the exact geometric conditions on domains and measures for both boundedness and compactness, completing the picture begun by Rellich and Kondrachov.
Bibliography Master
@article{Rellich1930,
author = {Rellich, Franz},
title = {Ein Satz \"uber mittlere Konvergenz},
journal = {Nachrichten von der Gesellschaft der Wissenschaften zu G\"ottingen, Mathematisch-Physikalische Klasse},
year = {1930},
pages = {30--35}
}
@article{Kondrachov1945,
author = {Kondrachov, Vladimir I.},
title = {Sur certaines propri\'et\'es des fonctions dans l'espace $L^p$},
journal = {Doklady Akademii Nauk SSSR},
volume = {48},
year = {1945},
pages = {535--538}
}
@article{Poincare1890,
author = {Poincar\'e, Henri},
title = {Sur les \'equations aux d\'eriv\'ees partielles de la physique math\'ematique},
journal = {American Journal of Mathematics},
volume = {12},
year = {1890},
pages = {211--294}
}
@incollection{Wirtinger1916,
author = {Blaschke, Wilhelm},
title = {Kreis und Kugel},
publisher = {Veit, Leipzig},
year = {1916},
note = {\S1.6; the one-dimensional Wirtinger inequality}
}
@article{Kolmogorov1931,
author = {Kolmogorov, Andrei N.},
title = {\"Uber Kompaktheit der Funktionenmengen bei der Konvergenz im Mittel},
journal = {Nachrichten von der Gesellschaft der Wissenschaften zu G\"ottingen},
year = {1931},
pages = {60--63}
}
@article{Riesz1933,
author = {Riesz, Marcel},
title = {Sur les ensembles compacts de fonctions sommables},
journal = {Acta Scientiarum Mathematicarum (Szeged)},
volume = {6},
year = {1933},
pages = {136--142}
}
@article{HancheOlsenHolden2010,
author = {Hanche-Olsen, Harald and Holden, Helge},
title = {The Kolmogorov-Riesz compactness theorem},
journal = {Expositiones Mathematicae},
volume = {28},
year = {2010},
pages = {385--394}
}
@book{Mazya2011,
author = {Maz'ya, Vladimir},
title = {Sobolev Spaces, with Applications to Elliptic Partial Differential Equations},
edition = {2},
publisher = {Springer Grundlehren 342},
year = {2011}
}