Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A finite-limit-preserving functor preserves a terminal object and pullbacks, equivalently all finite limits. It is also called left exact. Such functors from a Cartesian syntactic category to a finite-limit category correspond to models of the associated Cartesian theory.
A left Kan extension is left adjoint to precomposition, when it exists; a Right Kan extension is right adjoint. For small indexing categories and set-valued functors, both exist by comma-category colimit and limit formulas. These two adjoints give the essential geometric morphism induced by a functor between presheaf indexing categories.
A covariant functor into a Grothendieck topos is flat when its tensor extension from presheaves preserves finite limits. For set values, its category of elements with arrows carrying source elements to target elements is cofiltered; equivalently the functor is a filtered colimit of covariant representables. If the indexing category has finite limits, flatness is equivalent to preservation of finite limits. For a site, cover-to-joint-epimorphism continuity adds the condition needed by the Diaconescu equivalence for geometric morphisms.
A distributional weak solution of , with locally integrable , becomes after the shear . For almost every characteristic label, there is an absolutely continuous function representing , and its increments are the integrals of for every pair of times. Arbitrary modifications on time slices can destroy this every-time identity without changing the distributional solution.
For the free transport equation, substitute into . The resulting factor and the bound by prove this mixed Lebesgue norm estimate. The right side contains initial data. The same-time mixed norm is not a conserved replacement: prescribing a product at a later time and dilating disproves such a claim.
Elements of a module are linearly independent if every finite linear relation between them has all coefficients zero. An independent finite set freely generates its span, a finite free module. Over an integral domain, maximal independence within a finite generating set enables clearing denominators relative to an independent module subset.
Order the linearly independent subsets of a vector space by inclusion. A chain's union is independent, since every finite relation is contained in one chain member. Zorn's lemma gives a maximal independent subset. A vector outside its span could be adjoined while preserving independence, so it spans. Sending finite-support coefficient families to their linear combinations gives an isomorphism from the free module on that subset to . This supplies an arbitrary, possibly infinite-dimensional basis using the axiom of choice; no pre-existing basis theorem is invoked.
Compact perturbation invariance of Fredholm operators by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For a Fredholm operator on a Hilbert space, invert its restriction from the kernel complement to its closed range, extending by zero on the range complement. The resulting bounded has and with finite-rank projections. Adding a compact operator gives two-sided inverses modulo compact errors. Such a parametrix forces finite kernel, a lower bound on the kernel complement, closed range and finite adjoint kernel; the latter is the cokernel. Repeating with proves the equivalence without assuming self-adjointness.
For zero initial displacement and unit delta initial velocity, the spatial Fourier transform of the wave equation gives the displayed multiplier. A compact cutoff function around zero frequency produces an ordinary smooth function after inversion. The remaining sine splits into two oscillatory integrals with phases and symbols proportional to of order . Their stationary directions lie on , proving a light-cone bound for singular support. This does not claim vanishing of smooth tails inside the cone.
An extension estimate is a norm bound for the Fourier extension operator, uniform over its input. The exponents encode the curvature and scale of the frequency surface. For normalized circle measure, a cap of angular width produces size comparable to on a rectangle of dimensions . This single-cap example forces for a finite diagonal estimate with the same exponent on both sides.
For normalized circle measure and a nonnegative cutoff near , equal to one on and supported on , remove the constant phase . On , , the remaining phase has magnitude at most . Taking sufficiently large keeps its real part positive and comparable to one, so the Fourier transform has magnitude at least a constant times the cap mass, which is at least . No upper bound on the cutoff is required for this lower bound.
For a semi-infinite plane-parallel atmosphere with polynomial source function , the outward specific intensity is . Substitution gives coefficients in the surface polynomial in . The deep boundary term must vanish. A local truncated Taylor series instead gives this contribution plus a remainder, so its surface polynomial is not automatically exact.
Along a radial ray through a layer with constant source function, the incident specific intensity is attenuated by and the layer adds . At small optical depth, . Whether the source exceeds the incident specific intensity determines the first-order emission or absorption contrast.
The cross-sectional area of a narrow flux tube, measured normal to its magnetic field. Constancy of the magnetic flux gives along the tube. This area controls the mass transport when flow follows the field.
This lattice condition on configuration masses is the hypothesis of the FKG inequality. A product measure on a finite Boolean lattice satisfies it with equality, since in each coordinate the minimum and maximum retain the original two coordinate values. It implies positive association of random variables for increasing functions.
For independent two-by-two tables with counts and total , the Mantel–Haenszel pooled odds ratio is the displayed ratio of sums. When all , it is also the weighted arithmetic mean of study odds ratios with weights . These differ from inverse estimated variance weights for log odds ratios. Both constructions can represent a fixed-effect meta-analysis, but they should not be silently interchanged when interpreting a supplied plot.
For a Sobolev space function, almost every line parallel to a coordinate axis gives an absolutely continuous restriction. An absolutely continuous function has derivative zero almost everywhere on each of its level sets. Slicing and Fubini's theorem give the assertion in higher dimension. If , apply it to and then to each component of its gradient to get almost everywhere on . This supplies the contact differentiation used in noncontact of ROF level boundaries.
Clearing denominators relative to an independent module subset by
Codex 0 Created 2026-10-07 Updated 2026-11-05
Let a finitely generated module over an integral domain have a finite generating set and a maximal independent subset . For each , dependence of gives a nonzero coefficient with . The product of those coefficients is nonzero and carries the whole module into .
For an MA(1) process, the recursion has candidate limits and . The limit in is when and otherwise. The limiting innovation variance is , expressing the same covariance law through an invertible reciprocal representation.
The nontrivial center of a finite p-group theorem implies that the center of a group of order has order or . If it has order , the quotient by the center has prime order and is cyclic; a cyclic quotient by the center forces the whole group to be abelian, contradicting the assumed size of its center. Thus the group is abelian. An element of order makes it cyclic. Otherwise choose and ; their order- cyclic subgroups intersect trivially and generate the direct product of groups . The two possibilities are nonisomorphic because only the cyclic one has an element of order .
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





