---
title: 'Tsukamoto’s Approach: Local-to-Global Methods'
url: https://www.emergentmind.com/topics/tsukamoto-s-approach
type: topic
---

# Tsukamoto’s Approach: Local-to-Global Methods

Searching arXiv for the cited papers to ground the article in the literature.
arxiv_search(query="2506.13091 OR 2606.13270 OR 2509.11985 OR 2307.16772 OR 2108.06308 OR 2510.08051 OR 2404.05293", max_results=10)
Tsukamoto’s approach denotes a set of research methodologies associated with Tsukamoto’s work or later constructions explicitly formulated in Tsukamoto-style terms across several domains. In contemporary arXiv literature, the phrase is used in at least three technically distinct senses. In strong-field gravitational lensing, it refers to a refinement of Bozza’s strong-deflection formalism for asymptotically flat, static, spherically symmetric spacetimes, in which the logarithmic divergence of the deflection angle near the photon sphere is isolated and encoded by a small set of coefficients determined by the metric at the unstable circular null orbit [2506.13091], [2509.11985]. In topological dynamics and mean-dimension theory, it refers to a family of localization, recursive covering, and information-theoretic constructions that recast global invariants through local stable sets, nested covers, or rate-distortion-type quantities [2606.13270], [2307.16772], [2510.08051]. In musculoskeletal robotics, it designates a long-time self-body image acquisition strategy in which a robot continuously learns nonlinear relations among joint angles, muscle tensions, and muscle lengths from sensor data, while maintaining operational safety and control utility [2404.05293]. The common structural feature is methodological: each usage replaces a direct global treatment by a decomposition into local, recursively organized, or asymptotically singular components.

## 1. Strong-deflection gravitational lensing

In black-hole optics, Tsukamoto’s approach is a strong-deflection-limit method for null geodesics in static, spherically symmetric spacetimes. The formalism is built around the unstable circular null orbit, or photon sphere, and the observation that the bending angle diverges logarithmically as the closest approach approaches the photon sphere [2506.13091], [2509.11985].

For the quantum-corrected Reissner–Nordström spacetime studied in "Shadow and strong-field lensing effects of quantum-corrected RN blackhole" [2506.13091], the metric is written as
\[
ds^{2} = -A(r)\,dt^{2}+B(r)\,dr^{2}+C(r)\,d\Omega^{2},
\]
with
\[
B(r)=\frac{1}{A(r)}, \qquad C(r)=r^2,
\]
and, for small quantum parameter \(\mathrm a\),
\[
A(r)_{\rm app}=1-\frac{2M}{r}+\frac{Q^2}{r^2}-\frac{\mathrm{a}^2}{2r^2}+\mathcal{O}(\mathrm{a}^4).
\]
The parameter \(\mathrm a\) is defined by
\[
\mathrm{a} = 4\sqrt{\kappa} \equiv 4\ell_p.
\]
The photon sphere is found from
\[
\frac{d}{dr}\left[h^2(r_{\rm ph})\right]=0,\qquad h(r)\equiv \sqrt{\frac{C(r)}{A(r)}},
\]
equivalently
\[
C'(r_{\rm ph})A(r_{\rm ph})-C(r_{\rm ph})A'(r_{\rm ph})=0,
\]
yielding
\[
r_{\text{ph}}=\frac{3M}{2}+\frac{\sqrt{9M^2-8Q^2+4\mathrm{a}^2}}{2}.
\]
The shadow radius is then computed from
\[
r_{\rm sh}=\sqrt{\frac{C(r)}{A(r)}\Bigg|_{r_{\rm ph}} }.
\]

The lensing sector is formulated through
\[
\alpha(r_0)=I(r_0)-\pi,
\qquad
I(r_0)=2\int_{r_0}^{\infty}\frac{dr}{\sqrt{\frac{R(r)C(r)}{B(r)}}},
\]
with
\[
R(r)=\frac{A(r_0)r^2}{A(r)r_0^2}-1.
\]
Tsukamoto’s refinement introduces
\[
z\equiv 1-\frac{r_0}{r},
\]
and splits the integral into divergent and regular parts,
\[
I(r_0)=\int_0^1\left[F_D(z,r_0)+F_R(z,r_0)\right]dz.
\]
Near the photon sphere the bending angle takes the logarithmic form
\[
\hat{\alpha}_{\rm str} = -\bar{a}\,\log\!\left(\frac{b_0}{b_{\rm crit}}-1\right)+\bar{b}
+O\!\left[\left(\frac{b_0}{b_{\rm crit}}-1\right)\log\!\left(\frac{b_0}{b_{\rm crit}}-1\right)\right].
\]
The generic coefficients are
\[
\bar{a}= \sqrt{\frac{2}{2A(r_{\rm ps})-A''(r_{\rm ps})r_{\rm ps}^{2}}},
\]
and
\[
\bar{b}= \bar{a}\log\!\left[ r_{\rm ps}\left(\frac{2}{r_{\rm ps}^{2}-\frac{A''(r_{\rm ps})}{A(r_{\rm ps})}}\right) \right]+I_R(r_{\rm ps})-\pi.
\]

A closely related application appears in "Black Hole Gravitational Phenomena in Higher-Order Curvature-Scalar Gravity" [2509.11985]. There the spacetime is
\[
ds^2=-A(r,\xi)\,dt^2+\frac{dr^2}{B(r,\xi)}+r^2(d\theta^2+\sin^2\theta\,d\phi^2),
\]
with
\[
A(r,\xi)=1-\frac{2M}{r}+\frac{\xi}{r^2},\qquad
B(r,\xi)=1-\frac{2M}{r}+\frac{2M\xi^{3/2}}{r^4}.
\]
The closest-approach impact parameter is
\[
b(r_o)=\sqrt{\frac{r_o^2}{A(r_o,\xi)}},
\]
the photon sphere is determined by
\[
\frac{d}{dr}\left(\frac{r^2}{A(r,\xi)}\right)=0,
\]
and explicitly becomes
\[
r_{\rm ph}=\frac{1}{2}\left(3M+\sqrt{9M^2-8\xi}\right).
\]
The critical impact parameter is
\[
b_c=\sqrt{\frac{r_{\rm ph}^2}{A(r_{\rm ph},\xi)}},
\]
and the strong-field deflection angle is written as
\[
\alpha(b)= -\tilde a\,\ln\!\left(\frac{b}{b_c}-1\right)+\tilde b+\mathcal O\!\left[(b-b_c)\ln(b-b_c)\right].
\]
Here
\[
\tilde a = \sqrt{ \frac{2B_{\rm ph}}{ A_{\rm ph}C''_{\rm ph}-C_{\rm ph}A''_{\rm ph} } },
\]
and
\[
\tilde b = \tilde a \ln\!\left[ r_{\rm ph}^2\left( \frac{C''_{\rm ph}}{C_{\rm ph}}-\frac{A''_{\rm ph}}{A_{\rm ph}} \right) \right] +I_{\rm Reg}(r_{\rm ph})-\pi.
\]

This lensing usage of Tsukamoto’s approach is therefore not a generic name for black-hole imaging, but a specific asymptotic method: identify the photon sphere, transform the bending integral by \(z=1-r_o/r\), isolate the divergent part, and express the logarithmic blow-up through coefficients fixed by the metric at the photon sphere [2506.13091], [2509.11985].

## 2. Optical observables and empirical bounds

The practical significance of the strong-deflection method lies in its direct connection between local null-geodesic structure and observable quantities such as the critical impact parameter, shadow radius, angular image accumulation, and strong-lensing image separation [2506.13091], [2509.11985].

In the quantum-corrected Reissner–Nordström analysis, the paper states that charge \(Q\) decreases the photon-sphere radius \(r_{\rm ph}\), while the quantum correction parameter \(\mathrm a\) increases it [2506.13091]. The corresponding small-correction shadow expression is
\[
R_{\rm sh} \approx 3\sqrt{3}M-\frac{\sqrt{3}Q^2}{2M}+\frac{\sqrt{3}\mathrm{a}^2}{4M}+\frac{7\sqrt{3}Q^2\mathrm{a}^2}{72M^3}.
\]
This makes explicit that \(Q^2\) decreases the shadow size, whereas \(\mathrm a^2\) increases it. The same paper reports that \(Q\) has a strong effect near the photon sphere, that the deflection angle changes significantly as \(Q\) varies close to the critical radius, and that far from the photon sphere the different curves converge and the charge dependence becomes weak. By contrast, \(\mathrm a\) has negligible impact near the photon sphere at present observational precision, but increasing \(\mathrm a\) leads to a slight increase in shadow radius and a slight suppression of the strong deflection angle [2506.13091].

The paper compares its shadow predictions with Event Horizon Telescope constraints and states the following ranges. For Sgr A*,
\[
4.209M \leq R_{\rm sh} \leq 5.560M,
\qquad
-0.364 \le \delta/M \le 0.987.
\]
For M87*,
\[
4.313M \leq R_{\rm sh} \leq 6.079M,
\qquad
\delta/M = \pm 0.883.
\]
Its main conclusion is that even for large charge the shadow remains within EHT observational bounds for both M87* and Sgr A* [2506.13091].

In the higher-order curvature-scalar gravity study, Tsukamoto’s coefficients are used to define standard observables for relativistic images:
\[
\theta_\infty=\frac{b_c}{D_{OL}},
\qquad
s \simeq \theta_\infty \exp\!\left(\frac{\tilde b-2\pi}{\tilde a}\right),
\qquad
r_m \simeq \exp\!\left(\frac{2\pi}{\tilde a}\right),
\]
with
\[
r_m^{\rm (mag)} = 2.5\log_{10} r_m.
\]
The shadow angular diameter is
\[
\Omega_{\rm sh}=\frac{2b_c}{\mathcal D}.
\]
Using EHT-measured angular diameters, the paper finds
\[
0\le \frac{\xi}{M^2}\lesssim 0.091
\]
for M87\(^*\), and
\[
0\le \frac{\xi}{M^2}\lesssim 0.963
\]
for Sgr A\(^*\) [2509.11985].

A plausible implication is that, within this usage, Tsukamoto’s approach functions as an observational reduction scheme: local data at the photon sphere are propagated through logarithmic asymptotics to quantities directly comparable with EHT shadow measurements.

## 3. Localization in metric mean dimension

In dynamical systems, Tsukamoto’s approach denotes a localization principle for metric mean dimension. The central object is the pointwise \(\varepsilon\)-stable set
\[
\Gamma_\varepsilon(x)=\{y\in X:\ d(gx,gy)\le \varepsilon \ \forall g\in G\},
\]
which collects points that remain \(\varepsilon\)-close to \(x\) along the entire \(G\)-orbit [2606.13270].

The paper "Metric mean dimension of amenable group actions: localization and non-uniformity" [2606.13270] presents Tsukamoto’s original idea as the recovery of a global scale-sensitive invariant from the entropy of these small stable sets. For \(\mathbb Z\)- and \(\mathbb R^k\)-/\(\mathbb Z^k\)-actions, the localization formula is described in the form
\[
\overline{\mathrm{mdim}_M(X)}=\limsup_{\delta\to 0}\sup_{x\in X}\frac{h_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta)}{\log(1/\delta)},
\]
for every fixed \(\varepsilon>0\). The 2026 paper extends this viewpoint to actions of countable discrete amenable groups and proves, for every tempered Følner sequence \(\{F_n\}\) satisfying \(\lvert F_n\rvert/\log n\to\infty\), that
\[
\overline{\mathrm{mdim}_{M}(X,\{F_n\},d) = \limsup_{\delta\to 0}\sup_{x\in X} \frac{h_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta,\{F_n\},d)}{\log \frac1\delta}
\]
\[
= \limsup_{\delta\to 0}\sup_{x\in X} \frac{h^{P}_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta,\{F_n\},d)}{\log \frac1\delta}
= \limsup_{\delta\to 0}\sup_{x\in X} \frac{h^{B}_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta,\{F_n\},d)}{\log \frac1\delta}.
\]

This formulation is accompanied by equivalent upper metric mean dimension definitions for any nonempty \(Z\subset X\):
\[
\overline{\mathrm{mdim}_M(Z,\{F_n\},d) = \limsup_{\delta\to 0}\frac{h_{\mathrm{top}}(Z,\delta,\{F_n\},d)}{\log(1/\delta)},
\]
\[
\overline{\mathrm{mdim}_M^P(Z,\{F_n\},d) = \limsup_{\delta\to 0}\frac{h_{\mathrm{top}}^P(Z,\delta,\{F_n\},d)}{\log(1/\delta)},
\]
\[
\overline{\mathrm{mdim}_M^B(Z,\{F_n\},d) = \limsup_{\delta\to 0}\frac{h_{\mathrm{top}}^B(Z,\delta,\{F_n\},d)}{\log(1/\delta)}.
\]
For the whole system, Theorem 5 yields
\[
\overline{\mathrm{mdim}_M(X,\{F_n\},d) = \overline{\mathrm{mdim}_M^P(X,\{F_n\},d) = \overline{\mathrm{mdim}_M^B(X,\{F_n\},d),
\]
and also
\[
\overline{\mathrm{mdim}_M(X,\{F_n\},d) = \max_{x\in X}\overline{\mathrm{mdim}_M(x,\{F_n\},d).
\]

The technical novelty of the amenable-group extension is the replacement of tiling arguments by Lindenstrauss’s combinatorial covering lemma. Proposition 14 states that if the local Bowen-dimensional entropy of all stable sets \(\Gamma_\eta(x)\) is bounded above by \(\lambda\), then for small \(\delta\),
\[
\sup_{x\in X}N(\mathcal U^{F_n},B_\eta^{F_n}(x)) \le |\mathcal U|^{(\delta+\delta^{1/4})|F_n|}e^{\lambda |F_n|}2^{\delta |F_n|}.
\]
This estimate is identified as the amenable-group analogue of Bowen’s key covering estimate [2606.13270].

The same paper also establishes a limitation of the localization principle. It defines
\[
\overline D_{\mathrm{int}}(X,\varepsilon) = \limsup_{\delta\to 0}\sup_{x\in X} \frac{h_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta,\{F_n\},d)}{\log(1/\delta)},
\]
\[
\overline D_{\mathrm{ext}}(X,\varepsilon) = \sup_{x\in X}\limsup_{\delta\to 0} \frac{h_{\mathrm{top}}(\Gamma_\varepsilon(x),\delta,\{F_n\},d)}{\log(1/\delta)},
\]
with analogous lower quantities. Theorem 7 gives a \(\mathbb Z\)-subshift \(X\) such that for every \(\varepsilon\in(0,1)\),
\[
\overline D_{\mathrm{int}}(X,\varepsilon)=\underline D_{\mathrm{int}}(X,\varepsilon)=1,
\qquad
\overline D_{\mathrm{ext}}(X,\varepsilon)=\underline D_{\mathrm{ext}}(X,\varepsilon)=0.
\]
Thus the supremum and small-scale limit cannot generally be interchanged [2606.13270].

This establishes a characteristic feature of Tsukamoto’s localization approach: the global invariant is indeed recoverable from local stable sets, but not uniformly across phase space.

## 4. Recursive coverings and weighted topological pressure

A second dynamical-systems usage of Tsukamoto’s approach appears in weighted entropy and weighted pressure. The paper "Weighted topological pressure revisited" [2307.16772] describes Tsukamoto’s 2022 contribution as a redefinition of weighted pressure in a more “nested covering” style for the case of two systems, and then generalizes that idea to an arbitrary finite chain of factor maps.

The setting is a sequence
\[
(X_1,T_1)\xrightarrow{\pi_1}(X_2,T_2)\xrightarrow{\pi_2}\cdots\xrightarrow{\pi_{r-1}}(X_r,T_r),
\]
together with
\[
\boldsymbol a=(a_1,\dots,a_{r-1})\in[0,1]^{r-1}.
\]
From \(\boldsymbol a\) one forms
\[
\boldsymbol w_{\boldsymbol a}=(w_1,\dots,w_r)
\]
via
\[
\begin{cases}
w_1=a_1a_2\cdots a_{r-1},\\
w_2=(1-a_1)a_2\cdots a_{r-1},\\
w_3=(1-a_2)a_3\cdots a_{r-1},\\
\vdots\\
w_{r-1}=(1-a_{r-2})a_{r-1},\\
w_r=1-a_{r-1}.
\end{cases}
\]
These weights sum to \(1\) [2307.16772].

The new weighted entropy is defined recursively. With
\[
d^{(i)}_N(x,y)=\max_{0\le n<N} d^{(i)}(T_i^n x,T_i^n y),
\]
one first defines \(\#^{\boldsymbol a}_1(\Omega,N,\varepsilon)\) as the minimal number of open sets covering \(\Omega\subset X_1\) whose \(d_N^{(1)}\)-diameter is \(<\varepsilon\). Then, for \(\Omega\subset X_{i+1}\),
\[
\#^{\boldsymbol a}_{i+1}(\Omega,N,\varepsilon) = \min \left\{ \sum_{j=1}^n \big(\#^{\boldsymbol a}_i(\pi_i^{-1}(U_j),N,\varepsilon)\big)^{a_i} : \{U_j\}_{j=1}^n \text{ covers }\Omega,\ \operatorname{diam}(U_j,d_N^{(i+1)})<\varepsilon \right\}.
\]
The entropy is
\[
h^{\boldsymbol a}(\boldsymbol T) = \lim_{\varepsilon\to 0}\; \lim_{N\to\infty} \frac{1}{N}\log \#^{\boldsymbol a}_r(X_r,N,\varepsilon).
\]

The corresponding pressure uses Birkhoff sums
\[
S_N f(x)=\sum_{k=0}^{N-1} f(T_1^k x)
\]
and defines
\[
P^{\boldsymbol a}_1(\Omega,f,N,\varepsilon) = \inf \left\{ \sum_{j=1}^n \exp\!\left(\sup_{U_j} S_N f\right) : \{U_j\}_{j=1}^n \text{ covers }\Omega,\ \operatorname{diam}(U_j,d_N^{T_1})<\varepsilon \right\},
\]
then recursively
\[
P^{\boldsymbol a}_{i+1}(\Omega,f,N,\varepsilon) = \inf\left\{ \sum_{j=1}^n \big(P^{\boldsymbol a}_i(\pi_i^{-1}(U_j),f,N,\varepsilon)\big)^{a_i} : \{U_j\}_{j=1}^n \text{ covers }\Omega,\ \operatorname{diam}(U_j,d_N^{T_{i+1}})<\varepsilon \right\},
\]
and finally
\[
P^{\boldsymbol a}(f) = \lim_{\varepsilon\to 0}\; \lim_{N\to\infty} \frac{1}{N}\log P^{\boldsymbol a}_r(X_r,f,N,\varepsilon).
\]

The main theorem states
\[
P^{\boldsymbol a}(f) = \sup_{\mu\in\mathscr M^{T_1}(X_1)} \left( \sum_{i=1}^r w_i\, h_{\pi_*^{(i-1)}\mu}(T_i) + w_1\int_{X_1} f\,d\mu \right),
\]
and, for \(f\equiv 0\),
\[
h^{\boldsymbol a}(\boldsymbol T) = \sup_{\mu\in\mathscr M^{T_1}(X_1)} \left( \sum_{i=1}^r w_i\, h_{\pi_*^{(i-1)}\mu}(T_i) \right).
\]
The paper interprets this as a higher-dimensional generalization of Tsukamoto’s cover-based redefinition and emphasizes that the method avoids the direct weighted-Bowen-ball formulation of Feng–Huang [2307.16772].

This suggests that, in this branch of Tsukamoto’s approach, the decisive move is recursive descent through factor maps: local covering complexities are propagated level by level and then reassembled by exponents \(a_i\).

## 5. Directional and information-theoretic extensions of mean dimension

Tsukamoto’s influence on mean-dimension theory also appears in two adjacent developments: directional mean dimension under expansiveness hypotheses and the information-theoretic reformulation of mean dimension through rate-distortion-type quantities [2108.06308], [2510.08051].

The paper "Directional mean dimension and continuum-wise expansive \(\mathbb{Z}^k\)-actions" [2108.06308] is positioned as a directional-mean-dimension analogue of the theorem of Meyerovitch and Tsukamoto on mean dimension and expansive multiparameter actions. For a \(\mathbb{Z}^k\)-action \((X,\mathbb{Z}^k;T)\), an \(h\)-dimensional subspace \(V\subset \mathbb{R}^k\), and \(r>\sqrt{k}/2\),
\[
B_r(V)=\{u\in \mathbb{Z}^k:\ |u-w|<r \text{ for some } w\in V\},
\]
and the directional mean dimension is defined by
\[
\operatorname{mdim}(X;T;V) = \lim_{\varepsilon\to 0} \liminf_{N\to\infty} \frac{ \operatorname{Widim}_{\varepsilon}\bigl(X,d_{B_r(V)\cap[-N,N]^k}\bigr) }{ \operatorname{vol}_h\bigl(V\cap[-N,N]^k\bigr) }.
\]
The main theorem states that if \((X,\mathbb{Z}^k;T)\) is continuum-wise expansive, then the \((k-1)\)-dimensional directional mean dimension with respect to any direction is finite and uniformly bounded by a finite number depending only on \((X,\mathbb{Z}^k;T)\) [2108.06308].

The same paper proves that directional mean dimension need not be continuous as a function of direction. For any \(\alpha\in[0,\infty]\), there exists a \(\mathbb{Z}^2\)-action \((X,\mathbb{Z}^2;T)\) such that
\[
\operatorname{mdim}(X;T;\langle v\rangle^\perp)=
\begin{cases}
\alpha, & v\in\{(-1,0),(1,0)\},\\
0, & v\in S\setminus\{(-1,0),(1,0)\}.
\end{cases}
\]
This non-continuity result prevents any simple continuity-based transfer of Meyerovitch–Tsukamoto-style finiteness to all directions [2108.06308].

The paper "Mean dimension and rate-distortion function revisited" [2510.08051] continues the Lindenstrauss–Tsukamoto program in an explicitly information-theoretic direction. It recalls the upper metric mean dimension
\[
\overline{\operatorname{mdim}_M(T,X,d)} =\limsup_{\epsilon\to 0}\frac{h_{\mathrm{top}}(T,X,d,\epsilon)}{\log(1/\epsilon)},
\]
with
\[
h_{\mathrm{top}}(T,X,d,\epsilon)=\limsup_{n\to\infty}\frac{1}{n}\log s(X,d_n,\epsilon),
\qquad
d_n(x,y)=\max_{0\le j<n}d(T^jx,T^jy).
\]
For the Hilbert cube shift \(([0,1]^{\mathbb Z},\sigma)\), it proves for every invariant measure \(\mu\),
\[
\underline{\mathrm{MRID}}([0,1]^{\mathbb Z},\sigma,d^{\mathbb Z},\mu)=\underline d(\mu),
\qquad
\overline{\mathrm{MRID}}([0,1]^{\mathbb Z},\sigma,d^{\mathbb Z},\mu)=\overline d(\mu),
\]
thereby answering a question of Gutman and Śpiewak [2510.08051].

The same work introduces four rate-distortion entropies and proves that for every ergodic \(\mu\) and every \(p\ge 1\),
\[
h_{\mu,L^p}(T)=h_{\mu,L^\infty}(T)=h_{\mu,B}(T)=\lim_{r\to 0} h_{\mu,r}(T)=h_\mu(T).
\]
Under the marker property and finite mean dimension, it sharpens the double variational principle to
\[
\operatorname{mdim}(X,T) = \min_{d\in\mathcal D'(X)} \sup_{\mu\in E(X,T)} \left\{\limsup_{\epsilon\to 0}\frac{1}{\log(1/\epsilon)}\,h_\mu(T,\epsilon)\right\}
= \min_{d\in\mathcal D'(X)} \sup_{\mu\in M(X,T)} \left\{\limsup_{\epsilon\to 0}\frac{1}{\log(1/\epsilon)}\,h_\mu(T,\epsilon)\right\}.
\]

Taken together, these results show that Tsukamoto’s approach in mean-dimension theory is not confined to one formula. It includes a directional-expansive line, a localization line via stable sets, and an information-theoretic line via rate-distortion and local entropy [2108.06308], [2606.13270], [2510.08051].

## 6. Long-time self-body image acquisition in musculoskeletal robotics

A distinct usage of Tsukamoto’s approach appears in robotics, particularly in "Long-time Self-body Image Acquisition and its Application to the Control of Musculoskeletal Structures" [2404.05293]. Here the problem is the control of tendon-driven musculoskeletal humanoids whose joint–muscle relationships are highly nonlinear and strongly affected by body softness, friction, muscle interference, and route changes. The paper states that conventional model-based control cannot realize intended movements and proposes a learning control mechanism that acquires the nonlinear relationships among joint angles, muscle tensions, and muscle lengths from actual sensor data [2404.05293].

The self-body image is represented by
\[
\bm{l} = \bm{f}(\bm{\theta}, \bm{T}) = \bm{f}_{ideal}(\bm{\theta}) + \bm{g}(\bm{\theta}, \bm{T}),
\]
where \(\bm{f}_{ideal}\) is the ideal joint–muscle mapping and \(\bm{g}\) is the muscle-route change model. The paper explicitly separates the learned model into these two networks because the scale of the ideal geometric mapping and the compensation due to tension-induced elongation or route change are very different, and a single network tends to learn poorly or drift [2404.05293].

The long-time acquisition mechanism has three major components: initial training from a geometric model, online learning from actual sensor data, and a safety mechanism to prevent over-tension and overheating. The online data extraction rules are
\[
\bm{\theta}_{vision} = IK(\bm{\theta}_{initial}=\bm{\theta}_{est}, \bm{P}_{target}=\bm{P}_{vision}),
\]
\[
\bm{\theta}_{actual} = \bm{\theta}_{potentio}\;\; \textrm{or}\;\; \bm{\theta}_{vision},
\]
\[
(\bm{\theta}_{update}, \bm{l}_{update}) = (\bm{\theta}_{actual}, \bm{l}_{m}-\bm{g}(\bm{\theta}_{actual}, \bm{T}_{m})),
\]
\[
(\bm{\theta}_{update}, \bm{T}_{update}, \bm{l}_{update}) = (\bm{\theta}_{actual}, \bm{T}_{m}, \bm{l}_{m}-\bm{f}_{ideal}(\bm{\theta}_{actual})).
\]
To update the ideal mapping, the current route-change output is subtracted from measured muscle length; to update the route-change model, the ideal output is subtracted instead [2404.05293].

A major practical contribution is the data accumulation and augmentation pipeline. The minibatch combines one sample from the current extraction, \(N_b\) stored samples, \(N_c\) constraint samples, and \(N_d\) random model-consistency samples, with
\[
N_b = 10,\quad N_c = 5,\quad N_d = 5.
\]
For IJMM, constraint data include
\[
(\bm{0}, \bm{0}),
\]
and for MRCM, augmentation uses
\[
\bm{\theta}_{around} = \bm{\theta}_{update} + \mathcal{N}(0,\delta\bm{\theta}_{div}).
\]

The safety mechanism modifies target muscle lengths by
\[
\delta{l} = K_{T}\textrm{max}(T-T_{lim}, 0)+K_{C}\textrm{max}(C-C_{lim}, 0),
\]
\[
\delta{l}_{t+1} = \delta{l}_{t} + \textrm{max}(-\delta{l}_{lim}, \textrm{min}(\delta{l}_{lim}, \delta{l}-\delta{l}_{t})),
\]
\[
l_{target} = l_{target}+\delta{l}_{t+1},
\]
with
\[
K_T = 1.0 \text{ mm/N},\quad
K_C = 1.0 \text{ mm/}^{\circ}\text{C},\quad
T_{lim} = 200 \text{ N},\quad
C_{lim} = 60^\circ\text{C},\quad
\delta l_{lim} = 0.01 \text{ mm}.
\]
The mechanism runs every 8 msec [2404.05293].

The learned self-body image supports position control, torque control, and variable stiffness control. The position-control formulation uses
\[
\bm{T}_{target} = \bm{T}_{bias} + \textrm{max}(\bm{0}, K_{stiff}(\bm{l}-\bm{l}_{target})),
\]
\[
\bm{l}_{soft}(\bm{T}) = -(\bm{T} - \bm{T}_{bias})/K_{stiff},
\]
and then either
\[
\bm{l}_{target} = \bm{f}(\bm{\theta}_{target}, \bm{T}_{const})+\bm{l}_{soft}(\bm{T}_{const})
\]
or
\[
\bm{l}_{target} = \bm{f}(\bm{\theta}_{target}, \bm{T}_{measured})+\bm{l}_{soft}(\bm{T}_{measured}).
\]
For variable stiffness, operational stiffness is
\[
K_w(\bm{\theta}, \bm{T})=J(\bm{\theta})^{-T}G(\bm{\theta})^{T}K_m(\bm{\theta}, \bm{T})G(\bm{\theta})J(\bm{\theta})^{-1},
\]
joint torque is
\[
\bm{\tau}(\bm{\theta}, \bm{T})=-G(\bm{\theta})^{T}\bm{T},
\]
and the search objective is
\[
E(\bm{\theta}, \bm{T})= |K^{-1}_{target}K_w(\bm{\theta}, \bm{T})-I| +\alpha|\bm{\tau}(\bm{\theta}, \bm{T}_{current})-\bm{\tau}(\bm{\theta}, \bm{T})|,
\]
with
\[
\alpha = 0.02,\quad N_{v1}=10,\quad N_{v2}=2,\quad N_{v3}=50.
\]

Experimentally, the paper reports that in a 3-hour self-body image acquisition experiment the average RMSE decreases from about \(0.3\) rad to about \(0.08\) rad over about the first 40 minutes; that the safety mechanism keeps muscle temperature below \(70^\circ\)C and below the burnout threshold \(C_{burn}=90^\circ\)C even when temperature rises rapidly; and that the learned model supports variable stiffness behavior and impact absorption [2404.05293].

In this robotics usage, Tsukamoto’s approach is not an asymptotic analytic method but a long-time adaptive modeling strategy. The shared principle with the dynamical-systems and lensing usages is nevertheless recognizable: global control performance is achieved by decomposing the problem into structured local corrections learned or evaluated where the nonlinearities are concentrated.

## 7. Conceptual unity and domain-specific differences

The phrase "Tsukamoto’s approach" does not denote a single cross-disciplinary formalism. Rather, the literature shows several domain-specific methods that share a common methodological architecture while differing sharply in object, scale, and proof technology [2506.13091], [2606.13270], [2307.16772], [2404.05293].

In gravitational lensing, the central operation is asymptotic singularity extraction near the photon sphere. The divergent part of the deflection integral is separated from the regular remainder, and the observable content is compressed into coefficients such as \(\bar a,\bar b\) or \(\tilde a,\tilde b\) [2506.13091], [2509.11985]. In metric mean dimension, the global invariant is localized to pointwise stable sets \(\Gamma_\varepsilon(x)\), but the 2026 amenable-group analysis shows that this localization is non-uniform: the supremum over points must generally be taken before the small-scale limit [2606.13270]. In weighted pressure, the method is recursive and combinatorial: cover complexities are nested through factor maps and reweighted by exponents \(a_i\), yielding a variational principle equivalent to the Feng–Huang invariant [2307.16772]. In the rate-distortion line, the approach becomes information-theoretic, replacing direct topological complexity by \(\epsilon\)-entropy and coding-cost quantities while preserving variational recovery of mean dimension [2510.08051]. In robotics, the method becomes online and operational, decomposing the self-body image into ideal geometry plus route-change compensation and stabilizing learning by accumulation, augmentation, and explicit safety logic [2404.05293].

A common misconception is that Tsukamoto’s approach names one universally standardized method. The literature instead supports a narrower statement: it names a family of methods that are recognized by local-to-global reduction, recursive decomposition, or asymptotic isolation of the dominant contribution, with the exact mathematics determined by the host field. Another misconception would be to read the localization formulas or strong-deflection formulas as uniform statements. The amenable-group counterexamples show non-uniformity in metric mean dimension [2606.13270], and the black-hole applications show that different deformation parameters can have markedly different observational relevance, with charge effects dominating quantum-correction effects at current precision in the quantum-corrected Reissner–Nordström case [2506.13091].

This suggests that the most stable encyclopedia-level characterization is methodological rather than doctrinal. Tsukamoto’s approach, across the literatures in which the term appears, is an approach in which a difficult global quantity is reconstructed from a carefully chosen local, recursive, or singular structure, and in which that reduction is strong enough to support either rigorous variational characterizations, asymptotic lensing formulas, or long-horizon adaptive control.

Source: https://www.emergentmind.com/topics/tsukamoto-s-approach