A note on "The Cartan-Hadamard conjecture and the Little Prince"
Spyridon Michalakis

TL;DR
This paper offers straightforward proofs of key lemmas from a work on the Cartan-Hadamard conjecture, facilitating the derivation of new isoperimetric inequalities without complex algebraic computations.
Contribution
It provides elementary, Sage-free proofs of lemmas crucial for establishing novel isoperimetric inequalities related to the Cartan-Hadamard conjecture.
Findings
Elementary proofs of Lemmas 7.1 and 7.4
Simplification of proof techniques for isoperimetric inequalities
Elimination of reliance on symbolic algebra software
Abstract
We provide elementary proofs of Lemmas 7.1 and 7.4 appearing in "The Cartan-Hadamard conjecture and the Little Prince", by B. Kloeckner and G. Kuperberg. The Lemmas play an important role in the derivation of novel isoperimetric inequalities. The original proofs relied on Sage, a symbolic algebra package, to factor certain algebraic varieties into irreducible components.
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.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Mathematics and Applications · Polynomial and algebraic computation
A note on “The Cartan-Hadamard conjecture and the Little Prince”
S. Michalakis
Institute for Quantum Information and Matter, Caltech, Pasadena, CA 91125
Abstract
We provide elementary proofs of Lemmas 7.1 and 7.4 appearing in ”The Cartan-Hadamard conjecture and the Little Prince”, by B. Kloeckner and G. Kuperberg. The Lemmas play an important role in the derivation of novel isoperimetric inequalities. The original proofs relied on Sage, a symbolic algebra package, to factor certain algebraic varieties into irreducible components.
I The two lemmas
The following lemmas can be found in little-prince as Lemmas 7.1 and 7.4. Elementary versions of their proofs follow below.
Lemma 1** (Lemma 7.1).**
Show that for and ,
[TABLE]
with equality at .
Proof.
We begin by setting
[TABLE]
In the proof of Lemma 7.1 in little-prince , the authors begin by showing that the negative values of are confined in a compact subset of . Hence, we can use the derivative and boundary-value test to prove positivity.
It is easy to see that , with equality only when , so we may assume that . Noting that the following identity holds (by differentiating both sides):
[TABLE]
(and similarly for ), we see that the condition , is equivalent to:
[TABLE]
Setting the partial derivatives of to zero, yields in turn:
[TABLE]
where we used to get the last two equations.
Now, noting that where we used, , we get from Eqn (I.4):
[TABLE]
Hence, , or
[TABLE]
A quick check shows that: since , with equality when . To treat the remaining case, we make the following substitutions:
[TABLE]
Substituting the above in equation (I.7), and using , we get:
[TABLE]
which can be further simplified to:
[TABLE]
Now, if , then (and vice versa), and equation (I.8) implies that , which is what we set out to prove. So, we may assume that and that:
[TABLE]
The rest of the proof verifies that the above conditions on and are incompatible with (I.5) and (I.6), so that the only global minimum is attained at , at which point .
We begin with (I.5). Using equation (I.8) and the trigonometric identities and , we see that , is equivalent to the following equality:
[TABLE]
Substituting the expression we derived above for , we get:
[TABLE]
where we used and
If , then equation (I.10) with and exchanged (derived by taking the partial w.r.t. instead of , and noting that ) yields , which is equivalent to . Since , we have that implies , which leads to the contradiction (note that minimizes when , which was treated separately above). By symmetry, we also know that if , then , since otherwise , which is a contradiction. Hence, we can assume that .
Dividing through by and re-writing , equation (I.10) yields:
[TABLE]
which may be further simplified to:
[TABLE]
Moreover, by exchanging and (due to the symmetry of discussed above), we also have the equation:
[TABLE]
Subtracting the two equations yields:
[TABLE]
which implies that and/or . If , the (I.11) becomes
[TABLE]
which immediately implies (since the left and right side of the equality have opposite signs otherwise). This contradicts our earlier assumption that . If , then , which contradicts the assumption that . This completes the proof. ∎
Lemma 2** (Lemma 7.4).**
Let
[TABLE]
The function is non-negative for and , vanishing only when .
Proof.
The proof follows the steps of the argument given above for Lemma 1 almost identically (the argument confining the negative values of in a compact set can be found in the beginning of the proof of Lemma 7.4 in little-prince ). In particular, applying similar reasoning as before and using , one can show that:
[TABLE]
and similarly for , since is symmetric in and . It is trivial to check that , with equality only when . Hence, we will assume that from now on. Setting and using , we get:
[TABLE]
Noting that the above conditions for extrema of are identical to the ones we derived for in the proof of Lemma 1 (if we swap with ), we see that the only values of and satisfying all three conditions are (one still needs to check that is not allowed, which follows from the requirement that ). Hence, the global minimum of is attained at , at which point it is each to check that . ∎
Acknowledgements.
S. Michalakis would like to acknowledge support provided by the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center with support of the Gordon and Betty Moore Foundation through Grant #GBMF1250 and by the AFOSR Grant #FA8750-12-2-0308.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) B. Kloeckner and G. Kuperberg, “The Cartan-Hadamard conjecture and The Little Prince”, ar Xiv:1303.3115 [math.DG] (2014)
