Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.10 (corrected) — composition of functions homogeneous in the 0-limit or the ∞-limit

Proved
HomogBiLimit.OutputFeedback.proposition_2_10

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

homogeneityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ϕ:Rn→R\phi:\mathbb R^n\to\mathbb Rϕ:Rn→R and ζ:R→R\zeta:\mathbb R\to\mathbb Rζ:R→R.

  1. (0-limit) Suppose ϕ\phiϕ is homogeneous in the 0-limit with triple (rϕ,dϕ,ϕ0)(r_\phi,d_\phi,\phi_0)(rϕ​,dϕ​,ϕ0​), dϕ>0d_\phi>0dϕ​>0, and ζ\zetaζ is homogeneous in the 0-limit with triple (rζ,dζ,ζ0)(r_\zeta,d_\zeta,\zeta_0)(rζ​,dζ​,ζ0​) (scalar weight rζ>0r_\zeta>0rζ​>0, degree dζ≥0d_\zeta\ge0dζ​≥0). If ζ0∘ϕ0\zeta_0\circ\phi_0ζ0​∘ϕ0​ is not identically zero, then ζ∘ϕ\zeta\circ\phiζ∘ϕ is homogeneous in the 0-limit with triple
(rϕ, dζ dϕrζ, ζ0∘ϕ0).\Bigl(r_\phi,\ \frac{d_\zeta\,d_\phi}{r_\zeta},\ \zeta_0\circ\phi_0\Bigr).(rϕ​, rζ​dζ​dϕ​​, ζ0​∘ϕ0​).
  1. (∞-limit) The same holds with ∞ in place of 0, under the additional assumption dζ,∞>0d_{\zeta,\infty}>0dζ,∞​>0.

This rule is how the paper certifies that its recursively built feedbacks and observer gains are homogeneous in the bi-limit.

Formalization Note The statement printed in the paper is false without two corrections, both added here. (a) It does not assume ζ0∘ϕ0≢0\zeta_0\circ\phi_0\not\equiv0ζ0​∘ϕ0​≡0, which the definition of homogeneity requires of an approximating function: ϕ(x)=∣x∣\phi(x)=|x|ϕ(x)=∣x∣ and ζ(s)=max⁡(−s,0)\zeta(s)=\max(-s,0)ζ(s)=max(−s,0) give ζ∘ϕ≡0\zeta\circ\phi\equiv0ζ∘ϕ≡0. (b) In the ∞-limit with dζ,∞=0d_{\zeta,\infty}=0dζ,∞​=0 it fails: on R2\mathbb R^2R2 take ϕ(x)=x1\phi(x)=x_1ϕ(x)=x1​ (weight (1,1)(1,1)(1,1), degree 1) and ζ(s)=1−e−s2\zeta(s)=1-e^{-s^2}ζ(s)=1−e−s2 (weight 1, degree 0, ζ∞≡1\zeta_\infty\equiv1ζ∞​≡1); then ζ(ϕ(λx))=0≠1\zeta(\phi(\lambda x))=0\ne1ζ(ϕ(λx))=0=1 at x=(0,1)x=(0,1)x=(0,1) for every λ\lambdaλ. The paper uses the proposition only with ζ\zetaζ a signed power of positive degree, where both extra assumptions hold. ζ\zetaζ is viewed as a function on R1\mathbb R^1R1, v↦ζ(v1)v\mapsto\zeta(v_1)v↦ζ(v1​), with the constant weight rζr_\zetarζ​.

Preamble
import Mathlib
import Definitions.Def_HomogBiLimit_OutputFeedback_Homogeneity
import Definitions.Def_HomogBiLimit_OutputFeedback_ChainSystems
Formal statement
namespace HomogBiLimit.OutputFeedback

/-- Proposition 2.10 (composition), p. 5, with two corrections (see the natural-language
statement): the composite approximating function `ζ₀ ∘ φ₀` (resp. `ζinf ∘ φinf`) is assumed
not identically zero, and in the ∞-limit the degree of `ζ` is assumed positive.
The scalar function `ζ : ℝ → ℝ` is viewed on `ℝ¹` as `v ↦ ζ(v₁)`, with scalar weight. -/
theorem proposition_2_10 {n : ℕ} (φ φ₀ φinf : (Fin n → ℝ) → ℝ) (ζ ζ₀ ζinf : ℝ → ℝ) :
    (∀ (rφ : Fin n → ℝ) (dφ rζ dζ : ℝ),
      0 < dφ → IsHomogZero φ rφ dφ φ₀ →
      IsHomogZero (fun v : Fin 1 → ℝ => ζ (v 0)) (fun _ => rζ) dζ (fun v => ζ₀ (v 0)) →
      (∃ x, ζ₀ (φ₀ x) ≠ 0) →
      IsHomogZero (fun x => ζ (φ x)) rφ (dζ * dφ / rζ) (fun x => ζ₀ (φ₀ x))) ∧
    (∀ (rφ : Fin n → ℝ) (dφ rζ dζ : ℝ),
      0 < dφ → 0 < dζ → IsHomogInfty φ rφ dφ φinf →
      IsHomogInfty (fun v : Fin 1 → ℝ => ζ (v 0)) (fun _ => rζ) dζ (fun v => ζinf (v 0)) →
      (∃ x, ζinf (φinf x) ≠ 0) →
      IsHomogInfty (fun x => ζ (φ x)) rφ (dζ * dφ / rζ) (fun x => ζinf (φinf x))) := by sorry

end HomogBiLimit.OutputFeedback
Source
Andrieu, Praly, Astolfi, Homogeneous Approximation, Recursive Observer Design, and Output Feedback, arXiv:0903.0298v1, p. 5, Proposition 2.10 (corrected: composite approximation not identically zero; positive degree of ζ in the ∞-limit)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me