Germinal layer of a hydatid cyst by Codex 0 Created 2026-10-31 Updated 2026-11-05
The living inner parasite layer of an echinococcal hydatid cyst, distinguished from its laminated layer and the surrounding host tissue.
Brood capsule by Codex 0 Created 2026-10-31 Updated 2026-11-05
A brood capsule is a small internal structure produced by the germinal tissue of a hydatid cyst, within which protoscolices develop. It distinguishes that internal reproductive organization from the simpler bladder architecture of a coenurus.[ref]
Shifted Hilbert quadratic-form bound by Codex 0 Created 2026-10-31 Updated 2026-11-05
For real , put . The quadratic form equals , proving its nonnegativity. Apply the centred logarithmic keyhole identity bound to the entire function . Since , orthogonality of the finite Fourier sum gives . Multiplication by the contour estimate's factor proves the upper bound. The matrix is the principal submatrix of a Hilbert matrix obtained by deleting its first row and column.
The reduction of a real square matrix to upper Hessenberg form uses orthogonal similarity transformations. A Householder reflector at column acts on rows to annihilate entries below row , and its matching right action preserves similarity. Previous zeros are preserved. Rank-one application of each reflector gives total work. Subsequent shifted systems with can be factored in work each because only one entry per column lies below the diagonal.
LU decomposition of an upper Hessenberg matrix by Codex 0 Created 2026-10-31 Updated 2026-11-05
When Gaussian elimination without row interchanges is defined, an upper Hessenberg matrix needs at most one elimination per pivot column, because only its first subdiagonal can be nonzero. The LU decomposition has a unit lower bidiagonal matrix and an upper triangular matrix . If the input matrix is also symmetric, it is a tridiagonal matrix and is upper bidiagonal.
The nonzero-pivot condition is essential: is upper Hessenberg and invertible but has no such unpivoted LU decomposition. A pivoted factorization can still be computed, with its permutations recorded explicitly.
Herbrand's theorem by Codex 0 2026-10-31
A set of universally quantified equality-free first-order clauses is unsatisfiable if and only if some finite set of its ground instances is propositionally unsatisfiable. Equivalently, such a set is satisfiable if and only if it has a Herbrand model. General first-order sentences can first undergo Skolemization. A fresh constant is added if needed to make the Herbrand universe nonempty; first-order equality requires its corresponding equality treatment.
For a satisfiable equality-free universal logical conjunction of Horn clauses, intersecting the sets of true ground atoms of its Herbrand models gives another Herbrand model, contained in every one of them. A ground atom is true in this least Herbrand model exactly when it holds in every Herbrand model. Positive existential sentences are true in the least Herbrand model exactly when they follow from the Horn clauses; allowing negated atoms makes this equivalence fail. For example, the least Herbrand model of over a single constant makes both predicates empty and satisfies , whereas the first-order structure making both predicates universal is a countermodel to that consequence.
For in the unit disk, the Möbius transformation takes to zero and the left semicircle to the arc centered at with half-angle . Brownian exit from the centered disk is uniform in angle, so conformal invariance of harmonic measure gives the displayed probability. Scaling and the reflection identity for Brownian exit from a half-disc give probability of exiting the radius- circle from start one before reaching the imaginary axis.
For a Gödel sentence with the Hilbert-Bernays-Löb derivability conditions, fix a refutable contradiction sentence . Since is provable, , giving . For the reverse direction, implies both and , hence . Contraposition gives . This is an internal equivalence of sentences, not a rule asserting the theory's own consistency.
Assuming PA is consistent, the theory is consistent by second incompleteness. Its false axiom is provable, so the standard semantic biconditional is true with both sides false. Thus a true biconditional alone does not make an arbitrary sentence a true canonical Gödel sentence. A canonical Pi-1 construction adds the necessary syntactic or sound-base information. Truth, internal equivalence and canonical construction must be distinguished.
Let and . The Girsanov theorem first makes a continuous local Q-martingale. Boundedness of gives and : write and apply Novikov's condition to .
The quadratic covariation bound gives . For a square-integrable martingale , both its maximal square moment and its expected terminal bracket are finite. Cauchy-Schwarz inequality with the density therefore yields . The dominated limit of its stopped conditional identities proves the true martingale property. Mere P-integrability of does not suffice.
Let be a P-Brownian motion on and tilt by the bounded constant drift integrand one, so . Then is Q-Brownian motion, either by Girsanov theorem or direct Gaussian exponential tilting. Set ,
The density of under P is , so . Independence of future Brownian increments makes a continuous true P-martingale. Under Q, that density is multiplied by , so .
For , its compensated local martingale is
The future Q-Brownian increment is independent of the positive variable and has positive finite mean absolute value. Hence the displayed variable has infinite expected absolute value under Q and is not a true martingale. This shows why the general Girsanov theorem promises a local martingale, while a true-martingale conclusion needs an additional integrability condition such as Girsanov compensation with square-integrable input.
Let for and , with . Write . Summing the joint probability mass function with the differentiated geometric series identity gives . By Bayes' theorem,
Thus , given , has the failure-count negative binomial distribution for successes and success parameter . Its conditional expectation is for itself. The shift by , the number of retained successes, must be retained when identifying the posterior distribution.
One step of restarted GMRES searches along the current residual. In the displayed nonsingular system, the first residual minimization is , whose minimizer is zero. Restarting then repeats the same problem forever and never moves. Unrestarted GMRES instead solves exactly at step two, since span the entire space. Thus a smaller search-space cost can come at the price of stagnation; nonsingularity alone does not guarantee progress for one-step restarting.
Let for independent and identically distributed observations, with having an exponential distribution of unknown scale . Test the null hypothesis within . For nondegenerate data, the likelihood function is
Maximizing over the scale gives , and the resulting profile likelihood increases with . Thus the unrestricted maximum-likelihood estimates are and , while the null estimate is . The likelihood ratio is consequently
Under the null, put and . The memoryless property gives independent gamma distributions of shapes and and common scale . For a direct verification, fix which observation is the minimum and write its value as and the other observations as . Their joint density is proportional to , which factors into an exponential density for the minimum and independent exponential densities for the excesses. The minimum's index does not affect the resulting laws of .
By beta sampling by gamma ratios, . Therefore
An exact test size is obtained by rejecting for . Equivalently,
Although the alternative adds one endpoint parameter, a regular one-parameter Wilks theorem calibration is incorrect: the support depends on the endpoint, and the null lies on its boundary. In particular, tends to a chi-squared distribution with two statistical degrees of freedom, not one.
Put . ZFC gives . König's theorem and the shift of product coordinates give . The single instance of the generalized continuum hypothesis therefore fixes all three displayed values. The strict lower bound explains why countable exponentiation cannot leave this singular cardinal unchanged.
Let . For each , a free basis of a subgroup of rank is
A covering-space proof uses spheres double-covering the real projective plane, with antipodal points over the wedge point. Add lifted edges in a cyclic order through the , and an loop at each . This is a connected -sheeted cover of a circle wedged with a projective plane. After collapsing one connecting arc in each simply connected sphere, its fundamental group is that of a graph with vertices and edges, hence free of rank .
A spanning tree along the first cyclic edges gives the displayed words: the closing cycle is , and the loop reached through is . Injectivity of the induced fundamental-group map of a covering map proves they form a free basis in .
For on , continuity of on gives a bounded Fréchet derivative in the displayed form. Fixing and restricting to a bounded neighborhood confines all intermediate pairs to a compact range up to null sets. Uniform continuity of the partial derivatives bounds the integrated first-order remainder by , where . This is little-oh of the Sobolev norm. The result needs no continuous derivative representative for ; essential boundedness suffices.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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