First prove the concentration statement with its correct scale. Let , the th uniform order statistic. The number of sample points at most is . Therefore means , and means , up to probability-zero ties. Take and . Applying Chernoff bounds at gives, for an absolute and sufficiently large ,
When the upper endpoint exceeds one its upper-tail event is empty. A union bound makes the total failure probability for all at most . On this event,
where integral comparison gives .
The first vertex block has right endpoint and always contains , so its initial chord contributes vertex degree two. All its other endpoints are those with that fall below . Conditional on the right endpoints, these events are independent with probabilities . Thus
The fewer than early summands contribute at most to this conditional mean. For the rest, the uniform estimate and uniform tightness of give
To control the actual fluctuations without assuming unconditional independence, restrict to the concentration event and . Then . Conditional Chebyshev inequality bounds the probability of a deviation exceeding by . The discarded endpoint event has limiting probability ; let . Therefore
Since has a continuous distribution, the corrected first-vertex degree in the LCD model tail is
This disproves the printed exponent for . The hint's factor is independently contradicted at : its proposed upper bound tends to , whereas
Thus the printed concentration event has probability tending to zero, not one. Replacing its by leads to the proven exponent . The exponent would instead arise for , but then the graph has vertices and the part (b) endpoint limit at becomes . It cannot repair all the printed claims with one convention. The literal part (c) is false for the named model; the full corrected limit and the source of the discrepancy are established above.
The first right endpoint is the smallest of independent pair maxima. A maximum exceeds with probability , so for ,
Taking the limit gives the requested, correctly normalized result
Thus converges to a continuous nonnegative limit with survival function . In particular the scaled first right endpoint is tight. This calculation uses maxima of pairs, not the first order statistic of all individual endpoints, which would have a different scale. The converted TeX loses the formula in this part; the displayed limit has been recovered directly from the PDF.
Draw independent pairs of independent uniform random variables on . In each pair call the minimum and maximum , then relabel whole pairs so . Merge all endpoints in into vertex , with , and join the blocks containing the two endpoints of each pair, orienting from the right endpoint to the left. Self-loops are retained. This gives the uniform linearized chord diagram representation.
Before ordering, a pair has joint density on . Consequently its maximum has distribution and density ; conditional on , its minimum is uniform on . Independence and relabelling give the equivalent precise description
Every one of the relative orderings of the independently drawn labelled endpoints has the same probability. After forgetting pair labels and within-pair labels, each matching of ordered points is produced by orderings. Thus its matching is uniform among the pairings.
To prove equivalence with the recursive graph law, remove the last endpoint and its mate from a uniform pairing. The remaining ordered points have a uniform -pairing, and the mate's old rank is uniform among the possible ranks, independently of that smaller pairing. Conversely insert the mate into a uniformly chosen one of its gaps, and pair it with the new final endpoint. For each old vertex block, the number of gaps assigned to it is exactly the number of endpoints already in that block, hence its old total vertex degree. These are the gaps immediately before each endpoint of that block. The last gap, after the last old endpoint, makes both new endpoints belong to the new final block and produces a self-loop. Therefore the attachment probabilities are for old vertices and for the new one. Induction proves the continuous construction and the recursive LCD model have the same distribution. Inserting a left endpoint into an old block raises exactly that vertex's vertex degree without splitting any old block.
Figure 1.
A linearized chord diagram with six vertex blocks, six edges and loops counted twice in the block degrees
. Details.
The necessary and sufficient condition is
where is the spectral radius of the nonnegative matrix. No irreducibility is required. We use the given nonnegative-vector characterization of its Perron eigenvalue.
For necessity, suppose is the survival fixed point and let . Since for every , its equation gives for every . There are finitely many such coordinates, so
Outside the inequality still holds, because its right side is zero and its left side is nonnegative. The provided Perron–Frobenius theorem characterization therefore gives . In particular survival is impossible at for this Poisson offspring law.
Conversely suppose . The given characterization supplies a nonzero with ; normalize it so . For sufficiently small ,
For example any works. Coordinates with satisfy the inequality automatically. Starting at , iterate . Monotonicity makes the sequence increase, and takes nonnegative vectors into , so it converges to a fixed point . Part (a) gives , proving survival from at least one type. This proves the spectral survival criterion for multitype Poisson branching for reducible as well as irreducible reproduction matrices.
Use row vectors for population counts. Given , independent reproduction has conditional mean . Starting from , induction gives . Summing all child types, the expected size of generation is
This also covers , using . All these finite-generation expectations are finite because the matrix is finite with finite entries.
At each vertex independently, take a uniformly random permutation of the other vertices. Use its first two entries for the two-out choices and its first entries for the -out choices. Every unordered choice set has the prescribed uniform distribution, and choices at different vertices remain independent. This couples the random k-out graphs so that on the same vertex set. Adding edges cannot destroy graph connectivity. Consequently
This establishes connectivity of random k-out graphs for every fixed allowed .
If the random k-out graph with is disconnected, one of its connected components of a graph has size . The lower bound follows because every vertex chooses two distinct neighbours inside its component. For a specified -set , absence of crossing edges requires every choice at a vertex in to stay in , and every choice outside to stay outside. Independence of choices at different vertices gives exactly
For , the two ratios are at most and . Indeed each of the factors , , is at most , and the complementary statement is identical. Put . The binomial coefficient bound follows by bounding the probability of successes in by one. Thus the union bound gives
For , the last summands are at most , whose sum from three tends to zero. For , they are at most , again summing to zero. Therefore
The proof bounds all possible small components rather than assuming the dependent undirected edges behave like a binomial random graph.
False. Complementary-size simplicial vertex boundaries can be asymmetric. Use , and , so .
There are 64 sets of size at most three. The initial segment contains all of them except the last triple . Every four-set has another included triple, so its external vertex boundary is that missing triple together with all four-sets: .
The initial segment contains all sets of size at most three and the first four-set . Its external vertex boundary has the other 34 four-sets and the three five-sets containing . Thus
contradicting the proposed inequality.
False. The simplicial vertex boundaries need not increase below half volume. In ,
Both closed graph neighbourhoods consist of all vertices except , so both have size seven. Their external vertex boundaries therefore have sizes
although . Adding a vertex already in the neighbourhood can reduce the external vertex boundary without enlarging the neighbourhood.
Always true. Simplicial initial segments are nested: when . Taking the closed graph neighbourhood preserves inclusion, hence and the claimed size inequality follows. No extremal theorem is needed for this step.
Take . In polar coordinates its Laplacian is , so it is harmonic on the annulus. If for a single-valued holomorphic function, the Cauchy-Riemann equations would give . But for ,
The first equality follows by evaluating the primitive around a closed curve. This contradiction verifies the absence of a global harmonic conjugate.
For the final function, the quotient of squared distances is . On , both and lie in the open right half-plane, so their principal logarithms are single-valued and holomorphic. Define
The series converges locally uniformly outside the unit circle, and
Thus this is the required single-valued holomorphic function, even on the larger domain . Its derivative is , whose two periods around the holes cancel. The logarithmic cancellation on an exterior annulus explains why this example succeeds while fails; using independent multivalued logarithms of and would conceal that cancellation.
For a harmonic function , put . Its Wirtinger derivative is
so the Cauchy-Riemann equations make holomorphic. In the simply connected domain it has a single-valued primitive
The integral is path independent: local holomorphic primitives make its value invariant under path homotopies, and being simply connected makes any two paths with the given endpoints homotopic, as in Question 3.
Since , the real part satisfies and . Hence is constant on the connected domain. Adding a real constant corrects it, producing a single-valued holomorphic with . The imaginary part is a harmonic conjugate and is unique up to an additive real constant. This is the global harmonic conjugate criterion by vanishing periods in the simply connected case.
The intended construction is to solve the Lenard-Magri recursion one step at a time. With a Casimir function of the first Poisson structure, seek satisfying
Here , consistently with part 1(i). If every step can be solved by a globally defined smooth function, the formal series is a Casimir function for the Poisson pencil, and part (i) proves that all the are Poisson-commuting functions for every parameter value after complexification.
The recursive step is a concrete potential problem. Put . It must first be tangent to the symplectic leaves of . On a regular leaf use canonical coordinates . The required equations are
Thus the leaf one-form
must be exact. Where it is closed on a contractible coordinate domain, define by integrating from a base point; path independence follows from closedness. A function of the leaf labels can be added, corresponding to a Casimir function of the first Poisson structure. Global solvability also requires vanishing periods and smooth matching between leaves. This describes how to perform each solvable step without pretending that a degenerate Poisson structure can simply be inverted.
Compatibility alone does not ensure these solvability conditions. There is an immediate obstruction to a Lenard-Magri recursion even in two dimensions. On take
Both are Poisson structures, and their linear combination is a scalar multiple of the canonical Poisson bracket, so they are compatible. Every function, including , is a Casimir function for the first bracket. But the first recursion, evaluated at , would require
a contradiction. An arbitrary initial Casimir need not extend even to . Consequently the unconditional existence assertion requires an additional hypothesis: the indicated vector field must be Hamiltonian for at every step. Under that hypothesis the recursive construction and involution proof above complete the intended result; without it the counterexample rules out the requested infinite extension.
The coefficients of the formal series must be smooth functions , rather than points of . Interpret complex parameter values in the complexified function algebra. The Casimir function condition for the Poisson pencil is a coefficientwise formal identity:
Equality of the formal coefficients proves
These are the Lenard-Magri recursion relations, valid for every smooth function .
For and , use the recursion in the first argument, then antisymmetry and the recursion in the second:
Each step lowers the first index while raising the second. Iterating times gives
because is a Casimir function of the first Poisson structure. This includes directly. The recursion one step higher then gives
Thus the commuting coefficients of a Poisson pencil Casimir satisfy
They are therefore Poisson-commuting functions for every member of the Poisson pencil. The argument proves involution, not functional independence; an infinite sequence can contain repetitions or zero coefficients.
Use the canonical representatives of functionals of : , . The formal pseudodifferential composition rule gives
and the reversed product has exchanged. Therefore
Multiplying by on the left, only the leading displayed commutator term can produce a residue. Differentiation of its coefficient produces powers at most , and multiplication by produces powers at most . Thus
and, with the trace convention of part (i),
There is no dependence in this bracket.
Moreover , so and . If is the distributional field bracket, it is characterized by
Since , the answer is
The Dirac delta is periodic in the periodic setting, or the ordinary Dirac delta on the real line with admissible test functions. This is the first Hamiltonian structure of the KdV equation, with Poisson operator . Its skewness follows by integration by parts; its coefficients are constant, so the functional Jacobi identity has no coefficient-variation terms.
A qualification is needed if the displayed trace formula is interpreted as a bracket on the reduced space for arbitrary operator representatives. Multiplication by a function gives , yet direct expansion gives
With on a period , the latter is . Hence the formula does not descend through every possible representative of a functional on this reduced affine space. The requested representatives, used consistently for variational gradients, give the well-defined constant field bracket just computed; a general restriction from the ambient operator algebra needs an appropriate reduction.
Write , setting unused coefficients to zero. Split the Adler trace into its fixed leading part and variable parts:
Cyclicity from part (i) gives
Thus this Hamiltonian trace functional on monic differential operators has the required form
To make each coefficient explicit, expand by the Leibniz rule. A term with derivatives of contributes to the residue exactly when . Consequently,
These are smooth functions depending on , not on the variable coefficients of . In particular and . The coefficient must be included: it appears in the displayed sum even though the printed coefficient list starts at .
The monic operators form an affine space, not a vector space. Accordingly is affine in the coordinates , with constant , and its differential is linear in variations. Its variational derivatives are . It is the restriction of a linear trace pairing on the full operator space, which explains the terminology without discarding the constant term.
Put every formal pseudodifferential operator in normal order, with all coefficient functions on the left. Its formal pseudodifferential residue is the coefficient of . The Adler trace is
Here and below, use periodic coefficients and integrate over a period, or impose convergence and vanishing boundary terms on the real line. Equivalently, the algebraic integration functional must annihilate total derivatives. This convention is needed for the requested trace property; arbitrary elements of do not supply it automatically.
It suffices to compute with monomials , . Write . If , no term in either product has power , so both residues are zero. If , the formal pseudodifferential composition rule gives
Since , reversal of the factors in the numerator proves
After integrations by parts, . Hence the two product traces agree. More explicitly, for their residue difference is the total derivative
For the residue difference is . In products of operators bounded above in order, only finitely many monomial pairs can contribute to a residue: the required is nonnegative, so the two downward coefficient indices have a bounded sum. Summing the monomial result therefore proves
The boundary convention is substantive. Without it, take , . Both individual residues vanish, but and its integral over is , not zero. The primitive has unequal limits at the two ends. Also a generic smooth residue need not have a convergent integral at all. Thus the proof supplies the intended cyclic trace under its necessary analytic or formal integration convention.
Write the two formal pseudodifferential operators in normal order as
where and . The formal pseudodifferential composition rule gives
Thus whenever is not identically zero, in particular when both leading coefficients are nowhere zero. In general the rigorous statement over the specified coefficient algebra is .
The leading scalar coefficients commute. Subtracting the reversed composition also cancels the terms involving , leaving
Therefore the order filtration of formal pseudodifferential operators gives
with equality precisely when the displayed coefficient is not identically zero. The bound can be strict: constant-coefficient powers of commute, giving the zero operator, whose order can be assigned .
There is also a genuine qualification to product-order addition in . Choose nonzero smooth functions with disjoint compact supports and take . Each has order zero, but their product is zero. Nonzero coefficients as elements of this algebra need not have a nonzero product. Thus an unqualified assertion of exact product order requires an additional leading-symbol hypothesis.
Use the formal pseudodifferential composition rule on each coefficient and then the exponential eigenfunction convention. For every integer ,
Consequently
Collecting all terms of a fixed power of the spectral parameter gives the useful answer
The sum defining each is finite. For example,
and
This is the action on a formal pseudodifferential wave function. It is a formal expansion near , with carried as a formal prefactor. It does not assert convergence for finite , and negative powers are not evaluated at .
First let . The ordinary Leibniz rule, applied to a test function , gives
Equivalently, the composition of differential operators is
For completeness, this formula follows by induction: applying differentiates either the coefficient or the remaining derivative of , and the two contributions combine by . The initial case is multiplication by .
For all integers , define and . The formal pseudodifferential composition rule is
For , , so this is usually an infinite series. In particular
Applying on the left gives : all later coefficient derivatives cancel in pairs. This uniquely determines the normal-ordered inverse expansion. Repeating the inverse construction, or using the same binomial recurrence downward in , gives every negative power. More explicitly, applying to the proposed -series yields coefficient at , so it is consistent with the already determined -series. Negative powers here are formal; differentiation on all of has a nontrivial kernel and has no genuine two-sided inverse there.

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