Absolutely convex set¶

In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7827
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Functional Analysis, Topological Vector Spaces → Mathematics

Core Idea¶

Absolutely convex set is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk.

In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The disked hull or the absolute convex hull of a set is the intersection of all disks containing that set. If D is a disk and r and s are scalars then s D = |s| D and (r D) \cap (s D) = (\min_{} {|r|, |s|}) D.

It is called an or a if r c + s d \in C whenever c, d \in C and r, s are scalars satisfying |r|^p + |s|^p \leq 1. If D is a bounded disk in a TVS X and if x_{\bull} = \left(x_i\right){i=1}^{\infty} is a sequence in D, then the partial sums s = \left(s_n\right){n=1}^{\infty} are Cauchy, where for all n, s_n := \sum S) is instead a closed "hour glass shaped" subset that intersects the x -axis at exactly the origin and is the union of two closed and filled isosceles triangles: one whose vertices are the origin together with S and the other triangle whose vertices are the origin together with - S = {(-1, -1), (1, -1)}.}^n 2^{-i} x_i. However, \operatorname{co} (S) is equal to the horizontal closed line segment between the two points in S so that \operatorname{bal} (\operatorname{co

For Absolutely convex set, the abstraction is narrower than the article's general subject matter: a positive case must preserve In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics, logic, and statistics, which is why this identity is domain-specific rather than prime.

How would you explain it like I'm…

Centered No-Dent Shapes

Picture a shape drawn around a center dot, with no dents or holes. Take any point inside and slide it toward the center dot, or flip it to the exact opposite side of the center: it's still inside. A shape like that, such as a circle centered on the dot, is called absolutely convex.

Balanced No-Dent Shapes

In math, a shape is 'convex' if a straight line between any two of its points stays completely inside — no dents or holes. A shape is 'balanced' if, whenever a point is in it, shrinking that point toward the center, or flipping it to the opposite side of the center, keeps it inside. A set that is both convex and balanced is called absolutely convex, or a 'disk'. A filled circle or square centered on the origin is an example; a triangle with a corner at the center isn't, because flipping it through the center takes points outside.

Convex and Balanced Sets

In a real or complex vector space, a subset C is convex if it contains the line segment between any two of its points, and balanced (or 'circled') if sC ⊆ C for every scalar s with |s| ≤ 1, meaning scaling toward the origin, and for real spaces flipping through it, keeps you inside. A set that is both convex and balanced is called absolutely convex, disked, or simply a disk. Equivalently, rc + sd is in C whenever c, d are in C and |r| + |s| ≤ 1. The disked hull (absolute convex hull) of a set is the intersection of all disks containing it. A useful consequence: for a disk D and scalars r, s, sD = |s|D and (rD) ∩ (sD) = min(|r|, |s|)·D.

A subset C of a real or complex vector space is absolutely convex (disked) if it is convex and balanced, i.e., sC ⊆ C whenever |s| ≤ 1; such a set is called a disk. Equivalently, rc + sd ∈ C whenever c, d ∈ C and |r| + |s| ≤ 1. The absolutely convex (disked) hull of a set is the intersection of all disks containing it. For a disk D and scalars r, s: sD = |s|D and (rD) ∩ (sD) = min{|r|, |s|}D. Replacing the exponent condition by |r|^p + |s|^p ≤ 1 yields the related p-convex notions. Order matters when building hulls: the balanced hull of a convex set need not be convex — the balanced hull of a horizontal segment is an 'hourglass' of two triangles meeting at the origin. In a topological vector space, bounded disks have useful properties: for a sequence xᵢ in a bounded disk, the partial sums of Σ 2^(−i) xᵢ are Cauchy.

Structural Signature¶

Sig role-phrases:

Defining carrier — The smallest convex (respectively, balanced) subset of X containing a given set is called the convex hull (respectively, the balanced hull) of that set and is denoted by \operatorname{co} S (respectively, \operatorname{bal} S ).
Constitutive relation — The disked hull of S will be denoted by \operatorname{disk} S or \operatorname{cobal} S and it is equal to each of the following sets.
Operating condition — Given 0 a topological vector space is (meaning that its topology is induced by some p -seminorm) if and only if it has a bounded p -convex neighborhood of the origin.
Recognition evidence — A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied.
Admissible variation — for any scalars a and b, if |a| + |b| \leq 1 then a S + b S \subseteq S.
Characteristic consequence — for all scalars a, b, and c, if |a| + |b| \leq |c|, then a S + b S \subseteq c S.
Failure boundary — for any scalars a_1, \ldots, a_n and c, if |a_1| + \cdots + |a_n| \leq |c| then a_1 S + \cdots + a_n S \subseteq c S.

What It Is Not¶

Not the whole field of mathematics, logic, and statistics. The node requires the specific identity stated by In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk.
Not an over-broad reading. The intersection of arbitrarily many absolutely convex sets is again absolutely convex; however, unions of absolutely convex sets need not be absolutely convex anymore.
Not an over-broad reading. However, for any subsets S, T \subseteq X, if S \subseteq T then \operatorname{cobal} S \subseteq \operatorname{cobal} T which implies \operatorname{cobal} (\operatorname{co} S) = \operatorname{cobal} S = \operatorname{cobal} (\operatorname{bal} S).
Not an over-broad reading. Then \operatorname{bal} (\operatorname{co} S) is a strict subset of \operatorname{cobal} S that is not even convex.
Not automatically Convex hull. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Absolutely convex set applies literally inside mathematics, logic, and statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:

Generalizations. A is any non-negative function q : X \to \R that satisfies the following conditions.
Generalizations. For example, whenever 0 then the map q(f) = \int_{\R} |f(t)|^p d t used to define the Lp space L_p(\R) is a p -seminorm but not a seminorm.
Definition. A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied.
Definition. for any scalars a and b, if |a| + |b| \leq 1 then a S + b S \subseteq S.
Definition. for all scalars a, b, and c, if |a| + |b| \leq |c|, then a S + b S \subseteq c S.
Definition. for any scalars a_1, \ldots, a_n and c, if |a_1| + \cdots + |a_n| \leq |c| then a_1 S + \cdots + a_n S \subseteq c S.

Outside mathematics, logic, and statistics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Absolutely convex set names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The strongest recognition evidence in the frozen account is: A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification The intersection of arbitrarily many absolutely convex sets is again absolutely convex; however, unions of absolutely convex sets need not be absolutely convex anymore. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Absolutely convex set compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—the disked hull of S will be denoted by \operatorname{disk} S or \operatorname{cobal} S and it is equal to each of the following sets.—and the practical consequence—for all scalars a, b, and c, if |a| + |b| \leq |c|, then a S + b S \subseteq c S. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the mathematics, logic, and statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk.
Check operation and conditions. Given 0 a topological vector space is (meaning that its topology is induced by some p -seminorm) if and only if it has a bounded p -convex neighborhood of the origin.
Demand recognition evidence. A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied.
Test variation. Change an implementation or setting while preserving for any scalars a and b, if |a| + |b| \leq 1 then a S + b S \subseteq S.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Absolutely convex set transfers literally when a new case preserves the same carrier type, relation, and recognition test. A is any non-negative function q : X \to \R that satisfies the following conditions. For example, whenever 0 then the map q(f) = \int_{\R} |f(t)|^p d t used to define the Lp space L_p(\R) is a p -seminorm but not a seminorm.

Beyond the home domain. No canonical parent is asserted for Absolutely convex set. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

For example, whenever 0 then the map q(f) = \int_{\R} |f(t)|^p d t used to define the Lp space L_p(\R) is a p -seminorm but not a seminorm. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk; recognition evidence → A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied

Applied / In Practice¶

In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → the applied context; invariant → In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk; boundary → the case exits the class when the intersection of arbitrarily many absolutely convex sets is again absolutely convex; however, unions of absolutely convex sets need not be absolutely convex anymore

Structural Tensions¶

T1 — Stable identity versus admissible variation. The intersection of arbitrarily many absolutely convex sets is again absolutely convex; however, unions of absolutely convex sets need not be absolutely convex anymore. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. However, for any subsets S, T \subseteq X, if S \subseteq T then \operatorname{cobal} S \subseteq \operatorname{cobal} T which implies \operatorname{cobal} (\operatorname{co} S) = \operatorname{cobal} S = \operatorname{cobal} (\operatorname{bal} S). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. Then \operatorname{bal} (\operatorname{co} S) is a strict subset of \operatorname{cobal} S that is not even convex. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. For example, whenever 0 then the map q(f) = \int_{\R} |f(t)|^p d t used to define the Lp space L_p(\R) is a p -seminorm but not a seminorm. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. The smallest convex (respectively, balanced) subset of X containing a given set is called the convex hull (respectively, the balanced hull) of that set and is denoted by \operatorname{co} S (respectively, \operatorname{bal} S ). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Absolutely convex set literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. The disked hull of S will be denoted by \operatorname{disk} S or \operatorname{cobal} S and it is equal to each of the following sets. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Absolutely convex set distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Absolutely convex set is structural-leaning. Its structural side is the repeatable organization summarized by In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. Its framed side is the mathematics, logic, and statistics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: Given 0 a topological vector space is (meaning that its topology is induced by some p -seminorm) if and only if it has a bounded p -convex neighborhood of the origin. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: The smallest convex (respectively, balanced) subset of X containing a given set is called the convex hull (respectively, the balanced hull) of that set and is denoted by \operatorname{co} S (respectively, \operatorname{bal} S ). The disked hull of S will be denoted by \operatorname{disk} S or \operatorname{cobal} S and it is equal to each of the following sets. It further constrains recognition and variation through: Given 0 a topological vector space is (meaning that its topology is induced by some p -seminorm) if and only if it has a bounded p -convex neighborhood of the origin. A subset S of a real or complex vector space X is called a ' and is said to be ', ', and ' if any of the following equivalent conditions is satisfied.

What is domain-bound. mathematics, logic, and statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Absolutely convex set literal. Its documented scope includes the condition that A is any non-negative function q : X \to \R that satisfies the following conditions. Another bounded application condition is that For example, whenever 0 then the map q(f) = \int{\R} |f(t)|^p d t used to define the Lp space Lp(\R) is a p -seminorm but not a seminorm. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—for any scalars a and b, if |a| + |b| \leq 1 then a S + b S \subseteq S.—and future graph densification may discover a defensible relation only if it preserves that boundary.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Absolutely convex set. The reviewed identity is: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Neighborhood in Abstraction Space¶

Absolutely convex set sits in a moderately populated region (47^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Topological & Functional-Analytic Spaces (13 abstractions)

Nearest neighbors

Balanced set — 0.88
Affine hull — 0.88
Infrabarrelled space — 0.86
DF-space — 0.86
Convex hull — 0.86

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk?
Convex hull. The smallest convex set containing a given set, equivalently all finite convex combinations of its points. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Balanced set. A subset of a real or complex vector space closed under multiplication by every scalar of absolute value at most one. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Relative convex hull. The smallest geodesically convex set containing given points while constrained to remain inside a surrounding polygon or simple closed region. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Absolutely convex set remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside mathematics, logic, and statistics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Absolutely_convex_set (revision 1242712985).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.