When do $n$ ants in cyclic pursuit with constant velocity converge? I'm reading a paper (Ants, Crickets and Frogs in Cyclic Pursuit) and trying to understand one of the simpler results.
The following is a paraphrasing of the parts I'm using, but check the paper if more context is needed:

Consider $n$ moving ants $\mathrm{x}_1(t)$ through $\mathrm{x}_n(t)$ in a vector space $\mathcal{L}$. Each ant $\mathrm{x}_i$ moves at all times in the direction of the ant $\mathrm{x}_{i-1}$ (and $\mathrm{x}_1 \to \mathrm{x}_n$) with constant velocity $v$.
For $i = 1,...n$, define the initial conditions as $\mathrm{x}_i(0) = \xi_i$ and the following system of $n$ differential equations:
$$\frac{d}{dt} \mathrm{x}_i(t) = v \ \frac{\mathrm{x}_{i-1}(t) - \mathrm{x}_i(t)}{||\mathrm{x}_{i-1}(t) - \mathrm{x}_i(t)||}$$
We can construct an equivalent model in barycentric coordinates by defining
$$\mathrm{y}_i(t) = \mathrm{x}_{i-1}(t) - \mathrm{x}_i(t)$$
Then for $i = 1,...,n$, we have $\mathrm{y}_i(0) = \xi_{i-1} - \xi_i$ and the following system of equations:
$$\frac{d}{dt} \mathrm{y}_i(t) = v \left(\frac{\mathrm{y}_{i-1}(t)}{||\mathrm{y}_{i-1}(t)||} - \frac{\mathrm{y}_i(t)}{||\mathrm{y}_i(t)||} \right)$$
For this system, we can prove the following:
$\textbf{Lemma 1}$ The difference vectors $\mathrm{y}_i(t)$ have the following properties:

*

*$\sum \mathrm{y}_i = 0$

*$\frac{d}{dt} ||\mathrm{y}_i|| = (\cos \alpha_i - 1) v$
Where $\alpha_i$ is the angle between $\mathrm{y}_i$ and $\mathrm{y}_{i-1}$.
$\textbf{Proof:}$ The first part follows by definition and the second comes from projecting $\mathrm{y}_{i-1}$ onto $\mathrm{y}_i$.
Call $T$ the termination time where all ants collide and define $Y(t) = \sum_i ||\mathrm{y}_i(t)||$.

Then comes the part I'm most curious about. They claim

If the speeds are constant and equal, Lemma $1$ part 2 implies that $T \le Y(0)/v$.

I think this works by summing both sides of the second equality to get
$$\sum_i \frac{d}{dt}||\mathrm{y}_i|| = v \sum_i (\cos \alpha_i - 1) \le -v$$
which would prove the claim, but the inequality is where I get stuck.
I'm thinking we can bound the sum somehow by using the fact that $\sum_i \alpha_i \ge 2\pi$, but I'm not quite sure how to do this.
Edit: It appears this claim is false as pointed out by @stewbasic.

I'd still like to get answers for the following:

*

*A general bound for the termination time $T$.


*Under what conditions do the ants collide simultaneously?
For simultaneity, a sufficient condition is fine provided it covers the specific case of cube. For example, if a cycle of $n$ ants all start a constant distance $\mathrm{y}(0) = ||\mathrm{y}_i(0)||$ from their pursuer and prey and all start the same distance $d$ from their centroid, is this enough to ensure simultaneity of collision? If it simplifies things, the time bound need only apply to cases that satisfy the sufficient condition for simultaneity.
Specific case: Consider $8$ ants on the corners of a unit cube with pursuit cycle given by
$$(0,0,0) \to (1,0,0) \to (1,1,0) \to (1,1,1) \to (1,0,1) \to (0,0,1) \to (0,1,1) \to (0,1,0)$$
I'd ideally like to get the bound $T \le 2/v$, but even $T \le 8/v$ would acceptable. The actual value is about $1.96$, which I can get from simulation where their convergence path looks like this:

Here's an animated version I created:

Edit:
As @VictorZurkowski points out, the proof of Theorem $1$ includes a (not very strict) bound on $T$ which reduces in the constant velocity case to
$$T \le \frac{Y(0)}{v\left(1 - \cos\left(\frac{2\pi}{m}\right)\right)}$$
where $m$ is the number of survivors. For the cube case with unit speed, this becomes
$$T \le \frac{Y(0)}{1\left(1 - \cos\left(\frac{2\pi}{8}\right)\right)} = \frac{8}{\left(1 - \cos\left(\frac{\pi}{4}\right)\right)} = 8\left(2 + \sqrt{2}\right) \approx 27.3137$$
Using symmetry, I think I could get this down to $2 \left(2+\sqrt{2}\right) \approx 6.82843$.
All of the $\alpha_i$ follow one of these two curves where the $y$-axis is in degrees and the $x$-axis is $t$ in percent of of $T$ (at 100% they converge). We can see that they converge to the planar case where $\alpha_i = \frac{\pi}{4} = 45^{\circ}$

I believe the planar case is worst case in terms of convergence time and this website has some nice bounds for regular polygons with unit area. If my calculations are correct, an octagon with unit length sides would have path length $2\sqrt{4+3\sqrt{2}} \approx 5.742$.
[To be revised and continued...]
 A: This seems to be not true. Consider the case where the ants start on successive vertices of a regular $n$-gon (in the plane). By symmetry, their positions will always form a regular $n$-gon, so
$$
  \alpha_i=\frac{2\pi}n.
$$
Now Lemma 1 part 2 gives
$$
  \frac{d}{dt}Y(t)=-kv
$$
where
$$
  k=n\left(1-\cos\left(\frac{2\pi}n\right)\right).
$$
Thus $T=Y(0)/(kv)$. Now $k\to0$ as $n\to\infty$ (asymptotically it is $\frac{2\pi^2}n$) so we can choose $n$ with $k<1$. Explicitly if $n=20$ then $k\approx0.97887$ (see wolframalpha). Then $T>Y(0)/v$.
A: In Section 1 (the one about Ants), Theorem 1 says:
"Termination must therefore occur before [$(\cos(2\pi /m)-1) \int_0^t \min v_i(s)\;ds$] assumes the value $-\sum ||y_i(0)||$ ." (1)
In case of constant speed, this statement translates to $T \le (1-\cos(\frac{2\pi}{m}))^{-1}\frac{Y(0)}{v}$, where $m$=number of survivors by termination time.   
In particular, @stewbasic basic example does not contradict the statement, since in that case the number of survivors by temination time is $n$.  
In your example of 8 points at the vertices of a cube, whether $T\le 2$ depends on the speed $v$ that you are considering.  
$\mathbf{\text{Note}}$: To prove (1), Bruckstein et alt. use that $\alpha_i \ge \frac{2\pi}{m}$ for some $i$, which does not seem to follow from the result they quote. i.e.: it is not clear that the proof of the bound for $T$ is without gaps.
