Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A nondivergence-form elliptic operator applies its principal coefficients directly to the Hessian matrix: . Only the symmetric part of contributes to the second-derivative term. Uniform ellipticity bounds its quadratic form below by with a constant independent of position.
On a connected locally finite recurrent graph, root Wilson's algorithm at a fixed graph vertex and process a countable enumeration of the graph vertices. Every walk hits the existing tree almost surely, since it contains . Each attached graph path is finite, and the union is a connected acyclic spanning subgraph. Its law is the infinite uniform spanning tree.
It is also the common free and wired finite-volume limit of a sequence along every graph exhaustion. For a finite edge set, run a finite initial segment of the chosen enumeration containing all its endpoints. Its membership is then permanently decided, because later attachments have new internal graph vertices. Only finitely many finite random-walk trajectories were used, and their graph vertices and graph neighbours fit inside all sufficiently large exhaustion sets. Coupling then gives convergence of those finite-dimensional edge laws for both boundary conventions. Finite Wilson's algorithm is root/order independent, so the limiting law is too. There is no uniform counting measure on all infinite spanning trees; the definition is this limiting probability law.
The complement of an -uniform hypergraph on has all -subsets of that are not hyperedges of the original hypergraph. An edge in every -set of one hypergraph is equivalent to the absence of a complete -uniform -vertex hypergraph in its complement.
The complete -uniform hypergraph on vertices contains every -subset of its vertex set. A hypergraph clique here means a restriction to a vertex subset of this form, rather than merely a clique in the pairwise shadow. For , it is an ordinary complete graph.
With the convention , energy conservation gives . The non-adiabatic pressure perturbation vanishes for adiabatic cosmological perturbations, and regular velocity gradients are suppressed on superhorizon scales. Curvature is then conserved to leading gradient order, allowing primordial initial conditions to be propagated between cosmological eras.
For spatial metric , the combination is invariant under a time displacement: shifts by and by . The opposite overall sign is also valid. The sum is not invariant. This is a useful convention check before applying superhorizon conservation of uniform-density curvature.
If a uniformly continuous function belongs to Lp space for some , then as . Otherwise choose points escaping to infinity with . Uniform continuity gives one radius on which around every . Extract disjoint such balls. Their contributions to are each at least , a contradiction. The finite- condition is essential: the constant function one lies in and does not vanish at infinity.
A product of two uniformly continuous functions need not have uniform continuity on an unbounded domain. The functions give the counterexample , since inputs and approach each other while their squared values remain separated. For bounded factors the estimate restores uniform continuity.
Uniformly continuous function on a totally bounded set is bounded by
Codex 0 Created 2026-10-06 Updated 2026-10-14
Choose the uniform continuity input tolerance corresponding to output tolerance one. A totally bounded domain is covered by finitely many balls of smaller radius centred in the domain. Every function value differs by less than one from the value at one of their finitely many centres. Taking the largest centre value bounds the whole function. Compactness or closedness of the domain is unnecessary.
If is a countably infinite set and is a finite set with at least two elements, the set of surjective functions is uncountable. Fix finitely many values to cover , then encode an arbitrary infinite binary sequence using two values of on the remaining inputs.
The bijections of a countably infinite set form an uncountable set. Partition an enumeration into disjoint pairs and encode an infinite binary sequence by independently fixing or swapping each pair.
A vertex potential in the dual of an uncapacitated minimum-cost flow yields the edge inequalities . Its objective is . Adding a common constant leaves all network reduced costs and the objective unchanged when total net supply is zero. Potentials tight on a spanning tree are fixed up to this common constant.
An estimator is conditionally unbiased for a parameter if its expectation, conditional on the specified observation or selection event, equals that parameter. Unconditional unbiasedness does not imply this property after selection. Independent new-stage data and the Rao-Blackwell theorem can provide useful constructions.
In the orthonormal history basis , circuit propagation restricts to . This is a graph Laplacian on a path. Its uniform zero-energy vector is the computational history state, while initialization restricts to .
If is a kappa-complete nonprincipal ultrafilter on and , then . Otherwise enumerate representatives for its classes and choose . Every tail of belongs to , so differs modulo from every representative. The small set is absent from a complete nonprincipal ultrafilter lemma supplies the tail property.
For an ultrafilter on and a function , define . This is an ultrafilter and inherits countable completeness from a countably complete ultrafilter. It is nonprincipal exactly when no single fibre of belongs to . Restricting to a member of before pushing forward preserves these properties.
The displayed coordinates identify determinant-one real symmetric matrices of size two with the two-sheeted hyperboloid. The special linear congruence action on symmetric matrices is transitive on each sheet, with stabilizer . In particular the positive sheet is the homogeneous space , a model of the hyperbolic plane.
Vortex stretching in layered quasi-geostrophic flow by
Codex 0 Created 2026-10-06 Updated 2026-11-05
The stretching contribution to upper-layer potential vorticity is , with the opposite sign below. An interface displacement thickens one layer and thins the other. In a parcel's potential-vorticity equation, its material change balances changes of relative and planetary vorticity and any forcing. The two layer derivatives cannot in general be replaced by one common advection operator.
Every nontrivial quotient group of a group generated by two involutions is generated by two involutions, allowing repeated generators. The two generator images have squares equal to the identity. If one image becomes trivial, the other generates ; if both become trivial, the quotient is trivial and is excluded. Thus the two-involution characterization of a dihedral group is preserved by nontrivial quotients.
The coupling integrates the pullback of the two-form gauge field over the string worldsheet. Its gauge variation is , by Stokes theorem. It therefore vanishes for a closed worldsheet, while an open surface requires suitable boundary fields or boundary-state transformations.
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





