Topics (349k) Articles (361k) Users (402) Discussions (237) Comments (383) Files (12k) New article
Conjugation by every element of preserves a normal Lie subgroup . Its differential therefore preserves . Differentiate that invariance along to obtain , proving that is an ideal of a Lie algebra. Closed subgroups have a canonical Lie-subgroup structure; an arbitrary abstract subgroup need not.
Special linear congruence action on symmetric matrices by
Codex 0 Created 2026-10-06 Updated 2026-10-07
The special linear group acts on determinant-one real symmetric matrices by matrix congruence. Symmetry and determinant are preserved, and signatures are preserved by Sylvester's law of inertia. The determinant-one set is a regular level set of dimension , with tangent directions satisfying . Its infinitesimal left-action fields are ; converting them to a Lie algebra representation requires the infinitesimal left-action sign convention.
In a local exponential chart, the mixed second differential of the group commutator defines a bilinear map on the tangent space at the identity. Inversion after swapping the two group elements proves antisymmetry. Differentiating conjugation gives ; applying naturality of the Lie bracket to the Adjoint representation of a Lie group then proves the Jacobi identity. For a matrix group this recovers by expanding through the mixed term.
The relation for a bilinear map proposed as a Lie bracket. An Alternating Lie bracket always satisfies it. Conversely, setting gives , so antisymmetry implies alternation over a field of characteristic different from two.
In characteristic two, the sign disappears and this relation just says . It does not force , even when the Jacobi identity holds. For example, on a two-dimensional vector space with basis , set and every other basis bracket to zero, then extend bilinearly. Every nested bracket vanishes, so the Jacobi identity holds, and the product is symmetric. Nevertheless it is not a Lie algebra, because .
The real Lie algebra of the unitary group is , of real dimension . Differentiating unitarity gives necessity; exponentiating any skew-Hermitian matrix gives a curve in the group, proving sufficiency.
Differential of a Lie group homomorphism preserves Lie brackets by
Codex 0 Created 2026-10-06 Updated 2026-10-14
For a smooth homomorphism of Lie groups, naturality gives . Therefore locally. Apply this to the group commutator and differentiate its two curve parameters to obtain the displayed identity for the Lie bracket from local group commutators. In particular the differential of a group representation is a Lie algebra representation.
For the current with rather than , the spin-summed symmetric leptonic tensor is . Integrating the standard two-body Lorentz-invariant phase space of two massless particles givesIts antisymmetric Levi-Civita symbol term integrates to zero. The normalization changes by a factor of four if the current uses instead. The result separates the leptonic integration from hadronic pseudoscalar-to-pseudoscalar form factors in a three-body decay rate.
Complementary pivoting follows adjacent bases while maintaining all but one label of a complementarity system. The Lemke-Howson algorithm for a bimatrix game follows the duplicated label between two tableaux until it restores the dropped label at a nonzero completely labelled pair. Normalization then gives a Nash equilibrium.
An uncountable subset of the real numbers whose intersection with every null set for Lebesgue measure is countable. Testing only Borel sets suffices because every Lebesgue-null set has a Borel null superset. No measurability of is assumed.
If and nonnegative measurable functions satisfy for all , then their Lebesgue integrals obeyThe quantile derivative identity and monotone substitution inequality prove the one-dimensional case; Tonelli theorem extends it by induction. It implies the Brunn–Minkowski inequality.
For increasing concave , write . Under the smallest-maximizer convention, the leader wins with probability greater than exactly when . The sign of places the maximizer before or after . At equality, concavity alone permits a flat interval of optima; strict concavity or an explicit selection is needed for the strict comparison at that type.
If a concave leader objective is constant over an interval, all efforts there are best responses, but they can have different winning probabilities. A flat positive-density interval of produces this at the type . Thus strict threshold statements must distinguish strict concavity from a selection such as the smallest maximizing effort. For an atom-free type distribution, the specified threshold type has zero ex ante probability.
For a simple symmetric random walk, geometric blocking and the Borel-Cantelli first lemma yield the upper estimate almost surely. Equality requires a separate lower-bound argument.
For a full Euclidean lattice and a positive definite real symmetric matrix , the Gaussian theta sum obeysUse the Fourier transform kernel , the identity , and the Poisson summation formula for a Euclidean lattice. No integrality or self-duality of the Euclidean lattice is assumed.
Starting Landweber iteration at zero with fixed step , the full data-to-solution coefficient on a singular value isThis follows by summing the scalar geometric series in a singular system of a compact operator. For fixed , near zero and extends with . Its dimensionless damping factor is , so the two common filter conventions must not be confused. Writing uses a discrete parameter sequence; if negative multipliers occur, noninteger real powers are not a definition of the same iteration.
In a singular system of a compact operator, Landweber iteration with a Tikhonov initial value has coefficients . Summing the finite geometric series gives the displayed filter. For fixed , at zero, so each finite iterate is bounded. Under the filter approaches on every positive singular mode; noisy data require early stopping of Landweber iteration.
Choose a reference path between Lagrangian submanifolds in a symplectic manifold. With a connecting homotopy strip oriented by , define . If the path space is connected and , relative symplectic-area independence makes this single-valued up to a global constant. Its derivative is , so its critical points are the constant paths in . For a compatible almost complex structure, its formal downward flow is the J-holomorphic curve equation .
For binary knapsack optimization, is an upper bound for every . Its minimum is computable from the finitely many profit-to-weight breakpoints and agrees with the fractional knapsack problem optimum. Zero-weight positive-profit terms are added independently.
For perturbing acceleration on an osculating orbital element system with fixed central parameter ,To prove it, differentiate the specific orbital energy , obtaining . Substitute , and . Here is the true anomaly; a normal perturbing acceleration does no instantaneous work.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





