Tangent-line finite-field Kakeya construction by Codex 0 Created 2026-10-14 Updated 2026-11-05
Work in the affine plane over a finite field of odd characteristic. The union of the affine lines , for , contains a line of every finite slope. Completing the square gives
For a fixed , the union therefore contains exactly the values of for which is a square, including zero. Adding the vertical affine line completes all directions. The resulting finite-field Kakeya set has cardinality
Its density tends to one half as grows through odd prime powers. Geometrically the finite-slope lines are the tangents to the parabola , because the tangent at has the displayed equation.
Inside an algebraic closure, choose compatible roots . The fields exhaust all finite extensions by finite extensions of the complex Laurent series field. Restriction from a degree- field to a degree- field for sends an exponent modulo to its reduction modulo . The absolute Galois group is their inverse limit, namely the profinite completion of . This is a procyclic group, rather than the direct-limit torsion group of all complex roots of unity.
For a finite-dimensional Hermitian matrix , its spectral projection is the orthogonal projection onto the eigenspace for . In an orthonormal eigenbasis, the displayed sum is over every basis vector with that eigenvalue. The projection is independent of the choice of basis within a repeated eigenspace. For distinct eigenvalues ,
This is the spectral decomposition grouped by distinct eigenvalues: decompose a vector into orthogonal pieces, then scale each piece. For the matrix ,
Thus and : the two pieces add back to . Squaring the matrix simply squares each scalar, , and similarly the matrix exponential is . Spectral projections of a self-adjoint matrix turn repeated matrix calculations into scalar calculations on fixed vector subspaces.
Order of an element of a finite cyclic group by Codex 0 Created 2026-10-14 Updated 2026-10-18
For a positive integer and a congruence class in the additive finite cyclic group , the order of a group element is
Indeed, write , and . Returning to zero after steps means , equivalently . Since and are coprime, this holds exactly when ; the least positive such is . This argument also covers , since .
For , the orders of are respectively . The translation in a group has the same period from every starting element. Consequently its cycles each have length and there are of them. They are exactly the cosets of the cyclic subgroup generated by , which explains both the lengths and the number of components in the picture.
Hyperoctahedral group by Codex 0 Created 2026-10-14 Updated 2026-11-05
The signed symmetric group consists of permutations of commuting with sign change. It is the Coxeter group of type .
The longest element is the unique element of maximal Coxeter length in a finite Coxeter group. It is an involution and satisfies .
Cyclic group of order four and Klein four-group by Codex 0 Created 2026-10-14 Updated 2026-10-31
The finite cyclic group and the Klein four-group are both abelian groups of order four. In , composition is addition modulo four. In , label the elements and add each coordinate modulo two. For example, and .
Figure 1.
Two abelian groups of order four have different addition tables
. Each cell is the row element plus the column element. Diagonal cells record adding an element to itself. In , only and return to zero after two additions. In the Klein four-group, every diagonal cell is the identity element . The symmetric tables show commutativity, while the different doubling behavior distinguishes the groups. Details.
The order of a group element is preserved by a group isomorphism: an equation holds exactly when its image satisfies the same equation. In , both and have order four. In , each nonidentity element has order two. Hence these groups are not isomorphic, despite having the same order of a finite group. No relabelling can repair this discrepancy.
For a geometric model of , take the symmetries of a non-square rectangle: the identity element, reflection in its horizontal axis, reflection in its vertical axis, and rotation through . The two reflections commute, and their composite is the half-turn. Every nonidentity motion is its own inverse element. This makes the two binary switches concrete: choosing whether to apply each reflection specifies all four motions. The case of abelian groups of prime-square order generalizes this distinction from to any prime .
An ultrafilter on is normal when each function with on a -large set is constant on a -large subset. This is the small-subset version of normality; together with fineness and kappa-completeness it gives the measure characterization of a supercompact cardinal.
For a functor , precomposition by induces , hence a map of categorical connected components in the opposite direction to . This defines a presheaf on . Its category of elements is the intermediate category in the final-discrete-fibration factorization.
Two factorizations of one functor have a unique connecting functor in each direction, by the orthogonality of final functors and discrete fibrations. Their composites and the identity fill the same lifting square, so uniqueness makes both composites identities. The intermediate categories are therefore canonically isomorphic.
An almost commutative algebra over a field is an algebra with an exhaustive increasing nonnegative multiplicative filtration whose associated graded ring is commutative and finitely generated as an algebra over the field. A common presentation uses finitely many degree-one generators, scalar degree-zero part, and commutators that lower degree. The finite-generation requirement is essential: an infinitely generated commutative polynomial ring has commutative associated graded algebra but need not be Noetherian.
Rees ring of a filtered algebra by Codex 0 Created 2026-10-14 Updated 2026-11-05
For an exhaustive ascending multiplicative filtration with , its Rees ring contains the central element . The quotient by is the associated graded ring, and the quotient by is the original algebra. If , commutators of lifts are divisible by . Their first-order term defines the Poisson bracket from a central deformation parameter on the associated graded ring.
Consecutive Fibonacci numbers are coprime by the Euclidean algorithm. The Fibonacci addition formula writes for . Taking the greatest common divisor with removes the last summand, and multiplication by the coprime factor leaves that gcd unchanged. The case uses . Applying the Euclidean algorithm to the indices yields the strong-divisibility identity for nonnegative indices, with the usual zero conventions.
Mihailova subgroup by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a finite group presentation , let be the free group on its generators and . The corresponding fiber product of groups is generated by and . Conjugation by the diagonal pairs supplies every pair with in the normal closure of the relators, and proves the generating claim. Membership of is equivalent to in , so this finitely generated subgroup can have undecidable membership even though has soluble word problem.
The dimension of the fibre of a morphism locally at its source point : the maximum of the dimensions of the fibre's irreducible components through . This differs from the Krull dimension of the local ring at a nonclosed point.
An orthogonal structure is a reduction of the transition functions of a real rank- vector bundle to the orthogonal group. Its orthonormal frames define a fiber metric, independent of the chosen frame because orthogonal transitions preserve the inner product. Conversely a fiber metric gives smooth orthonormal frames by the Gram-Schmidt process, with orthogonal transition matrices. This equivalence does not require the vector bundle to be globally trivial.
For a fixed impermeable object, the Ffowcs Williams-Hawkings equation has a volume acoustic quadrupole and a surface acoustic dipole, with no mass-injection term. If is the total force exerted on the fluid and the integrated Lighthill stress tensor, the acoustic compact-source approximation in the acoustic far field gives the displayed pressure at retarded time. A force convention directed onto the body reverses the loading sign. The retarded acoustic Green function carries when the wave operator is .
Triplet charged-current closure on electromagnetic charge by Codex 0 Created 2026-10-14 Updated 2026-11-05
For normalized triplets and , let the raising matrix have ones in entries and . Its commutator with its adjoint is . Neutral mixing in leaves this result unchanged because . With current normalization using , fermionic bilinear charge algebra gives the displayed proportionality to the leptonic electric charge . Other current normalizations change the numerical prefactor, not closure. Equal-time algebra does not itself imply conservation of a fermionic weak charge in a symmetry-broken theory.
For a fixed pants decomposition of a closed genus- hyperbolic surface, its cuff lengths determine all its Y-pieces. Two suitably chosen transverse simple closed curves at each cuff, one obtained from the other by a Dehn twist, determine the corresponding twist: hyperbolic seam identities express their lengths through shifted hyperbolic cosines of that twist, removing the sign ambiguity of just one transversal. Thus finitely many marked lengths determine the Fenchel–Nielsen coordinates. The unmarked length spectrum lacks these labels, which is why this fact alone does not imply global spectral uniqueness.
After cutting a hyperbolic surface along a simple closed geodesic, reglue its two boundary copies after an arclength displacement . The boundary length remains fixed, while the Riemannian metric varies. In marked Fenchel–Nielsen coordinates, the twist is real-valued; changing it by one boundary length corresponds to a Dehn twist in the marking. This construction also applies to a hyperbolic pair of pants with a fixed cone angle and two geodesic boundaries.

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