Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Positive and negative parts: ak=ak+−ak− and ∣ak∣=ak++ak−; a series converges absolutely iff both ∑ak+ and ∑ak− converge, and for a conditionally convergent series both diverge to +∞

Statement

Let (ak) be a sequence of reals (Series, partial sums, convergence and the sum, divergence, and the tail series) and define its positive part and negative part by

ak+  :=  ∣ak∣+ak2,ak−  :=  ∣ak∣−ak2(k∈N),

with ∣x∣ the absolute value (Absolute value in an ordered field). Then:

  1. ak+=max⁡{ak,0} and ak−=max⁡{−ak,0} (Maximum and minimum of a set); in particular ak+≥0 and ak−≥0, and ak=ak+−ak−,∣ak∣=ak++ak−.
  2. ∑ak converges absolutely (Absolutely convergent and conditionally convergent series, and the general starting index) if and only if both ∑ak+ and ∑ak− converge.
  3. If ∑ak converges conditionally, then neither ∑ak+ nor ∑ak− converges, and the partial sums of each diverge to +∞ (Divergence to +∞ and to −∞).

Claim 3 is the engine of the rearrangement theory: a conditionally convergent series carries an unlimited supply of positive terms and an unlimited supply of negative ones, and its convergence is nothing but a cancellation between them.

Facts & Assumptions

Given: A sequence (ak) of reals, its positive and negative parts ak+ and ak− as displayed above, and the partial sums of the associated series (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L1]

Absolute value: ∣x∣≥0, −∣x∣≤x≤∣x∣, and ∣x∣=x when x≥0 while ∣x∣=−x when x<0 (Absolute value in an ordered field, Basic properties of the absolute value).

[L2]

A maximum of a subset of R is its greatest element, and there is at most one (Maximum and minimum of a set).

[L3]

Linearity of series: if ∑xk and ∑yk converge then so does ∑(xk+yk), and ∑c xk converges for every real c (Convergent series add and scale termwise).

[L4]

Direct comparison: if 0≤xk≤yk from some index on and ∑yk converges, then ∑xk converges (If 0≤ak≤bk eventually, convergence of ∑bk gives convergence of ∑ak, and divergence of ∑ak gives divergence of ∑bk).

[L5]

For a series of nonnegative terms, convergence is equivalent to the range of the partial sums being bounded above; and if that range is not bounded above then the partial sums diverge to +∞ (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Divergence to +∞ and to −∞).

[L6]

∑ak converges absolutely means ∑∣ak∣ converges, and converges conditionally means it converges while ∑∣ak∣ does not (Absolutely convergent and conditionally convergent series, and the general starting index, Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1

For every k, ∣ak∣+ak≥0 and ∣ak∣−ak≥0, since −∣ak∣≤ak≤∣ak∣; dividing by the positive real 2 gives ak+≥0 and ak−≥0.

L1algebra
1.2

For every k, ak+−ak−=((∣ak∣+ak)−(∣ak∣−ak))/2=ak and ak++ak−=((∣ak∣+ak)+(∣ak∣−ak))/2=∣ak∣.

algebra
1.3

Assume now that ∑ak converges conditionally, so ∑ak converges and ∑∣ak∣ diverges.

L6
2.1

If ak≥0 then ∣ak∣=ak, so ak+=ak and ak−=0; if ak<0 then ∣ak∣=−ak, so ak+=0 and ak−=−ak. In both situations ak+ is the greater of ak and 0 and ak− is the greater of −ak and 0, which is claim 1 together with step 1.1 and step 1.2.

L1L2step 1.1step 1.2algebra
2.2

From step 1.1 and step 1.2, 0≤ak+≤ak++ak−=∣ak∣ and 0≤ak−≤∣ak∣ for every k.

step 1.1step 1.2algebra
2.3

If both ∑ak+ and ∑ak− converge, then ∑∣ak∣=∑(ak++ak−) converges.

step 1.2L3
3.1

If ∑∣ak∣ converges then, by comparison with ∑∣ak∣ using step 2.2, both ∑ak+ and ∑ak− converge.

step 2.2L4
3.2

If ∑ak+ converged, then ∑ak−=∑(ak++(−1)ak) would converge by linearity, whence ∑∣ak∣ would converge by step 2.3; since ∑∣ak∣ diverges, ∑ak+ diverges.

step 1.3step 1.2step 2.3L3
3.3

If ∑ak− converged, then ∑ak+=∑(ak−+ak) would converge by linearity, whence again ∑∣ak∣ would converge; since ∑∣ak∣ diverges, ∑ak− diverges.

step 1.3step 1.2step 2.3L3
4.1

Claim 2 is the conjunction of step 2.3 and step 3.1, read through the definition of absolute convergence.

step 2.3step 3.1L6
5.1

Both ∑ak+ and ∑ak− are series of nonnegative terms by step 1.1, so each diverges only if the range of its partial sums fails to be bounded above, and then those partial sums diverge to +∞; this is claim 3.

step 1.1step 3.2step 3.3L5∎

Remarks

  • The two parts are determined by the terms, with no choice anywhere. The displayed formulas define a+ and a− outright, and step 2.1 identifies them with the two maxima; nothing in the proof selects one of several candidates.

  • Claim 3 is sharp in both directions. Absolute convergence makes both part series converge, and then ∑k=0∞ak is the difference of their sums. Conditional convergence makes both part series diverge to +∞, and the difference of their partial sums is what converges. There is no third possibility for a convergent series, because claim 2 covers the case where one of them converges: if exactly one converged, ∑ak=∑(ak+−ak−) could not converge, since the sum of a convergent and a divergent series diverges.

  • Why max⁡ is mentioned at all. The formulas with ∣ak∣ are what the algebra uses, while max⁡{ak,0} is what the name "positive part" means and what makes claims about signs immediate. Step 2.1 records that they agree, so either may be used later without further comment.

Depends on

Used by

Dependency tree · two levels

30 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