Bistro Research

The Conjugate Locus of Rotating Geodesics on SE(2)

From the kernel of the exponential map to folds, cusp seams, and a conditional global incidence criterion.

By Igor Moiseev·7 Oct 2026·original·5 theorems kernel-checked
Author manuscript · research draft; excluded-domain arguments open. This web companion states the principal results and explains their arguments. The complete hypotheses, detailed proofs, figures and bibliography are in the full manuscript linked below. This page is an editorial adaptation; it adds no theorem and does not claim journal peer review.

The image of the singular sources

Use the standard metric of Article A and rotating source coordinates (ψ,k,t)(\psi,k,t). A conjugate time is a zero of the differential's determinant. Its endpoint belongs to the conjugate locus.

The time equation tells us where to look, but the geometry of the image needs more information. A rank loss of one and a rank loss of two require different analyses. Even at corank one, the behavior along the kernel distinguishes an ordinary fold from a cusp.

The manuscript studies the first caustic, the later sheets and the target-incidence question. Its fold/cusp results and its global count criterion use separate certificates with separate domains.

First variation isolates the kernel

On Hamiltonian energy H=1/2H=1/2, the first variation pairs the terminal covector with the two parameter variations to zero, while its pairing with the time velocity is one. Hence a null vector of the full differential has zero time component.

On the open first sheet the heading derivative θψ\theta_\psi is nonzero. Therefore the map has corank one there, and a kernel generator is

v=(θk,−θψ,0).v=(\theta_k,-\theta_\psi,0).

This also explains why differentiating at fixed scaled time pp requires care: the geometric kernel holds physical time tt fixed. Since t=2kpt=2kp, changing kk changes pp along that kernel.

The polynomial that recognizes a fold

The manuscript expresses the derivative of the determinant along vv as an explicit nonzero factor times a polynomial QQ in the Riccati variables of Article A. On an open sheet, a nonzero kernel derivative establishes the fold condition.

The first-sheet positivity proof changes variables to a positive parameter and three variables in the open unit cube. After an explicit positive scaling, it gives the exact identity

P=S0+BSB+ZSZ,P=S_0+\mathsf B S_B+\mathsf Z S_Z,

with B>0\mathsf B>0, Z≥0\mathsf Z\ge0 and each SS a sum of positive Bernstein-basis products. The table contains 216 strictly positive rational coefficients. Its identity and scaling are checked with exact fractions. Thus the positivity argument is algebraic, rather than an extrapolation from a color plot or a floating-point sample.

Later right-sheet sign statements have their own domain and rational certificates. Neither this positivity identity nor a local fold test establishes the global incidence-count conjecture.

The image of the rank loss
A slice through the conjugate locus
Interactive figure on the original article; port pending.
The figure varies the modulus and chooses an ordinal conjugate point. It is a sampled plane projection, not a proof of embedding or a full three-dimensional singularity classifier. Paths can cross in projection while their endpoint headings differ.

Edges and the critical point

The manuscript distinguishes the open sheets from their seams:

  • The Maxwell edge of the first caustic is a cusp edge.
  • Its half-period edge is a cusp below the critical modulus.
  • Above the critical modulus, the first-sheet edge at the zero of α1\alpha_1 is a fold.
  • At k=k0k=k_0 the relevant seams meet in a corank-two point, classified through a generating-family calculation as D4+D_4^+.

The later-cell seam statements require their own labels and conditions; they are given in the PDF. The D4+D_4^+ argument uses the intrinsic cubic sign and the parameter classes needed for versality. These are separate requirements. A quartic zero of the scalar determinant along one curve is not enough to infer that classification.

The reviewed source statements for Morin and generating-family recognition are explicitly located in the manuscript. The literature record still contains full-text and edition gaps; the existence of an Obsidian note is not a substitute for a checked source theorem.

Embedding has a target-space boundary

An explicit half-angle chart parametrizes the first caustic in eight patches. Within each open patch, a slope argument establishes injectivity of the spatial chart, and hence of the full endpoint chart.

The small-modulus limit tends to the identity, while the separatrix limit leaves compact sets. Properness must therefore be stated into SE(2) with the identity removed. Into the whole group, a sequence approaching the omitted small-modulus endpoint disproves that properness claim. The corrected statement and seam identifications are in the manuscript; the plane projection above does not prove them.

The incidence bridge to the scalar inverse

Article C reconstructs rotating sources from integer intersections of a target-dependent function NN. A critical integer intersection is a singular source. This turns questions about incidences of conjugate sheets into questions about critical points and integer levels of NN.

Primes below differentiate along the scalar inverse chart. The useful conditional predicate at an interior critical point is

N′′<0orN<12  and  R<L(m),N''<0\qquad\text{or}\qquad N<\tfrac12\ \text{ and }\ R<L(m),

Here R=x2+y2R=\sqrt{x^2+y^2} and L(m)=4(K(m)−E(m))L(m)=4(K(m)-E(m)). The implication requires a nonzero spatial target, a strict heading 0<∣θ∣<π0<\lvert\theta\rvert<\pi, the off-seam condition xcos⁡(θ/2)+ysin⁡(θ/2)≠0x\cos(\theta/2)+y\sin(\theta/2)\ne0, and a maximal admissible component of the scalar inverse. Assume the predicate holds at every critical point with N≥1/2N\ge1/2 and at every interior local minimum; any critical points in the excluded regions need separate arguments. Then there is at most one critical point at levels ≥1\ge1, and at most two solutions at each positive integer level. The uniqueness threshold is one, not one half.

A locally certified low-level minimum is compatible with this statement. In fact, six selected targets have such dips below one, which rule out unrestricted all-real-level unimodality. They do not refute the positive-integer-level conjecture.

What the interval run establishes

For endpoint-amplitude lifts φ0,φ1\varphi_0,\varphi_1, set μ=(φ0+φ1)/2\mu=(\varphi_0+\varphi_1)/2 and Δφ=φ1−φ0\Delta\varphi=\varphi_1-\varphi_0. Reflection and period symmetries reduce the midpoint to μ∈[0,π/2]\mu\in[0,\pi/2]. The endpoint-coordinate box is

0.02≤m≤0.98,0≤μ≤π/2,0.02≤Δφ≤2π−0.02.0.02\le m\le0.98,\qquad 0\le\mu\le\pi/2, \qquad 0.02\le\Delta\varphi\le2\pi-0.02.

The original interval certificate was withdrawn after two enclosure defects were found: incomplete integrals at negative amplitudes and varying quadratic square roots incorrectly tightened as constants. The current calculation uses repaired primitives and source-bound, resumable proof records.

The saved full-grid audit records 38,400 validated cell checkpoints, with no semantic validation failures. Under the original exclusions, 304 boxes in 32 cells remain unresolved. The current manuscript declares those cells as a fifth excluded set C4\mathcal C_4, in addition to the bisector slab, two corners and double-flip tube.

The largest part of C4\mathcal C_4 is a low-modulus wedge,

0.02≤m≤0.06,0.94≤μ≤π/2,0.41≤Δφ≤0.80,0.02\le m\le0.06,\quad0.94\le\mu\le\pi/2, \quad0.41\le\Delta\varphi\le0.80,

plus one further cell near m∈[0.78,0.82]m\in[0.78,0.82]. The five declared sets occupy approximately 2.56% of the ambient endpoint-coordinate volume. All boxes outside those sets close in the recorded computation. The predicate inside the excluded regions remains an analytical task.

The fifth exclusion is a change of certified domain. It does not prove the residual wedge, nor convert numerical small-modulus asymptotics into a remainder-bounded theorem. Applying the conditional count globally to a target component requires its critical points to meet the certified domain or to have separate proofs on the excluded portions.

Status and reproducibility

This is a research draft. Exact local certificates, geometric recognition and selected independent differential checks support their scoped statements. The global incidence/count conjecture, excluded-domain arguments and publication checks remain open.

This web pass snapshots the current manuscript and reads the latest grid audit. It does not rerun the multi-million-leaf interval calculation or formalize the caustic in Lean. The snapshot manifest preserves the PDF and TeX hashes and identifies the audit totals used.

Read the complete 31-page manuscript above for all charts, seam hypotheses and proof details. Continue to Article C for the exact inverse map and its count statements, or return to the unified program.

Checked by the Lean kernel

Each statement below is a Lean 4 declaration in the program's library. Re-verify asks Lean, on this server, which axioms the proof depends on. A proof passes only if it uses nothing beyond the three standard axioms: in particular, no sorry.

CrossingData.crossing

For every phase ψ there is exactly one parameter p in [lo, hi] and one branch σ = ±1 whose value equals ψ modulo the period 2K.

Show the Lean sourcelean/SE2Conjugate/SE2Conjugate/Crossing.lean:233
/-- **Lemma 3.3, counting part.** For every phase there is exactly one `p ∈ [lo, hi]` at which the
line `τ = ψ + p` meets the curve `τ ≡ ±u(p) (mod 2K)`. -/
theorem crossing (ψ : ℝ) :
    ∃! p, p ∈ Set.Icc C.lo C.hi ∧
      ∃ σ : ℝ, (σ = 1 ∨ σ = -1) ∧ ∃ n : ℤ, C.branch σ p = ψ + 2 * C.K * n := by
  obtain ⟨p, hp, σ, hσ, n, hn⟩ := C.exists_branch ψ
  refine ⟨p, ⟨hp, σ, hσ, n, hn⟩, ?_⟩
  rintro p' ⟨hp', σ', hσ', n', hn'⟩
  exact C.unique_branch hσ' hσ hp' hp hn' hn
JacobiFull.exact_first_time

For every phase ψ there is exactly one p in [p₀, p₁] with J₂(ψ + p, p) = 0.

Show the Lean sourcelean/SE2Conjugate/SE2Conjugate/BeforeFirst.lean:105
/-- **Theorem 3.4 (uniqueness)**: exactly one `p ∈ [p₀, p₁]` with `J₂(ψ + p, p) = 0`, for every
phase, given finitely many tangencies. -/
theorem exact_first_time (ψ : ℝ) :
    ∃! p, p ∈ Set.Icc J.p0 J.p1 ∧ J.J2 (ψ + p) p = 0 :=
  J.left_exact_time 0 ψ
Passed· 18.0s · 1 d agoaxioms: propext, Classical.choice, Quot.sound
JacobiFull.first_time_complete

For every phase there is exactly one conjugate time in (0, p₁], and it lies in [p₀, p₁].

Show the Lean sourcelean/SE2Conjugate/SE2Conjugate/BeforeFirst.lean:111
/-- **Theorem 3.4, complete**: for every phase, exactly one conjugate time in `(0, p₁]`, and it
lies in `[p₀, p₁]`. -/
theorem first_time_complete (ψ : ℝ) :
    ∃! p, p ∈ Set.Ioc 0 J.p1 ∧ J.J2 (ψ + p) p = 0 := by
  obtain ⟨p, ⟨hpI, hp0⟩, hpu⟩ := J.exact_first_time ψ
  refine ⟨p, ⟨⟨by linarith [hpI.1, J.p0_pos], hpI.2⟩, hp0⟩, ?_⟩
  rintro x ⟨hx, hx0⟩
  rcases lt_or_ge x J.p0 with h | h
  · exact absurd hx0 (J.J2_pos_before_p0 ⟨hx.1, h⟩ _).ne'
  · exact hpu x ⟨⟨h, hx.2⟩, hx0⟩

/-! ### The global count: `2N` conjugate times before `p_{N+1}^1` -/
Passed· 24.5s · 16 h agoaxioms: propext, Classical.choice, Quot.sound
JacobiFull.roots_ncard

Away from K = 2E, every phase has exactly 2N conjugate times before the end of the N-th Maxwell cell: two per cell, none before the first.

Show the Lean sourcelean/SE2Conjugate/SE2Conjugate/BeforeFirst.lean:151
/-- **Theorem 4.1, globally**: for `K ≠ 2E` every phase has exactly `2N` conjugate times in
`(0, p_{N+1}^1)`, i.e. two per Maxwell cell, none before the first. -/
theorem roots_ncard (hk : J.K ≠ 2 * J.E) (ψ : ℝ) (N : ℕ) :
    (J.roots ψ N).Finite ∧ (J.roots ψ N).ncard = 2 * N := by
  induction N with
  | zero => rw [J.roots_zero]; simp
  | succ N ih =>
    obtain ⟨p, -, q, -, hC, -⟩ := J.cell_roots N ψ
    have hfin : {x | x ∈ Set.Ico (J.pL N) (J.pL (N + 1)) ∧ J.J2 (ψ + x) x = 0}.Finite := by
      rw [hC]; exact (Set.finite_singleton q).insert p
    have hdisj : Disjoint (J.roots ψ N)
        {x | x ∈ Set.Ico (J.pL N) (J.pL (N + 1)) ∧ J.J2 (ψ + x) x = 0} := by
      rw [Set.disjoint_left]
      rintro x ⟨hx, -⟩ ⟨hx', -⟩
      linarith [hx.2, hx'.1]
    rw [J.roots_succ]
    refine ⟨ih.1.union hfin, ?_⟩
    rw [Set.ncard_union_eq hdisj ih.1 hfin, ih.2, J.two_per_cell_of_ne N hk ψ]
    ring


/-! ### The coincident root is met only by the phase `ψ ≡ K` -/
JacobiConcrete.first_time_unique

For the concrete Jacobi elliptic data with modulus 0 < k < 1, the first conjugate time is unique for every phase.

Show the Lean sourcelean/SE2Conjugate/SE2Conjugate/Construction.lean:220
/-- Concrete first-root uniqueness: no Jacobi-function or first-zero existence premise. -/
theorem first_time_unique (hk0 : 0 < k) (hk1 : k < 1) (psi : ℝ) :
    ∃! p, p ∈ Ioc (0 : ℝ) (full k hk0 hk1).p1 ∧ (full k hk0 hk1).J2 (psi + p) p = 0 :=
  (full k hk0 hk1).first_time_complete psi

Cite as

Igor Moiseev (2026). The Conjugate Locus of Rotating Geodesics on SE(2). Bistro Research, Conjugate locus on SE(2). https://bistroresearch.ai/p/se2-conjugate-locus/conjugate-locus

Glossary
program
One public research topic (e.g. "AML drug repurposing") with its maintainers, pool, ledger and graph.
maintainer
A named person who owns a program: approves proposals, signs off findings.
research graph
The typed graph research-graph/1 (~/.claude/RESEARCH_GRAPH.md): question → hypothesis → experiment → finding → caveat, plus proposals.
question (Q)
What an experiment asks, one sentence.
hypothesis (H)
A falsifiable prediction with a metric and a threshold; *pre-registered* when written before the test.
experiment (E)
One run of the harness that tests a hypothesis.
finding (F)
The result of an experiment: verdict (confirmed / refuted / partial / null / pending) and metrics read from artifacts.
caveat (C)
A threat to a finding's validity (confound, sample size, leakage); open until an experiment controls it.
proposal (N)
A planned experiment with value and cost (1–5 each); score = value ÷ cost.
frontier
Ranked proposals + open caveats + findings that motivated nothing yet. The donation menu.
claim
A published statement bound to the stored script/query that produced it and the value it must return (lab/proof.py).
re-verify
Re-execute a claim's stored script and compare to the stored value.
verified-claim rate
claims whose re-execution matches the stored value ÷ all published claims, over the trailing 30 days.
provenance tier
Where a fact came from, strongest first: measured, label, document, discussion, unsourced (harness/provenance.py).
pool
A program's unspent donations, in arrival order.
FIFO attribution
Each recorded cost is paid by the oldest unspent donation in the pool, split at donation boundaries.
credit line
The list of donors and amounts that paid for one experiment, shown on its finding.
cost per finding
program spend in USD (tokens + compute) ÷ findings with a final verdict (confirmed / refuted / null), over the program's lifetime.
donor conversion
unique donors ÷ unique readers of a program page, over 30 days.
substrate
The data sources a run may read. In Bistro: public sources only (OpenAlex, Europe PMC, arXiv, …).
harness
The run loop: lifecycle steps, one model per step, policy hook, cost guard (forked from autonomous-lab).
lifecycle
GROUND (find sources) → PLAN (design the test) → BUILD (run it) → VERIFY (check claims) → DELIVER (write the finding).
cost guard
Records every model request and compute run with its cost and identity; refuses work past a cap.
policy hook
The rule deciding each agent action: allow, defer, stage (held for a maintainer), deny.
donated compute
A contributor runs a proposal on their own model account and uploads the signed run for re-verification (v2).
fiscal host
A foundation that receives donations on behalf of a project without its own legal entity (e.g. Open Collective Europe).
program slate
The candidate programs Claude proposes across fields of science (manage.py generate_programs), each grounded in literature searches and scored on the rubric below; the full slate, chosen and not, is published in programs/_slate/<date>.json.
impact
Slate rubric, 1–5: how many people, or how much of the planet, benefits if the program's answer is yes.
promise
Slate rubric, 1–5: how likely the first question yields a real, publishable result.
feasibility
Slate rubric, 1–5: how well public data, AI agents and under $50 of compute can answer the first question.
cost (slate)
Slate rubric, 1–5: expected spend for the first three experiments (1 = cheap, 5 = expensive).
slate score
value ÷ cost × 3, where value = (impact + promise + feasibility) ÷ 3; value 5 at cost 3 scores 5. Top programs are seeded one per field.
contributed compute
A run executed by a contributor on their own model account through the MCP server; credited in tokens and self-reported dollars, never drawn from the pool.
human-guided AI research
Research in which AI agents run the experiments while people hold the decisions that matter: what to ask, what to pay for, and what to believe.
maintainer
(refined) An expert who steers a program: accepts proposals, reviews evidence, signs off findings under their own name.
sign-off
A maintainer's review of one finding, recorded with their name and date. Accepting a contributor's staged submission also counts as one.
provisional finding
A finding produced by an agent run that no maintainer has signed off yet. Its numbers still re-execute; its interpretation is unreviewed.
imported record
A finding that was produced before this platform existed and brought in as an archive; it has no run here and so no sign-off.
proposal intake
The form that sends a research question, a maintainer application or an organisation inquiry to a maintainer's queue; nothing sent through it is published.
private project
(pilot) A project commissioned by an organisation, open or closed at its choice, steered by an expert panel it selects.
Proof Atlas
The research program on making large formal Lean proofs navigable by people: https://moiseevigor.github.io/projects/proof-atlas/
volunteer run
Running an open task with your own coding agent: your agent pulls an open task over MCP, runs it on your account and machine, and submits the result. Re-executed in a sandbox before it counts; credited as volunteered work, never drawn from the money pool.
crowd research
Research that many people take part in, by money, by running open tasks with their own coding agent, and by reviewing; in the spirit of volunteer computing such as SETI@home and Folding@home. Volunteers keep control: a task runs only when they ask their agent to run one, under their own provider terms.
tokens written
Output tokens a model generated for a program. Headline token figure together with fresh input.
tokens fresh read
Input tokens read for the first time: uncached input plus cache writes.
tokens re-read from cache
Input tokens served from the prompt cache. Shown separately because they would inflate the total about 25 times.
compute time volunteered
Seconds a volunteer's own machine spent running Bistro tasks. Counted on its own, never added to money or tokens.
non-reproduction rate (NRR)
Share of published, computationally-checkable findings whose stated number does not re-execute to the stored value, on a fixed pre-declared corpus with a stated numeric tolerance. Headline metric of the launch strategy's evidence lane ([STRATEGY-LAUNCH.md](STRATEGY-LAUNCH.md) §4).
claim pack
The sale unit of a private project: findings where every number carries its stored script, its re-execution result, its provenance tier, its cost and a named sign-off.
oracle position
Being the independent party that checks someone else's results; structurally unavailable to a lab that produces them.
non-dilutive
Funding that costs no equity and no board seat: grants, prizes, provider credits, revenue.