How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Morse stability with explicit parameter dependence
Statement
Assume AC for the projection-family proof below. For , and , the image of every possibly discontinuous -quasi-geodesic map of a nonempty compact real interval into a geodesic -slim space has Hausdorff distance at most from every geodesic with the same endpoints. No properness is assumed.
Facts & Assumptions
Given: Such a map , , and a specified endpoint geodesic. Put .
Quasi-geodesics, nonempty interval domains, infimum distances and both Hausdorff inclusions have the conventions of Hg toolkit local geodesics and hausdorff control. The product inequality holds with by Slim triangles imply the gromov product inequality; it is equivalent to the four-point condition by The gromov product inequality implies the four point condition.
In a geodesic product- space all chosen triangles are -slim by The four point condition implies slim triangles.
For , Hg toolkit polygonal interpolation of quasi geodesics supplies a -Lipschitz -quasi-geodesic with the same endpoints and Hausdorff error at most . Its short-endpoint bound is from .
Closest points on a specified segment exist, remain projections along their radial segments and satisfy for on the target. Both the geodesic-target and quasiconvex-target exponential contraction estimates are supplied by Exponential contraction of projection away from a quasiconvex set.
AC permits the families of closest points and radial geodesics used below (The Axiom of Choice). No closest-point assertion for arbitrary closed sets is assumed.
The exponential is the convergent series (The real exponential function and the number by a power series, The exponential series converges absolutely for every real argument), obeys addition (The exponential addition formula ), is positive with reciprocal formula (The exponential is positive and satisfies ) and is increasing (The exponential function is strictly increasing). The inverse identity is in The natural logarithm as the inverse of the exponential function. Geometric series sum to for by For , , and for the series diverges.
Proof
We first derive auxiliary metric estimates using only the product constant . For a specified segment and a point , choose its point at distance from . This parameter lies between zero and . Put . Expanding products shows that . The four-point inequality therefore gives . Every point on satisfies , by adding the two triangle inequalities through . Also, for any , : if is within of an endpoint this follows by the triangle inequality; otherwise the four-point inequality gives , which gives the claim since both sublengths exceed .
Let be nonempty and -quasiconvex as in F4, and suppose are closest points of respectively. For any , choose its quasiconvexity segment and its point at parameter . Write and ; from the definition of we have . Applying the product inequality at basepoint with bridge gives , and the products expand to and , since . Hence . Points of occur arbitrarily close to distance from , hence closest-point minimality implies . Thus . With , and , adding the estimates for and gives . The four-point inequality bounds this by . If , the first maximum entry cannot suffice; therefore The first radial estimate with also gives , since . If then ; if then the same radial estimate with the roles of and interchanged gives . Hence in every case the prime projection bound holds.
For a specified segment , put , . Closest points on exist by F4. If projects onto and , the radius- point on projects onto : the triangle inequality gives for , and attains equality. The same argument and F4 show that projects every later point of onto . Moreover is -quasiconvex. Join two points of to closest points on by radial segments of length at most . The radial segments and intervening part of lie in . Splitting the resulting quadrilateral by a diagonal and applying F2 twice puts every point of any fourth side within of these three segments, with arbitrarily small witness errors. Hence that side lies in the closed -neighbourhood of . This includes , where the sharper quasiconvexity constant zero is available.
The following elementary real facts justify the extrema and numerical steps. A Lipschitz function on a compact interval is bounded by its value at one endpoint plus or minus its Lipschitz constant times the interval length, and attains its infimum: bisect, keep the left half when it has the same infimum and otherwise the right half; nested left endpoints have a supremum, and the Lipschitz bound times the interval length tends to zero, forcing attainment there. Infima exist by the real completeness convention in F1. A continuous real function with opposite weak signs at the ends has a zero by the same interval bisection retaining opposite endpoint signs; continuity at the limiting point proves its value is zero. Finally F6's positive series terms give for . Put . Exact rational arithmetic gives In the first inequality the omitted exponential tail has successive ratios at most and is bounded by the displayed geometric tail. Thus , so . Monotonicity and the second inequality yield , and consequently All these are rational finite-sum comparisons and geometric tail bounds, not rounded numerical estimates.
Fix . Here is the required small-gap assertion. Suppose is continuous, is any supplied closest-point selection in a -quasiconvex set, and . There is with and with for every . Write . If everywhere, use . Otherwise let . The prime projection bound of step 1.2 and continuity of at make on some initial interval, because ; hence . All have . By continuity at , choose and with , both close enough to that . Such bad occur arbitrarily close to the infimum. The prime projection bound of step 1.2 gives , so . This proves the assertion without continuity of . Reversing the real parameter gives the corresponding assertion from the right endpoint.
We now prove the continuous estimate, assuming more precisely that is Lipschitz and is a -quasi-geodesic, . Fix and . Set , , , and All denominators and these constants are positive. Put and . We shall prove, by induction on a nonnegative integer , for every with , that For , and the left side is zero, whereas . The constants are independent of .
Assume the induction bound for , and let . Write , , , . If , the bound holds since and the exponential contribution is nonnegative. Suppose . Choose any segment and its point at parameter , as in step 1.1. Then . On a specified segment , let have distance from ; thus . Using F4 and AC, select closest points for all . In particular . Closest-point minimality gives ; since , we have . Thus lies between and . The same computation holds for .
Apply step 2.1 on with and threshold . It is at least and is less than since . Obtain with and this upper bound holds on all of . From the right endpoint similarly obtain . Measure coordinates on from . The initial projections have coordinates in , and the upper bounds imply that all projections in these two outer intervals have coordinates in . Hence their pairwise distance is at most , and their individual distances from are at most (since ). The function is Lipschitz, by the triangle inequality and Lipschitzness of . Step 1.4 gives minima attained at , .
For and , the lower quasi-geodesic inequality and the route through their projections give We also have the product recurrence Indeed F4 gives , and the same holds on the right. The product of at is the smaller of their radial distances, at least . Applying the product inequality twice through these two projections gives .
If both , put . The sum of the two upper quasi-geodesic bounds via gives If , step 5.1 gives , hence . If , the direct lower quasi-geodesic bound gives , so the same product is at most , which is bounded by that preceding expression because , and . Adding the recurrence loss in step 5.1 proves and thus the required induction bound.
In the remaining case one of is at least and is the larger. First suppose and . By AC choose, for each parameter , a radial segment from to . For integers define , from step 1.3, and let be the point at radius on that radial segment. Set and for . Step 1.3 makes -quasiconvex; when , is a closest point to . We use the following finite stopping construction. At stage there is such that The initial stage uses by its projection lower bound in step 4.1 and the definition of the minimum .
Given a stage, apply step 2.1 to on with threshold . This lies between and . Obtain with and the upper bound holds for every parameter in . If some satisfies , choose such a and call it . This is the stopping case, handled next. Otherwise every parameter in has distance strictly greater than that threshold; the next-stage construction below applies with .
In the stopping case . For , step 7.1 and radial projection give . Step 5.1 and give Here , since and , and . Also For this is , which follows from . For , , proving the other case.
The stage lower bound and the projection cap up to imply . Apply F4's exponential contraction to and , with lower distance . Its hypothesis follows from . For , use F4's sharper segment-target estimate, with no additive term. For , its additive term is . Thus, in both cases, Since , the exponential entry is at least . Step 9.1 splits its exponent and yields The exponentials before splitting are at most one, and , so also .
The first bound in step 9.1 gives . Use for from step 1.4 and exponential addition to obtain Combining this with step 10.1 and the definition of yields . Moreover , so . The outer induction hypothesis applies to , which contains . Adding its bound to the recurrence in step 5.1 cancels the two intermediate exponentials exactly and gives . This proves the required induction step whenever the stopping case occurs.
If there is no stopping point in step 8.1, every has . Both and therefore exist at their prescribed radii; their distances to respectively equal , and step 1.3 makes those earlier radial points their closest points in . Apply the contraction inequality of step 1.2 to these two new points. Because the old projection gap is at least , its second maximum entry must apply. Hence For the last inequality it suffices to use , , and : the left side is at least and the required right side is . Thus gives the next stage. Choose in advance a finite integer with , possible since . Stage is impossible at . Only finitely many stages and selections are therefore required, and a stopping case must have occurred. Step 11.1 proves the desired bound in this large-left-minimum case.
If instead and , reverse the real parameter by replacing with on , and replace by . Lipschitz and quasi-geodesic constants, products and interval lengths are unchanged; the large-right minimum becomes the large-left minimum. Steps 7.1–12.1 then shorten to an interval containing by at least . The same outer induction hypothesis applies because it concerns all intervals containing the fixed point and uses only their length and products; equivalently undo the reversal on the resulting shorter interval before applying it. This yields the identical bound for the original interval. Together with steps 3.1 and 6.1, all cases of the induction step are proved. Every finite is at most for some integer , so the induction applies to .
For any specified geodesic , step 1.1 and the resulting product bound give . Substituting the constants in step 2.2 and combining exponentials gives Indeed , , and the factor changes the exponential exponent to . Step 1.4 proves the strict numerical bound. Since , we obtain . This holds for every , so real order gives by letting decrease to . No limiting choice of projections is required, because the resulting inequality concerns the same fixed distance.
Fix and split that specified segment into from to and from to . The two functions are continuous, and their minimum is at most by step 14.1 and the union . Their difference is nonpositive at and nonnegative at , so step 1.4 gives a parameter where they are equal and thus both at most . F4 gives closest points , to , each within . The subsegment of contains . Step 1.1 gives . Together with step 14.1 and , both Hausdorff inclusions give This includes constant , a one-point interval and .
Return to the possibly discontinuous . If its endpoint distance is at least , apply F3 to obtain the Lipschitz map with . Step 15.1 and the two inclusions in F3 give, by adding approximate point-to-set witnesses, For precision, each point-to-set bound is composed with witnesses whose errors are arbitrarily small, and then the errors tend to zero; no nearest point on is asserted. If the endpoint distance is less than , F3 places every image point within of , while every point of is within of . The same desired bound follows directly. When , F3 uses , and the zero- limit above remains valid. Finally yields the exact stated . AC was spent in the explicitly supplied closest-point and radial-segment families in steps 3.1 and 7.1; interval minima, the finite stopping construction and all boundary cases were justified locally.
Depends on
- Hg toolkit local geodesics and hausdorff control
- Slim triangles imply the gromov product inequality
- The gromov product inequality implies the four point condition
- The four point condition implies slim triangles
- Hg toolkit polygonal interpolation of quasi geodesics
- Exponential contraction of projection away from a quasiconvex set
- The Axiom of Choice
- The real exponential function and the number $e$ by a power series
- The exponential series converges absolutely for every real argument
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- The exponential function is strictly increasing
- The natural logarithm as the inverse of the exponential function
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
Used by
Dependency tree · two levels
45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Gouëzel–Shchur, Theorem 1.1 and corrected proof architecture (standard reference, not scraped)
- Gouëzel, AFP Morse_Gromov_Theorem.thy, complete exact-constant proof (standard reference, not scraped)