For integer partitions of , padded by zero parts, the dominance order on partitions is
A -tableau fills the Young diagram of with , each once. A tabloid remembers the sets of entries in each row, ignoring their order within that row. The Young permutation module has these tabloids as basis, with acting by permuting the entries.
The row and column stabilizers independently permute entries within the rows and columns of . The column antisymmetrizer is , and is the associated polytabloid. Since and conjugation preserves permutation sign,
Thus the Specht module is the submodule
Every tableau is for a fixed , so any single generates it under . Also , since a permutation preserving both rows and columns must fix every cell. The tabloids for are consequently distinct, and has coefficient at ; in particular .
We use the following precise column antisymmetrizer facts. If some row of a -tableau contains two entries from one column of , the transposition interchanging them pairs equal tabloids with opposite signs in , so . Otherwise each row of meets each column of at most once. The first rows of therefore contain at most entries from column of , whence
This states and explains dominance from a nonzero column antisymmetrizer: implies .
When , the nonzero column antisymmetrizer criterion says more: either , or a column permutation takes to , and . Thus . This follows by matching the row positions within each column when all intersections have size at most one; the equal row and column sizes force the Ferrers incidence pattern.
For the inner product, use the positive Hermitian extension of the orthonormal tabloid basis, linear in its first argument. It has the supplied self-adjointness of . Its orthogonal complement of agrees with that obtained from the complex tabloid bilinear form, since the spanning polytabloids have real coefficients. Because the coefficient of in is , self-adjointness and the one-dimensional image give the useful identity
Indeed, the scalar multiplying is the -coefficient of , which is .
An M-group is a finite group for which every irreducible character is induced from a linear character of some subgroup. Let have both and abelian, and fix an irreducible -module with character . Since is abelian, has a linear constituent. Choose, among all pairs with and a linear character occurring in , one for which is maximal.
Every subgroup containing is normal in : its image in the abelian quotient is normal, and it is the full preimage of that image. Thus , so the inertia group of a character is defined and contains .
Suppose . The nonzero -isotypic component is preserved by , and every acts there as the scalar because . The finite-order operator representing is diagonalizable over ; choose an eigenvector . Then is invariant under both and , hence under . This line affords a linear character of with . Since it is a subrepresentation of , it is a constituent of . But strictly contains and still contains , contradicting maximality.
Therefore . Apply the Clifford correspondence with normal subgroup . Its inertia group is itself, and , so the unique irreducible -character lying over is . In particular,
Since was arbitrary, every irreducible character is a monomial character, proving that finite metabelian groups are monomial:
Write and . The derivatives of the cumulant-generating function are
Since and , the first three cumulants are
The last equality follows by expanding the cube and taking expectations. We use the paper's unstandardized third central moment throughout. The usual skewness coefficient divides this quantity by ; its sign is the same whenever the variance is positive.
There is a minor domain qualification: finite ordinary moments do not guarantee a finite moment-generating function for positive arguments. The differentiations are valid in a neighborhood of zero when a positive exponential moment exists. For positive variables with the stated finite moments, all formulas also follow from left derivatives at zero, because for and dominated convergence applies. Thus no extra exponential-moment assumption is needed for the moment identities themselves.
For the random sum of independent claims, condition on . Independence of the claims and independence from the count give
Taking expectations and then logarithms yields the random-sum transform identity and the cumulant composition for a random sum:
Here is the probability generating function. These identities hold wherever the transforms are finite, in particular for with positive claims.
For reuse in the three cases, write and . Applying the chain rule three times gives
or equivalently
This expresses the requested third central moment in raw claim moments, while keeping the contribution of claim-count variability explicit.
On a fixed finite horizon, a self-financing strategy consists of predictable stock holdings , integrable against the price processes, and a bank account holding . Its wealth and gains satisfy
An admissible trading strategy has discounted wealth bounded below by a deterministic constant throughout the horizon. With the bounded short rate in this part, an undiscounted deterministic lower bound is equivalent after adjusting the constant. An arbitrage is an admissible zero-initial-cost strategy with almost surely and .
Put and define the market price of risk
The bounded coefficients and bounded inverse make bounded. Define the stochastic exponential
The Novikov condition states that makes this exponential a true martingale with expectation one. Boundedness verifies the condition. Therefore defines an equivalent probability measure. The Girsanov theorem states that
is a -dimensional Brownian motion under . Substituting into the asset equations gives
Thus is an equivalent local martingale measure. The sufficient direction of the fundamental theorem of asset pricing says that such a measure excludes arbitrage among admissible self-financing strategies. Here the reason can be seen directly: is a local martingale under , and its lower bound makes it a supermartingale. Consequently implies , incompatible with the nonnegative terminal payoff of an arbitrage. Therefore the bounded-inverse market has no arbitrage.
For the requested law of one price counterexample, take a broader continuous-time local-martingale model on . Let be a Brownian motion, let , and set for . Define
The given hitting-time fact gives almost surely. The corresponding physical hitting time is , so reaches one and then stays one. In particular it is continuous at maturity and .
For a rigorous closed-horizon localization, stop additionally when hits , or at if it never does. The stopped process is Brownian motion stopped on first exiting and subjected to the deterministic clock; it is a bounded martingale, including at . The stopping times increase to , since every Brownian path on the finite random interval has a finite maximum. Thus is a positive local martingale on the whole horizon. With the time-changed Brownian filtration, the original probability measure is an equivalent local martingale measure. The admissible-wealth supermartingale argument above proves no admissible arbitrage.
Nevertheless while , so the law of one price fails. Shorting one share and buying two units of cash has zero initial cost and terminal gain one, but its wealth is . It has no deterministic lower bound: for every , the probability of Brownian motion hitting before is , obtained by optional stopping of the bounded stopped Brownian motion. That apparently profitable strategy is therefore inadmissible. The counterexample deliberately uses a strict local martingale; the bounded-coefficient class in the first part has true discounted asset martingales and does satisfy the law of one price.
A poset becomes a category whose objects are its elements and whose hom-set is a singleton if and empty otherwise. Reflexivity supplies identity arrows and transitivity supplies composition; all possible composites are unique, so the category axioms hold. Antisymmetry says that isomorphic objects are equal. A functor between such categories is exactly an order-preserving function: an inequality must be sent to an inequality, and there is no further choice of arrow map.
For a diagram shape , a functor preserves categorical limits of shape if every limiting cone over every diagram is carried to a limiting cone over . It reflects categorical limits of that shape if a cone in is limiting whenever its image cone is limiting. These properties concern cones which are given; reflection is not an assertion that every cone in the target lifts.
Suppose is a full and faithful functor and the image of is limiting. A cone in becomes a cone in , so there is a unique with . Fullness writes for some . Faithfulness gives , and also ensures uniqueness: two such would have the same image, by uniqueness of . Hence the original cone is limiting. This proves every full and faithful functor reflects categorical limits, the limits reflected by full and faithful functors criterion, with no essential-surjectivity requirement.
For the triangle quotient, the universal coefficient theorem for homology gives for every , because its only positive integral homology is . A connected positive-dimensional closed manifold has a nonzero top mod-two fundamental class, independently of orientability. Thus this quotient cannot be homotopy equivalent to such a manifold. A connected zero-dimensional closed manifold is a point, which its nonzero also excludes.
For the attached-band space, the same universal coefficient theorem for homology gives nonzero and zero homology above degree two. A connected closed manifold homotopy equivalent to it would consequently have dimension two. Its Euler characteristic would be one. The classification theorem for surfaces says that a closed connected surface of Euler characteristic one is the real projective plane. But its integral is , differing from both possibilities computed in part 2. Thus this space is never homotopy equivalent to a closed manifold.
The antipodal mapping torus is already a closed manifold: gluing the two boundary components of by a diffeomorphism gives a smooth -manifold without boundary. For , it is orientable exactly when , namely when is odd. In that case on is isotopic to the identity through rotations, so the mapping torus is diffeomorphic to . The case is a circle as above. Only the third family can be homotopy equivalent to a closed manifold.
Put and use normalized averages . Our convention for Fourier coefficients on a finite abelian group is
The underlying orthogonality of complex exponentials is for and zero otherwise. For nonzero this is the finite geometric series with ratio ; its sum vanishes because that ratio has th power one. The identical orthogonality statement holds when averaging over instead of .
Using this orthogonality to sum the definition over proves Fourier inversion on a finite group:
Indeed . This proves the Parseval identity on a finite group and its squared-norm case:
For normalized convolution on a finite group, write . Changing variables in its transform gives
the convolution theorem on a finite group. Linearity of the transform follows directly from its definition. Translation gives by changing variables. Complex conjugation gives ; for , the corresponding identity is . Finally and by the triangle inequality. These identities establish the basic normalized Fourier analysis on a finite abelian group needed below, with all normalizations fixed.
For completeness, pointwise multiplication has the dual convolution formula : insert the inversion formula for into the defining average and collect its frequencies. If modulo , the change of variables gives . These also follow directly from the same additive character orthogonality.
A general feedback shift register of length over an alphabet stores , outputs , and shifts to for a fixed function . When the alphabet is a field , it is a linear-feedback shift register if is linear over , equivalently for fixed coefficients in . The binary case uses the finite field ; the examples and counterexamples below are binary.
For a genuinely nonlinear example take length three and . Its values at and are both zero, but its value at their sum is one, violating additivity. Thus this general register is not linear. It even has an invertible state update: from the old leading bit is , so the counterexample does not rely on allowing singular registers.
The ergodic hypothesis states that long-time averages of equilibrium observables along typical trajectories equal their ensemble averages on the accessible phase space with the same conserved quantities. It permits statistical mechanics to predict measured macroscopic quantities from equilibrium distributions rather than tracking a trajectory. In its microcanonical form the measure is on the constant-energy surface. It is an assumption about the relevant dynamics, not a consequence of particles being noninteracting; the calculations below use the equilibrium canonical ensemble at temperature .
Pontryagin maximum principle leaves the initial costate unknown. Terminal conditions determine these unknown constants and, when terminal time is free, the time. In a maximization convention with terminal reward and running cost , use . A free terminal coordinate gives ; a fixed terminal coordinate instead allows a constraint multiplier. More generally is normal to the permitted terminal manifold. The free-terminal-time transversality condition is . These conditions convert the adjoint and state equations into a boundary-value problem. Reversing the costate sign gives the equivalent minimization convention.
A model of three-dimensional hyperbolic space is with metric , the complete simply connected metric of curvature . The translation length of an isometry is . A hyperbolic isometry has positive translation length attained on its invariant complete geodesic, the axis of a hyperbolic-space isometry. It joins the two fixed ideal points and is translated by distance ; a three-dimensional axial isometry can also rotate around it.
For the boundary map , the hyperbolic extension of a Möbius transformation is . Every path from to has length at least the absolute change of , namely , because the metric length dominates . On the vertical line a vertical segment attains that bound. Hence
If the vertical line is the axis. If the map is a rotation with zero translation length, including the identity when ; it is not a positive-length hyperbolic isometry.
Set and extend the proposed vector by . For , the angle-addition identity gives
Hence the Toeplitz antisymmetric tridiagonal matrix has eigenvalues
The real sine vectors are eigenvectors of the real symmetric tridiagonal matrix with both off-diagonals one, with distinct eigenvalues ; thus they are orthogonal and form a basis. Multiplication by the unitary diagonal matrix preserves orthogonality. Their squared norms are , so multiplying by gives a common orthonormal basis for all , even when some eigenvalues coincide.
Let have superdiagonal one, subdiagonal minus one and diagonal zero. The prescribed endpoint values remove the exterior unknowns, and the scheme is
In the common orthonormal eigenbasis, the two eigenvalues are . Every eigenvalue of is nonzero for real , and the amplification matrix has eigenvalues
Thus is a unitary matrix and exactly. The same holds for the mesh-weighted norm. This matrix argument proves , without a Fourier stability calculation.
The printed mesh ratio has a consistency error: advection requires , while the PDF prints . Indeed the centered spatial difference is , so division of the scheme by gives leading right-hand coefficient . The printed choice makes this rather than one. The stability conclusion is valid for the algebraic scheme with either definition, but does not fix this inconsistency. The continuous first-order advection problem also ordinarily specifies only the inflow endpoint, here ; zero data at both endpoints restrict admissible initial data. For example the initially boundary-zero profile develops nonzero outflow before inflow changes reach that boundary. The matrix norm calculation concerns the stated two-endpoint discretization and does not establish well-posedness for arbitrary continuous initial data.
The left group action on the homogeneous polynomials is , since . Every SU(2) matrix is conjugate to with . In the monomial basis , its eigenvalues are . Consequently the character of the homogeneous polynomial representation of SU2 is
The quotient is interpreted by continuity at the endpoints: and . The introductory action and character requests are independent of parts (i)–(iii), so this root Solution slot has been restored.
The angles and are cyclic. Their conjugate momentum components are and , so both are conserved; consequently is constant. With ,
Eliminating the cyclic velocities gives the nutation effective potential
apart from the constant axial spin energy. Thus
The endpoint is excluded for these nonzero conserved momenta: the effective potential diverges there. The apparent Euler-angle singularity at is interpreted by its smooth small-tilt limit.
Lubrication theory exploits a film thickness much smaller than its horizontal variation scale . Incompressibility then gives vertical velocity of order , vertical viscous derivatives dominate horizontal ones, and inertia is negligible when . The leading equations reduce to and vertical hydrostatic balance . Boundary conditions determine the local horizontal velocity profile; integrating it across the film and enforcing mass conservation produces an equation for flux or surface shape. This reduction turns the thin-film problem into a one-dimensional pressure problem while retaining the dominant viscous stresses.

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