Filling radius¶
In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X.
Core Idea¶
Filling radius is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X.
In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. It was originally introduced in 1983 by Mikhail Gromov, who used it to prove his systolic inequality for essential manifolds, vastly generalizing Loewner's torus inequality and Pu's inequality for the real projective plane, and creating systolic geometry in its modern form. The filling radius of a simple loop C in the plane is defined as the largest radius, R > 0, of a circle that fits inside C.
\mathrm{FillRad}(C\subset \mathbb{R}^2) = R. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. The last point to be swallowed up is precisely the center of a largest inscribed circle.
For Filling radius, the abstraction is narrower than the article's general subject matter: a positive case must preserve In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. 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.
Structural Signature¶
Sig role-phrases:
- Defining carrier — There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov.
- Constitutive relation — As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop.
- Operating condition — Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable.
- Recognition evidence — Namely, we map a point x\in X to the function f_x\in L^\infty(X) defined by the formula f_x(y) = d(x,y).
- Admissible variation — for all y\in X , where d is the distance function defined by the metric.
- Characteristic consequence — This follows by combining the diameter upper bound mentioned above with Gromov's lower bound in terms of the systole (Gromov, 1983).
- Failure boundary — The inequality is optimal in the sense that the boundary case of equality is attained by the real projective spaces as above.
What It Is Not¶
- Not the whole field of mathematics, logic, and statistics. The node requires the specific identity stated by In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X.
- Not an over-broad reading. Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable.
- Not an over-broad reading. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov.
- Not an over-broad reading. As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop.
- Not automatically Isoperimetric Inequality. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.
Scope of Application¶
Filling radius applies literally inside mathematics, logic, and statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:
- Dual definition via neighborhoods. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov.
- Dual definition via neighborhoods. As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop.
- Homological definition. One imbeds X in the Banach space L^\infty(X) of bounded Borel functions on X, equipped with the sup norm |\cdot| .
- Homological definition. Namely, we map a point x\in X to the function f_x\in L^\infty(X) defined by the formula f_x(y) = d(x,y).
- Homological definition. for all y\in X , where d is the distance function defined by the metric.
- Properties. The filling radius of the Riemannian circle of length 2π, i.e. the unit circle with the induced Riemannian distance function, equals π/3, i.e. a sixth of its length.
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 Filling radius names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. The strongest recognition evidence in the frozen account is: Namely, we map a point x\in X to the function f_x\in L^\infty(X) defined by the formula f_x(y) = d(x,y). A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable. so that a reader can reproduce the classification rather than infer it from topical resemblance.
Manages Complexity¶
Filling radius compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—as \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop.—and the practical consequence—this follows by combining the diameter upper bound mentioned above with Gromov's lower bound in terms of the systole (Gromov, 1983). 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 Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X.
- Check operation and conditions. Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable.
- Demand recognition evidence. Namely, we map a point x\in X to the function f_x\in L^\infty(X) defined by the formula f_x(y) = d(x,y).
- Test variation. Change an implementation or setting while preserving for all y\in X , where d is the distance function defined by the metric.
- 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 Filling radius transfers literally when a new case preserves the same carrier type, relation, and recognition test. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop.
Beyond the home domain. No canonical parent is asserted for Filling radius. 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¶
Equivalently, the filling radius is a sixth of the systole in these cases. 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 Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X; recognition evidence → Namely, we map a point x\in X to the function f_x\in L^\infty(X) defined by the formula f_x(y) = d(x,y)
Applied / In Practice¶
The inequality is optimal in the sense that the boundary case of equality is attained by the real projective spaces as above. 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 → Properties; invariant → In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X; boundary → the case exits the class when denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable
Structural Tensions¶
T1 — Stable identity versus admissible variation. Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable. 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. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. 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. As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop. 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. The last point to be swallowed up is precisely the center of a largest inscribed circle. 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. There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. 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 Filling radius literally, co-instantiate Pattern, or only resemble it?
T6 — Autonomy versus reduction. As \varepsilon>0 increases, the \varepsilon -neighborhood U_\varepsilon C swallows up more and more of the interior of the loop. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: What does Filling radius distinguish that the broader parent Pattern leaves together?
Structural–Framed Character¶
Filling radius is structural-leaning. Its structural side is the repeatable organization summarized by In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. 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: Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}_2 , depending on whether or not X is orientable. 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 Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. 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: There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. As \varepsilon>0 increases, the \varepsilon -neighborhood U\varepsilon C swallows up more and more of the interior of the loop. It further constrains recognition and variation through: Denote by A the coefficient ring \mathbb{Z} or \mathbb{Z}2 , depending on whether or not X is orientable. Namely, we map a point x\in X to the function fx\in L^\infty(X) defined by the formula fx(y) = d(x,y).
What is domain-bound. mathematics, logic, and statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Filling radius literal. Its documented scope includes the condition that There is a kind of a dual point of view that allows one to generalize this notion in an extremely fruitful way, as shown by Gromov. Another bounded application condition is that As \varepsilon>0 increases, the \varepsilon -neighborhood U\varepsilon C swallows up more and more of the interior of the loop. 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 all y\in X , where d is the distance function defined by the metric.—and future graph densification may discover a defensible relation only if it preserves that boundary.
Instantiates / Related Primes¶
- Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Filling radius. The reviewed identity is: In Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X. 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¶
Filling radius sits in a crowded region of the domain-specific corpus (15th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Named Analytic Theorems & Operators (39 abstractions)
Nearest neighbors
- Julia set — 0.92
- S-procedure — 0.91
- Big O in probability notation — 0.91
- Rooted product of graphs — 0.91
- Single Vegetative Obstruction Model — 0.90
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 Riemannian geometry, the filling radius of a Riemannian manifold X is a metric invariant of X?
- Isoperimetric Inequality. A sharp geometric relation bounding enclosed area or volume by boundary length or area, with Euclidean balls as the unique equality shapes up to the natural symmetries and negligible-set qualifications. Tell: Which entry's carrier, operation, and failure condition are satisfied?
- Space-Filling Curve. A continuous surjection from a one-dimensional interval onto a higher-dimensional region, typically built as the uniform limit of recursively refined approximating paths. Tell: Which entry's carrier, operation, and failure condition are satisfied?
- Triangle inequality. The distance or norm axiom stating that a direct separation is no greater than the length of any two-step path, d(x,z)≤d(x,y)+d(y,z). 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 Filling radius 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/Filling_radius (revision 1285450375).
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.