Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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) be a sequence of reals converging to x∈R (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals). Then (∣xk∣) converges to ∣x∣.

In the single case x=0 the implication reverses: ∣xk∣→0 if and only if xk→0. Whether the implication can be reversed for x≠0 is taken up in the remarks below; it is no part of what the proof establishes.

Facts & Assumptions

[L1]

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

[L2]

Reverse triangle inequality: ∣∣u∣−∣v∣∣≤∣u−v∣ for all reals u,v (The reverse triangle inequality).

[L3]

Absolute value: ∣u∣≥0 (Basic properties of the absolute value), and ∣v∣=v whenever v≥0 by the definition of the absolute value (Order on the reals, Absolute value in an ordered field), so ∣∣u∣∣=∣u∣; and ∣u−0∣=∣u∣ (Basic properties of the absolute value).

[L4]

Order arithmetic in R: u≤v<w gives u<w (Complete ordered field (least-upper-bound property), Ordered field).

Proof

technique · direct
1.1

Let ε>0 be rational. By convergence there is K∈N with ∣xk−x∣<ε for all k≥K.

L1
2.1

For every k≥K the reverse triangle inequality gives ∣∣xk∣−∣x∣∣≤∣xk−x∣<ε.

step 1.1L2L4
3.1

Since the rational ε>0 was arbitrary, (∣xk∣) converges to ∣x∣; and in the case x=0 the two conditions coincide, because ∣∣xk∣−0∣=∣∣xk∣∣=∣xk∣=∣xk−0∣ for every k, so ∣xk∣→0 if and only if xk→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=0; the witness is exhibited here instead. Fix a real c≠0, let (sk) be the alternating sequence of 1 and −1 constructed in FALSE: every bounded sequence converges, which is shown there not to converge, and put wk:=skc. Then ∣wk∣=∣sk∣ ∣c∣=∣c∣ for every k (Basic properties of the absolute value), so (∣wk∣) is the constant sequence ∣c∣ and converges to ∣c∣ (Sequences of reals: bounded, eventually, frequently, tails, subsequences). But (wk) does not converge: if it converged to some ℓ, then (sk)=(c−1wk) would converge to c−1ℓ 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 0 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+∣u−v∣) and min⁡{u,v}=12(u+v−∣u−v∣) (Maximum and minimum of a set), each a two-case check on the sign of u−v, exhibit max⁡{xk,yk} and min⁡{xk,yk} as sums of convergent sequences, so they converge to max⁡{x,y} and min⁡{x,y}.

  • The lemma is the sequential form of the statement that u↦∣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 · two levels

27 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