Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Continuity does not imply finite quadratic variation

Statement refuted

The assertion "every continuous function x:[0,1]R has finite quadratic variation along every refining sequence of partitions with mesh tending to zero" is false. There is a continuous function x on [0,1] and a refining sequence of partitions (πn) of [0,1] with mesh(πn)0 for which the quadratic sums i(xti+1xti)2 diverge to +.

Counterexample

Given: no special hypotheses; the construction is explicit and uses no choice principle.

1.1

For m1 put Im:=[2(m+1),2m], nm:=2m4, δm:=2(m+2)/m4=2(m+1)/nm, and let sm,j:=2(m+1)+jδm for 0jnm; define x(sm,j):=1/m for odd j and x(sm,j):=0 for even j, interpolate x linearly between consecutive vertices of each block, and set x:=0 on {0}[1/2,1].

given
2.1

The function x is well defined and continuous: on each block it is piecewise linear hence continuous, the last vertex of Im has even index and value 0, matching the value 0 at the shared endpoints of consecutive blocks and on [1/2,1], and for t(0,2m] one has x(t)1/m, so x(t)0=x(0) as t0.

step 1.1
2.2

For n1 let πn be the partition of [0,1] whose point set is the dyadic grid {k2n:0k2n} together with every vertex sm,j with 1mn; each πn is a finite partition in the sense of Partition of [a,b] as a finite strictly increasing list a=t0<t1<<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, the sequence is refining, and mesh(πn)2n.

step 1.1
3.1

No dyadic point of level n lies in the interior of In: such a point would be k2n with 1/2<k<1, and no integer satisfies this; hence the points of πn inside In are exactly the vertices sn,0<<sn,nn, and consecutive points of πn inside that block are consecutive vertices.

step 2.2
4.1

The quadratic sum along πn therefore contains the nn vertex increments of the block In, each of absolute value 1/n, so it is at least nn(1/n)2=2n4/n2=2n2; since 2n2, the quadratic sums along the refining sequence (πn) diverge to + for this continuous function.

step 3.1
5.1

Consequently continuity alone does not force finite quadratic variation along a prescribed refining sequence with vanishing mesh: the witness is the explicit sawtooth function above, whose block In alone contributes 2n2 to the n-th quadratic sum; the example also shows that the mesh condition of Quadratic variation along a partition sequence is not sufficient by itself, and the construction uses no choice principle.

step 2.1step 4.1

Source notes

Lawler, Section 2.8, warns that quadratic sums of a continuous path depend on the partitions chosen unless a specific regular sequence is prescribed. The sawtooth above is the classical witness: it is continuous and of unbounded variation on every neighbourhood of the origin, and the partitions are adapted to its vertices so that each block contributes a fixed amount.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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