Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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 absolute value is compatible with limits

Statement

Let (xk)(x_k) be a sequence of reals converging to xRx \in \mathbb{R} (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals). Then (xk)(|x_k|) converges to x|x|.

In the single case x=0x = 0 the implication reverses: xk0|x_k| \to 0 if and only if xk0x_k \to 0. Whether the implication can be reversed for x0x \ne 0 is taken up in the remarks below; it is no part of what the proof establishes.

Facts & Assumptions

Given: A sequence (xk)(x_k) of reals converging to a real xx (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals).

[L1]

Convergence, quantified over rational ε>0\varepsilon > 0 (Limits and Cauchy sequences of reals).

[L2]

Reverse triangle inequality: uvuv\bigl||u| - |v|\bigr| \le |u - v| for all reals u,vu, v (The reverse triangle inequality).

[L3]

Absolute value: u0|u| \ge 0 (Basic properties of the absolute value), and v=v|v| = v whenever v0v \ge 0 by the definition of the absolute value (Order on the reals, Absolute value in an ordered field), so u=u\bigl||u|\bigr| = |u|; and u0=u|u - 0| = |u| (Basic properties of the absolute value).

[L4]

Order arithmetic in R\mathbb{R}: uv<wu \le v < w gives u<wu < w (Complete ordered field (least-upper-bound property), Ordered field).

Proof

technique · direct
1.1

Let ε>0\varepsilon > 0 be rational. By convergence there is KNK \in \mathbb{N} with xkx<ε|x_k - x| < \varepsilon for all kKk \ge K.

L1
2.1

For every kKk \ge K the reverse triangle inequality gives xkxxkx<ε\bigl||x_k| - |x|\bigr| \le |x_k - x| < \varepsilon.

step 1.1L2L4
3.1

Since the rational ε>0\varepsilon > 0 was arbitrary, (xk)(|x_k|) converges to x|x|; and in the case x=0x = 0 the two conditions coincide, because xk0=xk=xk=xk0\bigl||x_k| - 0\bigr| = \bigl||x_k|\bigr| = |x_k| = |x_k - 0| for every kk, so xk0|x_k| \to 0 if and only if xk0x_k \to 0.

step 2.1L1L3

Remarks

  • The converse fails at every nonzero limit. This is not established by the proof above, which proves only the forward implication and the equivalence at x=0x = 0; the witness is exhibited here instead. Fix a real c0c \ne 0, let (sk)(s_k) be the alternating sequence of 11 and 1-1 constructed in FALSE: every bounded sequence converges, which is shown there not to converge, and put wk:=skcw_k := s_k c. Then wk=skc=c|w_k| = |s_k|\,|c| = |c| for every kk (Basic properties of the absolute value), so (wk)(|w_k|) is the constant sequence c|c| and converges to c|c| (Sequences of reals: bounded, eventually, frequently, tails, subsequences). But (wk)(w_k) does not converge: if it converged to some \ell, then (sk)=(c1wk)(s_k) = (c^{-1}w_k) would converge to c1c^{-1}\ell by the scalar-multiple rule (Algebra of limits: sums, scalar multiples, products and quotients), which it does not. Passing to absolute values destroys sign information, and only at 00 is there no sign information to destroy.

  • Combined with Algebra of limits: sums, scalar multiples, products and quotients this gives the usual companions: the identities max{u,v}=12(u+v+uv)\max\{u, v\} = \tfrac{1}{2}\bigl(u + v + |u - v|\bigr) and min{u,v}=12(u+vuv)\min\{u, v\} = \tfrac{1}{2}\bigl(u + v - |u - v|\bigr) (Maximum and minimum of a set), each a two-case check on the sign of uvu - v, exhibit max{xk,yk}\max\{x_k, y_k\} and min{xk,yk}\min\{x_k, y_k\} as sums of convergent sequences, so they converge to max{x,y}\max\{x, y\} and min{x,y}\min\{x, y\}.

  • The lemma is the sequential form of the statement that uuu \mapsto |u| is continuous, but continuity is not available yet and is not needed: the reverse triangle inequality does the work directly.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 55 results over 19 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