Bourbaki

Proposition 1

Tag 0871, permanent. Cite it as [Bourbaki, Tag 0871].

Functions of a Real Variable, chapter II, § 1. PRIMITIVES AND INTEGRALS

Let ff be a vector function defined on II with values in EE; if ff admits a primitive gg on II then the set of primitives of ff on II is identical to the set of functions g+ag + a, where aa is a constant function with its values in EE.

Indeed, it is clear that g+ag + a is a primitive of ff for any a∈Ea \in E; on the other hand, if g1g_1 is a primitive of ff then g1−gg_1 - g admits a derivative equal to 0 except at the points of a countable subset of II, and thus is constant (I, p. 17, corollary).

One says that the primitives of a function ff (when they exist) are defined “up to an additive constant”. To define a primitive of ff unambiguously it is enough to assign it (arbitrarily) a value at a point x0∈Ix_0 \in I; in particular, there exists one and only one primitive gg of ff such that g(x0)=0g(x_0) = 0; for every primitive hh of ff one has g(x)=h(x)−h(x0)g(x) = h(x) - h(x_0).

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Transcribed from the printed volume. Not translated.