Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let commute. On an open set where is equicontinuous, so is , by the rational map is Lipschitz in the chordal metric bound. Since this equals , equicontinuity descends through the open map : near every nearby value has a preimage near , and the corresponding estimates hold for all . Thus . A degree-at-least-two Julia set contains at least three points, all omitted by the iterates of on . The three-value Montel theorem gives . Exchanging the maps proves equality of their Fatou and Julia sets. The degree hypothesis excludes Möbius examples with only one Julia point.
For , the maximal cliques of are the families containing a fixed -subset, of size , and the families contained in a fixed -subset, of size . To see why these exhaust the possibilities, write two adjacent vertices as and . A common adjacent vertex either contains or lies in . A vertex of the first kind outside that union is not adjacent to a vertex of the second kind omitting an element of , so a clique cannot mix these alternatives. For and , , the clique sizes and four distinguish the families containing pairs. Their incidence recovers , whose stars of size distinguish the individual ground-set points from its triangular cliques.
One edge of a Johnson graph replaces one element of a -subset, so it can increase intersection with a fixed target by at most one. Replacing each element outside the target by one missing target element gives a path reaching this lower bound. Equal-distance ordered pairs have equal sizes of intersection, the two differences and the remaining ground set; a permutation matching these four regions proves distance transitivity.
The Jacobson radical is the intersection of the ideals over all simple modules, where is the annihilator of a module, so it is a two-sided ideal. If , the left ideal cannot be proper, since a containing maximal left ideal would also contain and hence . Thus for some . Now also differs from by a radical element and has a left inverse . Multiplying by gives , and hence . This proves the unit assertion. Conversely, if is outside a maximal left ideal , then for some , . Consequently cannot be a unit, proving the reverse direction.
The intersection of maximal left ideals is the intersection of annihilators of simple modules on the left, hence is a two-sided ideal. If belongs to it, has a left inverse for every . Its left inverse also differs from by a radical element and has a left inverse; this makes the original inverse two-sided. The identity then shows that is invertible too. If were outside a maximal right ideal , one would have for some , a contradiction. Applying the same argument to the opposite ring proves equality.
Jacobson radical as greatest quasinilpotent ideal by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For a complex unital Banach algebra , the unit criterion for the Jacobson radical implies that every radical element is a quasinilpotent element, because is invertible for every nonzero . Conversely, if a two-sided ideal consists of quasinilpotent elements, then is quasinilpotent for every member and every . Hence is invertible and lies in the Jacobson radical. The maximality statement concerns ideals contained in the quasinilpotent set, not the whole set itself.
Infinitely many prime quadratic nonresidues of a nonsquare integer by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For an odd positive nonsquare integer , there are infinitely many primes with Legendre symbol . Choose a residue modulo with Jacobi symbol by making it a quadratic nonresidue at one prime occurring to odd multiplicity and a square at every other prime. The Chinese remainder theorem also imposes and at any finite list of previously found primes. Then Jacobi reciprocity gives , so a prime factor of has and is outside that list.
For and real-valued , there is a real trigonometric polynomial with coordinate frequencies whose uniform error is at most . One obtains the multivariable statement by applying bounded one-dimensional Jackson approximation operators successively in each coordinate and telescoping their errors. Each operator commutes with differentiation in the other coordinates, and its uniform operator norm is bounded independently of ; the total error is bounded by a constant times . For complex-valued , approximate its real and imaginary parts separately; the resulting trigonometric polynomial may have complex coefficients.
The jackknife variance estimator estimates the sampling variance of the full-data estimator, using the deletion estimates and their mean from jackknife resampling:The square root is the estimated standard error. The factor multiplies the divisor- variance of the deletion estimates: those estimates vary less than estimates from new independent experiments because almost all their observations are shared. Ryan Tibshirani's [ref]
https://www.stat.cmu.edu/~ryantibs/statcomp-F15/lectures/design.html. Carnegie Mellon notes on computing jackknife standard errors
give the same scaling in terms of the divisor- sample variance of the deletion estimates.For the sample mean, this formula has an exact algebraic simplification. With denoting the usual sample variance,and thereforeUnder the independent and identically distributed assumption and a finite second moment, is an unbiased estimator of the population variance . Consequently is an unbiased estimator of the sample mean's sampling variance . The equality itself holds for any observed data with ; its sampling interpretation uses the stated assumptions.
For , the sum of squared deviations from the sample mean is , giving sample variance . The deletion sample means have squared deviations totaling , soHere estimates the variance of individual observations, while estimates the sampling variance of their sample mean. These answer different questions.
For more general statistics, validity requires regularity beyond the deletion formula, such as a sufficiently smooth function of sample means with suitable moments. Ordinary delete-one jackknife resampling can fail for nonsmooth quantiles, including the median; see Larry Wasserman's [ref]
https://www.stat.cmu.edu/~brian/valerie/617-2022/0%20-%20books/2006%20-%20Wasserman%20All%20Of%20Nonparametric%20Statistics.pdf. All of Nonparametric Statistics, Section 3.1
. With statistical dependence, deleting individual observations need not reproduce the relevant sampling variance; the deletion scheme must reflect that statistical dependence. Shalizi's [ref] distinguish the basic independent and identically distributed case from extensions.The classical Iwasawa main conjecture, now a theorem over , identifies characteristic ideals of appropriate cyclotomic Iwasawa modules with ideals generated by p-adic L-function power series. For a nontrivial even character in the p-ramified convention, with . The Kummer reflection in Iwasawa theory accounts for the reflected odd class-group convention.
Spherical symmetry makes moments over a ball isotropic tensors. Odd moments vanish under , while the second and fourth moments areFor the second moment, a tensor contraction gives . For the fourth, complete index symmetry makes the three coefficients equal and a double tensor contraction gives . These identities turn polynomial volume integrals into scalar radial integrals and are useful for inertia and rotational averages.
Assume the radial moment integral exists. Rotation through about the third axis multiplies by and preserves the region, volume element and radial weight. The integral equals times itself for every angle, so it vanishes. For degree two and four this also follows by contracting the isotropic sphere moments with the complex null vector , whose bilinear square is zero. Odd moments vanish under inversion.
Quadratically weighted inverse-radius Hessian integral by
Codex 0 Created 2026-10-14 Updated 2026-10-18
Away from the origin the Hessian matrix of is . Multiplication by makes the singularity locally integrable. Rotational invariance and the symmetries in each index pair reduce the integral to . The Laplacian trace gives , while contracting the two pairs as gives . Solving these two equations yields the displayed expression.
Writing an isophote's radial residual about its fitted ellipse as , positive extends the major and minor axes and gives a pointed, disky shape; negative extends diagonal directions and gives a boxy shape. The sign stated here is for radial residuals, not an unconverted brightness residual. Massive slowly rotating elliptical galaxies commonly have boxy isophotes, while embedded rotating disks commonly make lower-mass elliptical galaxies disky.
The area of a surface of revolution about the horizontal axis is . For a curve below the axis with endpoints and fixed arc length, its stationarity is equivalent to stationarity of . The Beltrami identity gives . Choosing , imposing the endpoints and integrating the length gives the displayed curve. The function increases strictly from to infinity on , so every determines exactly one positive . Stationarity alone does not establish a global minimum.
Zeros and poles describe the positive and negative local orders of a meromorphic function. Locally with holomorphic and nonzero at : is a zero, is a pole, and is a regular nonzero value. A simple pole has , and the order of vanishing records .
Let on a finite graph, with each undirected edge counted once, , and Ising spins . Here is a dimensionless log-weight: the probability mass function is . If denotes physical energy, the convention is , not .
Order configurations coordinatewise, so and . Define and . An edge contributes zero to the displayed difference unless it joins to . On such an edge the joined and met configurations each have spin product , whereas both original configurations have product . Its contribution is therefore . Each field term cancels because the coordinatewise maximum and minimum preserve the sum of the two spins. Consequently,Exponentiating gives , the FKG lattice condition. The corresponding FKG inequality implies positive association of random variables: increasing observables have nonnegative covariance. The sign convention matters: using a positive ferromagnetic log-weight as though it were physical energy in would reverse which couplings favor alignment.
With the convention , positive favors opposite neighboring Ising spins. On a bipartite graph, the Néel order parameter measures opposite sublattice magnetizations; it is distinct from the uniform magnetization. Changing the signs of spins on one sublattice maps the zero-field model to the ferromagnetic Ising model.
A fixed Ising boundary condition pins the Ising spins on a specified boundary, leaving the interior distributed with the original interaction weights. The boundary can be the inner graph vertex boundary of a finite box, or an exterior neighboring set if that convention is explicitly chosen. Conditioning on pinned Ising spins preserves the FKG lattice condition of a ferromagnetic Ising model. The FKG inequality then makes interior expectations of increasing observables nondecreasing in the pinned boundary Ising spins.
For the infinite one-dimensional coupling matrix with , its Fourier symbol is . Its inverse is nearest-neighbor even though the original interaction is not. The inverse quadratic form equals . Finite open chains add endpoint corrections; a periodized coupling gives the same translation-invariant formula.
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





