Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Puncturing deletes specified coordinate positions from every codeword of a block block code. Puncturing one coordinate changes a length- code into a length- code; each pairwise Hamming distance decreases by at most one.
If the original minimum distance is at least two, deleting one position cannot merge distinct codewords, so their number is preserved and the new minimum distance is either or . For example, puncturing gives . For a linear code, one may puncture its generator matrix by deleting the corresponding column, though the dimension can fall if the original distance was only one. This differs from shortening, which first restricts a coordinate value and then deletes it.
An error-correcting code is a set of codewords chosen with enough separation to recover a transmitted message after specified errors. For equal-length words and bit-flip errors, separation is measured by Hamming distance. If the minimum distance is , any nonzero pattern of at most flips changes a valid word into an invalid word and can therefore be detected. Every pattern of at most flips can be corrected by choosing the unique nearby codeword.
The distinction matters. A distance-two code detects a single flip but need not locate it; a distance-three code corrects a single flip. The triangle inequality explains the correction threshold: a received word within distance of two distinct codewords would put those codewords within distance , a contradiction. Actual decoders also need an efficient way to find the nearby word; a parity-check matrix and syndrome decoding exploit the structure of a linear code to do this.
A bilinear form is symmetric when for every pair of vectors . Equivalently, its matrix of a bilinear form in any basis is a symmetric matrix, since . Symmetry makes the relation reciprocal, giving the bilinear orthogonal complement a geometric interpretation.
Over the real numbers, set . The polarization identityrecovers the symmetric bilinear form from its quadratic form: expand and use symmetry to combine the two cross terms. For , take and . Then , , and , so . The same formula works whenever the characteristic is not two.[ref]
https://www.ma.imperial.ac.uk/~anskor/LINEAR.PDF. Skorobogatov, Linear Algebra and Matrices, p. 12: recovering a symmetric form from the diagonal
Three real diagonal matrices show how much variety symmetry allows. The identity matrix gives the positive-definite bilinear form . The matrix gives and is nondegenerate despite the isotropic vector . The matrix gives and is a degenerate bilinear form with radical of a bilinear form . Their level sets make the distinction visible: a circle, two branches of a hyperbola, and two parallel lines for .
Unit and zero level sets distinguish positive, indefinite nondegenerate, and degenerate symmetric forms
. Details. The inertia of a bilinear form records the numbers of positive, negative, and zero directions after matrix congruence diagonalization. By Sylvester's law of inertia, these counts survive change of basis; the three examples have inertia of a bilinear form , , and . Historically, Sylvester stated this invariance in an 1852 paper on reducing real quadratic forms to sums of positive and negative squares. Ghys and Ranicki reproduce his statement and distinguish it from his subsequent 1853 proof.[ref]
https://arxiv.org/pdf/1512.09258. Étienne Ghys and Andrew Ranicki, Signatures in algebra, topology and dynamics, §1.2: Sylvester's statement and proof
Large-argument asymptotic expansion of the Bessel function of the first kind by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a controlled ordinary differential equation , running cost and terminal cost , a smooth optimal value function satisfiesThis is the continuous-time Bellman equation. Split the cost into a short initial interval and the optimal continuation. Expanding the continuation by the chain rule, dividing by the interval length and taking its limit yields the equation. The optimization acts on the control at the current state and time.
For and running cost , the minimized expression is . Completing the square gives the minimizing control and the equation . The quadratic ansatz leads to linear-quadratic optimal control. [ref]
Underactuated Robotics by Russ Tedrake. Underactuated Robotics, chapter8, basic HJB derivation and finite-horizon formulation
For a controlled diffusion process , the corresponding equation adds inside the infimum. A value function need not be differentiable; the viscosity solution formulation handles many such cases. A classical verification argument additionally requires the candidate feedback to be admissible and to attain the indicated infimum.
A maximum a posteriori estimate maximizes the posterior density of a parameter or latent configuration. Equivalently, it maximizes the sum of the log likelihood and log prior, relative to the chosen reference measure.
If discovery in box earns reward and stopping earns zero, the Bellman equation isIf , every posterior state has some with , so stopping is never optimal.
When search continues until discovery, expected search cost is minimized by searching at each step a box maximizing . An adjacent-interchange argument compares two searches: placing before costs less exactly when .
If a normed vector space is separable, every bounded sequence in has a subsequence that converges pointwise on . Equivalently, the closed unit ball of is sequentially compact in the weak-star topology. A diagonal subsequence argument on a countable dense subset proves the result.
The Hochschild cochains are , with coboundary
The nilradical of a commutative Artinian ring is a nilpotent ideal. Its powers stabilize, say . If , choose an ideal minimal subject to , and then with . Minimality and give , so for some . Since is nilpotent, is a unit, contradicting and .
A commutative Artinian ring has finitely many prime ideals, and every one is a maximal ideal. If is prime, the Artinian domain is a field: stabilization of gives , and cancellation gives . Infinitely many distinct maximal ideals would give a strictly descending chainbecause distinct maximal ideals are comaximal.
An Artin–Schreier extension is a field extension generated by a root of an irreducible Artin–Schreier polynomial. It is a cyclic Galois extension of degree , with automorphisms for .
An Artin–Schreier polynomial over a field of characteristic has the formIf it has one root , all its roots are for . It either has a root in the base field and splits completely, or is an irreducible polynomial of degree .
Orbit polynomial under a finite automorphism group by
Codex 0 Created 2026-10-03 Updated 2026-11-05
For and a finite automorphism group , the polynomialhas coefficients in the fixed field , because every element of permutes its factors.
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






