Circles are fundamental shapes in geometry, and several important theorems govern their properties and behaviors. Here are some key theorems about circles: 1. **Circumference Theorem**: The circumference \( C \) of a circle is given by the formula: \[ C = 2\pi r \] where \( r \) is the radius of the circle.
The Mermin-Wagner theorem is a result in statistical mechanics and condensed matter physics that addresses the behavior of certain types of physical systems at low temperatures, specifically those defined by continuous symmetry. The theorem, which was formulated by N. D. Mermin and H. Wagner in the 1960s, states that in two-dimensional systems with continuous symmetry, spontaneous symmetry breaking and long-range order cannot occur at finite temperatures.
Helmholtz's theorems, named after the German physicist Hermann von Helmholtz, are fundamental results in the fields of fluid dynamics and vector calculus, particularly concerning the representation of vector fields.
The Generalized Helmholtz theorem is an extension of the classical Helmholtz decomposition theorem, which provides a framework for decomposing vector fields into different components based on their properties. The theorem states that any sufficiently smooth vector field in three-dimensional space can be expressed as the sum of an irrotational (curl-free) vector field and a solenoidal (divergence-free) vector field.
The Edge-of-the-Wedge theorem is a concept from complex analysis, specifically regarding holomorphic functions. It deals with the behavior of these functions on regions in the complex plane that have "wedge-shaped" domains.
In quantum mechanics, theorems are formal statements that can be proven based on a set of axioms and previously established results. These theorems provide foundational insights into the behavior of quantum systems and the mathematical framework that describes them. Here are several important theorems in quantum mechanics: 1. **Born Rule**: This theorem states that the probability of finding a quantum system in a particular state upon measurement is given by the square of the amplitude of the state's wave function.
Witt's theorem is an important result in the theory of quadratic forms in mathematics, specifically in the context of algebraic groups and linear algebra over fields. It provides a characterization of the equivalence of quadratic forms over fields. In simpler terms, Witt's theorem states that any two non-degenerate quadratic forms over a field can be transformed into each other by means of an appropriate change of variables, if and only if they have the same "Witt index" and the same "discriminant".
The Rank-Nullity Theorem is a fundamental result in linear algebra that relates the dimensions of different subspaces associated with a linear transformation. Specifically, it applies to linear transformations between finite-dimensional vector spaces.
The Principal Axis Theorem, often discussed in the context of linear algebra and quadratic forms, refers to a method of diagonalizing a symmetric matrix. This theorem states that for any real symmetric matrix, there exists an orthogonal matrix \(Q\) such that: \[ Q^T A Q = D \] where \(A\) is the symmetric matrix, \(Q\) is an orthogonal matrix (i.e.
MacMahon's Master Theorem is a mathematical tool used in the analysis of combinatorial structures, particularly in the enumeration of various combinatorial objects. While it's not as widely known as some other results in combinatorics, it provides a framework for counting partitions, arrangements, and related structures using generating functions. The theorem is named after the British mathematician Percy MacMahon, who made significant contributions to the theory of partitions and generating functions.
The Hawkins–Simon condition is a criterion used in economics, particularly in input-output analysis, to determine the feasibility of a production system. It is named after the economists R. J. Hawkins and R. L. Simon, who introduced this condition in the context of linear production models. In simple terms, the Hawkins–Simon condition states that a certain system of production can be sustained in equilibrium if the total inputs required for production do not exceed the total outputs available.
The Goddard–Thorn theorem is a result in the field of theoretical physics, particularly in string theory. It addresses the conditions under which certain types of models, specifically those involving extended objects or strings, can achieve a consistent description of physical phenomena. The theorem is named after physicists Peter Goddard and David Thorn, who developed it in the context of string theory in the early 1980s.
Cramer's Rule is a mathematical theorem used to solve systems of linear equations with as many equations as unknowns, provided that the system has a unique solution. It is applicable when the coefficient matrix is non-singular (i.e., its determinant is non-zero).
Chebotarev's theorem is a result in number theory that deals with the distribution of roots of unity in relation to polynomial equations over finite fields. Specifically, it is often associated with the density of certain classes of primes in number fields, but it can be stated in a context relevant to roots of unity.
In linear algebra, a lemma is a proven statement or proposition that is used as a stepping stone to prove larger or more complex theorems. Lemmas often simplify the process of proving more substantial results by breaking them down into manageable components. Here are a few key points regarding lemmas in linear algebra: 1. **Purpose**: Lemmas are typically used to establish intermediate results that help in the proof of a main theorem.
Wagner's theorem is a result in graph theory that provides a characterization of planar graphs. Specifically, it states that a graph is planar if and only if it does not contain a subgraph that is a subdivision of the complete graph \( K_{5} \) (the complete graph on five vertices) or a subdivision of the complete bipartite graph \( K_{3,3} \) (the complete bipartite graph with three vertices in each part).
Veblen's theorem is a result in the field of set theory and topology, specifically in the context of the study of properties of certain sets. It primarily deals with the concept of "well-ordering." The theorem states that every set can be well-ordered, meaning that its elements can be arranged in a sequence such that every non-empty subset has a least element.
Turán's theorem is a fundamental result in extremal graph theory that provides a bound on the number of edges in a graph that avoids complete subgraphs (cliques) of a given size. Specifically, it deals with the maximum number of edges that can be present in a graph with \( n \) vertices that does not contain a complete subgraph \( K_{r+1} \) (a complete graph on \( r+1 \) vertices).
The Strong Perfect Graph Theorem, proved by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas in 2006, establishes an important characterization of perfect graphs. The theorem states that a graph is perfect if and only if it contains no induced subgraph that is an odd cycle of length at least 5 or the complement of such a cycle (i.e., a complete graph minus an odd cycle).

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