Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-08-13 (gpt-5.6-sol-codex-subscription)↗ rests on later material (inherited)
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.

The rational function field R(t) ordered by the eventual sign is an ordered field, worked out

Example

Let R(t) be the field of fractions (For a field F, F(t)=Frac⁡(F[t]) is its rational function field; in particular R(t)=Frac⁡(R[t])) of the polynomial ring R[t], and let

P  =  { f∈R(t):f≠0 and f(x)>0 for all sufficiently large real x }.

Not every ordered field is Archimedean proves that (R(t),P) is an ordered field and that it is not Archimedean. This example works the order out in usable form. Three things are established below:

  1. A computation rule. For f=p/q with p,q∈R[t] nonzero, f∈P exactly when lc⁡(p)lc⁡(q)>0, where lc⁡ is the leading coefficient. So comparing two rational functions is comparing one product of two real numbers.
  2. That the rule is independent of the representative p/q chosen, which is what makes it a definition of a function on R(t) and not merely on pairs.
  3. The two elements that make the field interesting: t, which exceeds every canonical natural, and 1/t, which is positive and lies below every positive rational. An element of the second kind is called an infinitesimal, and its existence is exactly the failure of the Archimedean property (Archimedean ordered field).

Facts & Assumptions

Given: The field R(t) of fractions of R[t], whose elements are written p/q with p,q∈R[t] and q≠0, with p/q=p′/q′ exactly when pq′=p′q; and the set P above. For a nonzero p∈R[t], lc⁡(p) denotes its leading coefficient.

[L1]

(R(t),P) is an ordered field, and n⋅1<t for every natural n, so it is not Archimedean (Not every ordered field is Archimedean, Ordered field, Archimedean ordered field).

[L2]

For a commutative ring R and a nonzero f∈R[x], deg⁡f is the largest index carrying a nonzero coefficient and lc⁡(f) is that coefficient (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree). For a field F the polynomial ring F[t] is an integral domain (For a field F, F(t)=Frac⁡(F[t]) is its rational function field; in particular R(t)=Frac⁡(R[t])), and R is a field (The reals form a totally ordered field, Field). If R is an integral domain and f,g∈R[x] are nonzero, then fg≠0, deg⁡(fg)=deg⁡f+deg⁡g and lc⁡(fg)=lc⁡(f)lc⁡(g) (Over an integral domain, degrees add under multiplication of nonzero polynomials).

[L3]

In R, a nonzero square is positive (Squares of nonzero elements are positive); a product of two nonzero reals is positive exactly when both are positive or both are negative (Sign rules for products and monotonicity of multiplication).

[L4]

In an ordered field, f<g means g−f∈P; a positive element has a positive inverse (Inverses of positives are positive, and reciprocation reverses order, Ordered field).

[L5]

The canonical embedding of Q into an ordered field is an order embedding, so a rational q>0 names a positive element q⋅1 of R(t) (The unique embedding of ℚ into an ordered field).

[L6]

In an ordered field ∣u∣=u when u≥0 and ∣u∣=−u when u<0 (Absolute value in an ordered field), and −∣u∣≤u≤∣u∣ for every u (Basic properties of the absolute value); R is a totally ordered field (The reals form a totally ordered field).

Verification

technique · direct
1.1

Let p∈R[t] be nonzero, with m=deg⁡p and a=lc⁡(p)≠0, so that p(x)=axm+∑i<maixi for every real x. If m=0 then p(x)=a for every x. If m≥1, put C=∑i<m∣ai∣≥0; for x≥1 and i<m one has 0<xi≤xm−1, and −∣ai∣≤ai≤∣ai∣, so −∣ai∣xm−1≤aixi≤∣ai∣xm−1, and adding these m inequalities gives −Cxm−1≤∑i<maixi≤Cxm−1. Hence if a>0 then p(x)≥axm−Cxm−1=xm−1(ax−C)>0 for every x>max⁡(1,C/a); and if a<0, the same bound applied to −p, whose leading coefficient is −a>0, gives p(x)<0 for every x>max⁡(1,C/(−a)). In every case there is a real Xp such that p(x)≠0 and p(x) has the sign of lc⁡(p) for every x>Xp.

givenL2L3L6algebra
1.2

If p/q=p′/q′ then pq′=p′q, so lc⁡(p)lc⁡(q′)=lc⁡(p′)lc⁡(q); multiplying both sides by lc⁡(q)lc⁡(q′) gives lc⁡(p)lc⁡(q)⋅lc⁡(q′)2=lc⁡(p′)lc⁡(q′)⋅lc⁡(q)2, and both squares are positive, so lc⁡(p)lc⁡(q) and lc⁡(p′)lc⁡(q′) have the same sign.

L2L3
2.1

For nonzero p,q∈R[t] put X=max⁡(Xp,Xq) with Xp,Xq as in step 1.1: for every x>X neither p nor q vanishes, so f=p/q has a value f(x)=p(x)/q(x) there, and since p(x) has the sign of lc⁡(p) and q(x) the sign of lc⁡(q), the sign of that value is the sign of lc⁡(p)lc⁡(q); hence f∈P exactly when lc⁡(p)lc⁡(q)>0.

step 1.1L3
3.1

The rule of step 2.1 is therefore independent of the representative and computes membership in P; combined with [L1] it computes the order: p/q<p′/q′ exactly when the numerator and denominator of p′/q′−p/q, written in any representative, have leading coefficients of positive product.

step 1.2step 2.1L1L4
3.2

1/t∈P, since lc⁡(1)lc⁡(t)=1>0; equivalently, t∈P and inverses of positives are positive.

step 2.1L3L4
4.1

For every rational q>0: q⋅1−1/t=(qt−1)/t, whose leading coefficients have product q⋅1=q>0, so 1/t<q⋅1. Together with step 3.2, 0<1/t<q⋅1 for every positive rational q.

step 2.1step 3.1step 3.2L3L5
4.2

For every natural n: t−n⋅1 has leading coefficients with product 1>0, so n⋅1<t; and t2−t=t(t−1) likewise gives t<t2.

step 2.1step 3.1L2L3
5.1

So R(t) is an ordered field, computed by a single product of leading coefficients, in which t is larger than every canonical natural and 1/t is a positive infinitesimal.

step 3.1step 4.1step 4.2L1∎

Remarks

Depends on

Used by

Dependency tree · two levels

33 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