Symmetric set

From testwiki
Revision as of 07:31, 4 March 2024 by imported>Jlwoodwa (References: {{refbegin}})
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In mathematics, a nonempty subset Template:Mvar of a group Template:Mvar is said to be symmetric if it contains the inverses of all of its elements.

Definition

In set notation a subset S of a group G is called Template:Em if whenever sS then the inverse of s also belongs to S. So if G is written multiplicatively then S is symmetric if and only if S=S1 where S1:={s1:sS}. If G is written additively then S is symmetric if and only if S=S where S:={s:sS}.

If S is a subset of a vector space then S is said to be a Template:Em if it is symmetric with respect to the additive group structure of the vector space; that is, if S=S, which happens if and only if SS. The Template:Em of a subset S is the smallest symmetric set containing S, and it is equal to SS. The largest symmetric set contained in S is SS.

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 (k,k) with k>0, and the sets and (1,1).

If S is any subset of a group, then SS1 and SS1 are symmetric sets.

Any balanced subset of a real or complex vector space is symmetric.

See also

References

Template:Refbegin

Template:Refend Template:PlanetMath attribution

Template:Functional analysis Template:Linear algebra


Template:Settheory-stub