This paper investigates the sound ranging problem in infinite-dimensional Hilbert space, providing conditions for solution uniqueness and examples illustrating multiple solutions, extending classical methods to an abstract mathematical setting.
Contribution
It introduces solving methods for sound ranging in Hilbert spaces and establishes conditions for solution uniqueness and multiplicity, which are novel in this infinite-dimensional context.
Findings
01
Provided sufficient conditions for uniqueness of solutions.
02
Constructed examples with basis sensor sets illustrating solution multiplicity.
03
Extended sound ranging problem analysis to infinite-dimensional spaces.
Abstract
We consider the sound ranging problem, which is to find the position of the source-point from the moments when the wave-sphere of linearly, with time, increasing radius reaches the sensor-points, in the infinite-dimensional separable Euclidean space H, and describe the solving methods, for entire space and for its unit sphere. In the former case, we give some sufficient conditions for uniqueness of the solution. We also provide two examples with the sets of sensors being a basis of H: 1st, when sound ranging problem and so-called dual problem both have single solutions, and 2nd, when sound ranging problem has two distinct solutions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
On sound ranging in Hilbert space
Sergij V. Goncharov
Faculty of Mechanics and Mathematics, Oles Honchar Dnipro National University, 72 Gagarin Avenue, 49010 Dnipro, Ukraine.
E-mail: [email protected]
(July 2017)
Abstract
We consider the sound ranging problem, which is to find the position of the source-point from the moments when the wave-sphere of linearly, with time, increasing radius
reaches the sensor-points, in the infinite-dimensional separable Euclidean space H, and describe the solving methods,
for entire space and for its unit sphere. In the former case, we give some sufficient conditions for uniqueness of the solution.
We also provide two examples with the sets of sensors being a basis of H:
1st, when sound ranging problem and so-called dual problem both have single solutions,
and 2nd, when sound ranging problem has two distinct solutions.
By sound ranging (SR), we mean the following problem. Let (X;ρ) be a metric space, i.e. the set X with metric ρ:X×X→R+.
Let s∈X be an unknown point, “source”. At unknown moment te∈R of time the source “emits the (sound) wave”,
which is the sphere
for any moment t⩾te. Here v is known “sound velocity”, and we may assume, without loss of generality, that v=1
(switching to scaled time t←vt if v=1).
Let R={r(i)}i∈I, r(i)∈X, be an indexed set of “sensors”, whose positions are known.
Suppose that for each sensor we know the moment ti when it was reached by the expanding wave;
that is, ti=te+ρ(r(i);s) are known.
The problem is to find s and te, — from known moments when the wave reaches known sensors, (R;{ti}).
We’re also interested in uniqueness of the solution.
Retrospection. The researches on SR, —
also called passive location, sound triangulation, time-(difference-)of-arrival source localization, —
are considered to begin at the times of World War I, with the works of William L. Bragg, Lucien Bull, Erich Waetzmann among the others
(see [3], [4], [5], and [22], [28] for a survey).
Similar questions were studied in [2], [9], [11], [17]
from that “geometrical” era. During the century that followed, along with military
([7], [12], [15], [25], [26])
and surveillance-related ([24]) applications,
SR attracted acousticians and seismologists, to name a few, — [13], [20], [30], [36], [37, 5.7].
For a fairly long time, SR problems accompany the studies of (wireless) sensor networks
([1], [6], [10], [21], [23], [29], [31]; see also [39]).
Naturally, the majority of these researches relates to R2 or R3
(emphasized occasionally: [34], [36], [38]),
though there are exceptions ([6], [21], [27], [29], [35]).
The basic problem was generalized to take into account the “wind” or “flow” that gives an additional movement to the wave,
the variations of sound velocity at different regions of space, diffraction and reverberation,
the inaccuracy of measurements and its influence on the solution(s),
noise removal etc. ([16], [18], [20]), — generally speaking, the factors imposed by “physics”
(as a result, sometimes there’s the inclination towards practical applicability instead of rigour).
The uniqueness of the solution was analyzed as well, for example in [8], [20], [27], [32], [33].
The substantial part of the studies in the field deals with the so-called overdetermined problems, when the data from each sensor contains some random error,
and the position of the source is estimated in attempt to reduce the uncertainty
([6], [10], [13], [14], [18], [19], [35]).
Aim. The generalization being investigated here concerns only the infinite dimensionality of the (empty) space where source and sensors are placed,
and omits “physical” factors (comparing it with most of the papers listed in References, we warn at once that it is of much less “applicability”).
Consider (associated, in a way) question about solving such a problem: what limitations do we impose on the “procedure” — or “algorithm” —
of obtaining the solution s∈X?
There’s always a “universal” one, U: “go over all s∈X and select those satisfying ti=te+ρ(r(i);s)”
(if we know s, te can be found easily as ti−ρ(r(i);s) for some i).
But U seems to be too “heavy”. If, in a sense, the verification of each s takes a non-zero amount of time τ,
then for many kinds of spaces X we’ll need an infinite, non-countable set of “verificating entities” to confine into a finite time.
Less heavy but still not appropriate procedure N is as follows: take some point b∈X as the “origin” and, at each n-th step,
make the “n1-net Nn” in the ball B(b;n) (∀x∈B(b;n)∃y∈Nn: ρ(x;y)<n1).
In turn, for each y∈Nn calculate the “defect” \delta(\mathbf{y})=\sup\limits_{i}\bigl{|}t_{e}+\rho(\mathbf{r}^{(i)};\mathbf{y})-t_{i}\bigr{|},
and select the y with defect not greater than y∈Nninfδ(y)+n1. ρ(b;s)<∞ implies
the existence of the sequence {yn′∈Nn} such that yn′→s as n→∞ (not unique, though).
We prefer more “countable” and “aimed” methods. On the other hand, we “allow ourselves” the calculation of infinite sums in a finite time, as short as we want.
Well-knowns. Hereinafter, H is the separable infinite-dimensional Hilbert space over the field of reals R. We denote by <x;y>
the scalar product of any x,y∈H, and by ∥x∥ the norm of x. As usual, <x;x>=∥x∥2.
Since the field is R, <y;x>=<x;y> (the complex case reduces to the real one with “twice more dimensions”,
due to representability of distance between 2 points with complex coordinates through their real and imaginary parts).
x⊥y means <x;y>=0.
Some common properties of scalar product and norm are used without explicit reference:
∙ for any orthonormal basis {ek}k∈N of H, if x=k=1∑∞xkek
and y=k=1∑∞ykek, then <x;y>=k=1∑∞xkyk,
independent of basis {ek}.
∙ Cauchy-Bunyakowsky-Schwartz inequality (CBS): ∣<x;y>∣⩽∥x∥⋅∥y∥,
and the inequality becomes equality if and only if x and y are linearly dependent, that is,
∃a,b∈R: a2+b2=0 and ax+by=θ (where θ is the zero of H as linear vector space).
Moreover, if <x;y>=∥x∥⋅∥y∥ and y=θ, then x=cy, where c⩾0.
∙ If ∥x±y∥=∥x∥±∥y∥, then x and y
are linearly dependent (follows from previous statement).
Disclaimer. It appears that X=H introduces nuances (mostly dealing with limits and convergency),
however the basic method is that of Rn case.
We surmise many of the subsequent results, — especially the “auxiliary” ones, — to be already known, even as “folklore”, perhaps;
if so, this is merely where they come together… once more (see also “Acknowledgements”).
1 SR in Hilbert space
Hereinafter, the set R⊂H of sensors is finite or countable, and the SRP(roblem) is supposed to have at least one solution (s0;te;0), which may be unknown.
To simplify the notation, we move “the origin of space and time” to one of sensors at the moment when the (sound) wave reaches it.
So, R={r(0),r(1),...,r(n),...} with r(0)=θ, and the wave reaches these sensors
at the moments t0=0, t1, t2, …, where ti=te;0+∥r(i)−s0∥.
By L(A) we denote the linear closure of the set A⊆H. Note that L(R)=L({r(i)}i∈N), of all sensors but r(0).
We denote {r(i)}i∈N by R˙.
We begin by excluding the sets of sensors such that the solution, if it exists, is obviously not unique.
If L(R˙)=H and the source s0∈/L(R˙), then by projection theorem s0=u+h, where u∈L(R˙),
h⊥L(R˙) and h=θ. Then for each sensor the square of “reaching time”,
(<r(i)−u;h>=0 since these elements are orthogonal) would be the same for s0′=u−h, —
SRP has 2 solutions being non-distinguishable by the {ti}.
Moreover, if H=L(R˙)⊕K and dimK⩾2, then ∃w=θ: w⊥L(R˙) and w⊥h.
Consider normalized h=∥h∥h, w=∥w∥w,
and let s(φ)=u+∥h∥(cosφ⋅h+sinφ⋅w);
it is easy to see that s(φ) is a solution of SRP for any φ∈[0;2π), — we have an infinite, non-countable set of solutions.
Let L(R˙)=H, and let R˙ be a linearly independent set. In other words, let R˙ be a basis of H.
We introduce the orthonormal basis B={ei}i∈N, derived from R˙ by Gram-Schmidt orthogonalization.
With B, H is l2 and r(i)=j=1∑∞rj(i)ej=(r1(i);r2(i);...;ri(i);0;0;...), where ri(i)=0.
To find s is to find its coordinates (s1;s2;...).
The SRP is equivalent to the following set of equations: ti=t+∥r(i)−s∥, i∈Z+ (1)
Note that [math]-th equation is actually 0=t+∥θ−s∥⇔t=−∥s∥.
(For instance, take H=L2[a;b], and let f∈L2[a;b] be an unknown function. Suppose that for each i∈N we know
t_{i}=t+\bigl{(}\int\limits_{a}^{b}|f(x)-x^{i-1}|^{2}dx\bigr{)}^{\frac{1}{2}}, where t=-\bigl{(}\int\limits_{a}^{b}f^{2}(x)dx\bigr{)}^{\frac{1}{2}} is unknown too.)
We now proceed to the implied set of equations ∥r(i)−s∥2=(ti−t)2, i∈Z+ (2)
which may have additional solutions (s;t). To distinguish them from those of (1),
we verify that ∀i∈Z+: t⩽ti (in particular, t⩽t0=0) — “the wave was emitted before it reached sensors”.
Dual problem. The additional solutions of (1) such that t⩾ti are the solutions of the dual,
“in-mission” problem (in contrast with the original “out-mission” one),
where the wave is emitted from the source and propagates backward in time (being observed in “usual” time, it collapses into source):
ti=t−ρ(r(i);s). In reversed time T=−t these problems are swapped.
If (s′;t′) is a solution of SRP, and (s′′;t′′) is a solution of dual problem, then for any r(i):
ti=t′+ρ(r(i);s′) and ti=t′′−ρ(r(i);s′′), thus
ρ(r(i);s′)+ρ(r(i);s′′)=t′′−t′=const
which may be interpreted as: all sensors belong to the “ellipsoid” with s′ and s′′ being its “focuses”.
The following example shows that it’s possible in H.
Example 1.⊲
Let H=l2, E=\bigl{\{}\mathbf{x}\in H\mid g(\mathbf{x})=\frac{x_{1}^{2}}{2}+\sum\limits_{k=2}^{\infty}x_{k}^{2}=1\bigr{\}},
and s′=(−1;0;0;...), s′′=(1;0;0;...). We claim that ∀x∈E: ∥x−s′∥+∥x−s′′∥=22.
Proof.
Consider L_{n}=\bigl{\{}(x_{1};...;x_{n};0;0;...)\mid x_{i}\in\mathbb{R},i=\overline{1,n}\bigr{\}}\sim\mathbb{R}^{n} and
E_{n}=\bigl{\{}\mathbf{x}\in L_{n}\mid g_{n}(\mathbf{x})=\frac{x_{1}^{2}}{2}+\sum\limits_{k=2}^{n}x_{k}^{2}=1\bigr{\}} for n⩾2.
We now show that ∀x∈En: ∥x−s′∥+∥x−s′′∥=22, by induction.
For n=2 it holds true since E2, in L2, is the ellipse x12/2+x22=1 with focuses (±c;0), where c=2−1=1.
Suppose it holds true for n⩾2.
For any x∈En+1, let x(φ)=(x1;...;xn−1;xn(φ);xn+1(φ)),
where xn(φ)=xncosφ−xn+1sinφ and xn+1(φ)=xnsinφ+xn+1cosφ, for φ∈[0;2π).
gn+1(x(φ))=2x12+k=2∑n−1xk2+(xn(φ))2+(xn+1(φ))2=2x12+k=2∑n+1xk2=gn+1(x)=1, hence x(φ)∈En+1 too.
Similarly, ∥x(φ)−s′∥2=2(x1+1)2+k=2∑n−1xk2+(xn(φ))2+(xn+1(φ))2=2(x1+1)2+k=2∑n+1xk2=∥x−s′∥2, and ∥x(φ)−s′′∥=∥x−s′′∥.
∃φ0∈[0;2π): xn+1(φ0)=0, for instance, φ0={π/2,−arctanxnxn+1,xn=0,xn=0, so x(φ0)∈Ln. Moreover, gn(x(φ0))=gn+1(x(φ0))=1⇒x(φ0)∈En.
Therefore, ∥x−s′∥+∥x−s′′∥=∥x(φ0)−s′∥+∥x(φ0)−s′′∥=22:
the statement holds true for n+1.
Induction principle leads to it being true for any n⩾2.
Let x∈E, and consider \mathbf{x}^{(n)}=\Bigl{(}x_{1};...;x_{n-1};\sqrt{\sum\limits_{k=n}^{\infty}x_{k}^{2}};0;0;...\Bigr{)}\in L_{n} for n⩾3.
gn(x(n))=2x12+k=2∑n−1xk2+k=n∑∞xk2=g(x)=1,
thus x(n)∈En⇒∥x(n)−s′∥+∥x(n)−s′′∥=22.
We place sensors in E as follows: r(0)=(−2;0;0;...), r(1)=(2;0;0;...), and
r(k)=(k−10;...;0;1;0;0;...) for k⩾2
(so r(1)−r(0)=(22;0;0;...) and r(k)−r(0)=(2;k−20;...;0;1;0;0;...) for k⩾2;
R˙={r^(k)}k∈N={r(k)−r(0)}k∈N is a basis of H).
Since ∀k∈Z+: ∥r(k)−s′∥+∥r(k)−s′′∥=22, we have for t′=−2, t′′=2,
and tk=t′+∥r(k)−s′∥: tk=(t′′−22)+(22−∥r(k)−s′′∥)=t′′−∥r(k)−s′′∥.
In other words, for sensors R={r(k)}k∈Z+ and moments {tk}k∈Z+,
(s′;t′) is the solution of SRP, and (s′′;t′′) is the solution of dual problem. ⊳
(It was enough to show that ∀k∈Z+: ∥r(k)−s′∥+∥r(k)−s′′∥=22, without resort to E.)
Now we return to solving SRP, with the wave propagating forward in time.
Since ∥r(i)−s∥2=j=1∑∞(rj(i)−sj)2, rj(0)≡0, and t0=0, we arrive to the following:
Let b_{i}=\frac{1}{2}\bigl{[}\|\mathbf{r}^{(i)}\|^{2}-t_{i}^{2}\bigr{]}, ci=ti, so j=1∑irj(i)sj=bi+tci for all i∈N.
We denote by A the infinite matrix ∥aij∥i,j∈N=∥rj(i)∥=r1(1)r1(2)...0r2(2)...00.........⋱.
Also, S=s1s2..., and G(t)=B+tC, where B=b1b2..., C=c1c2.... And we have AS=G(t).
The way that we’ve specified {r(i)} allows to express sk through t from the first k equations of this set;
if we “cut off” A, S, and G(t) after first k rows and columns, the resulting matrix equation AkSk=Gk(t)
is equivalent to the set of k equations with k unknowns s1, …, sk.
S=B+tC with B=b1b2... and C=c1c2...; A(B+tC)=B+tC⇒AB=B, AC=C.
Substituting (1) into j=1∑∞sj2=t2 gives j=1∑∞(bj+tcj)2=t2 (5)
Case 0:t=0 is a root of (1). We claim that s=θ is the unique solution of SRP then.
Proof.t=0 turns (1) into equality: j=1∑∞bj2=0⇔bj=0 for all j∈N.
Since AB=B, it follows that bi=0 for any i∈N:
∥r(i)∥2=ti2⇔∥r(i)∥=∣ti∣.
On the other hand, for any solution (s;t) of SRP ti=t+∥r(i)−s∥=−∥s∥+∥r(i)−s∥.
Therefore \|\mathbf{r}^{(i)}\|=\bigl{|}\|\mathbf{r}^{(i)}-\mathbf{s}\|-\|\mathbf{s}\|\bigr{|}.
a) ∥r(i)∥=∥r(i)−s∥−∥s∥⇔∥r(i)∥+∥−s∥=∥r(i)+(−s)∥.
b) ∥r(i)∥=−∥r(i)−s∥+∥s∥⇔∥s∥−∥r(i)∥=∥s−r(i)∥.
In any case, r(i) and s are linearly dependent for any i∈N.
Since R˙={r(i)}i∈N is linearly independent, it is only possible when s=θ.
∎
Until now, the solving method had little relation with infinite dimensionality of H.
Case 1:t=0 isn’t a root of (1) (thus j=1∑∞bj2=0, and s=θ).
We divide it by t: j=1∑∞(cj+zbj)2=1 (6)
where z=1/t<0. By assumption, SRP has at least 1 solution, so for some ze;0=1/te;0 (1) holds true,
implying {cj+ze;0bj}j∈N=v∈H.
The relations C=v−ze;0B and B=ze;01(v−C)
show that B and C belong or don’t belong to H simultaneously;
the series j=1∑∞bj2 and j=1∑∞cj2 both converge or both diverge.
Subcase 1a (ruled out in Rn):j=1∑∞bj2 and j=1∑∞cj2 diverge.
Yet for some ze;0: j=1∑∞(cj+ze;0bj)2 converges to 1.
Assuming ∃z′=ze;0 such that j=1∑∞(cj+z′bj)2 converges,
we obtain from equality
the convergence of j=1∑∞bj2, which contradicts the assumption of the subcase.
Hence ze;0 is the one and only value not just satisfying (1), but providing the convergence of the series in the left side of (1).
How to obtain it? (Recall that we don’t allow ourselves to “go over all z<0 and select the one satisfying the equation”).
∃n0: j=1∑n0bj2>0, therefore for any n⩾n0: fn(z)=j=1∑n(cj+zbj)2−1=
is a quadratic trinomial with αn>0. And fn(z)⩽fn+1(z)⩽f∞(z), so fn(ze;0)⩽0: the equation fn(z)=0 has at least one root.
It is well known that {z∈R:fn(z)⩽0} is the segment [z−(n);z+(n)] whose center is zn=−2αnβn.
For any ε>0 the series diverges at ze;0−ε and ze;0+ε, therefore ∃n=n(ε): fn(ze;0−ε)>0 and fn(ze;0+ε)>0.
Consequently, [z−(n);z+(n)]⊂(ze;0−ε;ze;0+ε); in particular, zn∈(ze;0−ε;ze;0+ε).
That is, z_{n}=-\bigl{[}\sum\limits_{j=1}^{n}\widetilde{b_{j}}\widetilde{c_{j}}\bigr{]}/\bigl{[}\sum\limits_{j=1}^{n}\widetilde{b_{j}}^{2}\bigr{]}\xrightarrow[n\rightarrow\infty]{}z_{e;0}.
Subcase 1b:j=1∑∞bj2 and j=1∑∞cj2 converge.
From the common properties of series it follows that we can rewrite (1) as
or αz2+βz+γ=0, where α>0;
what’s left to do is to solve it, z±=2α−β+D (D=β2−4αγ⩾0 since ze;0 is a root),
and select the root(s) z such that z<0 and t=1/z⩽ti for any i∈N.
This concludes the description of the solving method for SRP in H.
(1) can have 2 distinct roots satisfying t\leqslant t_{i}\bigl{|}_{i\in\mathbb{Z_{+}}}, — even when sensors make a basis,
SRP in H can have 2 distinct solutions, as the following example indicates.
Example 2.⊲
Let non-θ sensors, R˙={r(k)}k∈N, be r(k)=k1ek,
with {ek} being an orthonormal basis of H. For the source s′=−k=1∑∞k1ek=(−1;−21;−31;...),
which emits the wave at the moment t′=−∥s′∥=−k=1∑∞k21=−6π,
the moments {tk} when k-th sensor is reached by this wave are such that
implying t_{k}=-\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{3}{k^{2}}}=\frac{3}{k^{2}\bigl{(}\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{3}{k^{2}}}\bigr{)}}>0
(by construction, for r(0)=θ, t0=0).
Now we solve the corresponding SRP in accordance with the procedure described above, knowing that (s′;t′) is a solution.
The basis is {ei}; the equations from (1) take the form of
where \widetilde{b_{k}}=\frac{1}{k}\cdot\frac{1}{2}\Bigl{[}1-\frac{9}{k^{2}\bigl{(}\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{3}{k^{2}}}\bigr{)}^{2}}\Bigr{]},
ck=k1⋅6π+6π2+k233.
It is clear that t=0 isn’t a root of k=1∑∞(bk+tck)2=t2, k=1∑∞bk2 converges
and k=1∑∞ck2 converges. Thus we can switch to z=1/t and the equation αz2+βz+γ=0 from Subcase 1b.
D⩾0 because z′=1/t′=−π6 is a root. Let z′′ be a second root; we claim that z′′<0 and z′′=z′.
Proof.z′z′′=αγ. Since α>0, signz′z′′=signγ. From \sum\limits_{k=1}^{\infty}\widetilde{c_{k}}^{2}=\sum\limits_{k=1}^{\infty}\frac{9}{k^{2}\bigl{(}\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{3}{k^{2}}}\bigr{)}^{2}}>
Assume that z′=z′′, then αγ=(z′)2=π26⇔k=1∑∞ck2=1+π26k=1∑∞bk2⇔\sum\limits_{k=1}^{\infty}\bigl{(}\widetilde{c_{k}}^{2}-\frac{6}{\pi^{2}}\widetilde{b_{k}}^{2}\bigr{)}=1.
However, when k⩾3,
0<k\widetilde{b_{k}}\leqslant\frac{1}{2}\Bigl{[}1-\frac{9}{k^{2}\bigl{(}\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{1}{3}}\bigr{)}^{2}}\Bigr{]}\leqslant\frac{1}{2}<1<\frac{3}{\frac{\pi}{\sqrt{6}}+\sqrt{\frac{\pi^{2}}{6}+\frac{1}{3}}}<k\widetilde{c_{k}}⇒0<bk<ck⇒0<π6bk<ck⇒ck2>π26bk2.
A little more numerical computation, and we get \sum\limits_{k=1}^{3}\bigl{(}\widetilde{c_{k}}^{2}-\frac{6}{\pi^{2}}\widetilde{b_{k}}^{2}\bigr{)}\approx 1.139918>1,
so \sum\limits_{k=1}^{\infty}\bigl{(}\widetilde{c_{k}}^{2}-\frac{6}{\pi^{2}}\widetilde{b_{k}}^{2}\bigr{)}>1; a contradiction. Therefore z′′=z′.
∎
Then t′′=1/z′′<0<tk, and s′′={bj+t′′cj},
is another solution, different from (s′;t′). ⊳
Remark. Non-uniqueness of SRP solution is a well known occasion in Rn.
For example, in R2 we place 3 sensors on half-hyperbola, and emit the wave at the moment t′ from the focus s′
of hyperbola. Then another focus, s′′, emitting at the moment t′′=t′+∥r(i)−s′∥−∥r(i)−s′′∥=t′+const,
is a different solution of the SRP defined by {ti}i=13.
Below we present some sufficient conditions for uniqueness of SRP solution (Prop. 1–1).
Proposition 1.
If the dual “in-mission” problem, “ti=t−∥r(i)−s∥ for any i∈Z+”,
also has a solution, then the solution of the original SRP is unique.
Proof.
The implied set of equations (1), when solved in t, has no more than 2 roots, and includes the solution t′⩽0 of SRP,
along with the solution t′′⩾0 of dual problem. Note that t′′=t′, otherwise t′=t′′=0, s′=s′′=θ, and the wave reaches r(1)
at the moment t1=0 when propagating both forward and backward in time, — t1=∥r(1)∥>0 and t1=−∥r(1)∥<0;
a contradiction. In other words, t′′>0 cannot be a solution of SRP, and t′ is the unique solution.
∎
Proposition 2.
If the solution s′ of the SRP is identical to one of sensors, then it is unique.
Proof.
Without loss of generality we suppose s′=r(0)=θ, and t′=0.
Now, assume that (s′′;t′′) is another solution. Then for each r(i), i∈N, we have {ti=0+∥r(i)−θ∥,ti=t′′+∥r(i)−s′′∥, and for i=0: 0=t′′+∥θ−s′′∥⇔t′′=−∥s′′∥.
Thus ∥r(i)∥=−∥s′′∥+∥r(i)−s′′∥⇔∥r(i)∥+∥−s′′∥=∥r(i)+(−s′′)∥;
linear dep. of r(i) and s′′ follows. s′′=θ then leads to r(i)∈L({s′′}),
for any i. This contradicts the linear indep. of R˙, so the assumption is wrong.
∎
(This conforms with Case 0 above).
Of course, we prefer the conditions relating only to the set of sensors, so that for any position of the source the solution of the SRP is unique and identical to that position.
This is important when sensors must be placed before the source appears anywhere in space and emits the wave.
Proposition 3.
If the SRP has a solution, and ∃{nk}k=1∞, nk<nk+1: r(nk)⊥r(i) for 1⩽i<nk,
and ∥r(nk)∥∈[λ;μ] with λ>0, then this solution is unique.
Proof.
We denote the SRP solution by (s′;t′). If s′=θ=r(0), it is unique by Prop. 1. Consider s′=θ.
The basis B={ek} is made from R˙={r(k)} by Gram-Schmidt orthogonalization:
ek=dk/∥dk∥, where dk=r(k)−j=1∑k−1<r(k);ej>ej
hence in B, rj(nk)=<r(nk);ej>=0 for j<nk, and rnk(nk)=∥r(nk)∥.
Let n=nk, then by (1): cn=r1(1)r1(2)...r1(n−1)00r1(2)...r2(n−1)000...r3(n−1)0......⋱......00...rn−1(n−1)0t1t2...tn−1tn/i=1∏nri(i)=
=tn(−1)n+ndetAn−1/i=1∏nri(i)=tn/rn(n)=tn/∥r(n)∥, so ∣cn∣⩾∣tn∣/μ.
In turn, tn=t′+∥r(n)−s′∥=−∥s′∥+<r(n)−s′;r(n)−s′>=
∥r(n)∥⩽μ and s′∈H⇒sn′k→∞0,
implying ∥r(n)∥sn′k→∞0 (n=nk→∞ as k→∞).
Therefore \varliminf\limits_{k}t_{n}=\sup\limits_{m\in\mathbb{N}}\inf\limits_{k\geqslant m}t_{n}\geqslant\bigl{[}\sqrt{\|\mathbf{s^{\prime}}\|^{2}+\lambda^{2}}-\|\mathbf{s^{\prime}}\|\bigr{]}>0, and klim∣cn∣>0.
Consequently, k→∞limcnk=0, so j=1∑∞cj2=∞.
Thus we are in Subcase 1a, where the solution of SRP is unique.
∎
The trivial example of such R˙ is any orthonormal basis of H (nk=k, λ=μ=1).
Now, for arbitrary basis R˙ of H, let R˙′ be the following “extension” of R˙:
R˙′=R˙∪{r(ω+1)}, where r(ω+1)=−r(1). Respectively, R′=R∪{r(ω+1)}.
The wave reaches this additional sensor, opposite to r(1), at the moment tω+1.
Proposition 4.
If the SRP defined by R′ and {ti}i∈Z+∪{ω+1} has a solution, then it is unique.
Proof.
Assuming the contrary, let (s′;t′) and (s′′;t′′) be the distinct solutions of such SRP.
The reasonings above show that s is determined uniquely by t (sj=bj+tcj), therefore t′=t′′.
From (1) for i=1 and i=ω+1
(it is clear that r(ω+1)=(−r1(1);0;0;...) and ∥r(ω+1)∥=∥r(1)∥):
\begin{cases}r^{(1)}_{1}s_{1}^{\prime}=\frac{1}{2}\bigl{[}\|\mathbf{r}^{(1)}\|^{2}-t_{1}^{2}\bigr{]}+t^{\prime}t_{1},&\mathbf{(1^{\prime})}\\
-r^{(1)}_{1}s_{1}^{\prime}=\frac{1}{2}\bigl{[}\|\mathbf{r}^{(1)}\|^{2}-t_{\omega+1}^{2}\bigr{]}+t^{\prime}t_{\omega+1}&\mathbf{(2^{\prime})}\end{cases} and \begin{cases}r^{(1)}_{1}s_{1}^{\prime\prime}=\frac{1}{2}\bigl{[}\|\mathbf{r}^{(1)}\|^{2}-t_{1}^{2}\bigr{]}+t^{\prime\prime}t_{1},&\mathbf{(1^{\prime\prime})}\\
-r^{(1)}_{1}s_{1}^{\prime\prime}=\frac{1}{2}\bigl{[}\|\mathbf{r}^{(1)}\|^{2}-t_{\omega+1}^{2}\bigr{]}+t^{\prime\prime}t_{\omega+1}&\mathbf{(2^{\prime\prime})}\end{cases}
Then we add (1′) and (2′): 0=∥r(1)∥2−t12⇔∣t1∣=∥r(1)∥. To be definite, suppose t1⩾0.
For any solution (s;t) of the SRP under study (that is, for (s′;t′) and (s′′;t′′)), we have t=−∥s∥ and
{t1=t+∥r(1)−s∥,tω+1=t+∥r(ω+1)−s∥, hence ∥r(1)−(−r(1))∥=2t1=∥r(1)−s∥−∥−r(1)−s∥. Or:
which implies linear dependency of (r(1)−s) and (−r(1)−s):
a(r(1)−s)+b(−r(1)−s)=θ⇔(a+b)s=(a−b)r(1).
a+b=0, otherwise we divide the 1st equation by a and come to r(1)−s+r(1)+s=θ,
or r(1)=θ, — a contradiction. Thus we can divide the 2nd equation by (a+b):
s=a+ba−br(1)∈L({r(1)}), therefore s=(s1;0;0;...),
and ∥r(1)−s∥=∣r1(1)−s1∣, ∥r(ω+1)−s∥=∣r1(1)+s1∣.
t1⩾0⇒∣r1(1)+s1∣⩽∣r1(1)−s1∣.
The basis B={ei} was made from R˙ by Gram-Schmidt orthogonalization, hence r1(1)>0, and r1(ω+1)=−r1(1)<0.
Thus s1⩽0⇒t=−∥s∥=s1.
We now take into account other sensors; one is enough, for instance, r(2)=(r1(2);r2(2);0;...)=(p;h;0;...), where h=0.
t2=t+∥r(2)−s∥=t+(p−s1)2+h2 turns into equality for (s′;t′) and (s′′;t′′):
t′+(p−t′)2+h2=t′′+(p−t′′)2+h2.
However, f(t)=t+(t−p)2+h2 has the derivative f′(t)=1+(t−p)2+h2t−p>0, because
∣t−p∣<(t−p)2+h2. Hence f(t) is strictly increasing, and it must be t′=t′′, — a contradiction.
Consequently, the initial assumption is wrong; the solution is unique.
∎
Proposition 5.
If the SRP (1) has a solution, and (s′′;t′′) is a different solution of implied (1),
then (s′′;t′′) is either the solution of SRP, or the solution of dual problem.
Proof.
Assume the contrary, then ∃m,k∈Z+: {tm=t′′−∥r(m)−s′′∥,tk=t′′+∥r(k)−s′′∥.
Let (s′;t′) be the solution of SRP (1), so ∀i∈Z+: ti=t′+∥r(i)−s′∥.
In particular, {tm=t′+∥r(m)−s′∥,tk=t′+∥r(k)−s′∥. Therefore
∥r(m)−s′∥+∥r(m)−s′′∥=t′′−t′=∥r(k)−s′∥−∥r(k)−s′′∥.
By triangle inequality, ∥r(m)−s′∥+∥r(m)−s′′∥⩾∥s′−s′′∥;
on the other hand,
Hence {∥s′−r(m)∥+∥r(m)−s′′∥=∥s′−s′′∥,∥r(k)−s′∥−∥r(k)−s′′∥=∥s′′−s′∥. From the 1st equality we obtain linear dependency of s′−r(m) and r(m)−s′′:
∃a,b: a(s′−r(m))+b(r(m)−s′′)=θ⇔(b−a)r(m)=bs′′−as′.
a=b, otherwise we could divide by a and get s′−s′′=θ; so r(m)=b−a1(bs′′−as′)∈L({s′;s′′}).
From 2nd equality: r(k)−s′ and r(k)−s′′ are linearly dependent, a(r(k)−s′)+b(r(k)−s′′)=θ⇔(a+b)r(k)=as′+bs′′, a+b=0 or it would be s′−s′′=θ, thus r(k)∈L({s′;s′′}).
Moreover, for any j∈Z+ such that tj=t′′+∥r(j)−s′′∥ we can repeat these reasonings for the same m, but taking j instead of k.
Consequently, R_{+}=\bigl{\{}\mathbf{r}^{(j)}\mid t_{j}=t^{\prime\prime}+\|\mathbf{r}^{(j)}-\mathbf{s^{\prime\prime}}\|\bigr{\}}\subseteq L(\{\mathbf{s^{\prime}};\mathbf{s^{\prime\prime}}\}).
Similarly, keeping k and going over suitable m, R−={r(j)∣tj=t′′−∥r(j)−s′′∥}⊆L({s′;s′′}).
Since R=R+∪R−, we have R⊆L({s′;s′′}), which is impossible, because R˙=R\{θ} is a basis of H,
while dimL({s′;s′′})⩽2. This contradiction proves that the assumption is wrong.
∎
In other words, when a solution of SRP exists, the transition from (1) to (1) may add only the solution of dual problem, not some “mixed” one.
When we have the countable set R of sensors and corresponding moments {ti}i∈Z, we may “downdimension” the original SRP
by taking into account only the sensors from 0-th to n-th, Rn={r(i)}i=0n.
Since r(0)=θ, we have Ln:=L(Rn)=L(R˙n) and is isomorphic to Rn.
Further, we seek the solution (s;t) of the problem “ti=t+∥r(i)−s∥ for any i=0,n” inside Ln.
We denote this “downdimensioned” problem by SRPn.
Proposition 6.
If the SRP in H has a solution, then SRPn has a solution for any n∈N.
Proof.
Denote the solution of original SRP by (s(∞);t(∞)). By projection theorem, s(∞)=u+h,
where u∈Ln and h⊥Ln. If h=θ, then s(∞) is the solution of SRPn.
We consider another case, h=θ. Let h=∥h∥.
Let Ln′=Ln⊕L({h})=L(Rn∪{h}). It is isomorphic to Rn+1, thus x∈Ln′
may be written as (x1;...;xn;xn+1) in the basis made, using Gram-Schmidt orthogonalization, from R˙n∪{h}.
In particular, for i=1,n the sensor r(i) has the coordinates {rj(i)}j with rn+1(i)=0.
Also, s(∞)∈Ln′ and s(∞)=(s1(∞);...;sn(∞);sn+1(∞)) with sn+1(∞)=h.
We now consider the SRP defined by (Rn;{ti}i=0n) in Ln′; it has (at least one) solution (s(∞);t(∞)).
Following the way of (1)-(1)-(1)-(1)-(1)
(now there’s a finite sum instead of series),
sj=bj+tcj for j=1,n; j=1∑n(bj+tcj)2+sn+12=t2
We rewrite the latter equation, in t, as αt2+βt+γ+sn+12=0. Note that γ=j=1∑nbj2⩾0.
This equation has the solution t=t(∞)⩽ti, i=0,n, when sn+1=±h
(so, actually, this SRP has at least 2 solutions in Ln′, symmetrical with respect to Ln).
We claim that it has a solution t(n)⩽ti when sn+1=0. Consider the cases:
Case α>0:fh2(t)=αt2+βt+γ+h2=0 has a root t(∞)⩽ti; if t′ is the lesser root of this equation, then all the more
t′⩽ti. Since fh2(t) is a quadratic trinomial, for h2 replaced by [math] it has 2 roots, with the lesser one t′′<t′. Let t(n)=t′′.
Case α<0:f0(t) has a root(s) because D=β2−4α(γ+0)⩾β2⩾0 (perhaps the root is multiple).
Its roots are t±=2α−β±D, and t+t−=αγ⩽0, thus t+⩽0 (and t−⩾0).
In other words, there’s only 1 root satisfying t⩽0, which distinguishes the solution of SRP from the solution of dual, “in-mission” problem.
Now, if we repeat the solving method after re-enumerating the sensors so that i-th sensor (i=1,n) becomes r(0),
and moving “the origin of space and time” to this new r(0), then we come to essentially the same SRP, Ln, Ln′, …
in different reference frame. And we obtain the single root T+⩽0. But T+* and t+ are the same moment* of time,
only in different temporal reference frames. Therefore, T+⩽0 means t+⩽ti. Let t(n)=t+.
Case α=0, β=0:fh2(t)=βt+γ+h2=0⇔t=t(∞)=−βγ+h2.
t(∞)⩽0⇒β>0, thus f0(t^)=0 for t^=−βγ⩽0.
Similarly, the symmetry implies t^⩽ti for any i=1,n. Let t(n)=t^.
Case α=0, β=0: impossible, because γ+h2>0.
Anyway, ∃t(n)⩽ti for any i=0,n: j=1∑n(bj+t(n)cj)2=(t(n))2.
It determines the solution s(n)={bj+t(n)cj}j=1n∈Ln of SRPn.
∎
The statement of Prop. 1 remains true if we take arbitrary finite R={r(i1);...;r(in)}⊂R˙
and seek the solution of the “truncated” SRP “tij=t+∥r(ij)−s∥ for j=0,n” in L(R), —
just re-enumerate elements of R˙ so that R={r(1);...;r(n)},
R˙\R={r(n+1);r(n+2);...} to get SRPn.
However, this statement becomes false for infinite R⊂R˙, in general case. Consider
Example 3.⊲
Let R˙=B be an orthonormal basis of H, r(i)=ei, thus rj(i)=δij;
also, let s′=r(1)=(1;0;0;...) and t′=−1. Then t0=t′+∥s′∥=0, t1=t′+∥r(1)−s′∥=−1,
and ∀i⩾2: ti=t′+∥r(i)−s′∥=−1+2.
Obviously, (s′;t′) is the solution of the SRP defined by \bigl{(}R;\{t_{i}\}_{i\in\mathbb{Z}_{+}}\bigr{)}.
We claim that for any infinite R⊂R˙
such that r(1)∈/R the truncated SRP “ti=t+∥r(i)−s∥ for any r(i)∈R∪{r(0)}”
has no solution in L=L(R).
Proof.
Assume the contrary and enumerate the elements of R as the subsequence of R˙, ascending:
R={r^(1);r^(2);...}.
R is the orthonormal basis of L, in itself r^j(i)=δij as well, and dimL=∞.
We denote the solution of truncated SRP in L by (s;t), with s=(s1;s2;...).
(that is, bk=bk, ck=ck).
Hence s_{k}\equiv\frac{1}{2}\bigl{(}1-(\sqrt{2}-1)^{2}\bigr{)}+t(\sqrt{2}-1)=(\sqrt{2}-1)(t+1),
therefore s∈H only if sk≡0⇔t=−1. Then for r^(0)=θ=s:
t0=t=−1=0, — a contradiction.
∎
⊳
Proposition 7.
If the solution (s(∞);t(∞)), s(∞)=θ, of SRP is unique, and for each n∈N
the solution (s(n);t(n)), s(n)=θ, of SRPn is unique, and j=1∑∞cj2<∞, then
t(n)n→∞t(∞) and s(n)n→∞s(∞)
Proof.
(1) gives s(∞)=(s1(∞);s2(∞);...)=(b1+t(∞)c1;...;bn+t(∞)cn;sn+1(∞);sn+2(∞);...)
and s(n)=(b1+t(n)c1;...;bn+t(n)cn;0;0;...), consequently
j=n+1∑∞(sj(∞))2n→∞0 and
j=1∑ncj2n→∞j=1∑∞cj2; it remains to prove that
t(n)n→∞t(∞)⇔z(n)n→∞z(∞)
where z(∞)=1/t(∞), z(n)=1/t(n).
From the assumptions of this proposition it follows that, speaking of SRP, we’re in Subcase 1b,
where z(∞) is one of two roots, z±(∞)=2α−β±β2−4αγ, of (1).
Now, using the symbols αn, βn and γn from Subcase 1a (this is different from notation used while proving Prop. 1),
we state that, similarly, z(n) is one of two roots, z±(n)=2αn−βn±βn2−4αnγn,
of the equation αnz2+βnz+γn=0, which appears while solving SRPn.
αn→α>0, βn→β, γn→γ as n→∞,
therefore z−(n)→z−(∞), z+(n)→z+(∞), and the selection of the root z(n) in SRPn (z−(n) or z+(n))
becomes the same as the selection of the root z(∞) in SRP (perhaps for n⩾n0). In any case, z(n)→z(∞) as n→∞.
∎
This proposition shows another method, one of Galerkin kind, to obtain the SRP solution.
2 SR on unit sphere in Hilbert space
Let it be S={x∈H:∥x∥=1}. Instead of “embracing-space-induced” ∥x−y∥,
we consider the so-called geodesic metric, d:S×S→R+: d(x;y)=arccos<x;y>∈[0;π].
Which (we remind) is really a metric.
Proof.
Obviously, d(x;x)=arccos1=0 and d(x;y)=d(y;x).
If d(x;y)=0, then <x;y>=1=∥x∥⋅∥y∥⇒x and y are linearly dependent
with y=ax, a⩾0; 1=<x;y>=a∥x∥2=a⇒x=y.
The triangle inequality ∀x,y,z∈S: d(x;z)⩽d(x;y)+d(y;z)
can be established as follows. It is equivalent to \left[\begin{array}[]{l}d(\mathbf{x};\mathbf{y})+d(\mathbf{y};\mathbf{z})\geqslant\pi,\\
\cos d(\mathbf{x};\mathbf{z})\geqslant\cos\bigl{(}d(\mathbf{x};\mathbf{y})+d(\mathbf{y};\mathbf{z})\bigr{)},\quad d(\mathbf{x};\mathbf{y})+d(\mathbf{y};\mathbf{z})\leqslant\pi;\end{array}\right. we rewrite the inequality in the 2nd case as
Using projection theorem (and dimH=∞), we represent y=y1x+y2h, where h∈S, h⊥x,
and z=z1x+z2h+z3w, where w∈S, w⊥x, w⊥h.
And y12+y22=1, z12+z22+z32=1, so
(2) ⇔1+2y1(y1z1+y2z2)z1⩾y12+(y1z1+y2z2)2+z12⇔1−y12⩾z12(1−y12)+y22z22⇔y22z32⩾0
∎
The set of sensors R={r(i)}i⊂S (obviously, θ∈/R).
As before, we assume the existence of at least one solution (s0;te;0), s0∈S,
of the SRP “ti=t+d(r(i);s) for any i”.
Remark. We may consider the wave to “oscillate forever” on S, from s0 to antipodal −s0 (d(s0;−s0)=π),
then back to s0, and so forth. Then ti is the first time when the wave reaches r(i).
However, the wave as the sphere of increasing radius t−te;0 vanishes at −s0.
The reasonings we’ve used for the entire H show that if L(R)=H and s0∈/L(R),
then the solution is certainly not unique: for s0=u0+u1 with u0∈L(R), u1⊥L(R),
the “s(φ)=u0+∥u1∥(cosφ⋅u1+sinφ⋅u2)”
(where u2⊥L(R),u1) construction works as well, since s(φ)∈S
and d(\mathbf{r}^{(i)};\mathbf{s}(\varphi))=\arccos\bigl{[}{<}\mathbf{r}^{(i)};\mathbf{u_{0}}{>}+\|\mathbf{u_{1}}\|\cos\varphi{<}\mathbf{r}^{(i)};\widetilde{\mathbf{u_{1}}}{>}+\|\mathbf{u_{1}}\|\sin\varphi{<}\mathbf{r}^{(i)};\widetilde{\mathbf{u_{2}}}{>}\bigr{]}=\arccos{<}\mathbf{r}^{(i)};\mathbf{u_{0}}{>}=\arccos{<}\mathbf{r}^{(i)};\mathbf{u_{0}}+\mathbf{u_{1}}{>}=d(\mathbf{r}^{(i)};\mathbf{s}_{0}).
Therefore, let R={r(i)}i∈N be a basis of H,
and let B be the orthonormal basis of H, derived from R by Gram-Schmidt orthogonalization;
thus, in B, r(i)=(r1(i);...;ri(i);0;0;...) (and r1(1)=1).
Then s can be written in the form of (s1;s2;...).
Since t⩽ti and ti−t=d(r(i);s)⩽π, we have t∈[sup{ti}−π;inf{ti}]=Δ (∣Δ∣⩽π).
The equations of SRP are equivalent to cos(ti−t)=<r(i);s>. Adding “s∈S”, we have
Case 1a:j=1∑∞pj2 converges, j=1∑∞qj2 diverges.
If the series in the left side of (2) converges for t
such that sint=0, then \{\widetilde{q_{j}}\}=\frac{1}{\sin t}\bigl{(}\{\widetilde{p_{j}}\cos t+\widetilde{q_{j}}\sin t\}-\{\widetilde{p_{j}}\cos t\}\bigr{)}\in H,
which contradicts the assumption. Thus, if t satisfies (2), then sint=0
(in particular, sinte;0=0, so j=1∑∞pj2=1).
We go over t=πm∈Δ, m∈Z (there’s 1 or 2 such values),
and select those satisfying (2) (in fact, they all do).
Then sj=pjcost+qjsint=pjcost for all j∈N.
Case 1b:j=1∑∞pj2 diverges, j=1∑∞qj2 converges.
Similarly, the convergence of the series in the left side of (2) leads to cost=0 (j=1∑∞qj2=1 since it converges
when t=te;0), and we take t∈(2π+πZ)∩Δ, satisfying (2).
Case 2:j=1∑∞pj2 and j=1∑∞qj2 diverge.
We know that (2) holds true for t′=te;0; if the series in the left side converges for t′′∈Δ, t′′=t′, then we have
⇒{pj}=sin(t′−t′′)1(sint′v′′−sint′′v′)∈H
(sin(t′−t′′)=0, because t′,t′′∈Δ, ∣Δ∣⩽π), — a contradiction.
So, t′ is the unique value providing the convergence of series in the left side of (2).
We obtain t′ using the method analogous to that of Subcase 1a from Section 1.
fn(t)=j=1∑n(pjcost+qjsint)2−1 is non-decreasing relative to n, fn(t)⩽fn+1(t).
Rearranging, fn(t)=αncos2t+βnsin2t+γncostsint−1=(αn−1)cos2t+(βn−1)sin2t+γncostsint.
cost=0, otherwise j=1∑∞qj2=1. Consequently, to solve fn(t)=0, we can divide it by cost:
(βn−1)tan2t+γntant+(αn−1)=0
The quadratic trinomial here has no more than 2 roots (βn→+∞ as n→∞), hence fn(t) has a finite number of zeroes in Δ.
Between them, the sign of the continuous fn(t) is constant. We consider it “easy enough” to determine, for each n∈N,
the set Un={t∈Δ∣fn(t)⩽0}. It is clear that Un⊇Un+1.
Moreover, {t′}=n∈N⋂Un; indeed, fn(t′)⩽f∞(t′)=0,
and ∀t=t′∃n0: fn0(t)>0.
Case 3:j=1∑∞pj2 and j=1∑∞qj2 converge.
Then we denote α=j=1∑∞pj2, β=j=1∑∞qj2,
γ=2j=1∑∞pjqj, and rewrite (2) as
(α−1)cos2t+(β−1)sin2t+γsintcost=0⇔
Subcase 3a:(β−1)2+γ2+(α−1)2>0. Then (2) again has a finite number of roots in Δ,
and they are “easy to obtain” (in accordance with our allowances).
Subcase 3b:β−1=γ=α−1=0, therefore {pj}∈S, {qj}∈S, and {pj}⊥{qj}.
Then any t∈Δ satisfies (2).
Each root t, in turn, determines s={pjcost+qjsint}j.
This concludes the description of the solving method for SRP on S with d.
Again, there’s the question about additional conditions for the set of sensors, or its extensions, providing the uniqueness of the solution,
especially in Subcase 3b with the most “ambiguity”. We restrict our attention to the finiteness of the set of solutions.
Proposition 8.
If r(2)⊥r(1) and r(3)⊥r(1),r(3)⊥r(2), then Subcase 3b is impossible.
Proof.
In the basis B, not only r(1)=(1;0;0;...), but r(2)=(0;1;0;0;...) and r(3)=(0;0;1;0;0;...) then.
From (2) it follows that pk=costk and qk=sintk for k=1,2,3;
therefore j=1∑∞(pj2+qj2)⩾j=1∑3(pj2+qj2)=3.
Meanwhile, in Subcase 3b we have j=1∑∞pj2+j=1∑∞qj2=α+β=2<3.
∎
The constraints for r(1), r(2), r(3) here may be weakened:
j=1∑3(pj2+qj2)>2 would suffice.
Example 4. (analogous to Ex. 1).
⊲
Let R be an orthonormal basis of H, rj(i)=δij, and let s′=r(1), t′=0.
Then t1=t′=0, tk=t′+d(r(k);s′)=arccos0=2π for any k⩾2.
(s′;t′) is the solution, on S, of the SRP defined by (R;{ti}i∈N).
Meanwhile, for any infinite R⊂R such that r(1)∈/R, the truncated SRP
“ti=t+d(r(i);s) for r(i)∈R” has no solution on S={x∈L(R)∣∥x∥=1}.
Proof.R is the orthonormal basis of L(R), and we enumerate the elements of R as they follow in R:
R={r^(1);r^(2);...}; then, decomposing R in itself, r^j(i)=δij.
Assuming (s;t), s∈S, to be the solution of truncated SRP, we have
2π≡t^k=t+arccos<r^(k);s>=t+arccossk,
thus sk≡cos(2π−t)=sint. Since dimL(R)=∞, s∈H implies sk≡0,
so s=θ∈/S, — a contradiction.
∎
⊳
Acknowledgements. We would like to thank everyone who will provide the references to where these problems in H, —
or perhaps, their more general forms, — have been considered, studied, and solved already.
Bibliography39
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Bancroft S. An Algebraic Solution of the GPS Equations. — IEEE Trans. on Aerospace and Electronic Systems. — 1985. — 21(1). — pp. 56–59. doi:10.1109/TAES.1985.310538
2[2] Bateman H. Mathematical Theory of Sound Ranging. — Monthly Weather Review. — 1918. — 46. — pp. 4–11.
3[3] Bazzoni C.B. Note on the Accuracy of Sound Ranging Locations. — France. — c 1918.
4[4] Bragg W. The World of Sound. — G. Bell and Sons LTD. — London. — 1921.
5[5] Bull L. Method of location of (gun) batteries by sound ranging. — Note submitted to the Société Geographique de l’Armée, Paris. — 1915.
6[6] Burgess S., Kuang Y., Åström K. TOA sensor network calibration for receiver and transmitter spaces with difference in dimension. — Centre for Math. Sciences. — Lund University. — 2013.
7[7] Canistraro H.A., Jordan E.H. Projectile-impact-location determination: an acoustic triangulation method. — Measurement Science and Technology. — 1996. — 7(12).
8[8] Compagnoni M., Notari R., Antonacci F., Sarti A. A comprehensive analysis of the geometry of TDOA maps in localization problems. — Inverse Problems. — 2014. — 30(3).