Generating set of a group in the context of "Hyperplane"

⭐ In the context of hyperplanes, generating sets of a group are most directly related to which geometric operation?

Ad spacer

⭐ Core Definition: Generating set of a group

In abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses.

In other words, if is a subset of a group , then , the subgroup generated by , is the smallest subgroup of containing every element of , which is equal to the intersection over all subgroups containing the elements of ; equivalently, is the subgroup of all elements of that can be expressed as the finite product of elements in and their inverses. (Note that inverses are only needed if the group is infinite; in a finite group, the inverse of an element can be expressed as a power of that element.)

↓ Menu

>>>PUT SHARE BUTTONS HERE<<<

👉 Generating set of a group in the context of Hyperplane

In geometry, a hyperplane is a generalization of a two-dimensional plane in three-dimensional space to mathematical spaces of arbitrary dimension. Like a plane in space, a hyperplane is a flat hypersurface, a subspace whose dimension is one less than that of the ambient space. Two lower-dimensional examples of hyperplanes are one-dimensional lines in a plane and zero-dimensional points on a line.

Most commonly, the ambient space is n-dimensional Euclidean space, in which case the hyperplanes are the (n − 1)-dimensional "flats", each of which separates the space into two half spaces. A reflection across a hyperplane is a kind of motion (geometric transformation preserving distance between points), and the group of all motions is generated by the reflections. A convex polytope is the intersection of half-spaces.

↓ Explore More Topics
In this Dossier

Generating set of a group in the context of Finitely generated abelian group

In abstract algebra, an abelian group is called finitely generated if there exist finitely many elements in such that every in can be written in the form for some integers . In this case, we say that the set is a generating set of or that generate . So, finitely generated abelian groups can be thought of as a generalization of cyclic groups.

Every finite abelian group is finitely generated. The finitely generated abelian groups can be completely classified.

↑ Return to Menu

Generating set of a group in the context of Cyclic group

In abstract algebra, a cyclic group or monogenous group is a group, denoted Cn (also frequently n or Zn, not to be confused with the commutative ring of p-adic numbers), that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a generator of the group.

Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order n is isomorphic to the additive group of Z/nZ, the integers modulo n. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is a direct product of cyclic groups.

↑ Return to Menu

Generating set of a group in the context of Icosian calculus

The icosian calculus is a non-commutative algebraic structure discovered by the Irish mathematician William Rowan Hamilton in 1856.In modern terms, he gave a group presentation of the icosahedral rotation group by generators and relations.

Hamilton's discovery derived from his attempts to find an algebra of "triplets" or 3-tuples that he believed would reflect the three Cartesian axes. The symbols of the icosian calculus correspond to moves between vertices on a dodecahedron. (Hamilton originally thought in terms of moves between the faces of an icosahedron, which is equivalent by duality. This is the origin of the name "icosian".) Hamilton's work in this area resulted indirectly in the terms Hamiltonian circuit and Hamiltonian path in graph theory. He also invented the icosian game as a means of illustrating and popularising his discovery.

↑ Return to Menu

Generating set of a group in the context of Charge (physics)

In physics, a charge is any of many different quantities, such as the electric charge in electromagnetism or the color charge in quantum chromodynamics. Charges correspond to the time-invariant generators of a symmetry group, and specifically, to the generators that commute with the Hamiltonian. Charges are often denoted by , and so the invariance of the charge corresponds to the vanishing commutator , where is the Hamiltonian. Thus, charges are associated with conserved quantum numbers; these are the eigenvalues of the generator . A "charge" can also refer to a point-shaped object with an electric charge and a position, such as in the method of image charges.

↑ Return to Menu

Generating set of a group in the context of Growth rate (group theory)

In the mathematical subject of geometric group theory, the growth rate of a group with respect to a symmetric generating set describes how fast a group grows. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length n.

↑ Return to Menu