Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Let be a finite unramified extension of complete fields with a Non-Archimedean absolute value, with separable residue extension and . If is integral and its residue generates , then form a -basis. Divide any nonzero combination by a coefficient of largest absolute value. Its remaining coefficients are integral, at least one is a unit, and the residue-basis independence makes the reduction nonzero. The displayed norm formula follows. In particular, the combination is integral exactly when every coefficient is integral, proving without requiring a discrete valuation.
Cyclic quartic local extension without a totally ramified complement by
Codex 0 Created 2026-10-14 Updated 2026-11-05
Let , with , and . The extension is unramified quadratic, whereas is totally ramified quadratic over , by the Eisenstein polynomial . Also , so . The Hensel lemma gives with . Put ; then and . Consequently , defines an automorphism whose square fixes and negates . It generates the cyclic Galois group of order four. Its unique quadratic subfield is , which is unramified. A decomposition as an unramified field and a totally ramified field would require a totally ramified quadratic subfield, and therefore cannot exist.
A universal-existential sentence has a universal block followed by an existential block and a quantifier-free formula. Such axioms are preserved under unions of chains of structures: the universally chosen tuple occurs in one stage, whose existential witnesses remain in the union. An inductive first-order theory has an axiomatization by these sentences.
Label the vertices of a universal countable uniform hypergraph by the natural numbers and remove the largest vertex of each hyperedge. The resulting -uniform hypergraph is complete. For any prescribed -set , apply the hypergraph extension property to a finite initial segment containing , prescribing that extend to an edge. The resulting vertex is larger than every member of , so this deletion produces . This supplies a useful example of a projection that destroys the nonedge information of a random structure.
A Hamiltonian operator has perfect transfer between basis states at time if for a known global phase . In an excitation-conserving qubit network whose vacuum is fixed, the initial product state with at site and zeros elsewhere evolves to . A local phase gate at removing restores the unknown qubit there. This explains why transfer of the single-excitation basis state suffices for qubit transfer when the vacuum phase is also accounted for.
Two operators on Hilbert spaces are unitarily equivalent if a unitary operator maps their operator domains onto one another and intertwines their actions. Their spectra and eigenvalue multiplicities then agree. For nonnegative self-adjoint operators it suffices that the unitary maps their closed quadratic form domains onto one another and preserves the forms, since the associated operator is determined by the form.
For a real orthogonal gauge group representation, the tangent vectors to the vacuum orbit are . Choose an independent basis of these vectors. Under an infinitesimal gauge transformation, the derivative of the displayed slice conditions with respect to the broken gauge parameters is the Gram matrix . It is invertible on the independent tangent directions, so the implicit function theorem selects this unitary gauge locally near the vacuum. The remaining scalar fluctuations are orthogonal to the gauge orbit, and their derivative has no quadratic mixing with the massive gauge fields. The statement is local and does not assert a global gauge slice through zeros of the scalar field.
On an oriented Riemannian surface, set , , and let be the Levi-Civita connection form with . The dual frame is andIn a local oriented frame, and are the base coframe rotated through angle ; the torsion-free and curvature equations give these identities. Evaluating exterior derivatives on dual fields yields , , .
A fundamental cell of a Bravais lattice, of volume equal to the absolute determinant of any primitive lattice basis. Direct and reciprocal lattice primitive cell volumes multiply to in dimension with the angular-wavenumber convention.
For a connected infinite locally finite graph that is also an amenable graph and a quasi-transitive graph, an invariant independent site percolation law with every orbit parameter strictly between and has either no infinite percolation cluster or exactly one, almost surely. Invariance and independence give a zero–one law. The finite-energy property of Bernoulli percolation excludes a fixed finite number greater than one by opening a finite joining region. Infinitely many clusters would create an encounter box in percolation with positive probability; translated disjoint boxes then have positive density, contradicting the boundary count in a Følner sequence. The finite-energy hypothesis matters if some orbit parameters are or .
A tight sequence of probability measures on the real line has a subsequence whose cumulative distribution functions converge at every continuity point of a cumulative distribution function. Choose a diagonal subsequence converging at every rational , write those limits as , and define . Monotonicity gives right continuity, and tightness of probability measures gives limits zero and one at the two ends of the real line. Bracketing by rational continuity approximations proves convergence at the continuity points of . The corresponding probability measure is the weak subsequential limit: approximate a bounded continuous test function by step functions on a compact interval, and use tightness to bound the tails.
The Lie algebra of a uniform pro-p group construction and BCH convergence on a powerful Lie lattice are mutually inverse on objects and morphisms. On the group side morphisms are continuous group homomorphisms; on the lattice side they are linear Lie algebra homomorphisms over the p-adic integers. A group homomorphism respects powers, roots and limits, and a Lie homomorphism respects every convergent Baker--Campbell--Hausdorff formula term.
The Lie algebra of a uniform pro-p group construction and BCH convergence on a powerful Lie lattice are mutually inverse on objects and morphisms. On the group side morphisms are continuous group homomorphisms; on the lattice side they are linear Lie algebra homomorphisms over the p-adic integers. A group homomorphism respects powers, roots and limits, and a Lie homomorphism respects every convergent Baker--Campbell--Hausdorff formula term.
For a uniform pro-p group, the power map is a homeomorphism onto . Transport multiplication back to byUnique roots make this an associative group operation. For odd , group commutator collection gives and . The operations converge to addition in the Lie algebra of a uniform pro-p group.
For a uniform pro-p group with , the map transports congruences byCommutator collection gives for , and the power map is an isomorphism . Thus a nontrivial first difference moves down exactly one layer when taking a th power. Iterating gives the equivalence; completeness supplies unique roots when the congruence is read in reverse.
Every uniform pro-p group embeds continuously in for some finite . Apply the Ado theorem to and choose a deep power lattice whose representing matrices lie in , or at . The matrix exponential and logarithm give a faithful representation of the corresponding open normal power subgroup. Induce that representation to the whole group using its finitely many cosets. An element outside the open subgroup permutes the coset blocks nontrivially; an element inside it is detected by the original representation. Thus the induced representation is faithful. All block matrices preserve a finite free -module, giving the integral embedding.
For odd and a finitely generated powerful pro-p group, put . The displayed group homomorphisms are surjective. If one has a nonzero kernel, choose with . Successive corrections , with , cancel its -th power one layer at a time, using . Compactness and the separated power filtration give a nonidentity limit of order . Thus a torsion-free group has constant layer indices and is a uniform pro-p group. Conversely constant indices make every displayed map injective; comparison at the first differing power layer proves that is injective, so there is no nontrivial torsion.
For an odd prime , the matrix logarithm and matrix exponential are inverse maps between and . They imply that the th-power map carries bijectively onto . Direct multiplication gives , so the group is a powerful pro-p group. The quotient is the additive matrix space over , with constant index . The matrices topologically generate, by successive approximation through these quotients. The lower p-series is exactly , so the group is a uniform pro-p group and a torsion-free group. At the first congruence subgroup contains and is not uniform.
Suppose and at increasing sites satisfying the Schoenberg–Whitney theorem conditions. For the B-spline collocation matrix , the coefficient linear functional in the dual basis is . Therefore . The checkerboard inverse of a totally nonnegative matrix makes , attaining that bound. Since ,The conclusion is an extremal property of an alternating unit-norm spline, not a claim that every bounded spline has these extremal coefficients.
For a nonnegative partition-normalized B-spline basis, the synthesis linear map has operator norm one. Its condition number is consequently , with the supremum norm on the spline space and the maximum norm on its coefficients. The uniform-norm stability of a B-spline basis bounds this number independently of the spline knot sequence when the order is fixed. This is different from the condition number of a particular sampled B-spline collocation matrix.
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





