Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tailored-LEN: Canonical Path Parametrization

Updated 10 July 2026
  • Tailored-LEN is a functional that defines an alternative length for continuous paths by integrating stripwise projected diameters, offering a canonical parameterization.
  • The framework guarantees key properties such as invariance under Euclidean isometries, subadditivity on subpaths, and minimality for straight segments.
  • Tailored-LEN enables a standard reparametrization for path classes, facilitating criteria for equicontinuity and compactness in families where traditional rectifiability fails.

Tailored-LEN is the $\len$-based framework developed in the work of Hoehn, Oversteegen, and Tymchatyn for canonically parametrizing continuous paths in Rn\mathbb{R}^n by an alternative notion of length that is defined for every continuous path, is invariant under Euclidean isometries, is monotone on subpaths, and is continuous in the uniform topology (Hoehn et al., 2013). In the formulation summarized for n=2n=2, the construction replaces Euclidean arc length by an integral of weighted stripwise projected diameters; this yields a standard parametrization for every non-constant path, a homeomorphic model for path classes modulo orientation-preserving retracing, criteria for equicontinuity and compactness, and a canonical extension procedure for certain laminations of arcs.

1. Definition of the $\len$ functional

For the planar case, the construction begins with the horizontal unit-width strips

Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.

Given parameters

x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],

one rotates by angle πt\pi t, scales by μ\mu, and translates vertically by xx, obtaining

Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).

For each triple Rn\mathbb{R}^n0, the plane is therefore foliated by the disjoint strips Rn\mathbb{R}^n1 (Hoehn et al., 2013).

If Rn\mathbb{R}^n2 is continuous, one considers, for each Rn\mathbb{R}^n3, the connected components Rn\mathbb{R}^n4 of the preimage Rn\mathbb{R}^n5. Each such component has a diameter under orthogonal projection to the line of direction Rn\mathbb{R}^n6, denoted

Rn\mathbb{R}^n7

The components with nonzero projected diameter are enumerated in nonincreasing order as Rn\mathbb{R}^n8, and the associated strip-sum is defined by

Rn\mathbb{R}^n9

The functional n=2n=20 is then

n=2n=21

A semicontinuity argument shows that n=2n=22 is Lebesgue-integrable and that n=2n=23 for every non-constant n=2n=24. The n=2n=25-dimensional case is stated to be analogous, replacing strips by parallel n=2n=26-planes. This suggests that Tailored-LEN should be understood not as a Euclidean metric replacement in the usual differential-geometric sense, but as a geometric averaging procedure over foliations and projected diameters.

2. Structural properties of n=2n=27

The functional satisfies several basic properties. If n=2n=28 is a Euclidean isometry, then

n=2n=29

If $\len$0 is defined on a dendrite $\len$1 and $\len$2 is a closed subcontinuum, then

$\len$3

with equality if and only if $\len$4 is constant on each component of $\len$5. If $\len$6 and $\len$7, then

$\len$8

These assertions encode invariance, monotonicity on subpaths, and subadditivity (Hoehn et al., 2013).

The minimality property is formulated for straight segments. If $\len$9 and Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.0 is any path joining them, then

Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.1

with strict inequality unless Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.2 is exactly the monotone parametrization of that line segment. This places straight segments in the role of Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.3-geodesics among all paths with fixed endpoints.

Every continuous path Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.4 satisfies

Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.5

and

Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.6

is continuous in the uniform-norm topology. The combination of finiteness for all continuous paths and continuity in the uniform metric is a defining distinction from Euclidean path length. A plausible implication is that Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.7 is particularly well suited to topological families of paths where rectifiability is unavailable or unstable.

3. Canonical parametrization and path classes

Two paths Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.8 are declared equivalent, written Sj={a+ib:  aR,  b[j,j+1]},jZ.S_j=\{\,a+ib:\;a\in\mathbb{R},\;b\in[j,j+1]\,\}, \qquad j\in\mathbb{Z}.9, when they trace the same image with the same orientation and constant pieces are collapsed. For a non-constant path x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],0, the map

x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],1

is continuous and non-decreasing into x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],2. After rescaling the target back to x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],3, one obtains the unique reparametrization

x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],4

This is the standard, or x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],5, parametrization (Hoehn et al., 2013).

The standard parametrization satisfies x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],6 and is uniquely determined by the equivalence class x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],7. If x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],8 denotes the set of all equivalence classes, then the map

x[0,1],t[0,1],μ(0,1],x\in[0,1],\quad t\in[0,1],\quad \mu\in(0,1],9

induces a homeomorphism between πt\pi t0, equipped with its natural quotient topology, and the closed subspace

πt\pi t1

consisting exactly of those paths for which

πt\pi t2

This is the central canonicalization theorem of the framework. Rather than selecting a representative by speed normalization in the Euclidean sense, Tailored-LEN selects a representative by linearizing accumulated πt\pi t3. The result is a topological normal form for oriented path classes.

4. Equicontinuity and compactness in the πt\pi t4-framework

Let πt\pi t5 be a family of path classes, and let

πt\pi t6

be the corresponding family of standard parametrizations. The equicontinuity criterion states that πt\pi t7 is equicontinuous in πt\pi t8 if and only if the following condition holds: for each πt\pi t9 there exists μ\mu0 such that no member of μ\mu1 admits more than μ\mu2 disjoint subintervals whose images have diameter at least μ\mu3 (Hoehn et al., 2013).

The compactness criterion strengthens this. A set μ\mu4 has compact closure if and only if two conditions are satisfied: the set of initial points

μ\mu5

is bounded, and μ\mu6 satisfies the same μ\mu7-long-pieces condition. In particular, after passage to standard parametrizations, one recovers Ascoli–Arzelà in the μ\mu8-framework.

These criteria are notable because they avoid direct reliance on Euclidean arc-length bounds. The controlling quantity is combinatorial-geometric: the number of disjoint subintervals carrying image diameter above a fixed threshold. This suggests that Tailored-LEN provides a compactness theory adapted to non-rectifiable path families, where classical bounded-variation hypotheses would be too restrictive.

5. Estimates and representative examples

Several explicit estimates and examples clarify the scale of μ\mu9. Any straight-line segment xx0 has the least possible xx1 among all paths joining xx2 to xx3. For the unit segment xx4 in the xx5-direction, one computes directly that

xx6

At the same time, every path still satisfies xx7 (Hoehn et al., 2013).

For the winding example

xx8

which traverses the unit circle xx9 times, one has

Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).0

while each individual Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).1 remains strictly less than Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).2. This indicates that repeated geometric complexity can asymptotically saturate the normalization range without ever exceeding it.

There is also a diameter comparison for small images. Whenever

Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).3

there exist constants Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).4, depending only on Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).5, such that

Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).6

This yields a local comparability between Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).7 and image diameter. A plausible implication is that, at sufficiently small spatial scale, Tailored-LEN behaves like a normalized geometric size functional, while at larger scale it retains sensitivity to repeated traversals and path structure.

6. Midpoint–Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).8 parametrization and lamination homeomorphisms

Section 4 of the summarized work introduces a second parametrization, the midpoint–Sjx,t,μ=μeiπt ⁣(Sj+ix).S^{x,t,\mu}_j=\mu\,e^{\,i\pi t}\!\bigl(S_j+i\,x\bigr).9 parametrization Rn\mathbb{R}^n00, which has the additional property that it commutes with reversal of orientation (Hoehn et al., 2013). This refinement is used for laminations.

A lamination Rn\mathbb{R}^n01 of a planar set Rn\mathbb{R}^n02 is described as a family of arcs filling Rn\mathbb{R}^n03 so that they meet only in endpoints, together with suitable local-finiteness and compactness axioms. If Rn\mathbb{R}^n04 is a bijection from the endpoint set Rn\mathbb{R}^n05 to the endpoint set of another lamination Rn\mathbb{R}^n06, then Theorem 4.2 extends Rn\mathbb{R}^n07 uniquely to a continuous map

Rn\mathbb{R}^n08

which, on each arc Rn\mathbb{R}^n09, is given in coordinates by

Rn\mathbb{R}^n10

where Rn\mathbb{R}^n11 and Rn\mathbb{R}^n12 are chosen so that Rn\mathbb{R}^n13, Rn\mathbb{R}^n14, and Rn\mathbb{R}^n15.

This extension is a homeomorphism provided Rn\mathbb{R}^n16 is one, and Theorem 4.3 states that the resulting lamination-homeomorphism depends continuously on the data Rn\mathbb{R}^n17. In this part of the theory, Tailored-LEN serves not merely as a parametrization device for individual paths but as a coordinate mechanism for transferring entire arc-families through endpoint data. The significance is that canonical path coordinates become sufficient to construct global homeomorphisms in a structured topological setting.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Tailored-LEN.