The formal character identity counts unordered pairs of distinct basis vectors. Substituting and the Weyl character formula gives the displayed multiplicity-free decomposition. Its dimensions sum to . The sl3 interlacing character formula provides an exact weight-enumeration check.
Local freeness of differentials on a smooth variety by Codex 0 Created 2026-10-06 Updated 2026-10-14
An invertible maximal-rank minor in the Jacobian matrix eliminates generators and gives a local surjection from to the Kähler differential sheaf. For an integral smooth variety the map is an isomorphism at the generic point. Its kernel is a submodule of a free module over an integral domain, so it is a torsion-free module; vanishing generically forces it to be zero. This gives local free frames for differentials.
In an embedded arrangement graph, an edge whose fixed-radius neighbourhood meets a bad edge can be charged to the first such edge along a shortest path. All intervening edges are good dual-arrangement edges, so their endpoints have bounded degree. The number of possible reversed paths is bounded in terms of the fixed radius alone. Therefore thickening a defect set by a fixed radius preserves an edge count.
Multiplying a relatively almost periodic observable by a base-set indicator preserves relative almost periodicity: on each fiber an orbit value is either unchanged or zero, so add zero to the finite list of centers. Conditional norm covariance under a factor map also proves closure under convergence in the uniform conditional L2 norm.
The punctured affine plane is not an affine scheme. On its cover , global sections are inside the field of fractions. Coprimality of and proves this equality. If were affine, its inclusion into would be an isomorphism by affine scheme reconstruction from global sections, contradicting the omitted point.
A projective complete intersection defined by a regular sequence in a polynomial ring has pure codimension equal to the sequence length and has no embedded associated primes. Thus its components account for the whole degree, with their generic multiplicities. This fact excludes hidden embedded points when a contained curve already has the full intersection degree.
For a holomorphic subbundle and quotient , the second fundamental form is . The Leibniz rule gives , and holomorphicity of the subbundle makes its part vanish. Thus : the form factor is a cotangent bundle, not a tangent bundle.
A graded module over a graded ring determines a quasi-coherent sheaf on the Proj construction by taking the degree-zero part of its localization on each standard affine open of Proj. Localization identifies these module sheaves on overlaps. The construction is exact, by exactness of localization and exactness of taking a fixed graded component.
If a nonnegatively graded ring is generated by as an -algebra, the standard affine opens of Proj with cover . Indeed a homogeneous prime containing every degree-one element would contain the irrelevant ideal of a graded ring. This condition makes all twisting sheaves on Proj invertible and makes graded sheafification compatible with tensor products of sheaves.
Spectral gap for powers of a positive line bundle by Codex 0 Created 2026-10-06 Updated 2026-11-05
Let be a positive holomorphic line bundle on a compact complex manifold of complex dimension , and use as the Kähler form. There is a constant independent of the positive integer such that, on smooth -valued -forms with ,
In particular, for sufficiently large , the Dolbeault Laplacian is bounded below by on every positive antiholomorphic degree.
To see the positive sign, identify these forms with -forms valued in , using the canonical bundle and its dual bundle. The Bochner-Kodaira-Nakano identity writes the quadratic form as a nonnegative derivative term plus the curvature commutator. The contribution acts by in bidegree ; the inverse-canonical contribution has uniformly bounded size on compact . This gives . Applying the curvature commutator directly in bidegree without this twist would give the wrong sign.[ref]
The estimate rules out nonzero harmonic forms in these degrees. The Dolbeault Hodge decomposition and Dolbeault theorem therefore imply for and sufficiently large . The additive constant matters for small powers; the linear spectral gap is an eventual statement.
When , the ratio of cubic damping to linear amplification is . The cubic amplitude saturation equation therefore gives
while the small-amplitude regime lasts. With , the matching real-wavenumber normal mode of the linear complex Ginzburg-Landau equation has and hence amplitude proportional to . Thus
This is the temporal growth rate of the same Fourier component. It is not the fixed-position absolute frequency rate of a localized impulse. Nonlinear damping becomes important when is comparable with and then arrests exponential amplification.
For the equal-width Hazel model with stable density stratification ,
The Miles–Howard theorem therefore excludes exponentially growing regular normal modes for . The candidate neutral modes of the equal-width Hazel model instead lie on
The parabola touches the sufficient-stability threshold at its maximum. There is no contradiction: neutrality has , whereas the proof in part (a) assumes . Moreover, the profile has a singular critical-layer derivative and logarithmically divergent horizontal kinetic energy; it is not a regular growing mode satisfying the proof's hypotheses.
For , the local gradient Richardson number condition permits instability but does not establish it. Substitution of a neutral ansatz alone also does not determine on which side of the curve unstable eigenvalues lie. It identifies the formal neutral curve; concluding a full stability boundary requires additional continuation analysis of the eigenvalues. The nondecaying endpoint and the smooth endpoint have the distinct qualifications described above.
The approximate source bound for coercive Tikhonov regularization first allows a fixed sufficiently large to make small, then a sufficiently small to make small. This order of limits proves for every datum in its domain.
For the noise error let . Its normal equation for coercive Tikhonov regularization gives
Completing the square shows , hence . The noise-bias decomposition for linear regularization now gives
Therefore the sufficient regularization parameter choice is
For example with works. Coercivity makes boundedly invertible for each positive , so these are continuous linear reconstruction operators and form a convergent regularization of an inverse problem.
Write , , and , with as required by coercivity and by the printed inverse power. The Tikhonov regularization with a coercive penalty operator normal equation gives
This also holds for inconsistent data in , because and therefore . Taking the inner product with gives
For any with , put and use Cauchy-Schwarz inequality to bound the right-hand side by . Since , completing the square in yields
The positive root of this quadratic inequality is at most . Infimizing over proves the approximate source bound for coercive Tikhonov regularization, in fact slightly more strongly:
Injectivity gives . Given any positive tolerance, approximate by for some finite-norm ; for all sufficiently large it is admissible in the infimum. Thus
No attainment of that infimum is needed.
For and , differentiate the bound . Its derivative vanishes at , and . Consequently, when ,
If , the infimum on the open allowed interval is approached as , rather than attained at an admissible endpoint. If and , the bound decreases throughout the interval and has the same boundary behavior. At zero noise with , its infimum is approached as .
A practical regularization parameter choice independent of is
It satisfies and , hence gives a convergent regularization of an inverse problem on the domain of the Volterra operator inverse. This extends beyond exact data: if with , the differences are local averages of . Extend by zero outside the interval; continuity of translations in makes these averages converge to on both halves. Together with this proves convergence uniformly over the noise ball for every admissible exact datum.
For the Volterra operator, the identity requires in addition to the printed hypothesis. The constant function is a counterexample to the unrestricted domain assertion: it is not in . The estimate below is valid for derivatives of every function, and estimates the Moore–Penrose reconstruction when this missing boundary condition holds.
Let . Apply separately to the two halves defining differentiation by one-sided difference quotients:
The two translated intervals cover each point at most twice; this proves the factor six. The shifts act on almost-everywhere equivalence classes, so no undefined pointwise data sampling is involved.
For exact data, write the forward difference as and the backward difference as . If , either differs from by at most . The interval has length one, so this also bounds the approximation error. The triangle inequality proves the error bound for one-sided differentiation:
The range of the Volterra integration operator is , using the representative of a Sobolev space element that is an absolutely continuous function. Indeed has weak derivative and zero initial trace; conversely the fundamental theorem of calculus reconstructs such a from its derivative. This range contains smooth compactly supported functions and is dense in .
The given step is in , and its value at the single midpoint is immaterial. It cannot be the image of an function: such an image is continuous, whereas no continuous representative agrees almost everywhere with zero on the left half and one on the right half. Its distributional derivative is a Dirac delta distribution, not an function. Thus
For a direct approximation, replace the jump by a linear ramp of width centered at . Each ramp starts at zero and has an derivative, so lies in the range, while its squared error is . Its derivative norm is , illustrating unstable differentiation.
The supplied SVD gives , or more simply . Since but , the Moore–Penrose inverse is discontinuous. Its domain is the dense, nonclosed range above, and there it is the weak derivative.
The Picard criterion with the input/output convention above states
Necessity follows from and Bessel inequality. Conversely the summability constructs ; the closure condition ensures that its image is all of . The closure condition must not be omitted: a component orthogonal to the range cannot be reconstructed.
For the diagonal example, is itself in only for . Its preimage would be , so the range criterion is the convergence of . The P-series gives
At the reconstruction norm diverges harmonically. For the data are legitimate but have no preimage; for they are not even in the specified data space.
A singular system of a compact operator consists of positive singular values and orthonormal systems , satisfying
They span and , respectively. The singular value decomposition is
For an infinite-rank compact operator, the singular values tend to zero; for finite rank the sum is finite. Vectors in contribute nothing. This convention labels the input singular vectors by and the output ones by .
For , truncating after diagonal entries gives finite-rank operators with operator-norm error , proving compactness. Its SVD is
For the diagonal operator on sequence space,
Equality holds at the first coordinate vector, so and is a bounded linear operator. Every diagonal entry is nonzero, giving the null space . A datum has a preimage exactly when its weighted coordinates belong to the l2 sequence space. Hence
Finite sequences lie in the range and are dense in , so and
The sequence converges to zero in the data norm, but has norm one. Thus is unbounded and discontinuous. In particular the dense range is not closed; the datum also proves that it is a proper subset of .

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