Formal calculation

From Wikipedia, the free encyclopedia

In mathematical logic, a formal calculation is sometimes defined as a calculation which is systematic, but without a rigorous justification. This means that we are manipulating the symbols in an expression using a generic substitution, without proving that the necessary conditions hold. Essentially, we are interested in the form of an expression, and not necessarily its underlying meaning. This reasoning can either serve as positive evidence that some statement is true, when it is difficult or unnecessary to provide a proof, or as an inspiration for the creation of new (completely rigorous) definitions.

However, this interpretation of the term formal is not universally accepted, and some consider it to mean quite the opposite: A completely rigorous argument, as in formal mathematical logic.

1 Examples
2 See also
3 References

[edit] Examples

[edit] A simple example

A somewhat exaggerated example would be to use the equation

$\sum_{n=0}^{\infty} q^n = \frac{1}{1-q}$

(which holds under certain conditions) to conclude that

$\sum_{n=0}^{\infty} 2^n = -1.$

This is incorrect according to the usual definition of infinite sums of real numbers, since the related sequence does not converge. However, this result can inspire extending the definition of infinite sums, and the creation of new fields, such as the 2-adic numbers, where the series in question converges and this statement is perfectly valid.

[edit] Formal power series

Formal power series is a concept that adopts some properties of convergent power series used in real analysis, and applies them to objects that are similar to power series in form, but have nothing to do with the notion of convergence.

[edit] Symbol manipulation

Suppose we want to solve the differential equation

$\frac{dy}{dx} = y^2$

Treating these symbols as ordinary algebraic ones, and without giving any justification regarding the validity of this step, we take reciprocals of both sides:

$\frac{dx}{dy} = \frac{1}{y^2}$