Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a nonzero finite-dimensional cyclic linear operator, identify its module with , where is the monic minimal polynomial. Its kernel consists of classes of with . If , coprimality gives , so the kernel is zero. If , it consists precisely of the multiples of modulo , a one-dimensional space. Thus the multiplicity of zero as a root of does not increase the nullity. The same companion block reads off invertibility from the constant term and gives the characteristic and minimal polynomials directly, while explicitly listing eigenvalues may require factoring .
For finite-dimensional linear maps and , the restriction of to maps onto and has kernel . The rank-nullity theorem on this restriction proves the title identity. Since the intersection has dimension at most , it implies . Equivalently, , the rank inequality for a composition. Also directly gives the upper bounds .
Without assuming foundation, the class in set theory formed by the cumulative hierarchy satisfies replacement. Relativize a functional logical formula to that definable class in set theory and use ambient replacement to collect its range. Every output belongs to the hierarchy class in set theory, and the rank-bounding result places the range set itself in that class in set theory.
Retain each of objects independently with probability , independently of the nonnegative integer-valued random variable . The retained count has the displayed conditional binomial distribution. The probability generating function of an independent random sum gives . If has finite variance, the law of total expectation and law of total variance giveThe first term is the average conditional variance of the independent retention decisions; the second is the variance in their conditional expected value.
Drive two copies of a random affine recursion with the same coefficient pairs, independent of their initial coupling. Then . If and , independence of random variables givesThis proves convergence in L1 and hence convergence in probability of the difference. If one copy starts in a stationary distribution, Slutsky's theorem shows that the other copy converges to that distribution. The argument compares paths before taking their one-time probability distributions; it does not require the paths ever to become exactly equal.
Let have the uniform distribution on and let have an exponential distribution of rate , with all these inputs independent. The random affine recursion has an invariant exponential law of the same rate. Indeed, for independent exponential , beta-gamma independence says that is uniform and independent of . Thus an independent uniform gives the same law as .
For any deterministic real initial value , couple the recursion to a stationary copy. Synchronous contraction of a random affine recursion gives an expected difference . Hence the one-time laws converge to , independently of . An invariant initialization keeps every one-time law unchanged while the chain continues to fluctuate.
A positional representation in which each digit has its own positive integer base. Least-significant-first digits satisfy , and digit has weight . For positions, assume . Repeated Euclidean division by the successive bases converts that integer to digits; a backwards version of Horner's method converts the digits back.
A chest radiograph is an X-ray transmission image through the chest. Different paths encounter different compositions and thicknesses, producing different detected intensities through attenuation. The detector records a projection through the body rather than a physically isolated slice.
For a narrow monochromatic beam, a spatially varying linear attenuation coefficient gives . Real sources emit an electromagnetic spectrum of photon energies, and scattered radiation contributes additional signal. Overlapping structures can therefore be ambiguous in a single projection; detector display brightness also depends on processing and must not be confused directly with one local material density.
Assign an arbitrary finite value at the origin. Polar integration and the substitution rule reduce the joint L1 norm exactly to . Near zero, gives ; at infinity, gives . These are integrable when and , respectively. Their explicit integrals give the displayed bound. This is a planar version of sine power kernel integrability, with the radial area element determining the exponents.
Consider an orientation-preserving classical radial deformation of an elastic solid on a connected spherical annulus. If its nonnegative energy is zero everywhere and the material is isotropic with strict Baker-Ericksen inequalities, every gradient is a natural state, so . Thus and .
A separate rigidity argument applies when the zero wells are , with finitely many positive definite symmetric . The radial gradient is positive symmetric; if , then , so uniqueness of the positive square root gives . The rotation well similarly gives . Hence the continuous ratio takes values in a finite set of eigenvalues and must be constant on the connected radial interval. Differentiating finishes the proof. This version needs neither material isotropy nor Baker-Ericksen inequalities and does not require an assumed continuity of beyond the radial-map regularity used for the ratio.
For a radial deformation with positive radial derivative, put and . The principal nominal stresses are and . Radial equilibrium reads . Since , substitution cancels the terms proportional to , leaving . Strict convexity of and positivity of force a constant positive determinant .
Integration of gives . Two spherical boundary radii fix uniquely. A positive increasing cube-radius interpolation verifies positivity of and , so the algebraic solution is an admissible smooth radial equilibrium. The result is restricted to this energy family and radial class; strict convexity of its determinant term alone does not imply uniqueness among arbitrary three-dimensional deformations.
Let be a compact Hausdorff space and a closed equivalence relation. The quotient space is compact and Hausdorff. Indeed, the saturation of any closed is the projection of the compact set , so is closed. Thus the quotient map is a closed map.
Two different equivalence classes are disjoint compact subsets of and have disjoint open neighbourhoods . To see the latter assertion, separate each pair of points by disjoint neighbourhoods and use compactness twice to extract finite covers. Now and are open saturated subsets containing the respective classes, and lie inside . Their quotient images are disjoint open neighbourhoods, proving the Hausdorff condition. Compactness follows from the continuous quotient map. This applies to finite gluing along closed boundary pieces when the generated equivalence relation is closed; that last condition must be checked.
Collapse the equator of a sphere to a single equivalence class and leave every other point in its own class. The two closed hemispheres are disks sharing that equator. A disk with its boundary collapsed is a sphere, so the two hemisphere quotients are spheres sharing just one point: their wedge sum. An explicit map sends height and longitude on the upper hemisphere to , and sends the lower hemisphere to the sphere centred at by reversing the first coordinate. The equator goes to the common origin and the poles go to . This map is continuous and has precisely the collapsed equator as its only nonsingleton fibre. Its induced map is a homeomorphism by the compact-to-Hausdorff continuous bijection theorem.
Historical pharmaceutical preparation; its composition and clinical use must be identified by edition. [ref]
The Essentials of Materia Medica and Therapeutics by Alfred Baring Garrod (1865). corresponding monograph and British preparation
In a compact Hausdorff space, the quasicomponent is connected and equals the connected component of . If were a nontrivial separation, disjoint open neighborhoods of its compact pieces leave a compact complement missing . Finitely many clopen neighborhoods of intersect to a clopen containing inside . The piece is then clopen in the whole space, contains , and misses the nonempty other piece, contradicting the definition of . This also proves that any neighborhood of a component contains a clopen neighborhood of that component, by compactness of its complement.
In a compact Hausdorff space, each connected component is its quasi-component and has a neighborhood basis of clopen sets. Let be the intersection of clopen neighborhoods of . It is compact. If it splits into two nonempty compact sets, normality separates them by disjoint open neighborhoods. The finite intersection characterization of compactness gives a finite intersection of clopen neighborhoods lying in their union. Its intersection with the neighborhood containing is then clopen and excludes part of , a contradiction. Thus is connected and equals the component. Applying the same finite-intersection argument to any neighborhood of proves the neighborhood-basis assertion. [ref]
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/Isabelle/browser_info/HOL/HOL-Analysis/Homotopy.html. Formalized Šura-Bura results, including the compact Euclidean case
. Pending infections at quarantine in a delayed epidemic model by
Codex 0 Created 2026-10-31 Updated 2026-11-05
Suppose that newly infected members of a biological population pass through a noninfectious stage of fixed duration before becoming infectious. This delay is a latent period, whereas the incubation period ends at symptom onset. The two endpoints need not coincide.[ref]
Household Transmission Investigation (HHTI) template protocol for respiratory pathogens with pandemic potential by World Health Organization. Section 1.3, printed p. 8, definitions and Figure 1: infection-to-infectiousness versus infection-to-symptoms
Let be the rate of new infections in the specified compartmental model. Assume no death or other removal during the noninfectious stage. At an intervention time , all infections acquired during the preceding time units are still pending entry into the infectious class, soFor a smooth recent incidence history, a Taylor expansion about givesThus the leading pipeline correction is proportional to the recent infection rate, rather than simply to the number currently infectious. A rapidly varying incidence history requires the integral instead of this short-delay expansion.
An ideal intervention stopping all new transmission at does not reverse these already acquired infections. Under the assumptions above, exactly additional entries into the infectious class occur after , over the next time units. They must be added when the reported cumulative count at records infectious-class entries. If that count already records infections at acquisition, the pending individuals are already included and must not be counted twice.
The definition of the susceptible individual compartment also matters: a genuinely uninfected susceptible class loses an individual at infection, while a model grouping not-yet-infectious individuals with susceptible ones postpones that recorded class transfer. The same biological delay therefore appears at different places in the bookkeeping. The assumption of perfect transmission removal is a model idealization rather than a clinical intervention rule.
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






