Schneider–Lang Theorem¶
Bounds the complex points where a derivative-stable family of controlled-growth meromorphic functions can simultaneously take values in a number field when the family contains two algebraically independent functions.
Core Idea¶
The Schneider–Lang theorem is an algebraic-value scarcity theorem for meromorphic functions. In a standard one-variable formulation, fix a number field \(K\) and finitely many meromorphic functions \(f_1,\ldots,f_N\) of finite order. Assume their generated algebra is stable under differentiation and that the family contains two algebraically independent functions, say \(f_1,f_2\), of orders \(\rho_1,\rho_2\). Then the set of non-pole points \(z\in\mathbb C\) at which every \(f_j(z)\) lies in \(K\) is finite; in the customary normalized statement its cardinality is bounded by.
Scope of Application¶
The theorem organizes arguments involving exponential, elliptic, and modular functions when their algebraic differential equations provide derivative stability and their growth is known. It explains how one premise package yields results that otherwise look unrelated: exponential values, algebraic powers, and restrictions on algebraic values of elliptic functions.
Its scope is narrow in a productive way. An application must identify a number field, choose a controlled family, prove algebraic independence, verify closure under differentiation, calculate admissible orders, and exhibit more common algebraic-value points than the bound would allow. The contradiction forces at least one allegedly algebraic quantity to be transcendental.
Clarity¶
The theorem counts points, not values in isolation. At each candidate point every function in the selected family must be finite and land in \(K\). An individual function may take algebraic values infinitely often without violating the result if the family is not simultaneously algebraic there or if the hypotheses fail.
Manages Complexity¶
The theorem compresses a long transcendence construction into a reusable audit. It tells the researcher which ingredients must be controlled before an auxiliary-function argument can work. Arithmetic height estimates constrain algebraic values; maximum-modulus estimates constrain analytic growth; Siegel's lemma supplies coefficients for an auxiliary function with high-order vanishing. The theorem packages their confrontation into a finite bound.
Abstract Reasoning¶
The proof architecture selects two algebraically independent functions and forms an auxiliary polynomial in them with algebraic coefficients. Siegel's lemma permits many vanishing conditions at the alleged algebraic-value points. Repeated differentiation remains arithmetically controlled because the function algebra is derivative-stable. One estimate says a suitable derivative has very small arithmetic size; another, from complex analysis and finite order, bounds its absolute behavior. Product-formula reasoning makes the two estimates incompatible when the point set is too large.
Knowledge Transfer¶
Across applications, the named functions change but the roles transfer literally. For \(z\) and \(e^z\), differentiation closes immediately and algebraic independence supplies the transcendence engine. For elliptic functions, an algebraic differential equation controls derivatives. For modular functions, analogous functional and differential information enters.
The theorem does not transfer freely to real-variable functions, arbitrary analytic germs, or uncontrolled infinite-order meromorphic functions. Those substitutions remove the analytic-arithmetic infrastructure rather than merely changing examples.
Relationships to Other Abstractions¶
Current abstraction Schneider–Lang Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Schneider–Lang Theorem presupposes Constraint Prime
The theorem composes Constraint: analytic growth and arithmetic degree impose an explicit upper constraint on the admissible common-value locus.
Hierarchy path (1) — routes to 1 parentless root
- Schneider–Lang Theorem → Constraint
Neighborhood in Abstraction Space¶
Schneider–Lang Theorem sits in a sparse region of the domain-specific corpus (78th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Fields, Norms & Birational Groups (7 abstractions)
Nearest neighbors
- Polynomial Ring — 0.85
- Quadratic Field — 0.83
- Étale Algebra — 0.83
- Norm Form — 0.82
- Matrix Pencil — 0.82
Computed from structural-signature embeddings · 2026-09-08