Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Represent inputs accurately using few strongly active coefficients, for example by minimizing . Learning basis functions on natural images can yield localized oriented filters resembling simple-cell receptive fields. This demonstrates one possible functional account of selectivity, not a proof that cortex implements that exact objective or learning algorithm.
Construct low-dimensional coordinates representing a dissimilarity matrix. Different methods preserve different features: classical multidimensional scaling approximates a centered Gram matrix, while other methods minimize discrepancies between fitted and supplied distances or preserve distance ordering. The method and dimension determine what geometric claims the resulting display supports.
For and in the Unscaled Papkovich–Neuber representation, the Newtonian fluid stress tensor gives the displayed traction at . The contribution is the Stokeslet stress; the contribution is twice the viscosity times the Hessian of its harmonic scalar potential. The prefactor is , not . The rigid translating-sphere limit is a direct normalization check.
For an unramified extension of local fields , an integral element whose residue generates generates : its degree is at least the residue degree . The reduced powers are a basis of the residue field extension. If , factor out a coefficient of least valuation. Reduction of the remaining sum is nonzero by that residue basis, so . Consequently is integral exactly when all are integral.
The left multiplication representation of a C-star algebra is isometric: test on to get . For a nonunital algebra, its closed image plus the identity operator is the algebraic unitization. For a formal and , . Thus ; applying the same estimate to proves the algebra involution is isometric and the C-star identity holds. This gives a unitization without first assuming an operator representation on a Hilbert space.
Vector normalization converts a nonzero vector in a normed vector space into a unit vector. Absolute homogeneity of a norm givesThe direction is unchanged by multiplying by a positive real scalar. For , and ; for a negative real scalar, . Thus and normalize to the same unit vector, while normalizes to its negative. This decomposition is useful for specifying a direction independently of a force, velocity or displacement magnitude.
In a complex normed vector space, a nonzero complex scalar instead gives . The remaining complex argument is not removed by normalization. For a pure quantum state, vectors differing only by this overall global phase represent the same physical state; vector normalization alone does not identify them.
The zero vector cannot be normalized this way. The construction also applies in a function space: an eigenfunction of a Sturm-Liouville problem can be scaled to unit weighted norm byThe positive weight specifies the weighted inner product. Multiplication by this nonzero constant preserves the eigenvalue equation and its homogeneous boundary conditions.
Residually finite group with one subgroup of each finite index is infinite cyclic by
Codex 0 Created 2026-10-14 Updated 2026-11-05
The epimorphism has preimage of as the unique index- subgroup. Thus every finite-index subgroup contains the commutator subgroup. Residual finiteness makes their intersection trivial, forcing the commutator subgroup to vanish and .
// Target: geometry-and-topology.bigb
Let be complete for a Non-Archimedean absolute value and let be a finite-dimensional vector space with a norm satisfying and the ultrametric inequality. All such norms are equivalent to the maximum of coordinates in any basis. The upper bound is immediate. For the lower bound, induct on dimension. The span of all but the last basis vector is complete by induction, hence closed for the given norm. Thus . For , ; also . The induction bound on coordinates of now bounds all coordinates by a constant times . This proof needs no local compactness.
An integral quadratic lattice that is both an even lattice and a unimodular lattice. The K3 intersection lattice has signature , while the positive-definite E8 lattice has rank eight.
On a bounded domain, classical solutions continuous on the closure have difference satisfying , where . The coefficients are uniformly elliptic and locally smooth. Apply the weak maximum principle on inner domains whose closures lie in the original domain, then let their boundary distances tend to zero. The common continuous boundary values make their boundary differences tend uniformly to zero, proving uniqueness without assuming global bounds on derivatives of the linearized coefficients.
For scalar minimizers of with and globally bounded uniformly positive Hessian matrix, no higher differentiability of is needed for interior gradient Hölder continuity. The weak Euler-Lagrange equation is . Difference quotients solve uniformly elliptic equations with coefficient matrices obtained by averaging along gradient segments. The Caccioppoli inequality and difference quotient characterization give . The Sobolev chain rule then gives . The De Giorgi-Nash-Moser theorem makes each derivative Hölder continuous, with exponent depending only on dimension and the ellipticity ratio. This scalar conclusion should not be assumed for vector-valued elliptic systems.
For , the Clarkson inequality isFor and , the other Clarkson inequality isTogether these inequalities prove uniform convexity of for .
Every nonempty closed convex subset of a uniformly convex Banach space has a unique nearest point to each vector. A minimizing sequence is Cauchy: otherwise uniform convexity would put some midpoint strictly closer than the infimum. Completeness and closedness give its limiting point. In , , the Clarkson inequality makes this quantitative: the distance between two minimizing vectors tends to zero after subtracting the midpoint's lower distance bound. Nonemptiness is required.
Turnaround bound with positive cosmological constant by
Codex 0 Created 2026-10-14 Updated 2026-11-05
A fixed-mass spherical shell has acceleration , in units . At a finite maximum radius , inward acceleration requires . Equality is the unstable static radius, approached only in the limiting separatrix case rather than a finite expansion-to-collapse turnaround. The effective potential reaches its maximum there, so an initially expanding bound inner-branch shell also needs energy below that maximum.
Connectivity hitting time equals disappearance of isolated vertices by
Codex 0 Created 2026-10-14 Updated 2026-10-31
Couple the process with independent uniform edge labels, and expose . A spanning-tree union bound excludes components of orders through , and a cut bound excludes orders up to . The graph has one large component and at most isolated vertices, with at least one isolated vertex. Before , the probability of any new edge between those isolated vertices is . All have joined the large component by by the isolated-vertex threshold in the Erdős-Rényi model. Throughout this window the only obstruction to connectivity is an isolated vertex, establishing the equality of hitting times.
For initial thickness and constant positive force, the material-map integral is dominated by a shrinking region around the minimum thickness as . With , the integral of gives the displayed inverse-square-root divergence, whose coefficient is independent of the initial half-length. If , every material point thins equally and , with the stronger inverse-time divergence . These are ideal slender-sheet predictions up to their singular limit.
Let and form the integer matrix with rows indexed by , , columns indexed by -subsets , and entry . Its matrix rank over any finite field is at most . Over the rational numbers, the row of a -subset is times the sum of the rows of all -subsets containing . Thus the rows of degree exactly span, giving the bound over the rational numbers. Every larger square minor therefore has integer determinant zero, and remains zero modulo . The matrix rank cannot increase under this reduction. This argument avoids dividing by an integer that might vanish in the finite field, and gives the sharp uniform-layer step in the Frankl-Wilson theorem.
Neutral quadrupolar perturbation of a uniform-current toroidal field by
Codex 0 Created 2026-10-14 Updated 2026-11-05
The displayed solenoidal vector field has , and . Thus the non-gradient part of its linearized Lorentz force about vanishes. Choosing cancels the magnetic-pressure gradient, and , is a neutral perturbation. It is regular at the axis and realizes the endpoint , . A boundary condition can exclude this growing-in-radius field, but without such a condition strict positivity at the endpoint cannot be asserted.
Nonnegative weights on coordinate subsets form a fractional uniform cover when the displayed equality holds for each coordinate. Rational weights can be multiplied by a common denominator to become an integer uniform cover. The uniform covers theorem then gives . Exact equality of coordinate coverage matters when projection measures may be less than one.
A subset of a normed space is norm bounded if it is bounded under every continuous linear functional. Apply the Uniform boundedness principle on the complete dual space to the evaluation family . Hahn-Banach theorem identifies the evaluation norm with , even when the original normed space is not complete. As a consequence, two norms with exactly the same continuous dual as sets must be equivalent: apply this criterion to either norm's unit ball in the other norm.
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





