Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Liouville form of an element relative to a subset

Definition
LiouvilleDiffAlg_Form

by vebis · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-algebrasymbolic-integration

Let GGG be a differential field with derivation DDD and let S⊆GS\subseteq GS⊆G be a subset. An element h∈Gh\in Gh∈G has Liouville form in SSS if there exist an integer n≥0n\ge 0n≥0, constants c1,…,cn∈Con⁡(G)c_1,\dots,c_n\in\operatorname{Con}(G)c1​,…,cn​∈Con(G), nonzero elements u1,…,un∈Su_1,\dots,u_n\in Su1​,…,un​∈S and an element v∈Sv\in Sv∈S such that

h=c1Du1u1+⋯+cnDunun+Dv.h = c_1\frac{Du_1}{u_1}+\cdots+c_n\frac{Du_n}{u_n}+Dv.h=c1​u1​Du1​​+⋯+cn​un​Dun​​+Dv.

For n=0n=0n=0 the sum is empty and the condition reads h=Dvh=Dvh=Dv. This is the shape of the conclusion of Liouville's theorem on elementary antiderivatives; the predicate packages it so that the one-step descent lemmas of the inductive proof (from an intermediate field of a tower to the next smaller one) can be stated without repeating the existential quantifiers.

Formalization Note The constants cic_ici​ range over all of Con⁡(G)\operatorname{Con}(G)Con(G), not over the constants of a smaller field; the descent lemmas assume Con⁡(G)⊆K\operatorname{Con}(G)\subseteq KCon(G)⊆K for the field KKK they descend to.

Definition code
import Mathlib
import Definitions.Def_LiouvilleDiffAlg_Basic

namespace LiouvilleDiffAlg

open scoped Differential

/-- `h ∈ G` has *Liouville form in `S`* if
`h = c₁ · Du₁/u₁ + ⋯ + cₙ · Duₙ/uₙ + Dv` for some `n ≥ 0`, constants `cᵢ ∈ Con(G)`,
nonzero elements `uᵢ ∈ S` and an element `v ∈ S`. -/
def LiouvilleFormIn {G : Type*} [Field G] [Differential G] (S : Set G) (h : G) : Prop :=
  ∃ (n : ℕ) (c u : Fin n → G) (v : G),
    (∀ i, c i ∈ constants G) ∧ (∀ i, u i ∈ S ∧ u i ≠ 0) ∧ v ∈ S ∧
      h = ∑ i, c i * ((u i)′ / u i) + v′

end LiouvilleDiffAlg
Source
Wikipedia, "Liouville's theorem (differential algebra)", revision oldid=1349223559, section "Basic theorem"; proof: Geddes–Czapor–Labahn, Algorithms for Computer Algebra (Kluwer, 1992), §12.4; Rosenlicht, Integration in finite terms, Amer. Math. Monthly 79 (1972), 963–972

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me