Suppose is an integrable adapted process, is finite and adapted, and . The displayed correction is a nonnegative supermartingale: its next denominator is measurable at time , and its reciprocal is at most one. If almost surely, the denominators converge to a finite positive limit since . The almost sure supermartingale convergence theorem then gives finite almost sure convergence of . No integrability of the infinite product or of is needed.
A probability measure-preserving system is compact if every observable has a relatively compact Koopman operator orbit in the global norm. For an invertible system one may use all integer times; for a general transformation use nonnegative times. This is a measure-theoretic definition, stronger than compactness of the underlying topological space.
If the forward orbit of under an isometry is totally bounded, choose a finite net whose centers are and let . For every sufficiently large , some center is within of , so cancellation gives . Thus is a syndetic set. Telescoping also gives .
Cancellation of weight-two Eisenstein anomalies by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a matrix in the Gamma 0 congruence subgroup, argument dilation conjugates its action to an integral determinant-one matrix for each divisor of . The anomaly of is , so the displayed linear condition cancels it. Necessity follows by testing the matrix with rows and . The combinations , with dividing , span this space.
The finite Laurent coefficient in the Kronecker limit formula is invariant under the modular group. Its Wirtinger derivative satisfies , by differentiating the convergent product in that formula. Differentiating gives weight-two covariance for . Since , substitution gives the displayed transformation law. This proof needs no prior modularity assertion for the eta product.
This is the degree-one convention for an almost commutative algebra: the exhaustive filtration is generated by a finite-dimensional first step containing , the degree-zero part is , and its associated graded algebra is commutative. The first step is a finite-dimensional Lie algebra under commutators. Its inclusion into extends by the universal property to a surjection from its universal enveloping algebra. The element of the first step is retained as a central Lie generator and its image is the associative identity; quotienting the first step by before taking the bracket can lose scalar commutators. This convention is stronger than merely requiring a finitely generated commutative associated graded algebra for an arbitrary weighted filtration.
// Destination: noncommutative-algebra.bigb
For a unital irreducible action and , the annihilator is a maximal left ideal and is closed. Thus supplies the displayed complete norm on the module, with contractive action. Every module endomorphism is bounded for this quotient norm: its value at the cyclic vector is , so it is induced by bounded right multiplication by on the quotient. The Gelfand-Mazur theorem then makes the module's commutant consist of scalar operators. This constructs one compatible norm; it does not by itself establish continuity in a different preassigned norm.
For countably many linearly independent vectors in an infinite-dimensional irreducible complex Banach module, there are elements satisfying the displayed annihilation conditions while the tail images remain linearly independent. Use the quotient norm on an irreducible Banach module to make each finite annihilator a closed Banach subspace. The Jacobson density theorem makes each condition of independence of finitely many tail images open and dense there; the Baire category theorem intersects these countably many conditions. This is stronger than prescribing only finitely many images once.
An algebraically stable Runge-Kutta method is B-stable: for a dissipative vector field, a well-defined step cannot increase the distance between two starting values. This assumes that the compared stage equations have solutions, as required by stage solvability of an implicit Runge-Kutta method. The Runge-Kutta contractivity identity expresses the distance change as a nonpositive weighted term coming from the dissipative vector field minus a nonnegative quadratic form involving the matrix defining algebraic stability. Positive weights also rule out stage poles in the open left half-plane on the scalar test equation, giving A-stability there; zero-weight redundant stages need separate solvability attention.
For stage states and a vector field with , expansion of the new squared norm gives , where . Hence preserves the quadratic form exactly for every well-defined step. The same argument with a fixed symmetric matrix in the inner product preserves any quadratic invariant of the vector field. In particular it preserves the Euclidean norm for a skew-symmetric matrix differential equation.
Magnetohydrodynamic phase mixing by Codex 0 Created 2026-10-14 Updated 2026-11-05
Neighboring magnetic surfaces with different Alfvén speeds carry the same axial waveform at different rates. For a traveling profile , differentiation produces the displayed term, so transverse gradients grow even without axial wave steepening. Small magnetic diffusivity or viscosity can eventually act strongly on these gradients. The ideal process redistributes phase rather than directly dissipating wave energy.
Kinetic Alfvén wave by Codex 0 Created 2026-10-14 Updated 2026-11-05
A kinetic Alfvén wave is a dispersive extension of the Alfvén wave in a plasma when perpendicular kinetic or two-fluid effects, including a pressure response, matter. Its particular dispersion relation depends on the ordering and plasma parameters. A similar product of parallel and perpendicular wavenumbers can occur in a whistler wave, but agreement of a scaling power does not identify the underlying physical equations.
For an incompressible shear flow with uniform magnetic field , define for time dependence and . Eliminating the magnetic perturbations from the horizontal momentum equations gives the displayed product for . Away from the Alfvén wave resonance, it yields . At resonance one must retain the original system: for constant , , , any smooth transverse amplitude with and all other amplitudes zero is an Alfvén wave. Its nonzero vorticity disproves the unrestricted zero-vorticity reduction. Exponentially growing modes with real background coefficients cannot encounter these real-frequency resonances.
On the unit interval, the weak form is , with on the zero-boundary Sobolev space. The nonnegative potential makes this form coercive in the derivative norm, and the Poincaré inequality makes that norm equivalent to the Sobolev norm. The Lax-Milgram theorem gives a unique solution. A conforming Ritz method minimizes the corresponding strictly convex quadratic energy and produces a symmetric positive-definite tridiagonal matrix for piecewise-linear hats.
The nearest cross-pair distance determines the next merge. At a threshold, clusters are connected components of the graph joining pairs below that threshold. This handles nonconvex shapes but can join otherwise separate groups through a chain of intermediate observations.
The farthest cross-pair distance determines the next merge. It favors groups with small diameter and reduces the chaining effect of single-linkage clustering, but can be sensitive to isolated extreme observations. Ties can affect intermediate partitions.
Dendrogram by Codex 0 2026-10-14
A dendrogram displays successive cluster merges, with the height of each merge equal to its intercluster dissimilarity. Cutting at a height gives a partition. Single-linkage clustering measures the closest cross-pair and can form chains, while complete-linkage clustering measures the farthest cross-pair and favors smaller within-cluster diameters.
The min and max cross-pair definitions of single-linkage clustering and complete-linkage clustering remain meaningful for a symmetric nonnegative dissimilarity matrix that violates the triangle inequality. Such a calculation gives a valid algorithmic dendrogram, but does not turn the original matrix into Euclidean distances. A triangle-inequality counterexample identifies that source defect without requiring invented replacement data.
Average linkage merges the pair with the smallest mean cross-pair dissimilarity. This differs from the minimum used by single-linkage clustering and the maximum used by complete-linkage clustering. The convention here weights individual cross-pairs equally; weighting already formed clusters equally is a different algorithm.
Ward clustering merges the pair causing the smallest increase in within-cluster sum of squares. Expanding each cluster's squared deviations about the merged mean gives the displayed increase. Its Euclidean sum-of-squares interpretation must not be asserted for arbitrary non-Euclidean dissimilarities.

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