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.
An index-one moduli locus can be infinite without compactness
Statement refuted
Without a compactness hypothesis, discrete index-one Morse trajectory data are finite.
Witness
Let and on put
Choose the locally normalized bounded downward-gradient-like field described by near , near , and away from those charts, patched by disjoint nonnegative bump functions. It is complete. Each component has one unparametrized trajectory from the index-one maximum to the index-zero minimum ; hence the global index-one locus is an infinite discrete union.
Facts & Assumptions
Given: The above disjoint-union field, with the local Morse coordinates and bump-function patching specified in the example.
A downward gradient-like field has the stated exact local normal forms and strictly decreases off critical points (Downward gradient-like vector fields for a Morse function).
Counterexample
Near and the displayed local fields are the required Morse normal forms; off them every patched summand has . The coefficients are bounded on fixed supports and the outside coefficient has absolute value at most , so every is complete.
On each line the interval is one flow orbit from to . Thus is a singleton and hence is discrete, without any appeal to Morse--Smale transversality.
Therefore is an infinite discrete set. It refutes finiteness of the global index-one locus without a compactness condition, not finiteness for one fixed endpoint pair.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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
- Kai Cieliebak and Urs Frauenfelder, Morse homology on noncompact manifolds, Introduction example (standard reference, not scraped)