Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31
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 harmonic sum is log x plus gamma plus O(1/x)

Statement

For every real x≥1,

∑n≤x1n=log⁡x+γ+O(1/x).

Facts & Assumptions

Given: A real x≥1 and an integer N≥1.

Proof

technique · direct
1.1givenalgebra

Since t↦1/t is decreasing on [1,∞) by The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, monotonicity of the integral and additivity over subintervals give ∫nn+1dtt≤1nfor every integer n≥1, and 1n≤∫n−1ndttfor every integer n≥2.

2.1step 1.1givenalgebra

Put EN:=∑n=1N1/n−log⁡(N+1). Summing the first inequality of step 1.1 from n=1 to N gives EN≥0, and the same inequality at n=N+1 gives EN+1−EN=1N+1−∫N+1N+2dtt≥0. Also summing the second inequality of step 1.1 from n=2 to N gives ∑n=1N1n≤1+log⁡N<1+log⁡(N+1), so 0≤EN<1. Thus (EN) is increasing and bounded, hence convergent by A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum.

3.1step 1.1step 2.1givenalgebra

Let L:=lim⁡NEN. Since ∑n=1N1n−log⁡N=EN+log⁡ ⁣(1+1N), and 0≤log⁡(1+1/N)≤1/N by step 1.1, the sequence in The Euler-Mascheroni constant has the same limit L. Therefore L=γ, and 0≤∑n=1N1n−log⁡N−γ≤1N.

4.1step 3.1givenalgebra∎

For the given real x, let N:=⌊x⌋. Then N≤x<N+1, so 0≤log⁡x−log⁡N=log⁡(x/N)≤log⁡(1+1/N)≤1/N. Combining this with step 3.1 yields ∑n≤x1n=∑n=1N1n=log⁡x+γ+O(1/N)=log⁡x+γ+O(1/x), because N≥x/2 for every x≥1.

Depends on

Used by

Dependency tree · two levels

34 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