Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For on , choose solutions bounded at zero and infinity. The homogeneous Cauchy-Euler equation has basis . Joining the left-regular and right-regular solutions continuously and imposing gives the displayed Green's function with ordinary integration measure . For bounded forcing,The integrals converge and give the unique bounded solution: no nonzero homogeneous combination is bounded at both ends. If , negativity of the kernel gives . Differentiation cancels the two moving-endpoint terms, leavingwhich implies . For constant forcing , the bounded solution is ; the endpoint conditions are boundedness, rather than zero endpoint values.
For on , impose by a continuous limit and at infinity. The adapted homogeneous solutions are at zero and at infinity, with Wronskian . The displayed Green function is continuous and its first derivative has jump one at , so with ordinary source measure . For continuous with ,This solves with the stated endpoint limits. No nonzero combination of meets both homogeneous endpoint conditions, proving uniqueness. Multiplying by gives the self-adjoint expression , explaining the weighted reciprocity .
For a smooth bounded connected domain with boundary , integrating the Green function equation and applying the divergence theorem forces . Thus zero Neumann boundary data are incompatible with an unmodified unit point source. The displayed constant boundary derivative has the required total flux. For and , the compatibility condition is . Green's second identity then yieldsThe last term is an undetermined additive constant. Adding a constant to does not change the other two terms together, because of the compatibility condition. This construction keeps the unit Dirac delta source; using a mean-subtracted source with zero normal derivative is a different normalization.
A static but spatially inhomogeneous linear operator has time translation symmetry without spatial translation symmetry. At fixed source position , one may still Fourier transform its Green function in . The coefficient retains as a parameter. A multiplication by becomes a convolution with , not a spatially diagonal multiplier unless is constant. Suppressing the source-position subscript is only a notational convention.
An advanced Green function has support only before its source time. It is selected by a future boundary condition, rather than an initial causal response. For with and , the real-axis inverse Fourier transform of is . Its first derivative jumps by one at zero. A growing retarded solution exists with a different inverse contour; this illustrates causality versus stability of a Green function.
A static background permits a Fourier transform of time difference, but a spatially varying coefficient generally prevents dependence on position difference alone. A momentum-space Green function then carries an incoming and an outgoing momentum, or equivalently one momentum together with the source position. Multiplication by a background field becomes a convolution, with a source-position phase when the Fourier basis is written as . A diagonal single-momentum representation is justified only with additional spatial translation symmetry or an explicitly fixed source origin.
Time support from poles of a Fourier Green function by
Codex 0 Created 2026-10-20 Updated 2026-10-24
For the inverse transform , positive requires closing a decaying contour below the real axis, clockwise; negative requires closing above, counterclockwise. Poles strictly below give a retarded Green function, while poles strictly above give an advanced Green function. Real-axis poles need a prescription. The sign convention in the Fourier exponential is essential.
A spectral transfer estimate . Its wavelength dependence constrains compensation, density structure and support, but one transfer curve does not uniquely determine them.
A static emitter at radius and a static receiver at infinity compare photon wavelengths with . Conservation of the time-translation Killing energy and the static clock rate prove the relation. Motion of the emitter adds a Doppler factor; a rotating stellar exterior may require a different metric.
In geometric optics without absorption, phase-space conservation preserves along a ray. Relative images of the same source at a common redshift therefore preserve surface brightness while changing apparent angular area and integrated flux. Source structure and propagation effects can introduce observed wavelength dependence.
The merger separates X-ray-emitting collisional gas from galaxies and lensing mass concentrations. Comparing those observables provides evidence for a dominant less-collisional unseen gravitating component, without identifying its particle species.
Thin-lens approximation for gravitational lensing by
Codex 0 Created 2026-10-20 Updated 2026-10-20
The gravitational lensing approximation in which deflection is concentrated in a plane whose thickness is small relative to the relevant observer-lens-source distances. The reduced angular deflection includes the distance ratio. A projected surface mass density then determines the lensing potential and the image-to-source mapping. This is distinct from a refracting thin optical lens.
In a spherical collapse model a freely falling surface can cross its event horizon after finite proper time, while outgoing signals received far away have increasing delay and redshift. Schwarzschild-coordinate freezing does not mean collapse physically stops or leaves a permanently bright surface at the horizon.
Inside-out collapse of a singular isothermal sphere by
Codex 0 Created 2026-10-20 Updated 2026-10-24
A collapse front propagates out through an initially singular isothermal envelope at . The only steady accretion scale is for fixed mean particle mass. The front sweeps original mass at , but the exact central accretion coefficient requires the dynamical similarity solution and cannot be identified with front sweeping alone.
A discrete process in which a vertex holding at least its degree in chips may send one chip along each incident edge. On the infinite line, a firing removes two chips from a site and gives one to each neighbor. When stabilization exists, commuting local firings explain why their order does not change the final stable configuration.
A path decomposition of a finite graph is a sequence of vertex sets, or bags, , such that every vertex occurs, every edge has both endpoints in a common bag, and the bags containing any fixed vertex form a consecutive interval. Its width is ; pathwidth is the minimum width.
A path with at least one edge has pathwidth one using bags . A complete graph on vertices has pathwidth . The consecutive-occurrence condition means a vertex can be forgotten permanently after its last bag, which supports dynamic programming that stores information only about the current bag. Pathwidth is at least treewidth because a path is a special tree.
An interval graph is a graph whose vertices can be represented by intervals on a line, with two vertices adjacent exactly when their intervals intersect. For example, intervals represent a single edge and an isolated vertex.
Interpreting an interval as the duration of a task makes an edge mean that the tasks overlap. A proper vertex coloring then assigns resources so simultaneous tasks use different resources. For interval graphs, the minimum number of colors equals the largest number of mutually overlapping intervals, their clique number. Sorting endpoints provides an efficient way to recognize and exploit this structure.
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





