In a full regular minimal exponential family, a finite maximum-likelihood estimator exists precisely when the observed sufficient-statistic mean is in the interior of the convex support of an exponential family. It is unique because the log likelihood is strictly concave. For an interior mean, positive base-measure mass near finitely many support points surrounding the mean makes grow at least linearly as . At a finite boundary of the full open natural domain, the normalizing integral diverges. Thus the likelihood attains its maximum in the domain. On a boundary face, no finite parameter can have the required mean. A regular restriction should instead use the exact mean-image criterion. These full-family conventions are also discussed in Geyer's exponential-family lecture notes.
For an adjunction , applying to its standard counit presentation gives , split by the monad units. Reflection therefore makes every counit presentation a coequalizer and gives full faithfulness by descent. Conversely, monad algebra forgetful functor creates split coequalizers makes an existing G-split quotient a coequalizer in the Eilenberg-Moore category. Fullness and faithfulness of the comparison lift its universal factorization back to the original category.
A quasistatic approximation to the solute field neglects its perturbation time derivative while retaining the interface motion in the solute balance. For steady pulling, a lateral wavenumber then has decaying exponent . It is justified when the interface growth time is long compared with the relevant solute diffusion time. Fixing the thermal field does not by itself impose this solutal timescale ordering.
In an equal-density, no-slip lubrication approximation, repulsive disjoining pressure sustains a premelting film of thickness beneath a rigid disk of radius . With imposed radial undercooling , local thermomolecular pressure is , and . A constant vertical lifting rate requires inward volume flux . Integrating the resulting lubrication pressure and disk force balance gives the displayed rate, where is the apparent load, is liquid dynamic viscosity, is specific latent heat, and is the absolute bulk melting temperature. Positive lifting requires . For fixed positive load, the rate rises from zero at that threshold towards as undercooling increases. That plateau is an asymptotic limit within this constitutive model, not a claim that continuum-film physics persists at arbitrarily low temperatures.
Odd-order group conjugacy-class congruence by Codex 0 Created 2026-10-14 Updated 2026-10-18
An odd-order finite group has only odd irreducible degrees, by irreducible character degree divides the group order. Its nontrivial characters occur in distinct conjugate pairs, by the Frobenius-Schur indicator. Therefore is a sum of pairs with odd. Since , each pair is divisible by sixteen. Here is the number of conjugacy classes.
For a Frobenius complement , a class function with satisfies . For each nontrivial of degree , the virtual character has norm one and positive degree by Frobenius reciprocity. It is therefore irreducible, restricts to and is identically on the candidate kernel . The intersection of the kernels of these characters is exactly : outside , separation follows from the character of the regular representation of . This proves normality; and then give the semidirect product.
Commutator bijection from a fixed-point-free automorphism by Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be a finite group and an automorphism whose only fixed element is the identity. If , then , so . The displayed map is therefore a bijection. For conjugation by a nonidentity element of a Frobenius complement, it gives the commutator map .
Frobenius kernel criterion by irreducible induction by Codex 0 Created 2026-10-14 Updated 2026-11-05
For proper, the displayed condition is equivalent to being a Frobenius kernel. For a normal subgroup the induction norm is . Trivial inertia for each nonprincipal character and Brauer's permutation lemma imply that every element outside has trivial centralizer in . This forces to be a normal Hall subgroup; a complement is then fixed-point-free on .
Lang theorem for algebraic groups by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a connected smooth algebraic group defined over a finite field, work over its algebraic closure and let be the finite-field Frobenius. Then the Lang map is surjective. One proof uses the twisted action . Since , every orbit map has surjective differential, so each orbit is open; connectedness leaves only one orbit. The same differential calculation makes the Lang map étale, with finite fibres equal to left cosets of .
Let a monic integer polynomial have distinct roots in its splitting field. Outside the finitely many primes dividing its polynomial discriminant or ramifying in that field, its roots reduce to distinct residue roots. The Frobenius automorphism permutes them by ; a reduced root belongs to exactly when it is fixed. Distinctness of reduction identifies this with a fixed root of the Galois permutation itself. Combining this observation with a derangement in a transitive group action and the Chebotarev density theorem proves that an irreducible polynomial of degree at least two has rootless reduction at a positive Dirichlet density of primes. The degree bound is essential: every monic linear integer polynomial has a root modulo every prime.
If a Freiman 2-isomorphism into uses minimal , every nonzero vector lies in the fourfold sumset. Otherwise quotienting by the line it spans would preserve all additive quadruple relations and would still be injective, contradicting minimality. Since zero also belongs to the fourfold sumset, that sumset is the full model group. Plünnecke-Ruzsa inequality then bounds its size by . A finite subset of the direct sum of countably many binary fields has a finite-dimensional model to start with.
For planar strong anchoring and a quarter-turn base profile, and . Expanding the one-dimensional twisted nematic energy through quadratic order gives . The lowest zero-endpoint mode is . Its coefficient vanishes at the displayed threshold, with , provided the bracket and anisotropy are positive. Halving the electric coupling doubles .
For a Neumann screen on the negative horizontal axis, the Helmholtz equation has an exact solution in Fresnel integrals. With time dependence , a wave incident from angle has total field , where and . The angular derivatives cancel on both faces of the screen. Away from the two shadow boundaries, the Fresnel tail expansion splits this into incident/reflected geometrical optics fields and an outgoing edge wave proportional to .
Normal form for free groups and free product of groups by Codex 0 Created 2026-10-14 Updated 2026-11-05
In a free group, a reduced word has no adjacent inverse letters. Successively cancelling such pairs gives the unique reduced representative in the chosen free generators. In a free product, a reduced word instead uses nonidentity factor elements as syllables in a free product, with consecutive syllables in a free product from different factors; the alternating syllables in a free product are unique.
For an amalgamated free product , the usual reduced form relative to a common subgroup requires the maps and to be injective. Chosen representatives of cosets then distinguish the alternating factors and the remaining common-subgroup element. The exact form depends on the chosen left/right representative convention.
For general group pushouts defined by arbitrary homomorphisms, factors can collapse and this embedded-subgroup normal form is unavailable. For example, take , map identically into , and map it trivially into . The pushout kills all of and is isomorphic to , so words in nonidentity elements of cannot retain the usual nontrivial-factor normal form.
Free factor by Codex 0 2026-10-14
A subgroup is a free factor of if is isomorphic to a free product by an isomorphism restricting to the inclusion of , for some subgroup . The normal form theorem for a free product ensures that both factors embed. A free factor need not be a normal subgroup.
Effective cyclic membership in a free product by Codex 0 Created 2026-10-14 Updated 2026-10-31
Suppose has a soluble word problem for a group and generates an infinite cyclic group. In , for the words and are cyclically reduced with two and four syllables respectively. Their nonzero powers have syllable lengths and . Given an input's reduced free product form, its length bounds the possible exponents; compare the finitely many candidates using the base word algorithm. Membership and the exponent in each of these infinite cyclic subgroups are therefore computable, with no algorithm for the order of required.
A finite generating set and finitely many relators in a free pro-p group, divided out by their closed normal closure. Relators are elements of the free pro-p group; they need not be finite ordinary words. A pro-p group with such a presentation is finitely presented in the pro- category.
Embed a free pro-p group on into the units of the noncommutative power-series algebra by . Its Magnus degree is the lowest total degree occurring in , with . Since in characteristic , one has . High powers therefore impose relations with small weight at any fixed parameter .
Writing the characteristic equation with reciprocal hyperbolic cosine avoids exponentially large products. For the positive roots indexed from one, . The apparent root at zero represents the separate affine kernel, not another positive bending mode. Evaluating hyperbolic pieces of high modes with decaying exponential forms also avoids cancellation.
For bounded operators with trace-class commutator, the multiplicative commutator differs from identity by a trace-class operator. Along , the trace of its logarithmic derivative is the constant . This follows by writing as the integral of conjugates of and using trace invariance under bounded similarities. Integrating the Fredholm determinant derivative from proves the formula. Individual traces of and need not exist.

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