Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

K⟦x⟧ embeds in K((x)) as the nonnegative-order subring; every nonzero Laurent series is uniquely xvx(h)u with u∈K⟦x⟧× and inverse x−vx(h)u−1

Statement

For every field K, extending a power series by zero at negative exponents gives an injective unital ring homomorphism

K⟦x⟧↪K((x))

whose image is {0}∪{h:vx(h)≥0}. Every nonzero h∈K((x)) has a unique factorisation

h=xvx(h)u,u∈K⟦x⟧×,

and

h−1=x−vx(h)u−1.

For K=R, the substitution xn↦t−n identifies this description with the published real Laurent-series construction.

Facts & Assumptions

Given: The hypotheses and notation of the statement above.

[F1]

Formal Laurent series have support bounded below, coefficientwise addition, finite convolution in each degree, least exponent vx, termwise derivative, and residue res⁡x(f)=[x−1]f (Formal Laurent series K((x)), their order, derivative, and residue).

[F2]

A formal power series is a unit exactly when its constant coefficient is a unit (A formal power series is a unit exactly when its constant coefficient is a unit).

[F3]

Every nonzero published real Laurent series has a multiplicative inverse constructed from its leading term (R((t−1)) is a field: every nonzero formal Laurent series is invertible).

[F4]

For nonzero published real Laurent series, v(fg)=v(f)+v(g) and the leading coefficients multiply (Valuation and leading coefficient in R((t−1)): v(fg)=v(f)+v(g), and the behaviour of v under sums).

Proof

technique · extend and shift coefficient functions
1.1

Extending coefficients by zero at negative integers preserves addition, 1, and every finite convolution, and is injective. Its nonzero image has nonnegative least exponent; conversely every Laurent series of nonnegative order already has no negative coefficient and so comes from a unique power series.

givenF1
1.2

Let m=vx(h). Define u=x−mh. Then u∈K⟦x⟧ and its constant coefficient is the nonzero leading coefficient of h, so u is a unit. This gives h=xmu and x−mu−1 is directly a two-sided inverse. If h=xav=xbu with the two final factors constant-term units, least exponents give a=b=m and coefficient extensionality gives u=v.

givenF1F2
2.1

Over R, sending coefficient anxn to ant−n preserves finite convolution. The least x-exponent becomes the published least t−1-exponent, so the order, factorisation, unit, and inverse formulas agree with the cited real theorem and valuation lemma.

step 1.1step 1.2givenF3F4
3.1

Steps 1.1-2.1 prove the embedding, image, unique factorisation, inverse formula, and real-coordinate dictionary.

step 1.1step 1.2step 2.1∎

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources