Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The singular power mode solves a first-order Euler equation

Proved
CouretOaiBridge01.InteriaSA05.besselSingularMode_euler_first_order

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For real nu and x>0, let u_nu(x)=x^(-|nu|). Then

xderiv⁡(uν)(x)=−∣ν∣uν(x).x\operatorname{deriv}(u_\nu)(x)=-|\nu|u_\nu(x).xderiv(uν​)(x)=−∣ν∣uν​(x).

This is a first-order identity for the explicit mode.

Preamble
import Definitions.Def_Couret_INTERIA_SA_05_BesselWeightedModes_d5985292a225
import Mathlib.Analysis.SpecialFunctions.Integrability.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv
import Mathlib.Tactic
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv

/-!
# INTERIA-SA-05 — singular Bessel power mode and weighted norm

A first, narrowly scoped connection from the mathlib power-integrability
criterion to an explicit differentiable function.

This is a model zero-energy power mode (not a classification of the Bessel
minimal operator). In particular the logarithmic companion at ν=0, the
second-order differential equation, Weyl's alternative, boundary domains and
deficiency indices are NOT established here. No Hilbert–Pólya/RH claim.
-/

open Set MeasureTheory

namespace CouretOaiBridge01.InteriaSA05











Formal statement

theorem besselSingularMode_euler_first_order (ν x : ℝ) (hx : 0 < x) :
    x * deriv (besselSingularMode ν) x = (-|ν|) * besselSingularMode ν x := by sorry






end CouretOaiBridge01.InteriaSA05

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/8a8227048f12169067627c9a591ee5448bdfc0b9/research/lean/CouretOaiBridge01/INTERIA_SA_05_BesselWeightedModes.lean#L54-L69, lines 54–69; source file SHA-256 ba27450104fa7b1723307eecdf5fd7d660e905e673981ada5da5102e73e1a042; theorem CouretOaiBridge01.InteriaSA05.besselSingularMode_euler_first_order

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