Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Characteristic diamond for speed one minus y squared by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For Cauchy data prescribed on over , put . The maximal region determined solely by those data isIn the travel-time coordinate for a one-dimensional variable-speed wave equation this is the ordinary characteristic diamond , as follows from finite propagation speed.
For a finite group , the Frattini subgroup is the intersection of all maximal subgroups. Its elements are exactly the non-generators: an element in every maximal subgroup cannot enlarge a proper generated subgroup to , while an element outside a maximal subgroup generates together with it.
For a finite p-group,where is generated by all th powers and is the commutator subgroup. Every maximal subgroup has index and is normal, so its quotient group is cyclic of order and it contains . Conversely is an elementary abelian p-group; each nonzero vector is excluded by some hyperplane, whose preimage is a maximal subgroup. This proves equality.
Thus is its order- subgroup, whereas . The Frattini quotient records the independent generators in the Burnside basis theorem.
A nine-point finite-difference stencil on a square grid couples a central value to its four axial neighbours and four diagonal neighbours. Ordering the grid by columns produces a block tridiagonal matrix whose diagonal and off-diagonal blocks are symmetric tridiagonal Toeplitz matrices.
A filtered algebra over a field has increasing vector subspaces with . In the usual exhaustive nonnegative convention, , , and . Multiplication on the associated graded ring is induced by multiplying representatives and retaining their highest filtered degree.
For a polynomial ring, polynomials of degree at most give this filtration. For a Weyl algebra, the Bernstein filtration assigns degree one to coordinates and derivatives. Its defining commutators have lower degree, so the associated graded algebra becomes commutative. A filtration of a module compatible with the algebra filtration similarly gives an associated graded module.
A direct system indexed by a directed set consists of abelian groups and homomorphisms for , with and .
A redundant operator is an interaction that can be removed by an invertible local field redefinition or by integration by parts together with the equations of motion. It can change off-shell formulas while leaving the on-shell S-matrix unchanged.
A supertrace is a trace weighted by the grading of a Hilbert space. For fermion parity , it is : even states contribute with a plus sign and odd states with a minus sign.
In supersymmetric quantum mechanics, paired positive-energy states have opposite fermion parity and cancel in the supertrace of . Unpaired zero modes then contribute to the Witten index. This cancellation requires a well-defined trace or a consistent regulator; a continuum reaching zero energy can invalidate a naive term-by-term argument. The supertrace is therefore useful for counting protected differences between sectors, while an ordinary thermal trace adds both sectors and counts a different quantity.
If a purported authentication service returns a square root of every chosen square modulo a Rabin modulus, a verifier who knows one root obtains a different root with substantial probability and can factor the modulus. Repeating the challenge therefore reveals the private key.
Expected utility of a Gaussian location-scale family by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let , where has the standard normal distribution and . Suppose is increasing, concave and twice continuously differentiable, with sufficient integrability to differentiate its Gaussian expectations twice and integrate by parts. A convenient sufficient bound is for fixed constants . For ,The middle equality uses Gaussian integration by parts. If , the mean derivative is strictly positive. At , the scale derivative is zero. Allowing negative leaves the distribution unchanged but reverses the sign of that derivative, so the monotonicity assertion is stated on nonnegative scale.
Furthermore,is negative semidefinite: its quadratic form on is . Thus is jointly concave in mean and scale. Concavity also follows directly by applying concavity of pointwise to affine combinations of , without assuming the differentiability formulas when their integrability fails.
Euler proof that the sum of reciprocals of primes diverges by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For a finite set of primes,expands as the sum of over positive integers whose prime factors are at most . It contains every term with , so these partial products dominate the harmonic series and diverge. Sinceuniformly for , convergence of would force convergence of the logarithms of these products, a contradiction.
A binary repetition code represents one bit by repeating it times, using codewords and . Their Hamming distance is , and the code rate is . For odd , the majority function recovers the input whenever fewer than half the positions have flipped. Even allows a tied vote, so a decoder must specify how it handles that case.
For , the received words decode to zero; decode to one. The decoder therefore corrects every single flip. This guarantee concerns the number of flipped positions, independent of any probabilistic model.
If each position passes independently through a binary symmetric channel with crossover probability , a decoded error requires at least two flips. The binomial distribution givesAt , the uncoded error probability is , while the three-bit code's decoded error probability is . This improvement costs three transmitted bits per message bit. For , ; for , one should first exploit the known tendency to invert symbols rather than applying the same majority rule blindly.
Independent flips are an essential assumption for the displayed formula. If a single common disturbance flips all three positions together with probability , repetition provides no improvement. More efficient error-correcting codes distribute redundancy across larger message blocks; repetition is useful as a transparent example of the geometry and the reliability–rate tradeoff.
Any two norms on a finite-dimensional real or complex vector space are equivalent. Relative to a fixed basis, continuity and positivity of a norm on the compact Euclidean unit sphere give uniform positive lower and finite upper bounds.
Given a definable operation on a set and a function with domain , there is a unique class function satisfyingfor every set . Existence and uniqueness follow by epsilon induction, because the value at depends only on values at members of .
Reduced positive definite binary quadratic forms of discriminant minus thirty-five by
Codex 0 Created 2026-10-03 Updated 2026-11-05
At discriminant of a binary quadratic form , the reduced positive definite binary quadratic forms are exactlyThe enumeration of reduced binary quadratic forms bound gives . For , the required odd and the divisibility leave precisely those two triples after the boundary sign convention. Both are primitive, so .
For a prime number , represents exactly when both Legendre symbols and are one; represents exactly when both are minus one. The square-completion identitiesprove the necessary signs modulo five and seven: four is a square at both primes, whereas twelve is a quadratic nonresidue at both.
For sufficiency, either matching sign pair gives by quadratic reciprocity. The discriminant criterion for prime representation by a binary quadratic form then supplies a primitive form of discriminant representing . It reduces to one of the two listed forms, and their distinct sign conditions determine which. For example, , whereas .
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






