Transcendence of power series for some number theoretic functions
Bibliographic record
Abstract
We give a new proof of Fatou’s theorem: <italic>if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.</italic> This result is applied to show that for any non–trivial completely multiplicative function from <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper N"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">N</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {N}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartSet negative 1 comma 1 EndSet"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:mo> − </mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo fence="false" stretchy="false">}</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\{-1,1\}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , the series <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma-summation Underscript n equals 1 Overscript normal infinity Endscripts f left-parenthesis n right-parenthesis z Superscript n"> <mml:semantics> <mml:mrow> <mml:munderover> <mml:mo> ∑ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:munderover> <mml:mi>f</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:msup> <mml:mi>z</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">\sum _{n=1}^\infty f(n)z^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is transcendental over <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper Z left-parenthesis z right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {Z}(z)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ; in particular, <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma-summation Underscript n equals 1 Overscript normal infinity Endscripts lamda left-parenthesis n right-parenthesis z Superscript n"> <mml:semantics> <mml:mrow> <mml:munderover> <mml:mo> ∑ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:munderover> <mml:mi> λ </mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:msup> <mml:mi>z</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">\sum _{n=1}^\infty \lambda (n)z^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is transcendental, where <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="lamda"> <mml:semantics> <mml:mi> λ </mml:mi> <mml:annotation encoding="application/x-tex">\lambda</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is Liouville’s function. The transcendence of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma-summation Underscript n equals 1 Overscript normal infinity Endscripts mu left-parenthesis n right-parenthesis z Superscript n"> <mml:semantics> <mml:mrow> <mml:munderover> <mml:mo> ∑ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:mi mathvariant="normal"> ∞ </mml:mi> </mml:munderover> <mml:mi> μ </mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:msup> <mml:mi>z</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">\sum _{n=1}^\infty \mu (n)z^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is also proved.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".