Integrate the joint density in . Symmetry gives , so the integrand is even. Hence
Tonelli's theorem justifies marginalization for these nonnegative densities.
The inverse change of variables is , , whose Jacobian determinant is . Since are independent, the original joint density is . Thus
The transformation is nonsingular away from ; this line has probability zero because has a density, so no extra mass is omitted.
Set and . Then , so part 1 gives . Since , this becomes
Equality holds exactly when for all , equivalently all the are equal. This is the weighted arithmetic–geometric mean inequality.
Work on the positive orthant, where the real powers defining are smooth. Its closure under the constraint is the compact weighted simplex , since . The product extends continuously there, is zero on its boundary when , and is one at . Thus a maximum is attained in the positive interior.
At an interior maximizer the constraint gradient is nonzero. The multiplier equations give
All coordinates are equal, and the weighted constraint forces each to equal one. Therefore the maximum is one and on . For the constraint itself gives , so the same conclusion holds directly. Equality occurs exactly at the all-ones point.
Continuity and nonvanishing on the compact interval imply
Hence . A -Cauchy sequence is therefore uniformly Cauchy, so (i) gives a continuous uniform limit; the upper bound then gives convergence in . Thus . The positive lower bound is what makes the argument work.
Yes. A Cauchy sequence of continuous functions in the supremum norm is Cauchy in the given complete space of bounded functions, so it has a uniform limit there. A uniform limit of continuous functions is continuous: at a point, use two uniform errors smaller than and continuity of one sufficiently late term for the remaining error. Thus the limit is in , proving completeness. Equivalently this is a closed subspace of the given complete space.
A metric space is complete if every Cauchy sequence of its points converges to a point of that same space. The requirement on the location of the limit distinguishes, for example, from its incomplete subspace .
A sequence is Cauchy if
The comparison is between sufficiently late terms, without presupposing a limiting point in the space.
The image is compact: pull any open cover back by the continuous map, use a finite subcover of , then map forward. For a general topological target, closedness is not guaranteed; a continuous image into the indiscrete two-point space can be a nonclosed singleton. No connectedness assertion follows merely from compactness of .
If is metric, is compact, therefore closed in , bounded and totally bounded. It is also complete in its induced metric and sequentially compact. For the latter properties, compact metric spaces have a convergent subsequence of every sequence; a Cauchy sequence with one convergent subsequence converges to that same limit. Total boundedness follows by selecting finitely many balls of each prescribed radius. These are properties of the image itself, irrespective of whether is complete.
By the Heine–Borel theorem a subset of is compact exactly when it is closed and bounded. Consequently the nonempty compact intervals are exactly . This includes the degenerate interval . The empty interval is compact as well; nonclosed bounded intervals and all unbounded intervals fail the criterion.
In any topological space a closed subset of a compact set is compact: add its open complement to an open cover and take a finite subcover of the compact set. However, compact subsets need not be closed in a general space. In the indiscrete two-point space a singleton is compact but not closed. Conversely a closed subset need not be compact: itself is closed in but the cover has no finite subcover.
In a Hausdorff space every compact subset is closed. Given , separate and each by disjoint neighborhoods; compactness selects finitely many neighborhoods covering , and the intersection of their companion neighborhoods of misses . Thus the complement is open. Closedness still need not imply compactness, as the same real-line example shows. It does imply compactness if the ambient space is compact.
In a metric space compactness implies boundedness: finitely many radius-one balls cover the set, so their centers have a finite maximal distance from any fixed center and the triangle inequality gives a global bound. The converse is false. An infinite set with discrete metric for is bounded, but its singleton cover has no finite subcover. It is even closed and complete, so closedness plus boundedness alone does not suffice in general metric spaces.
A subset of a metric space is bounded if it lies in a ball of finite radius: there exist a point and such that for every . Equivalently its diameter is finite, with the empty set bounded by convention.
A subset is compact if every cover of by sets open in the ambient space has a finite subcover. Equivalently, every relatively open cover of the subspace has a finite subcover. These agree because relatively open sets are intersections with ambient open sets.
The components cover and are pairwise disjoint by (b)(ii); by (iii) they are open intervals. Each nonempty interval contains a rational number. Enumerate the rationals and assign to each interval the first rational it contains. Disjointness makes these assigned rationals distinct, giving an injection from the set of components into . Thus , with the empty union for .
The inclusion of into is continuous, so a connected component of is an interval in . For , openness of gives with . This interval is connected and meets , so their union is connected and maximality forces the interval into . Thus is open in . A nonempty open connected subset of the line is an open interval, allowing an infinite endpoint or the whole line. Hence every component is an open interval.
If , their union is connected by (a)(iii). It contains , so maximality gives and hence . Interchanging the roles gives the reverse inclusion. Thus the two components coincide; otherwise they are disjoint.
Let be the union of all connected subsets containing . This collection is nonempty because it includes . Any two of its members meet at , so (a)(iii) makes their full union connected. It contains and by its definition contains every connected subset through . Thus
has exactly the required largest-set property.
Use the separation definition in (i). If had a separation , the intersections with each connected show that lies wholly in one side. Choose one nonempty ; every other intersects it and must lie on that same side. Thus the other side is empty, a contradiction. If the union is empty it is connected by definition. Therefore .
The connected subsets of the real line are exactly the intervals, including singletons, unbounded intervals and the empty set. Equivalently, whenever belong to the set, every with also belongs to it. Endpoints may or may not be included.
A subset is connected if, with its subspace topology, it cannot be written as with disjoint nonempty relatively open sets. Equivalently its only subsets both open and closed relative to are . This definition includes the empty set and singletons as connected sets.

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