Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
If a nonnegative continuous function on satisfies with , put . Then , and . Multiplication by the integrating factor and integration prove the displayed estimate. For its limiting interpretation is .
Boundary-matrix construction of an ordinary differential Green function by
Codex 0 Created 2026-10-24 Updated 2026-10-31
Let be a basis of homogeneous solutions of a linear ordinary differential operator of order . Let be independent homogeneous linear boundary conditions, which may be coupled. Suppose a fundamental solution satisfies . Define the boundary matrix and . If is invertible, thenThe added terms are homogeneous solutions, so the Dirac delta source is preserved. Applying the boundary operators gives . Any two such Green functions differ, for fixed source position, by a homogeneous solution with coefficient vector in the null space of ; invertibility therefore proves uniqueness. A singular boundary matrix signals a nontrivial homogeneous solution satisfying the endpoint conditions, where a compatibility condition and a nonunique inverse may arise. For , one convenient fundamental solution is .
A regional planetary mass concentration producing a gravity anomaly; lunar examples are associated with large impact basins.
The absolute density difference between a subsurface body and the material it replaces, commonly in . It is the source term in local gravity inversion, unlike the dimensionless relative density contrast used in cosmology.
For stationary emitter and observer in the same static patch, repeated rays between fixed radii have the same coordinate travel delay. Since a stationary clock obeys , the received-to-emitted proper-period ratio is . At a central observer and emitter radius , this is . Holding an emitter stationary requires unbounded proper acceleration as it approaches the horizon; the limiting redshift formula does not describe a timelike static worldline on the horizon itself.
A test particle released from rest at in a fixed spherical mass density obeys . Integrating once gives . The substitution then gives , and the arrival time at the centre is . This is free fall in a frozen singular isothermal sphere, not the self-consistent pressureless collapse of the background. An initially resting material shell with the same initial enclosed mass instead arrives after , because its enclosed mass stays fixed while the cloud contracts.
An edge cover of a finite graph is a subset of its edges incident to every vertex. It exists if and only if there is no isolated vertex, with the empty graph covered by the empty set. A minimum-cardinality edge cover uses as few edges as possible; a minimum-weight edge cover minimizes their total weight. These objectives are related to maximum cardinality matching and maximum-weight matching, respectively, by the edge cover and matching identity and minimum-weight edge cover by matching savings.
The unique maximal induced subgraph with minimum vertex degree at least , possibly empty. It is found by repeatedly deleting vertices of degree below . The k-core peeling invariant proves that every subgraph satisfying that degree bound survives inside the result; in particular the final vertex set does not depend on deletion order.
During repeated deletion of vertices of current degree below , every subgraph of minimum degree at least is contained in the active induced subgraph. If an active vertex has degree below , its degree in any subgraph of the active graph is no greater, so no candidate can contain it. This proves the invariant inductively. A queue of threshold crossings and adjacency lists implements peeling in time.
A tree of bags of graph vertices such that every vertex occurs in a bag, both endpoints of every graph edge occur together in a bag, and the bags containing any fixed vertex form a connected connected subgraph of a tree. Its width is . The connected-occurrence condition lets subproblems agree on shared variables while solving a constraint satisfaction problem; an arbitrary cover of edges by small bags is insufficient.
A path-cycle matching in a finite simple graph is a collection of mutually vertex-disjoint paths and cycles in a graph. Its used edges form a subgraph with every degree of a vertex at most two. Conversely, every finite connected component of a graph with maximum degree at most two is a graph path, a cycle in a graph, or an isolated vertex; following successive edges proves this classification. Discarding unused isolated vertices therefore converts any such subgraph into a path-cycle matching without changing its edge count. On a bipartite graph, maximizing the used edges is exactly bipartite b-matching with every .
For a normalized probability density on classical phase space with canonical volume element , the fine-grained Gibbs entropy is , whenever the integral exists. Here is a constant reference density fixing the units inside the logarithm, and is the Boltzmann constant. No averaging into finite cells is performed.
For a regular Hamiltonian flow , Liouville theorem in Hamiltonian mechanics gives and . Substitution directly provesAn irreversible macroscopic entropy increase therefore requires a different description or additional assumptions; it is not a failure of this volume-preservation argument.
For a crustal layer of thickness with constant thermal conductivity , no internal heating and a linear conductive profile, the upward heat flux magnitude obeys Fourier's law, with depth positive downward. Depth averaging givesThe basal excess temperature is , twice the mean excess. The formula requires a thickness assumption and a conductive interpretation of the measured flux. Hydrothermal advection, sedimentary thermal effects, internal production and nonlinear conductivity can invalidate a linear extrapolation.
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





