Topics (349k) Articles (361k) Users (420) Discussions (237) Comments (383) Files (12k) New article
A Duhamel comparison can bound truncation error using commutators evolved under the full Hamiltonian. This avoids assuming that a black-box Lieb-Robinson bound for also holds for every truncation. Polynomial shell weights and exponential distance suppression make the sum over omitted shells convergent. Comparing two truncations through the full evolution bounds their difference.
A Lagrangian is regular when its velocity Hessian matrix is invertible. The inverse function theorem then makes the fiber derivative locally invertible, allowing a local Legendre transform in mechanics to a Hamiltonian. If that fiber derivative is globally invertible, the Lagrangian is called a hyperregular Lagrangian. Regularity alone does not assert global invertibility, and singular Lagrangians may give constrained rather than ordinary unconstrained Hamilton's equations.
For symmetric and antisymmetric satisfying , solve , . Then is orthogonal and is constant. Hence every eigenvalue and every coefficient of the characteristic polynomial of is conserved.
A Puiseux series permits fractional exponents with a fixed common denominator: . These are natural local expansions of branches of algebraic functions. A fractional-power root expansion uses such powers to resolve roots that coalesce as a parameter tends to zero.
Let , , and . For design matrix columns of norm and , the event has probability at least when . Apply the sharp two-sided Gaussian tail bound to each standardized score and then the union bound; independence of the scores is not required.
The Lasso regularization path follows its coefficients as the penalty or constraint radius changes. Under the usual least-angle construction, the coefficient path is piecewise linear between knots, and variables can enter or leave the active set. Reading support at a selected cross-validation fraction requires checking which coefficients are actually zero at that fraction, rather than retaining only visibly large traces.
For the Lasso criterion , the displayed subgradient optimality condition is necessary and sufficient. A nonzero coefficient has residual score , and a zero coefficient has residual score in . The subdifferential of the L1 norm supplies both cases.
For a minimization problem with and , the optimization Lagrangian is with and unrestricted equality Lagrange multipliers. Its infimum over the original variable domain gives a dual lower bound. For a maximization problem, use to obtain upper bounds. The Lagrangian sufficiency theorem combines a global extremum of this function with feasibility and complementary slackness. This is distinct from a Lagrangian density in variational physics.
Transport a phase-space density along Hamilton's equations. The Hamiltonian vector field is and the equation is . Its zero divergence gives volume-preserving transport. For , the density is constant along characteristics; a source is integrated by the Duhamel formula for Hamiltonian transport. This is distinct from the elliptic Liouville equation.
The mass-normalized first velocity moment of a distribution on phase space. For a velocity-only distribution, omit the position integral. Nonzero finite mass and a finite first moment are required. For a probability distribution this is its expected value; its unnormalized counterpart is the momentum.
On the unit-period spatial circle, free streaming has solution . With Fourier phase , its mixed Fourier transform is . A nonzero spatial mode of the velocity-integrated density therefore samples increasingly large velocity frequencies. The conserved spatial zero mode remains, while extra velocity regularity supplies quantitative decay of the other modes.
This many-particle stochastic collision model rotates one uniformly selected velocity pair by a uniformly selected angle, conserving the sum of squared velocities. Its normalized angular averaging is the Kac collision operator, and its continuous-time evolution is the Kac master equation. In this version velocities range over and initial energy is not restricted to one sphere; the evolution preserves the initial energy distribution.
For a dilute phase-mixed population, an identical-species collision rate counts unordered pairs: . Different species have rate . Here uses the collision cross-section and relative speed. Destroying both identical particles gives , not . This distinction prevents inconsistent factors when using one kinetic kernel for several particle sizes.
Where a Killing vector field is and its squared norm is nonzero, an invariant metric tensor decomposes as . The quotient one-form has and the quotient metric has . All coefficients are independent of . Changing the fibre coordinate to sends to . A null Killing direction requires a different decomposition.
On three noncompact spatial dimensions times a circle of circumference , the method of images gives at equal compact coordinates. This interpolates from at short distances to at long distances. A gravitational circle-radius scalar can change the long-range coefficient if it remains unstabilized.
A forward problem computes observable data from a known state or parameter and a specified model . Its associated inverse problem reconstructs from and the model. Inverse problems can fail existence, uniqueness or continuous dependence on the data.
Multiparticle quantum scattering is factorized when it decomposes into two-body scatterings without particle production or a new irreducible many-body amplitude. The independence of the answer from the order of exchanges imposes the Yang-Baxter equation. Classical pairwise additivity of soliton shifts is a corresponding property of integrable soliton collisions.
A cutting-plane method repeatedly adds valid inequalities that exclude a current relaxed solution while preserving all feasible integer solutions. Gomory fractional cuts provide such inequalities from a fractional simplex dictionary.
The knapsack problem selects items of prescribed weights and profits under a total-weight capacity. The 0-1 knapsack problem permits each item at most once; bounded and unbounded multiplicity variants use different integer restrictions. Nonnegative weights and capacity are assumed here.
A branch-and-bound search partitions a feasible set, maintains a feasible incumbent, and prunes subproblems using bounds that cannot improve that incumbent. For a quadratic knapsack problem, fixing a selected set adds its exact quadratic value as a constant and replaces remaining profits by under the ordered-pair convention. Residual fractional row bounds for quadratic knapsack and a Lagrangian knapsack bound can then be recomputed. Worst-case search remains exponential.
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





