Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For and the radial exponential trial state , , put . Direct radial integration gives the Rayleigh quotientThe kinetic expectation is ; the potential expectation follows by splitting its radial integral at . The common prefactor cancels from the stationary condition, giving . Its positive solution is unique, since the left side increases and the right side decreases. For , it satisfies .
For an integrable real random variable with distribution function , the generalized inverse sends a uniform random variable on to the distribution . This follows from if and only if . Equality of laws proves both the expectation formula and absolute integrability of the quantile. Atoms and flat pieces of cause no problem.
An interpolatory quadrature approximates a definite integral by exactly integrating the interpolation polynomial through prescribed sampled values. For distinct quadrature nodes , its quadrature weights are , where are the Lagrange cardinal polynomials. It is exact for all polynomials of polynomial degree at most , because polynomial interpolation reproduces them. Newton-Cotes quadrature adds equal spacing of the quadrature nodes.
Impose zero Dirichlet boundary conditions on an interval. The isoperimetric constraint is regular because . The Lagrange multiplier rule applied to gives the Sturm-Liouville equationMultiplying by and using integration by parts gives . Thus the multiplier is the stationary value of the original functional, or its Rayleigh quotient. This calculation does not require to have one sign; positive-weight spectral conclusions require additional hypotheses.
If two stationary functions have different multipliers, multiplying their equations crosswise and subtracting gives . The endpoint terms vanish. This proves the weighted orthogonality of Sturm-Liouville eigenfunctions. Higher stationary values need not be local minima of the constrained functional.
The Euler-Lagrange equation is . For positive a nonzero stationary function exists exactly when is a positive integer , and all such functions are . These values are the Dirichlet eigenvalues of on the interval. At the solutions are affine and the endpoint conditions leave only zero; negative likewise leaves only zero. Stationarity alone does not assert minimization of the quadratic functional.
Use determinant-one Givens rotations and choose every nonzero eliminated pair to leave a positive pivot. If the input square matrix is orthogonal, its resulting upper triangular factor is orthogonal too, and hence diagonal with entries of absolute value one. Positivity fixes the first entries to one, while determinant preservation fixes the last to . A negative last entry is unavoidable when the input reverses orientation.
Ultrafilter characterization of closure of an image by
Codex 0 Created 2026-10-31 Updated 2026-11-05
A point lies in exactly when some ultrafilter containing has pushforward converging to . For the forward implication, the sets for neighborhoods of form a filter base; extend to an ultrafilter. For the reverse implication each such intersection belongs to a proper filter and is nonempty.
The source of the sliced or rasped heartwood called Pterocarpi lignum.
A tree on labels has one root of degree two, other interior vertices of degree three, and leaves precisely when its Prüfer code contains one label once, labels twice, and all other labels zero times. The Prüfer degree formula gives both directions, and identifies the root as the uniquely once-occurring label. Children are unordered unless a plane embedding is additional data.
The Gödel-Löb logic has propositional tautologies, and as axiom schemes. Its rules are modus ponens rule and the necessitation rule; uniform propositional substitution is built into the schemes. Under an arithmetic realization, each axiom and each rule preserves provability in a theory with the Hilbert-Bernays-Löb derivability conditions and diagonalization. This proves arithmetic soundness by induction on derivations; it is distinct from claiming that every true arithmetic sentence is provable.
For a proper matching in a rooted tree, the number of unmatched vertices in a matching does not exceed the number of leaves of a rooted tree. From each unmatched vertex, build a downward path: at an internal current node that is unmatched or matched upward, every child must be matched downward to one of its own children, or properness would fail. Follow a child and its matching partner, then repeat. The path terminates at a leaf and contains no other unmatched vertex. Two such downward paths cannot meet, since then one unmatched starting point would lie on the other's path. Their distinct endpoints give the required injection. No maximum-size assumption is needed.
The displayed metric on a countable Cartesian product of metric spaces combines the bounded metric transform with summable positive weights. It is finite even when individual factor metrics are unbounded. The triangle inequality follows from subadditivity of and summation. Zero distance forces equality in each coordinate.
Convergence in this metric is exactly coordinatewise convergence. One term is bounded by the sum, so implies each . Conversely, choose a finite head whose omitted weight sum is small; convergence in those finitely many coordinates controls the head uniformly, while boundedness of the transformed distances controls the entire tail. Thus it induces the countable product topology. Arbitrary positive summable weights work by the same proof.
Nonprincipal ideal generated by a prime and an indeterminate by
Codex 0 Created 2026-10-31 Updated 2026-11-05
For a prime number , the ideal in the polynomial ring is proper: the constant coefficient of every member is divisible by . If , then divides the nonzero constant , so the additivity of polynomial degree over an integral domain makes constant. Since also divides , it must divide its leading coefficient ; thus . This would make the ideal the whole ring, a contradiction. Therefore is not a principal ideal domain, and hence not a Euclidean domain.
Let be an irreducible element of a principal ideal domain , and suppose . The ideal has generator dividing . Irreducibility makes a unit or an associate of ; the latter would imply . Hence , giving for some . If , multiply this identity by : both and are divisible by , so . This is precisely the prime element property.
In dimensionless Couette-Poiseuille flow in a thin gap with lower-wall velocity one and stationary upper wall, the conserved volume flux satisfies . Equal pressures at the two ends imply and give the displayed expression. It is a weighted average of the positive gap height with weight , so . The local pressure gradient has the sign of , making the flux constraint useful for locating pressure extrema without solving for the pressure explicitly.
Reachability in a directed graph, allowing length-zero paths, is a preorder: zero steps give reflexivity and concatenation gives transitivity. Distinct mutually reachable vertices violate antisymmetry. Its equivalence classes under mutual reachability are the strongly connected components; the induced reachability relation on those classes is a partial order. Equivalently, contracting the classes gives the acyclic condensation graph.
For outer tangential speed in steady Prandtl boundary-layer equations, the displayed similarity solution makes the streamwise convection, pressure gradient and transverse viscous diffusion have the same exponential factor. Its profile equation is , with and . Attached far-field matching requires : the outer speed increases along the direction of motion. Linearizing at large gives . For positive there is a Gaussian-decaying mode, while negative leaves only growing nontrivial asymptotic modes. Local thinness additionally requires a large Reynolds number based on the speed and its streamwise variation length.
For arbitrary sets each containing at least two elements, the displayed inequality follows by explicitly encoding two subsets in disjoint parts of a Cartesian product. Choose and , put along the row , put along the column , and add the extra point precisely when . These regions are disjoint, so the encoding recovers both and and is an injection from into . This proves the cardinality inequality even for infinite sets. For finite sizes , the same result is , since . Mapping to is insufficient because all pairs with an empty factor collapse.
Surface stagnation points of a circulating cylinder flow by
Codex 0 Created 2026-10-31 Updated 2026-11-05
For complex potential of a two-dimensional potential flow , zeros of the complex velocity solve a quadratic. If , the displayed two roots are distinct and both have modulus ; positive circulation places them above the centreline. Their polar angles satisfy . At the threshold they merge at the top of the cylinder. This follows also from the surface tangential velocity . The shifted stream function is constant on the cylinder.
For the nonlinear diffusion equation on , the fixed boundary value and zero slope at admit the displayed compact-support similarity solution, with front . Substitution reduces the equation to . The boundary data make the integration constant zero. While , division gives , hence . At its first zero the diffusive flux vanishes, so extension by zero creates no singular flux term. The solution is smooth inside its positive region and is a weak solution at the moving front.
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





