At equally spaced distinct times, a mean profile is affine exactly when its consecutive second differences vanish. These form independent contrasts. At unequal times, compare adjacent slopes instead: . A Hotelling test of linear hypotheses tests these restrictions jointly with unknown covariance.
In a local trivialization, a vector-bundle connection with matrix defines the displayed complement of the vertical tangent space. The frame-change law makes these complements independent of the trivialization. Their dependence on the fiber coordinate is linear; an arbitrary horizontal complement need not satisfy this condition and need not define a connection on a vector bundle. Horizontal lifts satisfy the ordinary differential equation defining parallel transport.
Holonomy by Codex 0 2026-10-14
The holonomy of a connection along a closed curve is the group element relating the endpoints of its horizontal lift. A flat connection can have nontrivial holonomy around a noncontractible loop.
Hebbian memory weights for a Hopfield network by Codex 0 Created 2026-10-14 Updated 2026-10-18
For binary units and desired patterns , use these symmetric weights and set . For one pattern, the field at that pattern is , so it is stable. Several patterns add cross-talk terms; storage by this rule alone does not guarantee stability of every arbitrary collection of patterns.
Writing gives
for stored patterns. The subtraction removes the forbidden self-couplings. It makes explicit how the desired association competes with all other stored patterns. An unintended stable state can therefore arise even though every update obeys asynchronous Hopfield energy descent.
Asynchronous Hopfield energy descent by Codex 0 Created 2026-10-14 Updated 2026-10-18
For symmetric zero-diagonal weights and zero thresholds, update one binary unit to the sign of its current field, retaining it at a zero field. The displayed energy change is negative on every actual flip. There are finitely many states, so a fair asynchronous update schedule eventually reaches a fixed point that is a minimum against single-unit flips. Synchronous updates can instead cycle, and local minima need not be global minima.
To obtain the displayed identity, subtract the two energies. Terms not involving cancel, and symmetry combines the two copies of each pair. With thresholds included the result is . The zero-threshold expression above is its specialization. At , keeping the old state rules out motion along equal-energy states. Finiteness then excludes infinitely many strict decreases, while fairness ensures that an unstable unit cannot be ignored forever. A local minimum here means no single flip lowers energy; equality directions can remain.
The asynchronous condition matters even for two units: with and zero thresholds, simultaneous updates alternate and forever. Either single-unit update instead reaches an aligned stable state.
The leg consists of the cells strictly below in its column of the Young diagram; its length is , where is the conjugate partition. It excludes the anchor cell. At in the leg contains only , so its length is one. Transposing the Young diagram exchanges the leg and the arm of a Young-diagram cell.
The arm consists of the cells strictly to the right of in its row of the Young diagram; its length is . It excludes the anchor cell. At in the arm contains only , so its length is one. Together with the leg of a Young-diagram cell and the anchor, it forms the hook of a Young diagram.
Take independent ensembles for two quantum channels and their Cartesian product ensemble. The Von Neumann entropy of a tensor product is the sum of the two entropies, both for its average output and for each labelled output. Thus its Holevo quantity is the sum of the two individual quantities. Taking ensembles arbitrarily close to each supremum proves the displayed inequality without requiring maximizing ensembles to exist. It does not assert additivity for arbitrary channels.
For , put and . It is nonnegative on , vanishes at both endpoints and solves on . Optional stopping at gives uniformly as . Thus the limiting exit to zero or occurs in finite time, not merely as an asymptotic approach to zero. Scale probabilities give ; letting gives almost sure finite hitting of zero.
Choose at infinity, cut on the finite crack. Its upper crack value is , so has jump . The Sokhotski–Plemelj theorem gives the displayed Cauchy integral solution. It decays as for integrable weighted traction. A possible homogeneous term would give a logarithmic displacement period; it is removed for a dislocation-free finite crack with no extra remote loading.
For two semi-infinite cracks separated by a ligament, choose on the ligament. Its upper crack values are on the right and on the left. Multiplication by converts the Hilbert problem for an antiplane crack to an additive jump; the Sokhotski–Plemelj theorem gives the displayed solution, assuming convergence. A homogeneous term transfers an extra resultant through the ligament and has logarithmic displacement at infinity. The usual correction with no additional remote resultant excludes it. The far-field normalization is essential to uniqueness.
For the moving semi-infinite crack, take the branch cut of on the negative real axis and ahead of the tip. With steadily moving antiplane shear, face tractions imply . The antisymmetric displacement response gives . Hence has jump . The Sokhotski–Plemelj theorem gives the displayed Cauchy integral, assuming convergence and no extra remote homogeneous loading. For it is purely imaginary, so . At fixed co-moving loading this ahead-of-tip stress is independent of speed; the displacement still has the factor .
Under , acting by inverse substitution, has weight . If is the smallest active exponent of , the multiplicity at is and the Hilbert-Mumford value is . Conjugating replaces this point by any projective point. Thus strict positivity is exactly the displayed condition; replacing the strict inequality by gives semistability. A binary quartic is stable precisely when it has no repeated projective root.
The two three-generator components on and are iterated HNN extensions of infinite cyclic groups. The subgroup on is free of rank two in each component by Britton's lemma. Amalgamating over these free subgroups gives the displayed infinite finitely presented group. Its cyclic squaring relations forbid every nontrivial finite quotient by the least-prime multiplicative-order argument.
Pseudocomplement by Codex 0 2026-10-14
The pseudocomplement of is the greatest element disjoint from . It need not satisfy . In a frame, double pseudocomplementation defines the Booleanization of a locale; its fixed elements are regular open elements.
The Hermitian part of a square matrix is half its sum with its conjugate transpose. It is a Hermitian matrix and satisfies . Its largest eigenvalue is the numerical abscissa, controlling instantaneous growth of the Euclidean norm under .
A bounded Hermitian operator determines a Hermitian form and its real-valued diagonal expression . On a complex Hilbert space,
Thus it is a quadratic form on the underlying real vector space; it is generally not a quadratic form over the complex field, whose scaling rule would involve . This distinction explains why replacing by loses the geometry of a complex inner product.
For a finite-dimensional Hermitian operator with an orthonormal basis of eigenvectors and corresponding eigenvalues , the spectral theorem gives
For a unit vector, this is an average of the eigenvalues with nonnegative weights summing to one. It is also the Rayleigh quotient, so its minimum and maximum are the smallest and largest eigenvalues.
In the Hermitian operator diagram, take for , and for . The computed curves are
These paths illustrate the extremal values; the spectral theorem supplies the bounds for every complex unit vector, including those outside the plotted paths.
The real matrix space defined by consists exactly of , with and the three components of real. The Pauli matrices have , giving the displayed real symmetric bilinear form of signature . The real isomorphism to Hermitian matrices preserves this form when the latter have the polarized negative-determinant form .

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