Symmetric set
{{Short description|Property of group subsets (mathematics)}}
In mathematics, a nonempty subset {{mvar|S}} of a group {{mvar|G}} is said to be symmetric if it contains the inverses of all of its elements.
Definition
In set notation a subset of a group is called {{em|symmetric}} if whenever then the inverse of also belongs to
So if is written multiplicatively then is symmetric if and only if where
If is written additively then is symmetric if and only if where
If is a subset of a vector space then is said to be a {{em|symmetric set}} if it is symmetric with respect to the additive group structure of the vector space; that is, if which happens if and only if
The {{em|symmetric hull}} of a subset is the smallest symmetric set containing and it is equal to The largest symmetric set contained in is
Sufficient conditions
Arbitrary unions and intersections of symmetric sets are symmetric.
Any vector subspace in a vector space is a symmetric set.
Examples
In examples of symmetric sets are intervals of the type with and the sets and
If is any subset of a group, then and are symmetric sets.
Any balanced subset of a real or complex vector space is symmetric.
See also
- {{annotated link|Absolutely convex set}}
- {{annotated link|Absorbing set}}
- {{annotated link|Balanced function}}
- {{annotated link|Balanced set}}
- {{annotated link|Bounded set (topological vector space)}}
- {{annotated link|Convex set}}
- {{annotated link|Minkowski functional}}
- {{annotated link|Star domain}}
References
{{refbegin}}
- R. Cristescu, Topological vector spaces, Noordhoff International Publishing, 1977.
- {{Rudin Walter Functional Analysis|edition=2}}
- {{Narici Beckenstein Topological Vector Spaces|edition=2}}
- {{Schaefer Wolff Topological Vector Spaces|edition=2}}
- {{Trèves François Topological vector spaces, distributions and kernels}}
{{refend}}
{{PlanetMath attribution|id=4528|title=symmetric set}}
{{Functional analysis}}
{{Linear algebra}}
{{settheory-stub}}