Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Departures from exact isospin arise principally from unequal up- and down-quark masses and the electromagnetic interaction. Equal-rate isospin relations are leading approximations, especially when different charged and neutral thresholds affect the available phase space.
For any real separable Hilbert space , any orthonormal basis and independent standard normal random variables , the displayed series converges almost surely for each fixed and in L2 space. Indeed, the Parseval identity for a Hilbertian basis gives , so the partial sums form an L2 space-bounded martingale. The martingale convergence theorem supplies both limits. Every finite linear combination has the normal distribution with variance . Thus its finite-dimensional characteristic function is , independent of the chosen orthonormal basis. This proves equality of the finite-dimensional distributions of the resulting isonormal Gaussian processes; pathwise equality needs a coupling.
Start the Inviscid Burgers equation with height on , , and zero elsewhere. The upward left jump gives a rarefaction wave , while the downward right jump gives an entropy shock at . They meet at . Afterward the entire nonzero profile is the triangular fan on , with and zero outside. To prove the continuation, the Rankine-Hugoniot condition gives , and matching at fixes the integration constant. The triangle has conserved mass , and its left shock state is twice the shock speed, certifying causality.
Take period-one data equal to one on and zero on . Before , the separate rectangular pulse solutions of the inviscid Burgers equation do not overlap in their interiors. At each shock meets the two neighboring fans. Afterward, on the interval between shocks and , the solution remains . The Rankine-Hugoniot condition gives and , hence .
The title formula uses the fractional part and chooses right-hand shock values. Its left and right states are and , making every shock a causal entropy shock of speed . Therefore : the periodic entropy solution converges uniformly to its conserved mean even though it has a jump at every finite time. Periodizing a nonlinear solution is valid here only before the supports interact; after interaction the matching shock calculation is essential.
An ideal operational amplifier with a series input resistor and capacitor, resistive feedback and a grounded noninverting terminal realizes the displayed high-pass filter. Virtual ground and Kirchhoff's current law give . Its phase is in the convention. Equal resistances do not make its phase frequency independent.
Suppose a diagonalizable matrix has a simple eigenvalue uniquely closest to a shift . If the starting vector has a nonzero coefficient in the target eigenbasis direction, fixed-shift inverse iteration converges to that eigenvector line. In fact, the eigenvalues of are , so after inverse applications, division by leaves the target eigenvector plusThis proves direction error in Big O notation. The multiplicative constant depends on the eigenbasis and starting coefficients, and no uniform reduction at the first step follows for a nonsymmetric matrix. Over the real numbers, produces alternating signs. A nonzero ordinary inner product with a right eigenvector is not generally the same as a nonzero coefficient in the eigenbasis; the latter is the required condition.
For an independent statistical sample from an Inverse Gaussian distribution with mean and known shape , the maximum-likelihood estimator of is the sample mean. To prove this, expand the log-likelihood function to get . Its score function is , positive below and negative above it. Taking the negative expected second derivative gives one-observation Fisher information . Thus the regular asymptotic normality of a maximum likelihood estimator yields . The same conclusion follows from the central limit theorem and the distribution's variance .
For positive integers , partition the nonnegative integers by equality of and separately by equality of . The intersection of equivalence relations gives nonempty intersections of these consecutive blocks. Its boundaries occur at multiples of either or .
Let . Translating by increases the two floor quotients by the fixed integers and , so it preserves all within-block equalities and all block boundaries. Thus the refinement repeats in intervals of length . If lists the multiples of or within one period, its blocks are exactly for and . The pattern repeats, but blocks in different periods remain distinct equivalence classes.
On an interval where , the displayed factor givesThis follows from . It gives a useful self-adjoint form but does not solve a general second-order ordinary differential equation, since the term remains. If , it does reduce to one integration for . Another reducible class has , because the original left side is then . These are sufficient special cases, not a classification of all solvable equations.
A matrix of nonnegative rational numbers with integer row and column sums can be rounded entrywise up or down while preserving all those sums. Let and be its floor and fractional part. The residual row and column sums and are nonnegative integers. Build a flow network with source-to-row flow network edge capacities , row-to-column flow network edge capacities one where , and column-to-sink flow network edge capacities . The fractional parts supply a feasible flow saturating all source arcs. The integral max-flow theorem supplies an integral one of the same total value. If its middle-arc flows are , with where , then is the required matrix. This is a constructive polynomial-time algorithm; no multiplication by a common denominator is required.
The integer sequence proposed by Bernardo Recamán Santos starts at zero. At step , subtract if the result is positive and has not appeared before; otherwise add . The commonly written nonnegative version gives the same sequence because zero is already present. The initial values are . The addition branch can repeat a value: . Avoiding a repeated subtraction is therefore not a global injectivity condition.[ref]
OEIS entry A005132. Definition, initial terms, and comment on the first repeat; correspondence reference dated 29 January 1991
Since , induction gives . A prefix scan needs only constant extra storage but can take quadratic membership work. A bitset-style bounded membership table makes each lookup constant time, while its allocation cost depends on the chosen value universe. This separates the number of generated terms from the range of possible stored values.
In a uniformly random player permutation, edge contributes to 's marginal contribution exactly when precedes , which occurs with probability . Sum these expected contributions over incident graph edges to obtain the displayed Shapley value. This proof works for arbitrary real edge weights; nonnegativity is not required.
An induced subgraph game extended by one self-loop weight per player. Each loop is counted once, so andSingleton and pair coalition values determine all weights; larger coalition values must then agree with their sums. Signed weights are allowed. For example, two loops of weight joined by an edge of weight represent the simple cooperative game in which any coalition meeting those two players wins.
A loop-free induced subgraph game is a convex cooperative game exactly when all edge weights are nonnegative. Necessity follows by testing the supermodular inequality on two distinct singleton coalitions. For sufficiency,Only edges connecting the two set differences survive cancellation. Loop contributions cancel as well, so the same off-diagonal condition remains sufficient and necessary when self-loops are added.
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





