`interp_one`

proved

show as: view math explainer →

module: IndisputableMonolith.Action.PathSpace
domain: Action
line: 146 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Action.PathSpace on GitHub at line 146.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

formal source

 143  intro t; simp [interp_apply]
 144
 145/-- Interpolation at `s = 1` is the second path. -/
 146lemma interp_one {a b : ℝ} (γ₁ γ₂ : AdmissiblePath a b) :
 147    ∀ t, (interp γ₁ γ₂ 1 ⟨by norm_num, le_refl 1⟩).toFun t = γ₂.toFun t := by
 148  intro t; simp [interp_apply]
 149
 150/-- Interpolation preserves shared endpoints. -/
 151lemma interp_fixedEndpoints {a b : ℝ} {γ₁ γ₂ : AdmissiblePath a b}
 152    (h : fixedEndpoints γ₁ γ₂) (s : ℝ) (hs : s ∈ Icc (0:ℝ) 1) :
 153    fixedEndpoints γ₁ (interp γ₁ γ₂ s hs) := by
 154  refine ⟨?_, ?_⟩
 155  · simp [interp_apply, h.1]; ring
 156  · simp [interp_apply, h.2]; ring
 157
 158/-! ## Status report -/
 159
 160/-- Status string for the path-space module. -/
 161def pathSpace_status : String :=
 162  "Action.PathSpace: AdmissiblePath, actionJ, interp, fixedEndpoints (0 sorry, 0 axiom)"
 163
 164end Action
 165end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.