Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Every smooth left-invariant vector field on a Lie group is a complete vector field. Translate a local integral curve of a vector field through the identity to every other point. The same positive local existence interval works at every initial point, so no maximal integral curve of a vector field can have a finite endpoint. Uniqueness then makes the curve through the identity a one-parameter subgroup.
On a Matrix Lie group, the left-invariant vector field associated to a tangent vector at the identity is . Its ambient derivative is . Therefore the Lie bracket of vector fields is , and the induced Lie algebra bracket is the commutator. This fixes the sign for left invariance; right-invariant fields induce the opposite sign when evaluated with the same matrix identification.
Parallelization of a Lie group by left translations by
Codex 0 Created 2026-10-06 Updated 2026-10-14
A basis of the Lie algebra of a Lie group gives a global frame of a vector bundle of its tangent bundle by . Left translation is a diffeomorphism, so the left-invariant vector fields are independent everywhere. Every Lie group is therefore a parallelizable manifold.
Choose a nonzero element of for an -dimensional Lie group and transport it by inverse left translations. This gives a smooth nowhere-zero left-invariant differential form of top degree, hence an orientation. The identity proves invariance. The space of invariant top forms is one-dimensional, since evaluation at the identity identifies it with .
If every nonzero active coefficient has the sign of its residual score along the least angle regression path, the LAR active correlation invariant and inactive bounds give the Karush-Kuhn-Tucker conditions for the Lasso. A unique Lasso solution then equals the LAR path. Zero coefficients use a subgradient interval; literal sign equality with sign(0)=0 is not appropriate for a newly entering coefficient at a positive knot.
For , the Landweber full inverse filter obeysIndeed, with , the telescoping geometric series and give . Thus noise of norm at most produces iterate error at most . If , replace 2 by 1 to obtain . Together with exact-data strong convergence, a stopping choice and proves convergent regularization of an inverse problem.
Two homotopy strips with the same endpoint paths and boundary on Lagrangian submanifolds glue to a relative -cycle. If that cycle is zero in , its symplectic area vanishes: apply Stokes theorem, using and the zero restriction of to each Lagrangian. Thus relative homology controls the ambiguity in a Lagrangian path-area functional.
There is of size such that is countable for every . Its initial-segment tree, pruned and leveled to be normal, is a Kurepa tree.
Let be strongly inaccessible cardinal in the ground model and perform the finite Lévy collapse to omega-one. The ground full binary set-theoretic tree of height has all levels of size less than , so these levels become countable. Its at least ground branches remain distinct. The chain condition for forcing preserves , which is the extension . The unchanged ground set-theoretic tree therefore witnesses the Kurepa hypothesis.
For every natural parameter , there is a finite length such that every sequence of finite rooted trees satisfying has an earlier tree homeomorphically embedding into a later tree. It is a true finite-combinatorial principle unprovable in Peano arithmetic and in arithmetical transfinite recursion theory. Each fixed-parameter instance can still be verified by a sufficiently large finite search.
Finite rooted trees labelled in a well-quasi-ordering are a well-quasi-ordering under label-monotone tree embedding. A minimal bad sequence argument makes the collection of proper rooted subtrees a well-quasi-ordering; Higman lemma then compares their child lists while the root labels are compared in the label order.
If is an -primary ideal generated by elements in a Noetherian local ring and , then is a quotient of copies of . Summing their lengths gives the displayed bound. Since , it also bounds . Together with the prime-chain lower bound for local length, localization at a minimal prime proves the Krull height theorem.
The lengths of a finite uniquely decodable code satisfy , even when the code is not a prefix code. Distinct concatenations of codewords remain distinct; counting the possible binary strings of each total length bounds by . Taking th roots proves the claim.
For a bounded smooth solution of with initial function , apply the Itô formula to . Its drift vanishes and its boundedness upgrades the localized stochastic integral to a true martingale. Taking endpoint expectations yields without a global bound on .
The functions give the Brownian covariance eigenbasis on , with eigenvalues . Integrating by parts against gives independent coefficients . Pathwise L2 completeness yields in L2 and the squared-norm series.
At an isolated interface with continuous base velocity, a stable density drop and a jump of base shear, decaying disturbances obey the displayed dispersion relation. It follows by inserting their derivative jump into the jump conditions for stratified inviscid shear flow. Both the density jump and the vorticity jump contribute to the intrinsic phase velocity .
For on with endpoint values and , the interior derivatives are and . Fitting the hyperbolic-function solution proves the map. It turns matching conditions into a finite-dimensional interface system, with exponentially small cross-interface coupling at large .
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





