Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For arrays of values in , let average a product of entries over all ordered index tuples from coordinates, and let average it over the tuples with distinct indices. Decompose the first average as , where and the repeated-index average lies in . This gives . For uniformly sampled indices, a union bound over the pairs bounds the collision probability by . This deterministic estimate is the bridge between empirical-product limits and the De Finetti theorem.
On the Dahlquist test equation, the symmetric two-step two-derivative formula has amplification polynomial . For every real , its leading coefficient is positive and , whereas as . The intermediate value theorem therefore gives a real root below minus one. Thus the method is not A-stable, without any appeal to a multistep order barrier.
On the Dahlquist test equation, write the amplification polynomial as , where and . The identity shows that both roots of a polynomial can lie inside the open unit disk only if . But the complex quadratic Schur criterion would then require , which is impossible. Thus the strict linear stability domain is empty. This concerns robust damping of all modes, rather than convergence on fixed time intervals or the bounded-root stability set of the symmetric two-derivative formula.
For the symmetric two-step two-derivative formula, the closed-disk root condition for a multistep method fails off the imaginary axis. Positive real part makes the product of root moduli exceed one; negative real part fails the complex quadratic Schur criterion, as in the empty strict decay domain of the symmetric two-derivative formula proof. On , write and set . The amplification polynomial becomes . Its two roots are distinct and on the unit circle exactly when , or . Thus the bounded-root set consists of the imaginary intervals and , including and excluding the double-root endpoints. In particular, the set is unbounded. Unit-modulus oscillations are bounded but do not tend to zero.
A symmetric tensor invariant under rotations about a fixed nonzero vector has the form . Choose the third coordinate axis parallel to : rotation by a half-turn makes the mixed axial-transverse entries vanish, and all transverse rotations make the transverse block a scalar multiple of the identity. Its two transverse eigenvalues are and its axial eigenvalue is . The trace and the quadratic contraction determine these two coefficients. Full isotropy holds exactly when .
For , the explicit conservative diffusion update has weights , , and . Under the displayed restriction they are nonnegative and sum to one. With zero Dirichlet boundary conditions, each new value is a convex combination of old interior and boundary values, proving contraction in the discrete maximum norm. The spatial matrix is also symmetric with . This puts its eigenvalues in , so the same restriction gives L2 norm contraction. A stable recurrence need not be consistent with a different proposed differential equation.
For forms of degrees , the th transvectant contracts pairs of indices using the invariant alternating form. Explicitly it is a scalar normalization of . These contractions realize the irreducible summands in the symmetric-power tensor-product decomposition.
Counting Sylow bases in a coprime elementary abelian extension by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be an elementary abelian -group and let , with soluble. In each Sylow basis of , is the unique Sylow -subgroup and the product of the remaining Sylow subgroups is a complement to . All complements are -conjugate, and the stabilizer of under this conjugation is its fixed-vector space . Each complement has Sylow bases, proving the formula. For the permutation module of , the fixed-vector space is the one-dimensional constant-coordinate subspace, so the number is .
The sphere spectrum is . It is the unit of the smash product of spectra. Its integer suspensions of spectra represent stable homotopy groups.
Erlang claim-size differential equation for survival probability by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For an Erlang distribution claim probability density function and , write . The survival integro-differential equation gives . The convolution satisfies , because . Applying to the first equation eliminates and gives the displayed third-order equation. The original integral equation also supplies and ; these conditions must not be lost when solving the higher-order equation.
For a geometric morphism, the characteristic map of induces a comparison whose adjoint transpose is . Composing with a characteristic map classifies the inverse-image subobject. Thus monicity of is equivalent to reflection of equality of subobjects under , and hence to faithfulness of the inverse image: apply reflection to equalizers of parallel arrows. Conversely faithfulness reflects when a pulled-back monomorphism is an isomorphism, by comparing its characteristic map with truth; intersections then reflect equality of arbitrary subobjects.
The time translation is normalized at infinity. For the roots , evaluate to get the signed horizon values. The outer Hawking temperature in natural units is . The extremal limit has zero surface gravity; the neutral case has only the outer positive-radius horizon and temperature .
An object of a regular category is well-supported when its support of an object in a regular category is the terminal object, equivalently when is a regular epimorphism. Finite products of well-supported objects are well-supported, by pullback and composition stability of regular epimorphisms. A regular epimorphism has the same support as its codomain, and an object with a point is well-supported.
A regular category is almost totally supported if every object is a well-supported object or a strict initial object. The case in which every object is well-supported is allowed. There can be at most one strict initial object up to isomorphism. In the Category of sets, these two cases distinguish nonempty sets from the empty set. A meet-semilattice regarded as a category satisfies the condition precisely when it has at most two objects up to isomorphism.
The first term uses the induced worldvolume metric from the supervielbein; the second is the Wess-Zumino brane coupling to the super-three-form. Its fermionic dependence is retained before bosonic truncation. The relative charge magnitude equals the brane tension, while sets the orientation and matching kappa symmetry projector sign. In an on-shell eleven-dimensional supergravity superspace, this action has kappa symmetry.
If is a supercompact cardinal, each true statement, allowing parameters in , holds in . Write it as an existential witness followed by a assertion. Choose a supercompact elementary embedding whose transitive target contains the witness in . Downward absoluteness of the universal bounded-matrix assertion puts the witness in that rank segment, and elementarity reflects this to .
Cesàro summation assigns a value to a series when the arithmetic means of its partial sums approach a finite limit of a sequence. Here we use the first-order method, often written . For a real or complex series beginning at index zero, defineIt is Cesàro summable to when . The averaging is applied to the partial sums , rather than to the original terms . This distinction is essential: the terms can average to zero while their accumulated sum keeps growing. [ref]
For Grandi's series , the partial sums alternate between one and zero. The series is not a convergent series, but the two values occupy asymptotically equal proportions of the averaging window. In the declared index convention,so its first-order Cesàro sum is . This names a particular summation method; it does not turn the oscillating partial sums into an ordinarily convergent sequence.
Why is this useful? An oscillating approximation can retain stable information when its cumulative average settles. Because the Cesàro theorem for convergent sequences preserves an existing limit of a sequence, this adds some new cases without changing the sum of any ordinarily convergent series. For Fourier series, averaging the Fourier partial sums gives a Fejér sum; the existing Fejér kernel and approximation articles explain its effect on reconstruction. Averaging does not guarantee success for every oscillating sequence, as the bounded partial sums need not be Cesàro summable example shows.
One historical motivation was the multiplication of series. In 1918, A. F. Andersen recalled Ernesto Cesàro's product theorem and cited his 1890 publication at the start of a study of products involving Cesàro summable series. This connects the theory with preserving useful operations on sums, as well as with assigning a value to an isolated example. His paper treats several orders of summability; the examples here use only .[ref]
A summation method that includes every ordinarily convergent series and assigns it its ordinary sum. The Cesàro theorem for convergent sequences makes first-order Cesàro summation regular. Regularity alone does not justify every rearrangement or multiplication of a divergent series.
If , the displayed split of an function gives and . Weighted multiplication with cancels the threshold, yielding . Choosing also gives the continuous inclusion . The analogous split works if the larger endpoint is infinity.
The proper-divisor sum, or aliquot sum, adds the positive proper divisors:In particular , an empty sum. Removing from the sum-of-divisors function is essential: , but its proper-divisor sum is .
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






