Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A generalized Vandermonde matrix evaluates a chosen list of functions at interpolation nodes . For a basis of polynomials of polynomial degree at most and distinct nodes, it is an invertible matrix by uniqueness of polynomial interpolation. Choosing monomials recovers the ordinary Vandermonde matrix.
Mass-moment cancellation of vacuum energy divergences by
Codex 0 Created 2026-10-25 Updated 2026-11-05
For finitely many free physical degrees of freedom with nonnegative masses, assign positive weights to bosons and negative weights to fermions. With a common spherical ultraviolet cutoff, the unsubtracted vacuum energy density is finite precisely when the three displayed supertraces vanish. Expanding proves that they cancel the quartic, quadratic and logarithmic ultraviolet divergences. The remaining radial integral converges as . Equal-mass boson–fermion pairing is sufficient but stronger than the three conditions; a renormalized vacuum energy with a free counterterm need not satisfy them.
Units compete to respond to an input, and the winning unit or sparse winning set strengthens its representation of that input. A prototype update is for the winner , with . The winner moves toward the sample: . Competition and constraints prevent all units from learning the same unrestricted average.
Learning transformation-tolerant representations by combining input-feature overlap, current-activity Hebbian learning and synaptic competition. A new view partly activates an output already learned for an overlapping view, then strengthens its new features onto that output. Chains of overlapping views can link more distant transformations without an explicit temporal trace; dense enough overlap and suitable competition remain conditions.[ref]
Learning invariant object recognition in the visual system with continuous transformations by Simon M. Stringer and others. Abstract and Introduction, pp. 128–131; experiments 3–4 distinguish spatial overlap from temporal ordering
A yellow judged neither reddish nor greenish. A wavelength or matching setting can operationalize the judgment under controlled conditions; shifts in that setting do not by themselves identify the neural locus of a change.
Let be a normed space, a Banach space, and be bounded linear operators with . Convergence of for every in a dense subset implies convergence of for every to a bounded linear operator , with . Indeed, makes a Cauchy sequence; completeness gives its limit, and linearity and the bound pass to that limit. If is a Banach space, pointwise convergence conversely implies the uniform bound by the Uniform boundedness principle. If the limit bounded linear operator is specified in advance, completeness of is unnecessary.
Suppose a series of functions has uniform absolute convergence on and is a uniformly bounded family of functions there, with common bound . The triangle inequality givesThe right-hand side tends uniformly to zero as . The Uniform Cauchy criterion proves uniform convergence of . Applying the same estimate to proves uniform absolute convergence too.
For an unbiased stochastic gradient at with finite conditional second moment, expand in the squared Euclidean norm. The cross term has zero conditional expectation, which proves the displayed identity. It separates the squared true gradient from the total conditional variance of its random estimate.
Target: gradient-descent.bigb, under Stochastic gradient descent.For the QED proper Feynman vertex with both external four-momenta zero, a massive internal fermion and a massless internal photon in Feynman gauge, the even numerator reduces under Lorentz covariance to . The gamma matrices identity and the integrated replacement prove the coefficients. The term has neither an infrared divergence nor an ultraviolet divergence for ; its integral in four dimensions is . Only the remaining squared massive denominator supplies the ultraviolet pole.
An ultraviolet divergence appears as a pole of a dimensionally continued Feynman integral. In , a logarithmically divergent one-loop integral typically has a term. Dimensional regularization can also produce infrared divergences with the same formal regulator, so the origin must be identified before interpreting a pole as an ultraviolet counterterm.
An amplitude is ultraviolet finite if its regulated high-loop momentum contribution has a finite regulator-removal limit after whatever lower-order subtractions are specified. A zero superficial degree of divergence does not force divergence: gauge invariance can cancel the candidate local term. Conversely, superficial convergence alone does not exclude divergent subgraphs. Ultraviolet finiteness makes no claim about infrared divergences or physical threshold singularities.
Pair-number statistics of polarization-entangled down-conversion by
Codex 0 Created 2026-10-25 Updated 2026-11-05
For an ideal undepleted pump and one collected pair of spatial modes, the two orthogonal polarization-pair creation terms generate two commuting two-mode squeezed vacua. If , either squeezed pair has geometric occupation probability . Adding their pair counts gives equal-weight possibilities, hence . Thus and at weak gain. Different unresolved temporal or spectral modes need not obey this single-mode formula.
Boltzmann carrier density of a two-dimensional parabolic band by
Codex 0 Created 2026-10-25 Updated 2026-11-05
State counting with total degeneracy gives a constant two-dimensional density of states above a parabolic conduction band edge. Integrating the Boltzmann occupation yields the displayed areal carrier density. For one valley and two spin states the coefficient is . Applying the same count to holes gives and the intrinsic density , distinct from the three-dimensional prefactor.
For with standard normal distribution, , and , integrate over . The identity gives the displayed expectation of the positive part. This is useful for option pricing when a financial payoff is the positive part of a normal random variable, including a log-call option. At the formula is interpreted by its limit, .
For three radius- circular cylinders with mutually perpendicular axes through one point, the boundary of their common intersection has three congruent cylindrical surface pieces. On , the height restriction is . Eight congruent sectors give surface area per piece. Pairwise intersections are curves of zero surface area, so the three pieces add.
A linear map on a finite-dimensional vector space over an algebraically closed field has both an upper triangular matrix and a lower triangular matrix in suitable bases. One proof uses invariant subspaces and annihilators to make the induction step entirely in the dual space.
Choose an eigenvector and let . The dual map preserves the annihilator of a vector subspace , of dimension one less. By induction, choose a basis of making the restriction upper triangular. Extend this to a basis of the whole dual space; its matrix remains upper triangular because is an invariant subspace. In the corresponding primal basis, the matrix is , which is lower triangular. Reversing the primal basis makes it upper triangular. Dimension zero and one start the induction. This also allows the original eigenvector to be the first vector of the resulting upper triangular basis.
The seafloor continuation beyond the actively slipping ridge-to-ridge transform fault. Its two sides can differ in age without continuing relative plate-boundary slip.
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





