The biregular graph assumption allows both indicator functions in the discrepancy to be balanced:
The operator norm and the Cauchy-Schwarz inequality give
Consequently (iii)(i) with . Together with the previous sections, explicit constants for every direction are
All these constants tend to zero with the initial constant and are independent of . This is the required equivalence for a quasirandom bipartite graph.
Let be the singular values of the normalized adjacency operator of a bipartite graph, with the uniform inner products used above. Its ordinary matrix in an orthonormal basis on each side is . Expanding the trace of proves the box norm singular-value identity
Therefore (ii) immediately implies
which is (iii).
Conversely, the square of the Hilbert-Schmidt norm of this operator is
since a graph indicator function takes values zero and one. Under (iii), every with is at most , so
Thus (iii)(ii) with . This bound also covers the empty and complete bipartite graphs.
Use uniform expectations on the two nonempty parts, and equip their function spaces with the inner product . Let and
Since the bipartite graph is a biregular graph, both row and column averages of vanish. The normalized adjacency operator of a bipartite graph therefore splits into the map between constant functions, of singular value , and between their orthogonal complements.
There is no singular value larger than . Indeed, for , the Cauchy-Schwarz inequality gives
Averaging in uses the constant column degree and gives . For every operator is zero. Thus the second singular value is
If one part has a single vertex, missing singular values are interpreted as zero; the biregular graph then has .
The discrepancy in (i) is exactly . Its supremum over is the cut norm . To pass from this bound to arbitrary bounded real-valued functions, use the positive and negative parts and the identity for . Applying this separately to both factors gives
Here is a bound on , unrelated to any cardinality.
If , take real unit left singular vector and right singular vector with and . The Cauchy-Schwarz inequality and imply . Hence
This proves (i)(iii), with a constant independent of both part sizes. The case satisfies the same conclusion immediately.
Identify the Boolean hypercube with the subsets of . For a family , write for its closed vertex neighbourhood, consisting of the family and all vertices at Hamming distance one from it. Order subsets first by increasing size and, within a fixed size, use lexicographic order: at the smallest coordinate on which they differ, the set containing that coordinate comes first. This is the simplicial order on the discrete cube. Harper's theorem states that if is its initial segment of size , then
Thus simplicial initial segments minimize the external vertex boundary for each prescribed family size. The closed-neighbourhood and external-boundary formulations are equivalent because . No edge boundary is involved in this assertion.
We now give the deduction Harper theorem implies the Kruskal-Katona theorem, keeping track of the two different orders. For a family of -sets with , adjoin every smaller set:
Its closed vertex neighbourhood is exactly
where is the upper shadow. Applying Harper theorem to shows that, among -uniform families of fixed size, the lexicographic initial segment minimizes the upper shadow: all the lower-level contributions to the two neighbourhood sizes are identical.
To convert this into a statement about the lower shadow of a -uniform family , take and map each member to , where reverses the ground-set coordinates. Complementation changes lower shadows to upper shadows, and the coordinate reversal preserves their sizes. Moreover, the resulting lexicographic order corresponds exactly to colexicographic order on the original -sets: precedes in colexicographic order precisely when the largest element of lies in . After complementation and reversal, the smallest differing coordinate lies in the image of , as required for the stated lexicographic order. Hence a colexicographic initial segment minimizes the lower shadow, which is the Kruskal-Katona theorem. The cases and are immediate and need no adjoining construction.
For its usual numerical form, write the unique greedy binomial representation
Then the Kruskal-Katona theorem says
Here is why the shadow of the colexicographic initial segment has exactly that size. Its first block consists of all -sets in . If any members remain, they have the form , where runs through a colexicographic initial segment of -sets. The lower shadow consists of all -sets in , together with adjoined to the lower shadow of that remainder. These two blocks are disjoint. Recursing gives precisely the displayed sum. For , both the initial segment and its shadow are empty.
The Erdős-Ko-Rado theorem states that an intersecting family , with , satisfies
The bound is attained by all -sets containing one fixed element. For the proof Erdős-Ko-Rado theorem from shadows, take complements to obtain an -uniform family of the same size, and let be its rank- lower shadow. Every member of is disjoint from some member of , so . Iterating the Kruskal-Katona theorem bounds below by the rank- shadow of the colexicographic initial segment of size . This iteration is valid because lower shadows of colexicographic initial segments are again colexicographic initial segments, as the preceding block description shows.
If , that initial segment contains all -sets in and at least one further set containing . Since , its rank- shadow contains every -set in and at least one -set containing . Thus , implying
contrary to their disjointness. This proves the bound. If , all -sets intersect and the trivial maximum is instead .
For an intersecting family in a product alphabet, label the alphabet by . Partition the words into the classes
Each class has words, and any two distinct words in it disagree in every coordinate. An intersecting family therefore contains at most one word per class. There are classes, and fixing the first coordinate gives an intersecting family of that size. Consequently the exact maximum is
For this just says that the single word may be included.
Finally, for a weakly intersecting family in a product alphabet, associate to each word its support . The occurring supports form an intersecting family of nonempty subsets, and the fibre over support has words. Put . When , , and a support family can contain at most one of each complementary pair . For odd , the larger support in each pair has size greater than , so
All supports of size greater than are mutually intersecting, so taking every word over those supports achieves this bound. Thus the required extremal family is the strict-majority support family, with size
This is the weighted intersecting family bound on an odd Boolean lattice. For , strict inequality between the complementary fibre weights forces this extremal family to be unique. For , it is a largest family but need not be the only one; for example, all supports containing one fixed coordinate also attain the same size. For , no word has a nonempty support, so the maximum is zero, again agreeing with the formula.
Put , where . Since , part (ii), followed by a -th root, gives the Moser iteration step
After steps,
The geometric series and its differentiated form give
In particular the exact convergent product is
The printed hint's equality to a single power of is not correct in general; its claimed finiteness is correct and the displayed expression supplies the correction.
On a finite-measure domain, Lp norms converge to the supremum norm for a bounded continuous function. Indeed, the upper bound is ; for every , the set has positive measure, giving . Let in the iteration and use part (i), which gives . The Dirichlet eigenfunction supremum estimate is
The eigenvalue exponent is exactly . The constant depends only on : the supplied zero-boundary Sobolev inequality has a dimension-only constant, and every product factor above depends only on .
Use a signed power test for a Laplacian eigenfunction. For , test the Dirichlet Laplacian eigenfunction equation with . Its derivative is ; at the test function is just . Integration by parts gives the exact energy estimate
Set . It belongs to the zero-boundary Sobolev space and obeys the Sobolev chain rule:
For , the power map is with bounded derivative on the bounded range of . For , the absolute value map is Lipschitz, and almost everywhere; on the zero set, use the fact that a gradient of a Sobolev function vanishes on a level set. These facts justify the identity even when changes sign.
Apply the given Sobolev inequality with the Sobolev conjugate exponent :
Testing with a signed power raises the integrability exponent from to . Absorbing the factor into gives precisely the requested inequality.
Multiply the Dirichlet Laplacian eigenfunction equation by and use integration by parts. The zero Dirichlet boundary condition removes the boundary term and gives
The denominator is positive because the eigenfunction is nonzero. The numerator is also positive: if it were zero, the given Sobolev inequality for would force . Therefore the Dirichlet Laplacian eigenvalue has the positive Rayleigh quotient
Every nonzero Dirichlet eigenfunction in this problem has a positive eigenvalue.
Take nonempty and compactly contained in . The argument is a compactness proof of a nonnegative elliptic solution estimate, with the global Schauder estimate retaining control all the way to the boundary. The operator and the Hölder space exponent are fixed throughout.
Suppose the estimate fails. For each integer there is an admissible nonnegative solution , with forcing , such that
Put and . Then , , on the boundary, , and
Global elliptic regularity and the global Schauder estimate for zero Dirichlet boundary condition give
This estimate includes the term, so it does not require invertibility of or a sign restriction on . The compact embedding of Hölder spaces, or the Arzelà-Ascoli theorem applied through second partial derivatives, gives a subsequence converging in to . Thus , , on the boundary, and .
Choose with . A further subsequence has . Uniform convergence yields . Part (b) says that a nonnegative homogeneous solution on the connected domain is either zero everywhere or strictly positive inside. Both alternatives contradict, respectively, and . Therefore
The interior infimum and the forcing control the global supremum. Global boundary control is crucial here: an interior-only compactness argument could lose the normalized maximum at the boundary.
There is no need to assume that the original zeroth-order coefficient is nonpositive. Set and , and use the uniformly elliptic operator
Because and ,
Now , so the strong minimum principle for elliptic operators applies. If vanished at an interior point of the connected domain, this principle would force to vanish identically. The given nontriviality therefore proves
Every nontrivial nonnegative solution is strictly positive inside. This uses the nondivergence-form strong minimum principle for elliptic operators; the divergence-form Harnack inequality for uniformly elliptic divergence-form equations in part (a) is not being applied to this operator.
Assume is nonnegative almost everywhere, and that the real coefficient matrix is measurable and satisfies, for almost every and every ,
The operator norm bound controls all coefficients, including any antisymmetric part. For a symmetric matrix, these assumptions are exactly the usual lower and upper quadratic-form bounds. The weak solution condition is
Then the Harnack inequality for uniformly elliptic divergence-form equations is
A nonnegative weak solution has its supremum controlled by its infimum on the smaller ball. The De Giorgi-Nash-Moser theorem supplies a Hölder continuous function representative, for which ordinary supremum and infimum can replace the essential supremum and essential infimum. Nonnegativity and the larger ball are essential hypotheses; there is no differentiability requirement on the coefficients.
Fix nested relatively compact subsets of and let bound the gradient on the larger one. The fundamental theorem of calculus along a line segment gives on the smaller one. Part (i) gives coefficient bounds independent of small , so the De Giorgi-Nash-Moser theorem gives uniform interior Hölder continuity estimates for these weak solutions. Since is continuous, the difference quotients converge locally uniformly to . Passing to the limit in the Hölder seminorm estimate, and repeating for every coordinate, yields
The first derivatives are locally Hölder continuous. Here the initially obtained exponent depends on and the local gradient bound. This is the interior interpretation of the printed regularity conclusion; a uniform global estimate does not follow from alone.
Write the minimal surface equation for a graph as in its weak formulation, where . For negative increments use the same difference quotient convention, so
For , the function is an admissible test function in . Commuting the first partial derivative with translation, then applying discrete integration by parts, gives
The fundamental theorem of calculus along a line segment gives the averaged linearization of a nonlinear divergence-form equation
Thus the backward difference quotient solves a linear equation in divergence form:
To verify the ellipticity of the minimal surface flux, compute
and hence
The eigenvalue parallel to is ; every orthogonal eigenvalue is . The same lower and upper bounds pass to the averaged symmetric matrix whenever both endpoint gradients have norm at most :
The printed hypothesis supplies such an on each relatively compact subset, uniformly for sufficiently small . It therefore establishes a locally uniformly elliptic operator. A single lower bound on all of additionally requires bounded gradients there and at the shifted points; this is automatic for bounded and fixed , but is not supplied on an arbitrary open set.
Use homogenization of Dirichlet boundary data: put , using the supplied extension of to the half-ball. Then on the flat face and . The second-derivative estimate at a flat Dirichlet boundary from part (a) gives
The triangle inequality gives , while the Cauchy-Schwarz inequality bounds by . Finally , so restriction from the larger half-ball and another triangle inequality give
Nonzero boundary data contribute the second-order Sobolev norm of their extension. No estimate for a separately constructed extension is needed, because is already given on the half-ball.
Choose a smooth cutoff function supported in , equal to one on , with and . For , put . The zero Dirichlet boundary condition implies that the tangential boundary derivative vanishes on the flat face. Differentiating the Poisson equation gives . Test this equation with . The boundary terms vanish because on the flat face and near the curved face. Integration by parts in the tangential direction moves off , yielding
This is the essential Caccioppoli inequality step: it involves , rather than . Expanding and using the Cauchy-Schwarz inequality and the Young inequality gives
The term is bounded by . Absorbing the first term and summing over proves the hinted estimate:
All mixed second partial derivatives are now controlled, since . The remaining normal derivative is recovered from the equation:
The Cauchy-Schwarz inequality bounds its squared L2 norm by times the sum of the squared L2 norms on the right. Including the already controlled zeroth and first partial derivatives, and taking square roots, gives the second-derivative estimate at a flat Dirichlet boundary:
The full second-order Sobolev norm is controlled without any norm of .
For the corrected bounded-domain problem, the interior theorem for the Perron method for the Dirichlet problem gives a classical solution of the Poisson equation, and the power barrier for an exterior cone argument gives its continuous extension with the required Dirichlet boundary condition. Hence existence holds in .
If are two such classical solutions, then is a harmonic function with zero boundary trace. The weak maximum principle for elliptic operators, applied to and on the bounded domain, gives and . Consequently
There is exactly one solution after adding boundedness of . For the printed unbounded-domain version, the half-plane counterexample in part (i) disproves uniqueness; an additional condition at infinity or a suitable restricted solution class would instead have to be specified.
Fix , , and the power barrier for an exterior cone from part (i). Write . By continuity of the boundary data, there is such that on . On the rest of the boundary, . The boundary is compact, so is bounded. Choose large enough that and
Then the Perron subfunction for the Poisson equation and its superfunction counterpart
satisfy , , and on the whole boundary. The near-boundary ordering uses the choice of ; the remaining ordering uses the choice of . In particular the Perron family is nonempty and bounded above.
The Perron method for the Dirichlet problem and the permitted comparison give . Since as , we obtain
Letting proves
The interior Perron theorem gives continuity inside , and the displayed limit together with continuity of proves the continuous extension with the required boundary trace. Thus every boundary point is a regular boundary point.
For the bounded-domain correction, let be the family of Perron subfunctions for the Poisson equation with on . The subfunction condition is ball comparison: whenever and a classical solution of on satisfies on , it also satisfies throughout . For a function this is the sign condition . A superfunction reverses both inequalities.
The Perron solution is the pointwise upper envelope of the subfunctions:
This is the Perron method for the Dirichlet problem with the Poisson equation replacing the homogeneous Laplace equation. The power barrier for an exterior cone supplies a global member of and a global superfunction, as constructed below. The permitted subfunction-superfunction comparison therefore makes this envelope finite. The standard interior Perron theorem, available in the question, gives and ; neither result needs to be proved in this part.
A bounded-domain hypothesis is needed for the requested global construction and uniqueness. The printed question does not include it. For example, the upper half-plane satisfies the stated exterior cone condition, but both and are harmonic functions with zero Dirichlet boundary condition. Thus part (iv), in its printed unrestricted solution class, is false. In this question's solutions we add that is bounded; the exterior cone condition and all other data remain as printed.
The half-plane also rules out the printed global separated barrier. In its angular interval , varying on a fixed ray forces if for every . We would then have and . Put and . Twice integration by parts gives
contradicting the positive integrand. Thus a source qualification is necessary for part (i) as well as part (iv).
Fix and its exterior cone of half-angle . Choose and set
On the complement of the cone, unwrap the angle in polar coordinates as , measured from the cone axis. Then is the angle from the opposite axis and on . Define the power barrier for an exterior cone by
This has the requested separated form . In the printed signed-angle convention, the same function is outside the cone. It is smooth across the negative axis: near that axis the angular expression is the even function .
Since , put . The cosine is at least , so away from , and is continuous at . The Laplacian in polar coordinates gives
Let . Since , the barrier for the Dirichlet problem satisfies
Both the uniform lower bound and the later global comparison use boundedness. In particular, is positive at every other boundary point, and is bounded away from zero on boundary sets staying a positive distance from .
Weak compactness of the adjoint forces weak compactness of the original operator. Assume is weakly compact. Apply the already proved to this operator, rather than assuming the adjoint equivalence in advance. It gives
Take annihilating , so for every . Write for some . For every ,
Hence and . It follows that
for every annihilating .
The vector subspace is closed in the norm topology in because is complete and is an isometry. The Hahn-Banach theorem says that any point outside a closed linear subspace can be separated from it by a bounded linear functional vanishing on that subspace. Applying this in shows that an element annihilated by all such must belong to . Therefore for every , proving . The reverse implications above now establish all four equivalences, including weak compactness of an operator and its adjoint:
Finally, if is a reflexive Banach space, every is for some , and . If is a reflexive Banach space, , so the same range condition holds automatically. In either case, proves
Weak-star-to-weak continuity of the adjoint implies its weak compactness. By the Banach-Alaoglu theorem, is compact for the weak-star topology. Under the assumed continuous map , its image is weakly compact in .
This image is closed for the weak topology, and hence for the norm topology, because the weak topology is Hausdorff and weaker than the norm topology. Thus its norm closure is the same weakly compact set. By the definition of a weakly compact operator, is weakly compact, proving .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact