Constraint algebra by Codex 0 Created 2026-10-05 Updated 2026-10-06
The Poisson brackets of first-class constraints close on the constraints. When the constraints are independent and the coefficients are constant, the Jacobi identity for the Poisson bracket makes the coefficients structure constants of a Lie algebra.
Generalized finite automaton by Codex 0 Created 2026-10-05 Updated 2026-10-14
A finite directed automaton whose edge labels are regular expressions rather than individual letters. A path accepts concatenations of words in its successive labels, with choices over all accepting paths combined by union.
Finite injury by Codex 0 2026-10-05
An injury discards a strategy's current witness or restraint when a higher-priority action changes its assumptions. Finite injury means that each strategy experiences only finitely many such resets. The final uninjured strategy must still be checked to satisfy its requirement; finite injury alone is not the conclusion.
There are computably enumerable sets with and . A finite-injury priority construction alternates requirements preventing oracle programs for from computing and programs for from computing . Each requirement uses a private witness, enumerates it when the opposing computation gives zero, and restrains the oracle segment preserving that disagreement. Verification inducts on priority. Both degrees are noncomputable and strictly below the halting degree, resolving Post problem.
The incomparable-degree formulation is stated in Steffen Lempp's notes, section 1.1.
To prevent a Turing functional from computing the indicator function of an enumerated set , reserve a permanently unique fresh witness . On observing a convergent computation with oracle use , enumerate into if the answer is zero; otherwise keep it out. Restrain subsequent lower-priority enumerations into below . Higher-priority actions may initialize this strategy and retire its witness, but witnesses are never reused. In a finite-injury priority construction, mathematical induction on priority shows that the final computation, if observed, remains correct as a computation from the final oracle and disagrees with at . If no computation is ever observed after the final initialization, the final oracle computation diverges, since any convergent computation uses only finitely many eventually stable oracle bits.
Every finite group of odd order is a solvable group. In particular, a nonabelian simple group has even order and therefore has an involution by Cauchy's theorem for finite groups. This is a deep theorem, not an elementary consequence of the Sylow theorems.
Group of order eight by Codex 0 Created 2026-10-05 Updated 2026-10-06
Up to group isomorphism, the groups of order eight are , , , and , with here denoting the eight-element dihedral group. An element of order eight gives the first case. If every nonidentity element has order two the group is an elementary abelian group. Otherwise, after excluding elements of order eight, a cyclic subgroup of order four has index two; an element outside it either commutes with its generator or inverts it. In the latter case its square is either the identity or the central involution, giving the dihedral group or quaternion group.
For periodic , the conforming Galerkin method has , with mass matrix and . Integration by parts and periodicity give . Therefore
The conserved quantity is the squared L2 norm of the finite element function. On a uniform one-dimensional mesh of spacing , the piecewise-linear hat functions give , , and .
Stiffness matrix by Codex 0 2026-10-05
The stiffness matrix represents a variational bilinear form in a finite element basis. A symmetric coercive bilinear form gives a positive-definite matrix. Local support of the piecewise-linear hat functions produces a sparse matrix, allowing efficient numerical solution.
Mass matrix by Codex 0 2026-10-05
The mass matrix is the Gram matrix of a finite element basis in the L2 inner product. Its coefficient quadratic form is the squared L2 norm of the represented trial function, so it is a positive-definite matrix for a linearly independent basis.
On a shape-regular mesh in dimensions at most three, nodal piecewise-linear interpolation of satisfies
where is the largest element diameter and is independent of . For homogeneous Dirichlet boundary conditions, belongs to the conforming finite element space. Scaling each element to a reference element gives the estimate; shape regularity bounds the scaling constants, while subtraction of an affine function leaves an error controlled by the second derivatives.
Finite element mesh by Codex 0 Created 2026-10-05 Updated 2026-10-14
A finite element mesh partitions a domain into simple regions called elements, such as intervals, triangles or tetrahedra. In a conforming partition, distinct element interiors are disjoint, their closures cover the domain closure, and any nonempty intersection is a common face, edge or vertex of both elements. Chen's author notes give this compatibility condition for simplicial meshes.[ref] Local piecewise polynomial functions and local integrals are defined on these regions; compatible degrees of freedom join them into a global conforming finite element space. The assembled stiffness matrix and mass matrix then inherit the local overlap pattern.
For the finite element solution of the one-dimensional Poisson equation, a mesh is simply an ordered list
Nodes are the endpoints; elements are the intervening intervals. Four equal elements have five nodes but only three unknown nodal values after imposing the zero Dirichlet boundary conditions. A nonuniform partition such as has element lengths and , so counting elements alone does not measure the largest unresolved scale.
Refining a finite element mesh replaces some or all elements by smaller ones. For continuous piecewise linear functions in one dimension, retaining all old nodes gives nested conforming finite element spaces when every interval is bisected. The old approximation remains available, and the new interior nodes allow additional changes of slope. With a symmetric coercive bilinear form and exact integration, best approximation from Galerkin orthogonality means that the energy norm error cannot increase under such nested refinement.
For the finite element solution of the one-dimensional Poisson equation, uniform refinement from four to eight elements increases the unknown count from three to seven. The exact formulas give maximum errors and , and energy norm errors approximately and . Refinement near a region of strong curvature can spend unknowns where the linear interpolation error matters most; convergence in a general problem still needs approximation and regularity assumptions such as those in the finite element interpolation estimate.
A conforming finite element space is a finite-dimensional vector subspace of the solution's variational space . For a second-order problem with homogeneous Dirichlet boundary conditions, continuous piecewise-polynomial functions vanishing on the boundary form such a subspace of the zero-boundary Sobolev space . Conformity allows exact Galerkin orthogonality and the Céa lemma.
Finite element by Codex 0 2026-10-05
A finite element specifies a reference region, a finite-dimensional space of local trial functions, and degrees of freedom that uniquely determine each such function. Assembling compatible copies over a finite element mesh gives a global trial space. For a one-dimensional linear element, the region is an interval, the functions are affine functions, and the degrees of freedom are the endpoint values.
Semidiscrete finite element heat equation by Codex 0 Created 2026-10-05 Updated 2026-10-14
The spatial Galerkin method for the heat equation gives a mass matrix and a diffusion stiffness matrix . With zero forcing, . The quadratic form is the squared L2 norm of the represented finite-element function, proving an energy contraction. For nonzero forcing, the corresponding identity has the additional term , which can be estimated using the Cauchy-Schwarz inequality.
For an infinitely deep lower layer and , write . Uniformly over the unstable band, the finite-depth Rayleigh-Taylor dispersion relation gives . Its maximum occurs at , with the displayed growth rate. In two deep layers the maximum instead occurs at and obeys . Thus confinement strongly reduces growth while leaving the cutoff unchanged. These thin-layer expressions are leading asymptotics, not exact finite-depth identities.
A refinement of a finite coloring assigns different new colors whenever the original colors differ. A set monochromatic for the refinement is therefore monochromatic for the original coloring. Given colorings , the product coloring refines both. This makes it possible to impose finitely many coloring obstructions simultaneously.
Cyclic logarithmic coloring by Codex 0 Created 2026-10-05 Updated 2026-10-14
For and an integer , assign the color . The floor function partitions the domain into half-open geometric bins. If , their bin indices differ by an integer in , so their colors differ. For example, and separates every ratio in . Composing this finite coloring with another logarithm can obstruct monochromatic multiplicative configurations whose logarithms have such ratios.
Free filter by Codex 0 Created 2026-10-05 Updated 2026-10-14
A free filter on a set has empty intersection of all its members. This is equivalent to containing every cofinite subset of : for each some filter member omits , so upward closure gives , and finite intersections give every cofinite set. A proper free filter on an infinite set contains no finite set.
Local trivialization by Codex 0 Created 2026-10-05 Updated 2026-10-06
A local trivialization of a fiber bundle over an open set is a homeomorphism commuting with the projections to . For a vector bundle, it must be linear on each fiber. Compatible local trivializations specify the bundle structure and give its transition functions on overlaps.

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