The printed assertion is false when maximal means largest in the natural-number labelling. Both the original PDF and the TeX have this wording. The specified operation gives the complete graph, not the Rado graph.
Fix any two distinct vertices , and choose . Apply the hypergraph extension property of to , prescribing that the pair extend to a hyperedge; prescribe all other pairs in arbitrarily. The resulting witness has , so is a hyperedge whose largest vertex is . Deleting that vertex produces the edge in .
Since were arbitrary,
The Rado graph has nonedges: its hypergraph extension property supplies a new vertex nonadjacent to any specified existing vertex. Therefore and cannot be isomorphic graphs. This argument holds for every representative of the universal three-uniform structure labelled by , so changing its labelling does not repair the assertion. Equivalently, in an independently sampled representative each pair has infinitely many larger vertices that complete it to a triple, almost surely.
A valid related construction is to fix a vertex and take its link hypergraph: make an edge exactly when is a hyperedge, on the remaining vertex set. This is indeed the Rado graph. To prove it, take any disjoint finite sets of vertices other than , put , and prescribe triples through the pairs for and no triples through for . Complete all other pair prescriptions arbitrarily. The hypergraph extension property produces a new vertex adjacent in the link to all of and none of . Uniqueness from part (i), for , now proves the claimed hypergraph isomorphism for this corrected operation.
The edge choices are understood to be independent, and is a fixed positive integer. We prove the hypergraph extension property and then show directly that it determines a unique countable hypergraph isomorphism type.
For a finite , prescribe a family . We want a new vertex such that
For any , the probability of precisely this pattern in the countable random uniform hypergraph is
Two different candidate vertices use disjoint hyperedge decisions: all the other vertices in each tested edge lie in . The successes are therefore independent random variables with the same positive probability . The probability that the first candidates all fail is . The same argument after discarding any finite initial set of candidates shows that infinitely many witnesses exist almost surely.
There are only countably many finite subsets of , and finitely many prescriptions for each. A countable union of null events is null. Consequently the random uniform hypergraph satisfies every such extension prescription simultaneously almost surely.
Now let and be two countably infinite -uniform hypergraphs with the hypergraph extension property. Enumerate their vertex sets and construct increasing finite partial hypergraph isomorphisms by the back-and-forth method. At a forward step, take the least unused vertex of . Its incident hyperedges with each -subset of the current domain specify a pattern on the matched vertices of . The hypergraph extension property supplies an unused vertex of with exactly this pattern. Adding preserves and reflects every hyperedge in the enlarged domain. At the next step, take the least unused vertex of and perform the identical construction with and interchanged.
The union of the finite maps is defined on every vertex and has every vertex in its range. It is a bijection, and each finite -set appears at some finite stage, so all hyperedges and nonedges are preserved. Thus it is a hypergraph isomorphism. Existence of at least one structure with the property follows from the probability-one construction already proved; fix one representative and call it . Therefore
The hypergraph isomorphism type does not depend on . In the case it is the Rado graph. For , the argument says that the infinitely many selected and unselected singleton vertices determine the same one-uniform structure for every .
For this Cartesian product, the requested norm is the box norm, with complex conjugates:
Equivalently it is , where . This makes its nonnegativity explicit.
Apply the Cauchy-Schwarz inequality first in :
The right-hand expectation is nonnegative, since it came from . A second application in gives
Taking fourth roots proves the bilinear correlation bound for the box norm
For disjoint nonempty vertex sets , define their edge density of a bipartite graph by . They form an -regular pair of vertex sets if every , with , satisfies .
The Szemerédi regularity lemma asserts that, given and a positive integer , there are such that every graph on vertices has a set partition with
and at most irregular ordered pairs with .
Assume , which suffices since a smaller regularity parameter gives the claim for a larger one. Treat the exceptional vertices as singleton cells in the full partition , and use equitable regularity energy
Here the adjacency indicator function defines density even for diagonal cells. Clearly . If refines , weighted averaging of densities gives the refinement variance identity for regularity energy
To verify it, expand each square and use .
For every irregular ordered pair of nonexceptional cells, choose witnesses of relative sizes at least and density discrepancy greater than . Split each along all witnesses involving it; symmetry allows at most one witness for each other cell, hence at most atoms in each . In the witness rectangle, the weighted Cauchy-Schwarz inequality in the variance identity contributes more than .
If more than pairs are irregular and the equal cell size is , the energy increase is greater than
Restore equal cell sizes by cutting each witness atom into pieces of size , with leftover vertices added to as singleton cells. This operation is a further refinement, so the energy does not decrease. There are at most atoms, and fewer than leftover vertices in each, giving at most new exceptional vertices.
Here is a uniform bound ensuring that the iteration is legitimate. Put and choose
Start with equal classes and fewer than exceptional vertices. Taking makes the initial exception at most . At every refinement the number of nonexceptional cells does not decrease: each old cell loses at most vertices and is cut into pieces of size at most . Thus each of the at most rounds adds at most exceptional vertices.
When , the new cell count is at most
using . Define and , and take . Choosing ensures at every stage. All rounds are therefore defined, with cell count between and and exceptional size at most .
If the lemma still failed after refinements, the energy would have increased by more than , impossible because it lies in . Hence some stage has the required regular pairs. This completes the energy-increment proof of Szemerédi regularity, including the equal-size and exceptional-set conditions.
Choose a real vector subspace complementary to , so . The smooth map
has differential at , an isomorphism. The inverse function theorem makes a diffeomorphism from a sufficiently small product neighborhood onto an open neighborhood of the identity in .
There is a neighborhood of zero in in which implies . Otherwise choose nonzero tending to zero with . A normalized subsequence tends to a unit vector . The limit directions of a closed subgroup from part (a) give , contradicting . Shrink the product neighborhood so that this exclusion holds throughout its first factor.
If , then by the definition of , and hence . The exclusion forces . Conversely, every belongs to . Thus the local product coordinates for a closed subgroup identify near the identity exactly with the smooth coordinate slice .
Left translation by each element of gives the same description around that element, so is an embedded submanifold of in its subspace topology. The multiplication and inversion maps of restrict to smooth maps on this embedded submanifold, making a Lie group and an embedded Lie subgroup. Its tangent space at the identity is , because is the identity on this coordinate slice. It remains closed by hypothesis. This proves the closed-subgroup theorem, with no prior smoothness assumption on .
Define
It contains zero, and implies for every real scalar , by replacing with .
For , we prove closure under addition using the Lie product formula in a Lie group. In the local exponential chart, let . Smooth multiplication has differential at the identity, so Taylor's theorem gives
For each fixed real and all sufficiently large positive integers ,
Every term belongs to , and is closed, proving . Thus is a real vector subspace. It is also closed: if with , continuity of the Exponential map of a Lie group gives for each .
For the Lie bracket, use the Adjoint representation of a Lie group. Conjugating a one-parameter subgroup gives
Consequently . For , linearity puts in . Its limit as is . Closedness of therefore gives , proving that the Lie algebra of a closed subgroup is a Lie subalgebra of .
Suppose that is not a discrete subgroup. The identity is then an accumulation point of nonidentity subgroup elements: translate any failure of isolation to the identity. Choose with , and use a local exponential chart to write , where and in the real Lie algebra .
Choose a norm on this finite-dimensional vector space. By compactness of its unit sphere, pass to a subsequence with , where . For an arbitrary real , choose an integer nearest to . Then and
Every left-hand element belongs to , including for negative . Closedness gives . Since was arbitrary and , the limit directions of a closed subgroup provide a nontrivial one-parameter subgroup in . Its derivative at zero is , so it cannot be the constant subgroup.
Identify the diagonal Cartan subalgebra with through its coordinates , and identify real roots with coordinate vectors using the invariant Euclidean inner product. A Weyl reflection is . It does not change when is replaced by . For the Cn root system, its explicit actions are
Every coordinate not displayed stays fixed. Thus each generating Weyl reflection is a signed permutation, so the Weyl group is contained in the signed symmetric group. Conversely, the first row supplies each independent sign change and the second supplies every coordinate transposition; these generate the entire signed symmetric group. This proves the Cn Weyl group identification, including its size:
Let with its nondegenerate alternating bilinear form. Its inverse-form bivector is invariant under the symplectic Lie algebra, and . Choose . The exterior product defines a symmetric bilinear form on by
It is symmetric because two-forms commute under the wedge product. It is nondegenerate because each basis wedge pairs with its complementary basis wedge. Since , the five-dimensional orthogonal complement
also has a nondegenerate symmetric bilinear form. This is the primitive exterior square, equivalently the kernel of symplectic contraction of an exterior square.
Every element of fixes and preserves volume, since its trace is zero. The induced exterior-power Lie algebra representation consequently preserves and satisfies . Thus it gives a Lie algebra homomorphism
We check injectivity explicitly. If acts as zero on , it also kills , and therefore acts as zero on all of . For three distinct indices , the coefficient of in is , so all off-diagonal entries of vanish. Its action on is then . All these sums vanish, which in characteristic zero forces every diagonal entry to vanish. Hence .
Finally,
The injective Lie algebra homomorphism is therefore surjective. Over , every nondegenerate symmetric bilinear form admits a basis in which its matrix is the identity, so this constructs the exceptional isomorphism between sp4 and so5:
Write an element of the symplectic Lie algebra in blocks. Direct multiplication in gives
The diagonal Cartan subalgebra consists of . Define . Under the Adjoint representation, the off-diagonal matrix units in have weights ; the symmetric entries in have weights , including on the diagonal; those in have the negatives of these weights. All nonzero root spaces are one-dimensional, while the zero weight space is the diagonal Cartan subalgebra. Thus the Cn root system is
Choose the positive roots and simple roots as
Their highest root and Weyl vector are
For the last identity, each pair contributes before division by two, and the long positive root contributes another afterward. Successive simple roots have equal length except for , whose squared length is twice that of . The Cn Dynkin diagram is a chain with a double last bond, whose arrow points toward , the short root:
The displayed schematic is for ; omit intermediate nodes for . For the diagram has just the single node .
The strong maximum principle for subharmonic functions states that an upper semicontinuous subharmonic function on a connected open set which attains its finite global maximum at an interior point is constant. In particular this holds for a harmonic function; negating the function gives the corresponding minimum principle for superharmonic functions.
Let the maximum be , attained at . For every sufficiently small ball centered at , the mean value inequality gives
Therefore its average equals . If some point in the ball had value less than , upper semicontinuity would give an open neighborhood where for some . That positive-measure neighborhood would make the average strictly less than , a contradiction. Thus throughout a neighborhood of .
The same argument at each maximizing point shows that is open; it is also closed relative to the domain by upper semicontinuity. It is nonempty, so connectedness forces it to be the whole domain. Without connectedness, constancy is only guaranteed on the component containing the maximizing point.
This is Weyl lemma, with the representative condition needed for pointwise smoothness. Choose a smooth radial nonnegative mollifier of mass one. On interior domains, is smooth and harmonic because .
Fix a smaller interior neighborhood and a radial mollifier whose support stays inside the domain there. The mean value property for harmonic functions implies when is sufficiently small: a radial average is a weighted average of spherical means, all equal to the center value.
As , in , while locally uniformly. The latter follows by bounding the difference by times the local error on a slightly larger compact set. Thus almost everywhere locally. The right side is smooth, and its Laplacian is zero, providing a smooth harmonic representative. These representatives agree on overlapping neighborhoods since continuous functions agreeing almost everywhere agree everywhere.
The given uniqueness of the canonical upper semicontinuous representative identifies this smooth function with . Since the question assumes , it follows that pointwise. An arbitrary null-set modification of a harmonic distribution would not have that conclusion.
The statement as printed is false without an integrability condition. On any nonempty open set, the constant functions are harmonic and therefore subharmonic, but their supremum is , which is not locally integrable.
A valid version assumes . First, the maximum of finitely many subharmonic functions is subharmonic. For a distributional proof, mollify two functions on smaller interior domains and replace their maximum by
This is smooth, convex, and nondecreasing in each argument. The chain rule shows that its Laplacian applied to two smooth subharmonic functions is nonnegative: the first-derivative terms multiply their nonnegative Laplacians, and the Hessian term is nonnegative by convexity. Mollifier convergence in and the uniform bound allow both regularizations to be removed. Continuity of distributional derivatives under this convergence proves the finite-maximum assertion.
Now increases to and satisfies almost everywhere. The dominated convergence theorem gives convergence in . For every nonnegative test function,
Thus is subharmonic in the distributional sense. This is the locally integrable supremum theorem for subharmonic functions. For the pointwise upper semicontinuous convention, take its canonical representative; the raw supremum need not already have that regularity.
For a real locally integrable function , the distributional definition of a subharmonic function is : for every nonnegative ,
A superharmonic function has the opposite inequality, equivalently is subharmonic. A harmonic function has distributionally, equivalently equality for every test function. These definitions concern almost-everywhere classes; the given upper semicontinuous representative supplies the pointwise version for subharmonic functions.
The functions are nonnegative and normalized to have integral one. On the disk , Bernoulli inequality gives . Consequently
For any fixed , the mass outside radius is at most
This is an approximate identity. For any test function,
Let and then to conclude .
Polar coordinates also give the exact normalization through the beta function:
Figure 1.
Normalized radial densities and cumulative mass concentrating at the origin
. Details.
The function is locally integrable in , so it defines a distribution. The claimed distributional identity means that for every ,
Choose a ball containing the support and remove . On the punctured region . Green's second identity gives
The outer boundary contributes zero. On the inner boundary, the outward normal for the punctured region is , so , fixing the sign.
The first term is ; the second equals . Local integrability allows the left side to converge to its full-space integral. Therefore . In this sign convention, is the fundamental solution of the Laplace equation for the operator .
Weak convergence of distributions means for every test function . The distributional derivative is defined by
It is linear and continuous: differentiation preserves compact support and bounds each test-function seminorm by one of higher derivative order, so composing it with the continuous functional again gives a distribution. Finally, for every fixed test function,
Thus distributional differentiation preserves the stated convergence.
The appropriate Poincare-Wirtinger inequality, with no zero-boundary assumption, is
Assume is nonempty, bounded, connected and has the stated cone property. If this failed, after subtracting the mean and normalizing there would be with
The sequence is bounded in . By the permitted Rellich-Kondrachov compactness theorem, a subsequence converges strongly in to . For every compactly supported test function, integration by parts and these two convergences show that each distributional derivative of is zero. A function with zero weak gradient is constant on a connected open set: mollification makes it locally constant, and connectedness identifies the local constants.
Convergence in on a finite-measure set also preserves the integral, so and the constant is zero. But strong convergence preserves , a contradiction. This proves the inequality; connectedness prevents different constants on separate components.
Assume the bounded set is measurable, as needed to define its indicator in . Put and choose a smooth cutoff function of compact support equal to one near . Weak convergence in the H1 space gives a uniform bound, by the Uniform boundedness principle, and therefore is uniformly bounded in with fixed compact support.
Here is a direct Fourier proof of the local compactness in the Rellich-Kondrachov compactness theorem. For each frequency , , since integrating against the fixed compactly supported function is a continuous linear functional on . Also uniformly, by Cauchy-Schwarz inequality on the fixed support. The dominated convergence theorem gives, for every fixed ,
The uniform derivative bound and the unitary Plancherel theorem control high frequencies:
First let , then . This proves , and hence .
Let . The Sobolev embedding theorem bounds uniformly. For , choose with . Interpolation of Lp norms gives . For , Holder inequality on the fixed finite-measure support gives the same conclusion from convergence. Thus
The same integral estimate covers if those spaces are interpreted with their usual quasi-norm. No conclusion at the critical exponent is asserted.
Work on with Lebesgue measure. Without a uniform bound, use
It has and , with for . Each function still belongs to , but its norm is unbounded. For every fixed , its level set above is eventually empty, defeating any positive uniform .
Without a uniform bound, use instead
Now and , but for any fixed the high-amplitude level set has measure . These give the two distinct failures of the nonvanishing level-set bound between three Lp norms when either control is removed.

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