Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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 unrestricted nested interval property fails in R((t−1))

Statement refuted

Refuted claim: the unrestricted nested interval property holds in K=R((t−1)), that is, every nested sequence I0⊇I1⊇⋯ of closed intervals In=[an,bn]K of K (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field) has ⋂nIn≠∅.

The witness is

an:=ι(n) t−1,bn:=ι ⁣(1n+1)(n∈N),

where ι(c) is the constant series with value c at index 0 and ι(n) abbreviates ι(n⋅1R) (The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient). The intervals [an,bn]K are nested and their intersection is empty: a common point would have to be an infinitesimal of valuation ≥1, because it lies below every positive real constant, and simultaneously not such an element, because it lies above every multiple ι(n)t−1 of t−1.

This refutes only the unrestricted form. The shrinking form, with the additional hypothesis that the lengths tend to 0 in K, is true (R((t−1)) has the nested interval property for lengths tending to 0), and the lengths here do not tend to 0.

Facts & Assumptions

Given: K=R((t−1)) with its valuation v, leading coefficient lc⁡, monomials t−a and constants ι(c); and the elements an=ι(n)t−1, bn=ι(1/(n+1)) for n∈N.

[L1]

For nonzero h∈K: h(k)=0 for k<v(h) and h(v(h))=lc⁡(h)≠0; t−a is nonzero with v(t−a)=a and lc⁡(t−a)=1; and ι(c) for c≠0 is nonzero with v(ι(c))=0 and lc⁡(ι(c))=c (The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient, R((t−1)) is an ordered field, ordered by the sign of the leading coefficient).

[L2]

K is an ordered field in which f<g holds exactly when g−f≠0K and lc⁡(g−f)>0; exactly one of f<g, f=g, g<f holds; ι is a ring homomorphism, so ι(c)+ι(d)=ι(c+d) and ι(c)ι(d)=ι(cd) (R((t−1)) is an ordered field, ordered by the sign of the leading coefficient, Ordered field).

[L3]

For nonzero f,g∈K: fg≠0K with v(fg)=v(f)+v(g) and lc⁡(fg)=lc⁡(f)lc⁡(g); −f≠0K with v(−f)=v(f) and lc⁡(−f)=−lc⁡(f); if v(f)<v(g) then f+g≠0K with lc⁡(f+g)=lc⁡(f); and if v(f)=v(g) with lc⁡(f)+lc⁡(g)≠0 then f+g≠0K with v(f+g)=v(f) and lc⁡(f+g)=lc⁡(f)+lc⁡(g) (Valuation and leading coefficient in R((t−1)): v(fg)=v(f)+v(g), and the behaviour of v under sums, R((t−1)) is a commutative ring: the product is a finite sum and both operations preserve support bounded below).

[L4]

0K<t−(k+1)<t−k for every k∈Z; and if ∣h∣<t−k then h(j)=0 for every j<k (R((t−1)) is non-Archimedean, and the monomials t−k are cofinal below its positive elements).

[L5]

[a,b]K={x∈K:a≤x≤b} for a≤b; a sequence of closed intervals is nested when In+1⊆In for every n; and its lengths tend to 0 in K when for every ε>0 in K they are eventually <ε (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field).

[L6]

R is a complete ordered field, hence Archimedean: for every real c there is a natural n with c<n⋅1R, and for every real c>0 there is a natural n≥1 with 1/n<c (The reals form a totally ordered field, The Cauchy-sequence reals have the least-upper-bound property, Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Counterexample

technique · direct
1.1

For n≥1 the element an=ι(n)t−1 is nonzero with v(an)=0+1=1 and lc⁡(an)=n⋅1=n>0, while a0=ι(0)t−1=0K; and for every n the element bn=ι(1/(n+1)) is nonzero with v(bn)=0 and lc⁡(bn)=1/(n+1)>0. Also a1=ι(1)t−1=t−1.

givenL1L2L3
2.1

an≤bn for every n: for n=0 this is 0K<ι(1)=1K, which holds since lc⁡(1K)=1>0; and for n≥1 we have v(bn)=0<1=v(−an) by [step 1.1] and [L3], so bn−an is nonzero with leading coefficient 1/(n+1)>0, that is an<bn. So each [an,bn]K is a closed interval.

step 1.1L1L2L3L5
2.2

The sequence is nested: an+1−an=(ι(n+1)−ι(n))t−1=ι(1)t−1=t−1>0K by [L2] and [L4], so an<an+1; and bn−bn+1=ι(1n+1−1n+2)=ι(1(n+1)(n+2)), which is nonzero with positive leading coefficient, so bn+1<bn. Hence an≤an+1 and bn+1≤bn, and every x with an+1≤x≤bn+1 satisfies an≤x≤bn, that is In+1⊆In.

step 1.1L1L2L3L4L5
3.1

Suppose x∈⋂nIn. Then a1≤x, and a1=t−1>0K by [step 1.1] and [L4], so x>0K; hence x≠0K and lc⁡(x)>0 by [L2]. Write q:=v(x) and c:=lc⁡(x)>0.

step 1.1step 2.1L1L2L4L5
4.1

q≥1. If q<0 then v(x)<0=v(−b0) by [step 1.1] and [L3], so x−b0 is nonzero with leading coefficient c>0 and x>b0, contradicting x≤b0. If q=0, use [L6] to fix a natural n≥1 with 1/n<c and set n′:=n−1, so that 1/(n′+1)<c; then x and −bn′ both have valuation 0 with leading coefficients summing to c−1/(n′+1)≠0, so by [L3] x−bn′ is nonzero with leading coefficient c−1/(n′+1)>0, giving x>bn′ and contradicting x≤bn′. By trichotomy on Z the remaining case is q≥1.

step 3.1L1L2L3L5L6
4.2

q<1. If q>1 then v(−a1)=1<q by [step 1.1] and [L3], so x−a1 is nonzero with leading coefficient lc⁡(−a1)=−1<0, giving x<a1 and contradicting a1≤x. If q=1, use [L6] to fix a natural n with c<n⋅1R, so n≥1; then x and −an both have valuation 1 with leading coefficients summing to c−n≠0, so by [L3] x−an is nonzero with leading coefficient c−n<0, giving x<an and contradicting an≤x. Hence q≠1 and q≯1.

step 3.1L1L2L3L5L6
5.1

Steps 4.1 and 4.2 are incompatible, so no x lies in every In: the nested sequence (In) of [step 2.1] and [step 2.2] has ⋂nIn=∅, which refutes the unrestricted nested interval property for K.

step 2.1step 2.2step 4.1step 4.2L5
6.1

Consistency with R((t−1)) has the nested interval property for lengths tending to 0: the lengths here do not tend to 0 in K. Indeed (bn−an)(0)=1/(n+1)≠0 by [step 1.1], so by [L4] the inequality ∣bn−an∣<t−1 fails for every n; taking ε=t−1 shows the shrinking hypothesis of [L5] is not satisfied.

step 1.1step 2.1L4L5∎

Remarks

  • What the counterexample really exhibits. It is a gap in K. Each of the two requirements is satisfiable on its own — ι(1) lies above every ι(n)t−1, and 0K lies below every ι(1/(n+1)) — yet steps 4.1 and 4.2 show that nothing in K satisfies both at once. Both sides of the gap are approached along countable sequences, which is why intervals indexed by N can straddle it, and the lengths cannot shrink across it: they stay of valuation 0 while the left endpoints stay of valuation 1.

  • Why this does not contradict Cauchy completeness. (an) is not Cauchy in K: consecutive terms differ by exactly t−1, so the Cauchy condition fails at ε=t−1. Cauchy completeness (Every Cauchy sequence in R((t−1)) converges: K is sequentially Cauchy complete) constrains sequences whose terms crowd together in the order of K, and neither endpoint sequence here does.

  • Consequence for the equivalence of completeness properties. Since K is Cauchy complete but has neither the least-upper-bound property (R((t−1)) does not have the least-upper-bound property; its canonical naturals have no supremum) nor the unrestricted nested interval property, any statement of the form "nested intervals imply least upper bounds" has to say which nested interval property it means. The form that K does satisfy is the shrinking one, and that is the form for which K is a counterexample to the implication.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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