Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck 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.

R((t−1)), the formal Laurent series field, is Cauchy complete, non-Archimedean, and lacks the least-upper-bound property

Example

Let K=R((t−1)) be the field of formal Laurent series in t−1 over R (The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient), ordered by the sign of the leading coefficient (R((t−1)) is an ordered field, ordered by the sign of the leading coefficient). This example assembles, in one place and against the five properties of The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness, what the field does and does not satisfy:

K is therefore the witness for FALSE: an ordered field in which every Cauchy sequence converges has the least-upper-bound property, and a worked illustration of how far apart the two things called "completeness" can be. A concrete convergent Cauchy sequence is exhibited at the end.

Facts & Assumptions

Given: K=R((t−1)), whose elements are the functions Z→R with support bounded below, with t−a the function taking the value 1 at a and 0 elsewhere.

[L2]

n⋅1K<t for every natural n, so K is not Archimedean; 0K<t−(k+1)<t−k; for every ε>0 in K there is k∈N with t−k<ε; and if h(j)=0 for every j≤k then ∣h∣<t−k (R((t−1)) is non-Archimedean, and the monomials t−k are cofinal below its positive elements, Archimedean ordered field).

[L4]

The set A={ n⋅1K:n∈N } is nonempty, bounded above by t, and has no least upper bound in K, so (LUB) fails (R((t−1)) does not have the least-upper-bound property; its canonical naturals have no supremum).

[L5]

Every nested sequence of closed intervals of K whose lengths tend to 0 in K has exactly one common point, so (NIP) holds (R((t−1)) has the nested interval property for lengths tending to 0).

Verification

technique · direct
1.1

K is an ordered field.

L1
1.2

K is not Archimedean: t exceeds every canonical natural.

L2
1.3

K has (CC).

L3
1.4

K does not have (LUB): the canonical naturals are nonempty and bounded above and have no supremum in K.

L4
2.1

So K is a Cauchy complete, non-Archimedean ordered field without the least-upper-bound property, which is what this example asserts, and it is the witness used in FALSE: an ordered field in which every Cauchy sequence converges has the least-upper-bound property and in FALSE: the nested interval property alone implies the least-upper-bound property.

step 1.1step 1.2step 1.3step 1.4step 1.5
2.2

K has neither (BW) nor (MCT), since either would force K to be Archimedean, which step 1.2 denies.

step 1.2L6
2.3

A concrete convergent Cauchy sequence: let f(n):=∑k=0nt−k, the function taking the value 1 at each index 0≤j≤n and 0 elsewhere. For n>m the difference f(n)−f(m) vanishes at every index j≤m, so ∣f(n)−f(m)∣<t−m; since the monomials t−m get below every positive element of K, the sequence is Cauchy in K. Its limit is the element L with L(j)=1 for j≥0 and L(j)=0 for j<0, which lies in K because its support is bounded below, and f(n)−L vanishes at every index j≤n, so ∣f(n)−L∣<t−n and f(n)→L in K.

step 1.1step 1.3L1L2
3.1

The table of the Example is therefore established in every row, and K separates Cauchy completeness from the least-upper-bound property.

step 2.1step 2.2step 2.3∎

Remarks

  • The one-line reason. Comparison in K looks only at the first coefficient at which two elements differ, so t is bigger than every real constant and t−1 is smaller than every positive real constant. The naturals are therefore bounded, which kills (LUB), (BW) and (MCT) at a stroke. Meanwhile a Cauchy sequence in K must have each of its coefficients eventually constant, and reading off those eventual values builds the limit; nothing about the naturals being cofinal is needed for that.

  • Why the limit above is not a sum. The notation ∑k≥0t−k for L is a name for a function, not an infinite sum (The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient). What step 2.3 proves is a genuine limit in the order of K, and it happens to agree with that notation; no notion of convergence is presupposed by the notation itself.

  • What this example does not give. It says nothing about R(t), the other non-Archimedean field in this library (The rational function field R(t) ordered by the eventual sign is an ordered field, worked out), which is neither Cauchy complete nor nested-interval complete and cannot replace K in any of these roles.

  • Uniqueness of the complete ordered field is untouched. K is not a complete ordered field, so it is no counterexample to that uniqueness; it is a counterexample only to the habit of calling (CC) completeness.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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