Is it true that angles in Riemannian triangles with bounded sides are uniformly bounded?
More precisely, let $M$ be a Riemannian manifold.
Given $0<r <s$, is there a number $\delta$ (depending on $M,r,s$), such that for every triangle in $M$ (composed of geodesic edges), with edge lengths in $[r,s]$, its angles are greater than $\delta$?
Do we need compactness of $M$ for that to hold? Or are curvature bounds suffice?
Edit: The statement is false if we allow arbitrary pairs of $(r,s),0<r<s$. In fact, if we allow $2r \le s$, then one can always take a degenerate triangle whose edge lengths are $r,r,2r$ and then two angles will be zero!
Thus, there are to ways to proceed towards a correct version:
Proposition (1):
Let $M$ be compact, $0<r<s, 2r > s$. Then, there exist a number $\delta=\delta(M,r,s)$, such that for every triangle in $M$ with edge lengths in $[r,s]$, all its angles are greater than $\delta$.
Proposition (2):
Let $M$ be compact, $0<r<s$. Then, there exist a number $\delta=\delta(M,r,s)$, such that for every triangle in $M$ with edge lengths in $[r,s]$, at least one angle is greater than $\delta$.
Below I give proofs for the two propositions stated above.
Open questions:
Do the propositions hold if we only assume lower bound the curvature, without compactnes?
Is there a way to get an effective bound $\delta$ as a function of $r,s$ (depending also in $M$ somehow)? What if we assume some bounds on the curvature? (The above discussion on degenerate triangles implies that in Proposition (1), we should expect $\delta(r,s)$ to tend to zero, when $s \to 2r$).
Proof of Proposition (1):
Suppose by contradiction there is no bound $\delta$.
Then, there exist triangles $\Delta_n=\{[a_n,b_n],[b_n,c_n],[c_n,a_n]\}$ (where $[a_n,b_n]$ is a minimizing geodsic of unit speed connecting $a_n,b_n$ etc) with edge lengths in $[r,s]$, and each $\Delta_n$ has an angle $\theta_n$ which tends to zero when $n \to \infty$. By passing to a subsequence (or relabeling the vertices) we can assume $\theta_n=\angle b_n a_n c_n$.
Using the Arzela-Ascoli theorem (and perhaps again passing to a subsequence) we can assume that
$[a_n,b_n] \to [a,b], [b_n,c_n] \to [b,c],[c_n,a_n] \to [c,a]$, when the convergence is uniform ($[a,b],[b,c],[c,a]$ are paths connecting the corresponding limit points).
By our assumption,
$$d(a_n,b_n)=L([a_n,b_n]),$$ hence by the continuity of the distance function, and lower semi-continuity of length (w.r.t uniform convergence), we get that
$$ L([a,b]) \le \lim_{n \to \infty} L([a_n,b_n])=\lim_{n \to \infty} d(a_n,b_n)=d(a,b),$$
hence $[a,b]$ is a shortest path connecting $a,b$ and similar statements hold for $[b,c],[c,a]$.
Observation (1): Continuity of the distance imlies $d(a,b),d(b,c),d(c,a)$ all lie in $[r,s]$.
Now, since angles in Riemannian manifolds are lower semi-continuous* ,
$$ \angle b a c \le \liminf \angle b_n a_n c_n =0,$$ so $\angle b a c=0$
Hence, $b,c$ lie on the same geodesic emanating from $a$. W.L.O.G we assume $b$ lies on that geodesic between $a,c$. But then
$$ s \ge d(a,c)=d(a,b)+d(b,c)\ge 2r,$$ which contradicts the assumption.
(we have used observation (1) above).
Proof of Proposition (2):
The proof is very similar to the proof of proposition (1), so we only give a sketch:
Assume the claim is false. Then there exist suitable triangles $\Delta_n$, whose all angles are not greater than $\frac{1}{n}$. Thus, following the proof above, we conclude there is a "limit triangle" with all angles zero, which is a contradiction.
*Remrak on semi-continuity of angles:
By theorem 4.3.11 in "A course in metric geometry" (by Burago,Burago,Ivanov), if the curvature of $M$ is nonnegative then angles in $M$ are lower semi-continuous.
The assumption of nonnegative curvature can probably be omitted. The lower semi-continuity of angles which seems to hold in any intrinsic space of bounded curvature (see details in HK Lee's answer);
Locally, every Riemannian manifold has bounded curvature, and since angles are "local" objects (we can restrict our attention to the a neighbourhood of the corresponding vertex) the conclusion follows.