Formal power series
Integral weighted negative logarithmic derivatives of native formal-power-series units over arbitrary commutative rings, with group laws, naturality and finite coefficient formulas; and coefficientwise ideal-adically restricted native multivariate power series with finite polynomial reductions, regular-principal internal kernels. Polynomial completion over any commutative coefficient ring is the algebra of series over its adic completion with polynomial images at every original quotient precision; coefficient transport recovers the original restricted-series ring equivalence for adically complete coefficients. Ideal-preserving coefficient maps and arbitrary variable maps on these completed-coefficient series give functorial ring maps with finite source-row fiber sums, including infinite fibers. The polynomial-completion comparison is natural in both directions, with completed-scalar compatibility and raw row-kernel containment, without original completeness or finiteness assumptions. The restricted subring also has a coefficient-ring algebra structure, all-level surjective scalar-linear polynomial reductions, and regular-principal module-quotient equivalences, including a separate native-integer API for default module instances. Over adically complete coefficient rings, every polynomial linear endomorphism extends to the restricted series, with finite-level and kernel-preserving uniqueness laws. Independently of completeness, coefficientwise reduction kernels multiply into the kernel at the sum of their levels, including finite-sum laws. For adically complete coefficient rings, units of the restricted subring are detected by the first polynomial reduction or by constant and nonconstant coefficient criteria, with no finite-variable restriction. Over finitely many variables, restrictedness has a degree-cutoff criterion; if the coefficient ideal is finitely generated, every reduction kernel is the intrinsic algebraic image ideal of its corresponding ideal power. Separate restricted-series modules add coefficient content, intrinsic actual-ring leading terms, division under adic/valuation hypotheses and conditional ideal generation by a finite primitive family. A generic support leaf compares cofinal ideal-adic filtrations on arbitrary modules. Change-of-ideal maps and surjective polynomial reduction work for arbitrary ideals and variables. Local-ring polynomial residue is compatible with valuation-domain residue; injective first-variable regrouping has polynomial and finite-variable reindexing interfaces. Intrinsic leading products and singleton division have separate Hausdorff uniqueness and complete primitive-existence interfaces; first-variable division yields finite-polynomial remainders. A supplied division of X₀^d by a divisor with regrouped residue degree d and nonzero scalar top, with actual remainder support below d, gives constant-unit quotient residue; radical equality and completeness reflect it to a unit. With a nonzero principal-adic parameter in the maximal ideal of a commutative valuation domain, radical equality and completeness, a restricted series whose regrouped residue polynomial has degree d and nonzero scalar top coefficient admits a unique unit multiplier and monic first-variable polynomial of degree d, even among competing multipliers not assumed units; coefficient primitivity is derived from the top term.
Quoted from the project description in formalization.yaml of FormalFrontier/formal-power-series at commit 29bdab8c, Apache-2.0.
No articles: its formalization.yaml lists no highlights, and none of its 9 headline results links a declaration that the scan finds in the linked file at this commit, so they are quoted below.
Facts
From the repository and its formalization.yaml; the review and automation statements are quoted as written.
- Repository: FormalFrontier/formal-power-series, read at commit 29bdab8c (2026-11-04).
- Lean toolchain v4.34.0-rc2, Mathlib at 83abb3e7.
- License: Apache-2.0.
- Authors: Formal Frontier Agents.
- Review status: “The library's Lean mathematics has received independent review. Source correspondence and coverage are separate decisions.”.
- Review notes: “Proofs in the checked Lean sources depend only on propext, Classical.choice and Quot.sound, including private declarations. README.md and API.md describe the public API and its limits.”
- Reviewers: “Formal Frontier independent mathematical contribution reviewers”.
- Automation: agent; framework “OpenAI Codex CLI / Formal Frontier Hive”; tool setup “Formal Frontier AI contributors formalized the weighted derivative using mathlib's native power-series APIs and ordinary-import clients. Prism authored the original weighted-derivative proof expression; other contributors adapted its argument, and Folio contributed derivative documentation. Distinct contributors developed the restricted-series carrier, principal kernel, inverse-limit, scalar-linear quotient, linear extension and kernel-filtration proofs; others developed content, selected factorization, leading terms, monic parameters, restricted division, cofinal comparison and conditional primitive ideal generation. The completed-coefficient polynomial comparison reuses the full AdicModules direct-sum completion equivalence and its canonical restriction-of-scalars and completed coefficient-map interfaces. Coefficient change uses Mathlib's coefficientwise power-series maps; arbitrary variable maps use its polynomial renaming and finite dependent direct-sum pushforward, completed through that same whole AdicModules equivalence rather than through the polynomial-completion comparison. Contributors to the finite-variable degree criterion, its infinite-variable counterexample and the finite-generation kernel argument were distinct from those who formalized the results and wrote ordinary-import clients. Further contributors developed and formalized restricted-subring unit detection, using the geometric inverse and kernel-filtration APIs, and wrote its ordinary-import client. The pinned MultivariatePolynomials library supplies polynomial linear-division and monic-lifting algorithms. The antidiagonal multiplication method adapts Jz Pan's Apache-2.0 mathlib argument.”
Literature
The sources its formalization.yaml names, with their relationship to it.
- The K-book: An Introduction to Algebraic K-theory, Charles A. Weibel, Section II.4 and Exercise 4.6 (book; adapts).
- Foundations of Rigid Geometry I, Kazuhiro Fujiwara, Fumiharu Kato (book; background).
Builds on
- Adic modules (a Lake dependency, pinned at 5fbe4fe9)
- Coherent modules (a Lake dependency, pinned at 3ecdd76a)
- Multivariate polynomials (a Lake dependency, pinned at 5d58abb9)
Headline results
Quoted from the headline results in README.md of FormalFrontier/formal-power-series at commit 29bdab8c, Apache-2.0.
Weighted unit derivative
Over an arbitrary commutative ring R, for a native unit
f : (PowerSeries R)ˣ, negXLogDeriv f = -X * f' * f⁻¹, weighted by
negative X. Products become sums, inverses become negatives and integer
powers become integer multiples, naturally under coefficient-ring homomorphisms.
Integral convolution works without normalization; a division-free forward
recurrence for derivative coefficients requires constant coefficient one.
Linear factors 1 - C a * X give signed power sums for finite products,
including inverse factors and the empty family.
This is neither reconstruction nor injectivity: constant units and, under
[CharP R p], p-th powers lie in the kernel; even normalized nonidentity
units can do so. No formal logarithm, lambda/Witt structure, splitting extension
or Adams operation is asserted. See the full formulas and limitations
and source.
Rational Artin–Hasse exponential
The rational formal construction is defined for every natural p and has
constant and linear coefficients one. For 2 ≤ p (composite p allowed), it is
exp (∑ i ≥ 0, X^(p^i) / p^i); the coefficient recurrence together with
a_0 = 1 determines it uniquely. The recurrence fails at p = 1, degree two.
For prime p only, its degree-k coefficient equals that of every finite
Euler product of (1 - X^n)^(-μ(n)/n) over positive n ≤ N coprime to p,
when k ≤ N. This is coefficientwise, not an infinite-product or analytic
convergence assertion. Prime p also gives coefficient p-integrality
(multiplicative p-adic valuation at most one), by an independent
Dieudonné–Dwork proof using p-adic divided powers, not the Euler identity.
The rational core does not import p-adic theory. See details and examples,
the rational core,
Euler product and
separate p-adic module.
Ideal-adically restricted multivariate series
For any family q : ∀ i, C →+* Q i of homomorphisms between commutative
semirings, MvPowerSeries.polynomialReductionSubalgebra σ q consists of
series whose coefficientwise image under each q i is polynomial, equivalently
has finite coefficient support. It uses the usual coefficient-C algebra and
needs no compatibility, surjectivity, nonempty index type or finite variable
type. Its polynomial inclusion and finite reductions are homomorphisms;
a surjective row gives a surjective reduction. An empty family gives the whole
series algebra, and one identity row gives precisely the polynomial subalgebra,
with reduction inverse to inclusion.
For arbitrary variable types, commutative coefficient rings and ideals I,
restrictedness requires that, at each k, only finitely many monomial indices
have coefficients outside I ^ k. The restricted subring has surjective polynomial reductions, including
k = 0, ideal-change maps, and residue maps for parameters in a local ring's
maximal ideal. This subring and its reductions specialize the same construction
to q k = Ideal.Quotient.mk (I ^ k).
Regrouping and kernels. First-variable regrouping is injective, not an
equivalence with all iterated restricted series. Finite variables give a
degree-cutoff criterion; with I.FG they also identify the intrinsic
algebraic reduction kernel at every level. Regular principal ideals admit
internal division and scalar-linear quotient equivalences. For arbitrary
variables and ideals, coefficientwise reduction kernels multiply from levels
n, k into level n + k, without completeness or finite generation; this
does not identify intrinsic ideal powers or give an arbitrary-ideal
intrinsic kernel identity.
Completion and units. For arbitrary R, I and σ,
MvPolynomial.adicCompletionEquiv σ I identifies polynomial completion with
the algebra of series over AdicCompletion I R that become polynomials under
every original quotient evaluation. It uses the named
AdicCompletion.extendedAlgebra on the source, not a new global instance.
Under [IsAdicComplete I R], coefficient transport recovers the original
ring equivalence with restricted series over R. Neither assertion assumes
intrinsic completeness of arbitrary polynomial completions. Under coefficient
completeness, a restricted series f is a unit exactly when adicReduction I 1 f is a unit,
equivalently when its constant coefficient is a unit and every other
coefficient lies in I.radical.
Coefficient and variable maps. For commutative rings R, T, ideals
I, J, a homomorphism f : R →+* T, hf : I ≤ J.comap f, and any variable
map g : σ → τ, the completed-coefficient series above admit a ring map
MvPowerSeries.completedRestrictedMap I J f hf g. Infinite fibers are
allowed: at each precision its coefficients are finite sums over the source
polynomial reduction's support. Coefficient change is coefficientwise along
AdicCompletion.mapRingHom I J f hf; renaming completes a finite direct-sum
pushforward using the whole completion/restricted-product equivalence,
independently of the polynomial-completion comparison. Identity, composition,
polynomial and scalar laws hold, and MvPolynomial.adicCompletionEquiv
commutes with these maps in both directions on all elements. No completeness,
separation, finite generation or finite-variable hypothesis is required.
See the map API.
Linear extension. Under [IsAdicComplete I R], every polynomial
R-linear endomorphism extends to an R-linear restricted-series operator
with finite-level equations. Uniqueness needs both agreement on
polynomials and preservation of every coefficientwise reduction kernel;
no ring-homomorphism extension or intrinsic restricted-ring completeness is
asserted. See the extension guide.
Content, leading terms and division. Separated prevaluation rings give
selected-coefficient content factorization. Over a valuation domain separated
for the principal ideal of a parameter in its maximal ideal, intrinsic
leading terms are polynomials over the actual ring R. Any two supplied
divisions by a nonzero singleton divisor with actual-supported remainders
agree; arbitrary-divisor existence is not asserted. Primitive-divisor
existence and conditional ideal generation additionally require a nonzero
parameter, radical equal to the maximal ideal, and adic completeness.
Under those hypotheses, a finite primitive family in a restricted-series
ideal generates it if its actual-R leading terms generate the full
polynomial leading-term ideal. No standard-basis existence is asserted;
conditional quotient-unit reflection does not construct a division.
First-variable preparation. Over a commutative valuation domain complete
for the principal ideal of a nonzero parameter in its maximal ideal, with
that ideal's radical equal to the maximal ideal, let a restricted series f
in Fin (n + 1) variables have regrouped maximal-ideal residue polynomial
of degree d with nonzero scalar top coefficient C c. There is a unique
pair consisting of a restricted unit u and a monic first-variable polynomial
G of exact degree d with polynomialRestrictedFinFirst _ n G = u * f.
Actual-coefficient primitivity follows; uniqueness even allows competing
multipliers not assumed units. n = 0 and d = 0 are included. See the
preparation guide.
Generic cofinal support. For any R-module, I ≤ J, 1 ≤ N and
J ^ N ≤ I equate separation, precompleteness and completeness for the two
filtrations; this separately importable result needs no restricted series.
See the complete restricted-series results and limitations and module guide. These results do not assert norm/radius or variable-adic restrictions, general base change, standard-basis existence, or source coverage.
For completed-coefficient maps, choose one of these direct imports; paths are
relative to FormalPowerSeries.MvPowerSeries.IdealAdicRestricted.
| Module | Use |
|---|---|
CompletionMap |
Canonical map between polynomial completions, quotient squares and completed-scalar compatibility |
CompletedRename |
Arbitrary variable maps on series over completed coefficients, including infinite fibers |
Naturality |
Coefficient change, joint maps, functoriality and forward/inverse naturality of the completion comparison |
Main results
Its formalization.yaml lists 96 main results, and the scan finds 96 of them declared in the file the yaml gives; they are on their own page, not made articles.
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.