Bourbaki

Proposition 14

Tag 05NY, permanent. Cite it as [Bourbaki, Tag 05NY].

Algebra, chapter II, § 2. Modules of linear mappings. Duality

If x0x_0 is a solution of the linear equation u(x)=y0u(x) = y_0, the set of solutions of this equation is equal to the set of elements x0+zx_0 + z, where zz runs through the set of solutions of the associated homogeneous equation u(x)=0u(x) = 0.

The relation u(x)=y0u(x) = y_0 may be written as u(x)=u(x0)u(x) = u(x_0), which is equivalent to u(x−x0)=0u(x - x_0) = 0.

In other words, if the equation u(x)=y0u(x) = y_0 has at least one solution x0x_0, the set of its solutions is the set x0+u‾(0)x_0 + \overline{u}(0), obtained by translation from the kernel u‾(0)\overline{u}(0) of uu. Observe that u‾(0)\overline{u}(0), being a submodule, is never empty, since it contains 0 (called the zero solution, or trivial solution, of the homogeneous equation u(x)=0u(x) = 0).

By virtue of Proposition 14, for a linear equation u(x)=y0u(x) = y_0 to have exactly one solution, it is necessary and sufficient that it have at least one solution and that u‾(0)={0}\overline{u}(0) = \{0\} (in other words, that the associated homogeneous equation have no non-zero solution, or also that uu be injective); in this case, for all y∈Fy \in F, the equation u(x)=yu(x) = y has at most one solution.

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

Cited by

Cites

Nothing.

Transcribed from the printed edition, 1998, Springer. Not translated.