Apartness relation

In constructive mathematics, an apartness relation is a constructive form of inequality, and is often taken to be more basic than equality.

An apartness relation is often written as ${\displaystyle \#}$ (⧣ in unicode) to distinguish from the negation of equality (the denial inequality), which is weaker. In the literature, the symbol ${\displaystyle \neq }$ is found to be used for either of these.

Definition

A binary relation ${\displaystyle \#}$ is an apartness relation if it satisfies:^[1]

1. ${\displaystyle \neg (x\#x)}$
2. ${\displaystyle x\#y\;\to \;y\#x}$
3. ${\displaystyle x\#y\;\to \;(x\#z\;\vee \;y\#z)}$

So an apartness relation is a symmetric irreflexive binary relation with the additional condition that if two elements are apart, then any other element is apart from at least one of them. This last property is often called co-transitivity or comparison.

The complement of an apartness relation is an equivalence relation, as the above three conditions become reflexivity, symmetry, and transitivity. If this equivalence relation is in fact equality, then the apartness relation is called tight. That is, ${\displaystyle \#}$ is a tight apartness relation if it additionally satisfies:

4. ${\displaystyle \neg (x\#y)\;\to \;x=y.}$

In classical mathematics, it also follows that every apartness relation is the complement of an equivalence relation, and the only tight apartness relation on a given set is the complement of equality. So in that domain, the concept is not useful. In constructive mathematics, however, this is not the case.

Examples

The prototypical apartness relation is that of the real numbers: two real numbers are said to be apart if there exists (one can construct) a rational number between them. In other words, real numbers ${\displaystyle x}$ and ${\displaystyle y}$ are apart if there exists a rational number ${\displaystyle z}$ such that ${\displaystyle x<z<y}$ or ${\displaystyle y<z<x.}$ The natural apartness relation of the real numbers is then the disjunction of its natural pseudo-order. The complex numbers, real vector spaces, and indeed any metric space then naturally inherit the apartness relation of the real numbers, even though they do not come equipped with any natural ordering.

If there is no rational number between two real numbers, then the two real numbers are equal. Classically, then, if two real numbers are not equal, one would conclude that there exists a rational number between them. However it does not follow that one can actually construct such a number. Thus to say two real numbers are apart is a stronger statement, constructively, than to say that they are not equal, and while equality of real numbers is definable in terms of their apartness, the apartness of real numbers cannot be defined in terms of their equality. For this reason, in constructive topology especially, the apartness relation over a set is often taken as primitive, and equality is a defined relation.

Related definitions

A set endowed with an apartness relation is known as a constructive setoid. A function ${\displaystyle f:A\to B}$ between such setoids ${\displaystyle A}$ and ${\displaystyle B}$ may be called a morphism for ${\displaystyle \#_{A}}$ and ${\displaystyle \#_{B}}$ if the strong extensionality property holds

${\displaystyle \forall (x,\,y\colon A).\,f(x)\;\#_{B}\;f(y)\to x\;\#_{A}\;y.}$

This ought to be compared with the extensionality property of functions, i.e. that functions preserve equality. Indeed, for the denial inequality defined in common set theory, the former represents the contrapositive of the latter.

See also

• Equivalence class – Mathematical concept

References

• v
• t
• e

Mathematical logic

General

• Axiom
  • list
• Cardinality
• First-order logic
• Formal proof
• Formal semantics
• Foundations of mathematics
• Information theory
• Lemma
• Logical consequence
• Model
• Theorem
• Theory
• Type theory

Theorems (list)
 and paradoxes

• Gödel's completeness and incompleteness theorems
• Tarski's undefinability
• Banach–Tarski paradox
• Cantor's theorem, paradox and diagonal argument
• Compactness
• Halting problem
• Lindström's
• Löwenheim–Skolem
• Russell's paradox

Logics

Traditional	Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram
Propositional	Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞
Predicate	First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus

Set theory

Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities
Types of sets	Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Maps and cardinality	Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary
Set theories	Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive

Formal systems (list),
language and syntax

Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list

Example axiomatic systems (list)

of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica

Proof theory

• Formal proof
• Natural deduction
• Logical consequence
• Rule of inference
• Sequent calculus
• Theorem
• Systems
  • axiomatic
  • deductive
  • Hilbert
    • list
• Complete theory
• Independence (from ZFC)
• Proof of impossibility
• Ordinal analysis
• Reverse mathematics
• Self-verifying theories

Model theory

• Interpretation
  • function
  • of models
• Model
  • equivalence
  • finite
  • saturated
  • spectrum
  • submodel
• Non-standard model
  • of arithmetic
• Diagram
  • elementary
• Categorical theory
• Model complete theory
• Satisfiability
• Semantics of logic
• Strength
• Theories of truth
  • semantic
  • Tarski's
  • Kripke's
• T-schema
• Transfer principle
• Truth predicate
• Truth value
• Type
• Ultraproduct
• Validity

Computability theory

• Church encoding
• Church–Turing thesis
• Computably enumerable
• Computable function
• Computable set
• Decision problem
  • decidable
  • undecidable
  • P
  • NP
  • P versus NP problem
• Kolmogorov complexity
• Lambda calculus
• Primitive recursive function
• Recursion
• Recursive set
• Turing machine
• Type theory

Related

• Abstract logic
• Algebraic logic
• Automated theorem proving
• Category theory
• Concrete/Abstract category
• Category of sets
• History of logic
• History of mathematical logic
  • timeline
• Logicism
• Mathematical object
• Philosophy of mathematics
• Supertask

 Mathematics portal