Questions tagged [constructive-mathematics]

The term "constructive mathematics" refers to the discipline in mathematics in which one proves the existence of mathematical objects only by presenting a construction that provides such an object. Indirect proofs involving proof by contradiction and law of excluded middle are considered nonconstructive. Constructivism is the philosophical stance that the only "true" mathematics is constructive mathematics.

The term "constructive mathematics" refers to the discipline in mathematics in which one proves the existence of mathematical objects only by presenting a construction that provides such an object. Indirect proofs involving proof by contradiction are considered nonconstructive. Construvtivism is the philosophical stance that the only "true" mathematics as constructive mathematics.

In constructivism, an existence proof is not accepted, unless the object in question is constructed. As an example of a nonconstructive proof, consider the following classical proof of the fact that there are irrational numbers $ a $ and $ b $ such that $ a ^ b $ is rational:

Either $ { \sqrt 2 } ^ { \sqrt 2 } $ is rational, in which case we take $ a = b = \sqrt 2 $; or else $ { \sqrt 2 } ^ { \sqrt 2 } $ is irrational, in which case we take $ a = { \sqrt 2 } ^ { \sqrt 2 } $ and $ b = \sqrt 2 $.

The above argument is nonconstructive, because as it stands, it does not enable us to pinpoint which of the two choices of the pair $ ( a , b ) $ has the required property. An alternative proof for the same theorem which is constructive, goes like:

Take $ a = \sqrt 2 $ and $ b = \log _ 2 9 $.

Also, the law of excluded middle is typically not accepted as an axiom. That's because it can result in nonconstructive reasoning, as the above example illustrates. Therefore classical logic is rejected by constructivists, and instead they use intuitionistic logic, which is essentially classical logic without the law of the excluded middle. There are also mathematical axioms like the axiom of choice rejected by constructivists, as they have nonconstructive consequences.

As some of classical methods are not constructively valid, there are classically valid sentences that don't have constructive proofs. As an example there is no constructive proof for the following sentence:

For every real number $ x $, either $ x < 0 $, $ x = 0 $ or $ x > 0 $.

There is a suitable replacement for this which is constrcutively valid. In many applications this alternative is sufficient, although it's slightly weaker than the classical sentence:

For every real number $ x $ and every positive real number $ \epsilon $, either $ x < 0 $, $ | x | < \epsilon $ or $ x > 0 $.

Constructivism has different varieties, among which the most famous are:

  1. , a formal basis for the theory of intuitionism founded by L. E. J. Brouwer
  2. Recursive constructive mathematics, a.k.a russian construve mathematics, founded by A. A. Markov
  3. Bishop's constructive mathematics, founded by E. Bishop
576 questions
2
votes
1 answer

Are there sets $S\subseteq\Bbb N$ which are provably non-empty, but we don't know what is $\min S$?

I was wondering if there is a property that is known to be satisfied for certain "things" but for which we do not know any explicit example. More explicitly (also more restrictive but possibly easier): Is there a set $S \subseteq \mathbb{N}$ for…
2
votes
2 answers

Additive Inverses are unique on the integers

I'm trying to prove that the additive inverses on $\mathbb{Z}$ are unique. We define the elements of the integers as equivalence classes of ordered pairs in order to define subtraction. My idea is to assume that two additive inverses exist for one…
Mo Gainz
  • 155
1
vote
1 answer

Exercise 1.4.4 in A Course in Constructive Algebra.

I am asking about Exercise 1.4.4 in A Course in Constructive Algebra by R. Mines et al.: Let $I$ be the set of [infinite] binary sequences, and for each $i$ in $I$, let $A_i$ be $\{ x \in \{0, 1\} \mid x \geq i_j \ \text{for all} \ j \}$. Show that…
1
vote
1 answer

Constructive proof that AOC implies every subset has a complement

I am studying Bridges' Varieties of Constructive Mathematics. Exercise 7 in the first chapter is confounding to me. I don't know how the hinted proof strategy works. Let $A$ be a subset of a set $B$. A subset $A'$ of $B$ is a (strong) complement of…
Xiaoyu Liu
  • 113
  • 7
1
vote
1 answer

Constructive IVT: Question about initial step

Bishop states the constructive or approximate intermediate value theorem on page 40 of Constructive Analysis. Approx. IVT: Let $f$ be a continuous map on an interval $I$ with $a,b \in I$ and $f(a) < f(b)$. Then for each $y \in [f(a),f(b)]$ and each…
ToucanIan
  • 209
1
vote
1 answer

Order Properties of Constructive Reals (Bishop)

I aim to prove some of the order properties of Bishop's Real Numbers (given on page 22 of Constructive Analysis by Bishop and Bridges.) Bishop defines a real number to be a regular sequence of rational numbers, that is, a sequence $(x_n)$ of…
ToucanIan
  • 209
1
vote
1 answer

Constructive characteristic function of complemented sets

In Bishop and Cheng's paper, "Constructive Measure Theory", page 18, they define the characteristic function of a complemented set $A=(A_1,A_2)$ by the function $\chi : A_1\cup A_2 \to \mathbb{R}$, such as $\chi(x)$ is 1 if $x\in A_1$ and 0 if $x\in…
V. Semeria
  • 1,279
1
vote
0 answers

Constructive equality

From Bishop's constructive analysis book I know for some real numbers $x$ and $y$ at most one of the statements $x=y$, $x \ne y$ is true. Can I also show constructively that exactly one of the statements is true (i.e. a need to show that at least…
user397268
1
vote
2 answers

Question about Lemma (2.3) in Constructive Analysis, Bishop and Bridges

I am in the process of formalizing the constructive notion of a real number and the equivalence on them in the proof assistant Agda, but I am having trouble with the proof of Lemma (2.3) in the following: In Errett Bishops and Douglas S. Bridges…
MrChico
  • 115
1
vote
1 answer

Weak (Brouwerian) Counterexample for existence of right inverse of a surjection

I'm dealing with Exercise 2 of Bishop's Constructive Analysis, Chapter 2 : Construct a mapping $f$ from a set $A$ to a set $B$ such that $f$ is onto $B$, but there does not exist a mapping $g: B \rightarrow A$ with $f (g(b)) = b$ for all $b$ in…
0
votes
0 answers

Proving axiom consistency

I am trying to prove that some preconditions don't introduce an inconsistency to my (constructive) system. I would like to know if this is possible with the set-up below, and how to do this, and what additionally i need to include/specify to make…
Polina
  • 1
0
votes
0 answers

Compactness theorem for first order language, constructive proof

Definition (satisfiability): a set $\Gamma$ of formulas of a first order language is satisfiable if there exist a structure $S$, a Boolean algebra $B$ and an evaluation function $V$ such that $V(C)=1_B$ for every formula $C \in \Gamma$. Theorem…
effezeta
  • 445
0
votes
2 answers

Constructive proof that only zero is less than one

Based on intuitionistic number theory as defined in https://plato.stanford.edu/entries/logic-intuitionistic/#IntNumTheHeyAri, I'm trying to prove that if $x < 1 \Rightarrow x = 0$ (with $1 = S(0)$ being the successor of $0$). By the definition of…
ternary
  • 371
0
votes
1 answer

The price of constructivity

It is said that proofs in constructive math, if possible at all, tend to be more verbose than in classical math. I'm trying to get an intuition for this, so: Are there any good example of theorems mathematicians use, for which the proof in…
ternary
  • 371
0
votes
2 answers

Maximum of real numbers

A real number is a subset $x$ of $\mathbb{Q} \times \mathbb{Q}$ such that for all $(q,q')$ in $x$ we have $ q \le q'$, and a) for all $(q,q')$ and $(r,r')$ in $x$, the closed intervals $[q,q']$ and $[r,r']$ in $\mathbb{Q}$ intersect in points…
user397268