Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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)\mathbb{R}(t) ordered by the eventual sign is an ordered field, worked out

Example

Let R(t)\mathbb{R}(t) be the field of fractions of the polynomial ring R[t]\mathbb{R}[t], and let

P  =  {fR(t):f0 and f(x)>0 for all sufficiently large real x}.P \;=\; \{\, f \in \mathbb{R}(t) : f \ne 0 \text{ and } f(x) > 0 \text{ for all sufficiently large real } x \,\}.

Not every ordered field is Archimedean proves that (R(t),P)(\mathbb{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/qf = p/q with p,qR[t]p, q \in \mathbb{R}[t] nonzero, fPf \in P exactly when lc(p)lc(q)>0\operatorname{lc}(p)\operatorname{lc}(q) > 0, where lc\operatorname{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/qp/q chosen, which is what makes it a definition of a function on R(t)\mathbb{R}(t) and not merely on pairs.
  3. The two elements that make the field interesting: tt, which exceeds every canonical natural, and 1/t1/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)\mathbb{R}(t) of fractions of R[t]\mathbb{R}[t], whose elements are written p/qp/q with p,qR[t]p, q \in \mathbb{R}[t] and q0q \ne 0, with p/q=p/qp/q = p'/q' exactly when pq=pqpq' = p'q; and the set PP above. For a nonzero pR[t]p \in \mathbb{R}[t], lc(p)\operatorname{lc}(p) denotes its leading coefficient.

[L1]

(R(t),P)(\mathbb{R}(t), P) is an ordered field, and n1<tn \cdot 1 < t for every natural nn, so it is not Archimedean (Not every ordered field is Archimedean, Ordered field, Archimedean ordered field).

[L2]

A nonzero real polynomial has finitely many real roots, and beyond all of them its values have the constant sign of its leading coefficient; R[t]\mathbb{R}[t] is an integral domain, so lc(pq)=lc(p)lc(q)\operatorname{lc}(pq) = \operatorname{lc}(p)\operatorname{lc}(q) and a product of nonzero polynomials is nonzero (Not every ordered field is Archimedean, The reals form a totally ordered field, Field).

[L3]

In R\mathbb{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<gf < g means gfPg - f \in 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\mathbb{Q} into an ordered field is an order embedding, so a rational q>0q > 0 names a positive element q1q \cdot 1 of R(t)\mathbb{R}(t) (The unique embedding of ℚ into an ordered field).

Verification

technique · direct
1.1

For nonzero p,qR[t]p, q \in \mathbb{R}[t] there is a real XX beyond which neither pp nor qq vanishes, so f=p/qf = p/q has a value f(x)=p(x)/q(x)f(x) = p(x)/q(x) for every x>Xx > X, and the sign of that value is the sign of lc(p)lc(q)\operatorname{lc}(p)\operatorname{lc}(q); hence fPf \in P exactly when lc(p)lc(q)>0\operatorname{lc}(p)\operatorname{lc}(q) > 0.

L2L3
1.2

If p/q=p/qp/q = p'/q' then pq=pqpq' = p'q, so lc(p)lc(q)=lc(p)lc(q)\operatorname{lc}(p)\operatorname{lc}(q') = \operatorname{lc}(p')\operatorname{lc}(q); multiplying both sides by lc(q)lc(q)\operatorname{lc}(q)\operatorname{lc}(q') gives lc(p)lc(q)lc(q)2=lc(p)lc(q)lc(q)2\operatorname{lc}(p)\operatorname{lc}(q)\cdot\operatorname{lc}(q')^2 = \operatorname{lc}(p')\operatorname{lc}(q')\cdot \operatorname{lc}(q)^2, and both squares are positive, so lc(p)lc(q)\operatorname{lc}(p)\operatorname{lc}(q) and lc(p)lc(q)\operatorname{lc}(p')\operatorname{lc}(q') have the same sign.

L2L3
2.1

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

step 1.1step 1.2L1L4
2.2

1/tP1/t \in P, since lc(1)lc(t)=1>0\operatorname{lc}(1)\operatorname{lc}(t) = 1 > 0; equivalently, tPt \in P and inverses of positives are positive.

step 1.1L3L4
3.1

For every rational q>0q > 0: q11/t=(qt1)/tq \cdot 1 - 1/t = (qt - 1)/t, whose leading coefficients have product q1=q>0q \cdot 1 = q > 0, so 1/t<q11/t < q \cdot 1. Together with step 2.2, 0<1/t<q10 < 1/t < q\cdot 1 for every positive rational qq.

step 1.1step 2.1step 2.2L3L5
3.2

For every natural nn: tn1t - n \cdot 1 has leading coefficients with product 1>01 > 0, so n1<tn \cdot 1 < t; and t2t=t(t1)t^2 - t = t(t-1) likewise gives t<t2t < t^2.

step 1.1step 2.1L2L3
4.1

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

step 2.1step 3.1step 3.2L1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 34 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources