Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A local path action integrates a nonnegative convex cost g of the path's instantaneous input rate, assigning infinity to paths that are not absolutely continuous. When , the typical-rate path has zero cost. On any interval with prescribed total input, Jensen inequality makes a constant derivative minimize its cost. With a queue workload constraint this leads to constant-rate burst paths and the linear workload rate for a local convex action. Such a formula alone does not establish goodness in an unspecified path topology; goodness must be checked or assumed as part of the input large-deviation principle.
For and positive mass density and pressure, let in one-dimensional adiabatic compressible flow. The smooth equations are , and . Away from a constant branch, their coefficient determinant forces with and adiabatic sound speed . The entropy equation gives , and combining continuity with givesThus , , and , on intervals where . The specific entropy is constant. Together with uniform branches, these exhaust smooth positive-gas self-similar solutions; a contact discontinuity is not a smooth fan.
With and , the first angular harmonic of the steady cell conservation equation satisfies and . The regular solution is , . At large it gives the displayed layer with width . The exact Modified Bessel function of the first kind expression remains regular at the axis, unlike extrapolation of the boundary-layer formula there.
Let be linear maps of finite rank of a linear map. Their sum satisfiesThe image of a linear map lies in , so the dimension formula for a sum of subspaces proves the upper bound. Apply that bound to and to to obtain the lower bound. Finite rank ensures that subtraction in the displayed inequality is defined.
Both extremes occur for square matrices. For prescribed ranks , take and to obtain matrix rank . For the largest possible matrix rank, use diagonal supports whose union has size and assign positive real diagonal entries, obtaining that matrix rank without cancellation.
Gaussian random walk spends zero density of time in bounded sets by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For independent increments, a random walk has . If is a bounded measurable set, its occupation time probability obeys . Consequently , and Tonelli's theorem makes this series finite almost surely. Kronecker lemma then gives the displayed zero occupation natural density. This also shows why its empirical occupation probabilities cannot converge to a probability measure simultaneously on all bounded intervals and the whole real line: continuity of probability from below would contradict the preserved total mass one.
An upward skip-free random walk has integer-valued increments bounded above by one. Arbitrarily large downward jumps are permitted, but a first crossing of a nonnegative integer level from below must land exactly at . This removes the overshoot from the stopped likelihood ratio under exponential tilting and permits the exact geometric maximum of an upward skip-free random walk. For a real threshold , the first crossing is the crossing of , so the overshoot-free formula must use that integer level.
Separation chain for two labels in a circular transposition shuffle by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Place six positions on a cycle and distinguish two labels. At each step choose one of the fifteen unordered pairs of distinct positions uniformly and transpose their contents. This convention excludes identity moves. The shorter circular distance between the distinguished labels takes values . Cycle symmetry and exchangeability of the other labels make this distance a Lumped Markov chain.
Counting transpositions gives the transition matrix and Stationary distributionThe stationary weights also follow by counting unordered position pairs: six pairs have distance one, six have distance two, and three are opposite. If has every row equal to , then and . Starting with adjacent labels, the Probability of opposite labels after steps is therefore .
The parent Random transposition shuffle uses a different convention: two positions are sampled independently, allowing an identity move with Probability . Under that convention the distance transition matrix is , and the opposite-label Probability is . Explicitly stating the sampling convention prevents a spurious change in the convergence rate.
For a random sum of independent claims, conditioning on the count gives and therefore the displayed cumulant-generating function. Write and . The chain rule gives , , and . In raw severity moments , the third cumulant is . Positive exponential moments justify two-sided differentiation near zero; finite ordinary moments alone suffice for the corresponding left derivatives when claims are positive.
Let , with . The lognormal distribution of the random mean gives marginal mean . The law of total variance gives , strictly larger than when . Thus independent observation-level random effects produce overdispersion even though the conditional Poisson distributions have variance equal to their means.
Every red-blue edge coloring of the complete graph contains a monochromatic triangle in a graph, and some coloring of contains none. Together the five-cycle Ramsey coloring and six-vertex monochromatic triangle argument giveThe threshold is exact: one carefully chosen coloring establishes the lower bound, while the upper bound must handle every coloring.
A familiar interpretation uses six people and colors each pair red if they know one another and blue if they do not. Assuming the relation is symmetric and every pair falls into exactly one case, there are either three mutual acquaintances or three mutual strangers. The conclusion concerns all three pairs within the group, not merely two relationships through a common person. There is no prediction about which color wins or which three people form the group.
The small size makes exhaustive verification practical. The complete graph has edges, giving red-blue colorings of labeled vertices; exactly 12 have no monochromatic triangle in a graph. They are the choices of a red cycle graph of length five, whose blue complement graph is another five-cycle. The complete graph has edges, giving colorings. Checking all triples in every coloring finds none without a monochromatic triangle in a graph; in fact the minimum number is two. These counts can be reproduced by assigning one bit to each unordered pair and testing whether the three bits of each triple agree. The monochromatic-triangle counting formula gives a separate explanation of the stronger minimum-two conclusion.
Let a power series have finite radius of convergence . If its terms were bounded in complex modulus at a point with , say , choose with . ThenThe comparison test for series with a convergent geometric series would give absolute convergence at , contradicting its position outside the convergence disc. Hence the terms are unbounded at every such . The argument also works when and gives a stronger obstruction than the usual term test for divergence.
Inside both convergence discs, the triangle inequality gives absolute convergence of the sum. Suppose and the sum had radius . At any modulus between and , subtracting the absolutely convergent second series from the absolutely convergent sum would give absolute convergence of the first series outside its radius of convergence, a contradiction. Interchanging the two series covers .
If the terms of a power series at a nonzero point are bounded by , then . A convergent geometric series and the comparison test for series give absolute convergence at every point strictly inside that circle. Consequently terms at every point outside the radius of convergence must be unbounded. This conclusion is stronger than merely saying that those terms fail to tend to zero.
Knowing the radius of convergence does not settle convergence on its boundary. The three power seriesall have radius one, but behave differently on .
The same radius of convergence permits three different behaviours on the unit circle
. Green denotes absolute convergence, orange conditional convergence, and red divergence. All three series converge absolutely in the open unit disk. On its boundary, the geometric series diverges everywhere; the series converges conditionally except at ; the series converges absolutely everywhere. Details.For the geometric series, boundary terms all have complex modulus one, violating the term test for divergence. For the second series, absolute values give the divergent harmonic series at every boundary point. At the series itself is harmonic and diverges. At any other point on the unit circle, its geometric partial sums obeyThe Dirichlet test with the decreasing sequence therefore gives conditional convergence. In particular, gives the negative of the alternating harmonic series, with sum . For the third series, the convergent p-series bounds the absolute values at every boundary point, giving absolute convergence by the comparison test for series.
At , the rational function is well defined and equals , yet its geometric series diverges there. A formula for a function and a particular series representation can have different domains. Likewise, applying termwise differentiation of a power series preserves the radius but need not preserve the boundary convergence.
The right radical is . If is the matrix of a bilinear form, this condition is . For from the left radical example, the right radical is . The left radical and right radical differ here because the bilinear form is neither symmetric nor alternating. For a symmetric bilinear form or an alternating bilinear form, reversing a zero pairing preserves zero and the two linear subspaces coincide.
The left radical is . If is the matrix of a bilinear form, this condition is , so its coordinate vectors form . For , the bilinear form has left radical .
For a negligible-mass ideal-gas envelope above a core of mass , with constant luminosity and Kramers' opacity law, division of hydrostatic equilibrium by radiative diffusion gives . Taking the outer pressure constant to be negligible yields , where , and . Hydrostatic equilibrium then gives , so with . The radiative-zero choice is exact for a vanishing-temperature boundary at infinity and a deep-envelope approximation for a very extended finite star. It is not implied by small surface temperature alone at a specified finite radius.
In the optically thick radiative diffusion in a star approximation, the heat flux is . The conductivity depends on opacity, mass density and temperature. It relates a material temperature gradient to energy transport and must not be confused with the emergent effective temperature.
Select outgoing waves as a limit of a problem with weak absorption. With time convention use ; with use . The resulting Green function and transform-contour prescriptions determine which poles represent incoming or outgoing waves. This is especially useful when real-axis singularities obscure a Wiener-Hopf factorization.
For a slowly switched-on plane internal gravity wave in the half-space , the method of multiple scales gives transport of its amplitude at the vertical group velocity. For , . Initially undisturbed fluid and forcing at the bottom require . The outgoing radiation condition therefore selects when , although the vertical phase velocity is downward.
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






