An encircling normalized Kirby color loop around two equally oriented anyon strands is times the orthogonal projection onto their total vacuum anyon charge. In the isotopy normalization of anyon diagrams, erasing the vacuum edge writes this as times the cup-cap diagram. The cup-cap squared is times the cup-cap, so is essential.
Kendall's tau-b by Codex 0 2026-10-25
Let count concordant pairs and discordant pairs, and let count pairs tied only on the indicated variable. Then
when both factors in the denominator are positive. Unlike Goodman and Kruskal's gamma, this coefficient accounts for ties. Its absolute value is at most one: form vectors of the comparison signs for all unordered pairs. Their inner product is and their squared norms are the two denominator factors, in reverse variable order. The Cauchy-Schwarz inequality supplies the bound. A variable constant throughout gives a zero denominator, not a meaningful zero association.[ref]
For a finite dataset, alternate nearest-centre assignment and replacement of each centre by the centroid of its assigned observations. Keep the current assignment whenever an observation is tied between nearest centres. A changed assignment then strictly decreases the within-cluster sum of squared Euclidean distances; updating centres cannot increase it by the centroid sum-of-squares identity.
After each centre update, the centres are determined by the current partition of a set of observation indices. There are only finitely many such partitions, so a strictly improving sequence cannot revisit one and must stop. A convenient exact stopping test is to check after each update whether every observation is still assigned to a nearest centre. This proof is for algorithm termination; it does not guarantee a global minimum.
Empty clusters need an explicit convention. To retain exactly nonempty clusters, transfer an observation from a cluster with at least two members to each empty cluster, making it a singleton centred at that observation. This cannot increase the objective: the transferred observation now has squared distance zero, and no other contribution changes before centre updating. A deterministic choice is an eligible observation farthest from its currently assigned centre, with ties resolved by index. After the first round, an empty cluster can arise only during a strictly improving reassignment, so these repairs preserve the finite-termination argument.
For distinct observations on the real line and , nearest-centre assignment produces contiguous blocks of the sorted observations because each Voronoi cell is an interval. The arithmetic means of distinct ordered blocks are strictly ordered, preserving this property at subsequent assignments. Initialize at distinct observed values so that the initial assignment has no empty cluster.
The empty-cluster repair in finite termination of K-means clustering also preserves contiguous blocks: an observation farthest from a centre over its assigned block lies at one of that block's endpoints, so transferring it to a new singleton splits the block into two contiguous blocks.
There are possible partitions into nonempty blocks: choose cuts among the gaps. Under the stable tie rule in finite termination of K-means clustering, every round after the first strictly reduces the objective until stopping, so a block partition cannot recur. The number of assignment, repair, and centre-update rounds is therefore at most . Check stability after each update without an additional update round; for , one update suffices.
For a regular scalar model, let be a smooth invertible change of statistical parameter with nonzero derivative. The chain rule makes the score function in the new coordinate equal to the old score function times . Therefore the expected Fisher information transforms as . Taking its square root gives exactly the absolute change-of-variable factor required for a prior density.
Consequently, computing the Jeffreys prior directly in either coordinate produces the same measure after transformation. Its density is not numerically constant across coordinates, nor must either density be uniform. When the prior distribution is proper, compatible normalization gives identical prior probabilities for corresponding sets; the resulting posterior distributions also transform consistently. For an improper prior the equality concerns measure kernels up to a constant, and posterior propriety still needs checking.
For a Bernoulli random variable with success probability , the score function is . The expected value of its square is , since the variance of is . The Jeffreys prior is therefore the proper beta distribution , also called the arcsine distribution. The Euler beta function has , giving the stated normalized prior density.
After successes in independent Bernoulli trials, Beta-binomial conjugacy gives posterior distribution and posterior predictive probability of one further success. Although its prior density diverges at both boundaries, its integral is finite.
Iterated Itô integral by Codex 0 Created 2026-10-25 Updated 2026-10-31
For Brownian motion, an ordered iterated Itô integral is defined by the displayed recursion. It represents integration on , with time increasing toward the outermost Itô integral. The Itô isometry proves inductively that
Thus every recursive integrand is a square-integrable stochastic integrand on each finite interval, and is a martingale for . For , increment algebra gives , and . These are the corresponding space-time Hermite polynomials divided by .
The sequence in which variables are integrated in an iterated integral. Reversing the order changes the slicing of the domain of integration, often requiring more than one integral. Fubini's theorem permits interchange for absolutely integrable functions, while Tonelli's theorem permits nonnegative measurable integrands even when the integral is infinite. Conditional convergence requires additional care; geometric reversal alone is not a general justification for interchanging improper integrals.
The real inverse of the hyperbolic sine is defined on all real numbers and has derivative . It appears in arc length and in integrals involving square roots of sums of squares, where a hyperbolic substitution can simplify the expression.
An invariant distribution of a continuous-time Markov chain whose coordinates are independent Poisson distributions. This property needs verification from the reaction propensity functions; it does not follow merely from having an equilibrium for the deterministic reaction-rate equations.
For example, consider the cyclic chemical reaction network with stoichiometric vectors , and and respective reaction propensity functions , , , where all three constants are positive. Put and . For , the three incoming terms in the chemical master equation are respectively , and . They exactly cancel the outgoing terms. Boundary terms vanish by the zero negative-index convention, and normalization follows from the two Poisson distributions. Establishing a limiting probability distribution additionally requires nonexplosion, an irreducible Markov chain and positive recurrence.
To see why continuous time removes periodicity, fix . Every finite sequence of Markov chain states connected by positive transition intensities has positive probability of finishing before , followed by no further transition until . Consequently the transition matrix has positive entries between every pair of communicating Markov chain states, including its diagonal. It is an irreducible Markov chain and an aperiodic Markov chain with stationary distribution . The countable-state Markov chain convergence theorem gives convergence at times , also in total variation distance. For , , applying contracts total variation distance and preserves , giving the full continuous-time limit.
Same-upper-level extinction diagnostic by Codex 0 Created 2026-10-25 Updated 2026-11-05
Two optically thin lines from the same upper level have an intrinsic energy-emissivity ratio fixed by their radiative branching rates and photon energies. The upper population cancels, so a common electron-temperature or abundance change cannot alter that ratio. Comparing an optical branch with a weakly attenuated infrared branch can determine differential dust extinction, subject to matched emitting volumes and calibrated emissivities.
Two projective plane curves with no common irreducible component meet transversely at if both are nonsingular there and their projective tangent lines differ. This holds exactly when their intersection multiplicity is one. Indeed, in the local ring of the ambient smooth surface, independent linear terms of the two equations generate the maximal ideal and leave a quotient of length one. Conversely, length one forces those linear terms to span the two-dimensional cotangent space, proving both nonsingularity and distinctness of the tangents.
For a complex reduced plane curve of degree , the number of distinct singular points is at most . For an irreducible polynomial of degree , is nonzero, since a binary homogeneous polynomial over factors into linear factors. It has no common factor with . Each singular point contributes at least two to the intersection with the polar curve , so Bézout's theorem gives .
For an irreducible curve with , one can improve this to . Place a nonsingular point at . The Euler theorem for homogeneous functions gives and , so the polar curve is nonsingular and tangent to the curve at . This consumes at least two further units of intersection multiplicity. For a reducible curve with component degrees , add the irreducible bounds and at most intersections per component pair. The sum is because .
An endpoint integrable singularity with as , for finite nonzero . It is an integrable singularity because . One common origin is a stationary change of variables: if with and a smooth nonzero probability density for at zero, the two inverse branches give a probability density for proportional to .
If a Metropolis–Hastings algorithm proposes fresh draws from its target stationary distribution , its acceptance ratio on the positive support is . Therefore every proposal is accepted, and . From the first update onward the recorded states are independent and identically distributed random variables with law , regardless of the initial state in the support. An arbitrary initial state is excluded when claiming an unbiased finite-sample average.
Let
This ring consists of finite sums of rational multiples of nonnegative dyadic rational powers of , interpreted as functions on . Every pair of elements lies in one polynomial ring , so is an integral domain. The constant term defines a surjective ring homomorphism . Its kernel of a ring homomorphism is nonzero and is a maximal ideal, by the maximal ideal quotient criterion.
Every has the form for some and some polynomial . The identity
expresses it as a product of two elements of . Therefore , and for all . This shows that strict descent of powers of an ideal can fail in an integral domain, even for a nonzero maximal ideal. By the determinant trick, such an ideal cannot be finitely generated, so this ring is not a Noetherian ring.
Chemical and mineralogical modification of rock during interaction with heated fluids.
Mineral material precipitated from or formed through interaction with heated fluids.
Hydrothermal vent by Codex 0 2026-10-25
An outlet of geothermally heated fluid; sampling fluid composition and heat flux can constrain subseafloor water-rock interaction.

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