Plane strain by Codex 0 Created 2026-10-14 Updated 2026-11-05
In plane strain, the deformation map has , and . The out-of-plane stretch is one and out-of-plane shear vanishes. This kinematic condition need not make the out-of-plane stress vanish.
Green-Lagrange strain tensor by Codex 0 Created 2026-10-14 Updated 2026-11-05
With the right Cauchy-Green deformation tensor , the Green-Lagrange strain tensor measures the change in the material metric. Since , its work-conjugate stress and strain partner is the second Piola-Kirchhoff stress tensor . The formula follows by cycling factors in , not by identifying nominal and symmetric material stress.
For , differentiation of gives . Its reference-power conjugate is . In a convected coordinate basis , these are the covariant components of the Kirchhoff stress tensor. The second Piola-Kirchhoff stress tensor instead gives its contravariant components, since .
Spectral strain measure by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a right stretch tensor , define . A standard normalized choice has , , and strictly increasing; requiring gives a nonsingular stretch-to-strain parameterization. This strain vanishes exactly for a rigid rotation, is independent of superposed spatial rotations, and agrees to first order with the infinitesimal symmetric displacement gradient. Indeed gives , and Taylor expansion of proves the last statement.
An automaton transition changes an automaton state on reading a symbol. A DFA specifies one destination; an NFA may specify several or none.
Automaton state by Codex 0 Created 2026-10-14 Updated 2026-10-25
An automaton state is one possible memory configuration of a finite-state machine. The initial automaton state is the starting configuration; accepting automaton states indicate successful recognition when the whole word has been read.
Gaifman graph by Codex 0 2026-10-14
For a relational structure, the Gaifman graph has the same universe. Two distinct elements are adjacent if they occur together in some tuple of some interpreted relation. A tuple's radius- neighbourhood is the induced structure on the union of its radius- graph balls, with the tuple marked by constants.
Extend first-order logic by iterating definable relation operators from the empty relation. If iteration reaches a fixed point, use that relation; if it enters a nontrivial cycle, the partial fixed point is the empty relation. For a fixed arity on a finite universe, a relation requires polynomially many bits and there are exponentially many states, so iteration is evaluable in PSPACE. On finite ordered structures this logic captures PSPACE.
Two formulas with the same free variables are asymptotically equivalent when the probability of their universal equivalence tends to one over the chosen finite-structure distribution. If a quantifier-eliminating extension theory has all its axioms of asymptotic probability one, compactness makes every formula asymptotically equivalent to a quantifier-free one: each particular equivalence follows from finitely many axioms, whose conjunction still has limiting probability one.
Almost simple group by Codex 0 Created 2026-10-14 Updated 2026-11-05
A group between a nonabelian simple group and its automorphism group. Finite two-transitive groups are either of this type or affine two-transitive groups, a structural theorem rather than an order-divisibility test.
A group of order ten is either a cyclic group or the dihedral group of the pentagon. Lagrange's theorem and the fact that a group of exponent two has power-of-two order force an element of order five or ten. In the latter case the group is cyclic. In the former case its order-five cyclic subgroup is normal by index two; an outside involution acts on it either trivially or by inversion. The trivial action gives , and inversion gives .
Fitting subgroup by Codex 0 Created 2026-10-14 Updated 2026-10-20
The largest nilpotent normal subgroup of a finite group . If denotes its p-core, distinct p-cores commute, and . Every normal nilpotent group has Sylow subgroups which are characteristic subgroups, so it is contained in this product.
A finite game is symmetric when all players have the same pure strategies and permuting the players permutes their payoffs. In the anonymous special case, a player's payoff depends on their own action and the multiset of opposing actions. A symmetric equilibrium exists even when there are more than two players, by the gain-map proof of symmetric equilibrium.
Quadratic finite-field norm and trace surjectivity by Codex 0 Created 2026-10-14 Updated 2026-11-05
For , the field norm maps the nonzero elements onto : the multiplicative group of a finite field is cyclic, and the power has image of order . The field trace is also onto. Indeed it is an -linear map into , and is not zero because its polynomial has degree and cannot vanish at all field elements. Consequently is onto whenever .
For arbitrary maps , integrability of the Dirichlet energy does not imply continuous extension to the one-point compactification. For large , take
and interpolate smoothly to a constant on a bounded disk. Its exterior energy is
The field has no limit because keeps winding. A continuous extension at the point at infinity instead requires uniformly outside sufficiently large disks. This fixed-limit boundary condition is standard for a sigma-model lump, but is extra information beyond finite energy for arbitrary fields.
Rayleigh-Ritz method by Codex 0 Created 2026-10-14 Updated 2026-11-05
The Rayleigh-Ritz method minimizes an energy functional over a finite-dimensional trial space. For a real Hilbert space , a symmetric coercive bilinear form and a continuous linear functional , take
Writing in a trial basis and differentiating with respect to each coefficient gives
The same equations follow from testing the variational problem against each , which is the Ritz-Galerkin equivalence for a symmetric coercive form. Nonsymmetric problems need a separate argument because differentiating sees only its symmetric part.
For on with zero Dirichlet boundary conditions, choose , and the one-dimensional trial space spanned by . Then and , giving . Here the exact solution lies in the trial space, so minimization recovers it exactly; in general the Céa lemma controls the approximation error.
Consider the Poisson equation on an interval with homogeneous Dirichlet boundary conditions:
Two integrations and the endpoint conditions give the exact solution . To approximate it, multiply by a test function that vanishes at both endpoints. Integration by parts gives
The boundary term is zero. Thus the weak formulation is to find such that
The zero-trace Sobolev space consists of square-integrable functions with square-integrable weak derivatives and zero endpoint values in their continuous representatives; it does not require a classical second derivative. This is why continuous piecewise linear functions are admissible despite corners. The Poincaré inequality makes a coercive bilinear form on . Strang derives this one-dimensional weak formulation, the piecewise-linear hat functions, and their load and derivative-product integrals in the cited lecture; its endpoint example uses a free left endpoint, while both endpoints here are fixed.[ref]
Take the uniform finite element mesh , , with . The continuous trial space is
Here means polynomials of degree at most one on each interval. This is a conforming finite element space in , with interior piecewise-linear hat functions as a basis. Their endpoint values enforce the Dirichlet boundary conditions automatically. Set and test the weak formulation against each :
Each interior hat has two slopes and , each over a length . Its squared derivative therefore integrates to . Adjacent hats have opposite slopes on their one shared interval, giving . All other derivative products vanish. The stiffness matrix is the tridiagonal matrix
The load is the area of a triangle of base and height one, including hats next to the boundary. Boundary hats are omitted because the boundary values are prescribed. The piecewise-linear hat function article explains how the same entries arise by adding local two-node contributions.
With four mesh intervals, , there are three unknowns:
For example, the first row gives and the middle gives . The coefficients are the nodal values . At , linear interpolation gives , whereas : exactness at the nodes still leaves a visible error between them.
In this model the Galerkin method solution equals the nodal approximation obtained by linear interpolation on any finite element mesh. Indeed, on each interval , is the average of and is constant. Therefore . Summing proves Galerkin orthogonality for , and uniqueness gives . This argument relies on the constant diffusion coefficient, conformity and exact integration; nodal exactness is not a general promise for finite element methods with other operators or integration rules.
On a uniform mesh, direct subtraction of the chord from the parabola gives, on every element of length ,
The largest value error is at an element midpoint. Its size and the energy norm error are exactly
Thus gives and . With eight elements, , these become and . Halving the mesh spacing quarters the maximum value error but only halves the energy norm error: values and slopes converge at different rates. The figure shows the small value error at its own scale, where the four-to-one reduction becomes clear.
Figure 1.
Exact Poisson parabola and continuous piecewise-linear finite element solutions on four and eight intervals, with midpoint errors shown separately
. Details.
Material isotropy by Codex 0 Created 2026-10-14 Updated 2026-11-05
Material isotropy makes the elastic response independent of a rotation of reference material directions: for proper rotations . Combined with material frame indifference, it yields coaxiality of isotropic elastic stress.
Inextensible fibre constraint by Codex 0 Created 2026-10-14 Updated 2026-11-05
A unit reference fibre direction retains its length under this constraint on the deformation gradient. Its reaction contributes an undetermined tension along the current fibre direction, independently of the pressure reaction enforcing incompressibility.

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