|
Nielsen–Schreier Theorem
In group theory, a branch of mathematics, the Nielsen–Schreier theorem states that every subgroup of a free group is itself free. It is named after Jakob Nielsen and Otto Schreier. Statement of the theorem A free group may be defined from a group presentation consisting of a set of generators with no relations. That is, every element is a product of some sequence of generators and their inverses, but these elements do not obey any equations except those trivially following from = 1. The elements of a free group may be described as all possible reduced words, those strings of generators and their inverses in which no generator is adjacent to its own inverse. Two reduced words may be multiplied by concatenating them and then removing any generator-inverse pairs that result from the concatenation. The Nielsen–Schreier theorem states that if ''H'' is a subgroup of a free group ''G'', then ''H'' is itself isomorphic to a free group. That is, there exists a set ''S'' of elements ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also ce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Graph
In mathematics, a topological graph is a representation of a graph in the plane, where the ''vertices'' of the graph are represented by distinct points and the ''edges'' by Jordan arcs (connected pieces of ''Jordan curves'') joining the corresponding pairs of points. The points representing the vertices of a graph and the arcs representing its edges are called the ''vertices'' and the ''edges'' of the topological graph. It is usually assumed that any two edges of a topological graph cross a finite number of times, no edge passes through a vertex different from its endpoints, and no two edges touch each other (without crossing). A topological graph is also called a ''drawing'' of a graph. An important special class of topological graphs is the class of ''geometric graphs'', where the edges are represented by ''line segments''. (The term '' geometric graph'' is sometimes used in a broader, somewhat vague sense.) The theory of topological graphs is an area of graph theory, mainl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Dedekind
Julius Wilhelm Richard Dedekind (6 October 1831 – 12 February 1916) was a German mathematician who made important contributions to number theory, abstract algebra (particularly ring theory), and the axiomatic foundations of arithmetic. His best known contribution is the definition of real numbers through the notion of Dedekind cut. He is also considered a pioneer in the development of modern set theory and of the philosophy of mathematics known as ''Logicism''. Life Dedekind's father was Julius Levin Ulrich Dedekind, an administrator of Collegium Carolinum in Braunschweig. His mother was Caroline Henriette Dedekind (née Emperius), the daughter of a professor at the Collegium. Richard Dedekind had three older siblings. As an adult, he never used the names Julius Wilhelm. He was born in Braunschweig (often called "Brunswick" in English), which is where he lived most of his life and died. He first attended the Collegium Carolinum in 1848 before transferring to the University ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nonabelian Group
In mathematics, and specifically in group theory, a non-abelian group, sometimes called a non-commutative group, is a group (''G'', ∗) in which there exists at least one pair of elements ''a'' and ''b'' of ''G'', such that ''a'' ∗ ''b'' ≠ ''b'' ∗ ''a''. This class of groups contrasts with the abelian groups. (In an abelian group, all pairs of group elements commute). Non-abelian groups are pervasive in mathematics and physics. One of the simplest examples of a non-abelian group is the dihedral group of order 6. It is the smallest finite non-abelian group. A common example from physics is the rotation group SO(3) in three dimensions (for example, rotating something 90 degrees along one axis and then 90 degrees along a different axis is not the same as doing them in reverse order). Both discrete groups and continuous groups may be non-abelian. Most of the interesting Lie groups are non-abelian, and these play an important role in gauge theory. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zermelo–Fraenkel Set Theory
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded. Informally, Zermelo–Fraenkel set theory is intended to formalize a single primitive notion, that of a hereditary well-founded set, so that all entities in the universe of discourse are such sets. Thus the axioms of Zermelo–Fraenkel set theory refer only to pure sets and prevent its models from containing u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by arbitrarily choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family (S_i)_ of nonempty sets, there exists an indexed set (x_i)_ such that x_i \in S_i for every i \in I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. In many cases, a set arising from choosing elements arbitrarily can be made without invoking the axiom of choice; this is, in particular, the case if the number of sets from which to choose the elements is finite, or if a canonical rule on how to choose the elements is available – some distinguishin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cycle (graph Theory)
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal. A graph without cycles is called an ''acyclic graph''. A directed graph without directed cycles is called a ''directed acyclic graph''. A connected graph without cycles is called a ''tree''. Definitions Circuit and cycle * A circuit is a non-empty trail in which the first and last vertices are equal (''closed trail''). : Let be a graph. A circuit is a non-empty trail with a vertex sequence . * A cycle or simple circuit is a circuit in which only the first and last vertices are equal. Directed circuit and directed cycle * A directed circuit is a non-empty directed trail in which the first and last vertices are equal (''closed directed trail''). : Let be a directed graph. A directed circuit is a non-empty directed trail with a vertex sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schreier's Subgroup Lemma
In mathematics, Schreier's lemma is a theorem in group theory used in the Schreier–Sims algorithm and also for finding a presentation of a subgroup. Statement Suppose H is a subgroup of G, which is finitely generated with generating set S, that is, G = \langle S\rangle. Let R be a right transversal of H in G. In other words, R is (the image of) a section of the quotient map G \to H\backslash G, where H\backslash G denotes the set of right cosets of H in G. We make the definition that given g\in G, \overline is the chosen representative in the transversal R of the coset Hg, that is, :g\in H\overline. Then H is generated by the set :\. Hence, in particular, Schreier's lemma implies that every subgroup of finite index of a finitely generated group is again finitely generated. Example Let us establish the evident fact that the group Z3 = Z/3Z is indeed cyclic. Via Cayley's theorem, Z3 is a subgroup of the symmetric group In abstract algebra, the symmetric group defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cayley Graph
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem (named after Arthur Cayley), and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing families of expander graphs. Definition Let G be a group and S be a generating set of G. The Cayley graph \Gamma = \Gamma(G,S) is an edge-colored directed graph constructed as follows: In his Collected Mathematical Papers 10: 403–405. * Each element g of G is assigned a vertex: the vertex set of \Gamma is identified with G. * Each element s of S is assigned a color c_s. * For every g \in G and s \in S, there is a directed edge of color c_s from the vertex corresponding to g to the one corresponding to gs. Not ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Betti Number
In algebraic topology, the Betti numbers are used to distinguish topological spaces based on the connectivity of ''n''-dimensional simplicial complexes. For the most reasonable finite-dimensional spaces (such as compact manifolds, finite simplicial complexes or CW complexes), the sequence of Betti numbers is 0 from some point onward (Betti numbers vanish above the dimension of a space), and they are all finite. The ''n''th Betti number represents the rank of the ''n''th homology group, denoted ''H''''n'', which tells us the maximum number of cuts that can be made before separating a surface into two pieces or 0-cycles, 1-cycles, etc. For example, if H_n(X) \cong 0 then b_n(X) = 0, if H_n(X) \cong \mathbb then b_n(X) = 1, if H_n(X) \cong \mathbb \oplus \mathbb then b_n(X) = 2, if H_n(X) \cong \mathbb \oplus \mathbb\oplus \mathbb then b_n(X) = 3, etc. Note that only the ranks of infinite groups are considered, so for example if H_n(X) \cong \mathbb^k \oplus \mathbb/(2) , where \mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Homology
In algebraic topology, simplicial homology is the sequence of homology groups of a simplicial complex. It formalizes the idea of the number of holes of a given dimension in the complex. This generalizes the number of connected components (the case of dimension 0). Simplicial homology arose as a way to study topological spaces whose building blocks are ''n''-simplices, the ''n''-dimensional analogs of triangles. This includes a point (0-simplex), a line segment (1-simplex), a triangle (2-simplex) and a tetrahedron (3-simplex). By definition, such a space is homeomorphic to a simplicial complex (more precisely, the geometric realization of an abstract simplicial complex). Such a homeomorphism is referred to as a ''triangulation'' of the given space. Many topological spaces of interest can be triangulated, including every smooth manifold (Cairns and Whitehead). Simplicial homology is defined by a simple recipe for any abstract simplicial complex. It is a remarkable fact that simplic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy
In topology, a branch of mathematics, two continuous functions from one topological space to another are called homotopic (from grc, ὁμός "same, similar" and "place") if one can be "continuously deformed" into the other, such a deformation being called a homotopy (, ; , ) between the two functions. A notable use of homotopy is the definition of homotopy groups and cohomotopy groups, important invariants in algebraic topology. In practice, there are technical difficulties in using homotopies with certain spaces. Algebraic topologists work with compactly generated spaces, CW complexes, or spectra. Formal definition Formally, a homotopy between two continuous functions ''f'' and ''g'' from a topological space ''X'' to a topological space ''Y'' is defined to be a continuous function H: X \times ,1\to Y from the product of the space ''X'' with the unit interval , 1to ''Y'' such that H(x,0) = f(x) and H(x,1) = g(x) for all x \in X. If we think of the second ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
