Mathematical definitions are not merely descriptions; they are logical agreements that determine exactly when a term may be used. Biconditional definitions with quantifiers express this exactness by using “if and only if” over a prescribed universe. Thus, a definition normally contains both directions: the defined term implies the defining property, and the defining property implies the defined term. In this lesson, biconditional definitions with quantifiers are studied through sequence limits, rectangles, even integers, and prime integers. :::definition[Quantified Mathematical Definition] A mathematical definition often has the form of a universally quantified biconditional statement. Let $p(x)$ and $q(x)$ be open statements with a prescribed universe. A definition of $p(x)$ in terms of $q(x)$ is usually written as $$\begin{equation*} \forall x[p(x)\leftrightarrow q(x)]. \end{equation*}$$ This means that for every object $x$ in the universe, $p(x)$ is true if and only if $q(x)$ is true. ::: The biconditional $$\begin{equation*} \forall x[p(x)\leftrightarrow q(x)] \end{equation*}$$ contains two implications: $$\begin{equation*} \forall x[p(x)\to q(x)] \end{equation*}$$ and $$\begin{equation*} \forall x[q(x)\to p(x)]. \end{equation*}$$ The first direction says that every object satisfying the defined term satisfies the defining condition. The second direction says that every object satisfying the defining condition deserves the defined term. Both directions are needed for an exact definition. A quantified biconditional definition must pass two tests over the same universe. We observe whether every object with the defined term also has the defining property, and whether every object with the defining property also has the defined term. Use the checkboxes to decide which objects satisfy each predicate. The tester reports the two implication directions separately, so a missing direction becomes visible before the biconditional fails. This matters because a definition is exact only when the two sets of objects match. :::scientific-preview[Biconditional Definition Tester] ::: :::definition[Limit of a Sequence] Let $(r_n)$ be a sequence of real numbers and let $L\in\mathbb{R}$. Then $$\begin{equation*} \lim_{n\to\infty}r_n=L \end{equation*}$$ means $$\begin{equation*} \forall \epsilon>0\ \exists k>0\ \forall n[(n>k)\to |r_n-L|<\epsilon]. \end{equation*}$$ This definition says that every positive tolerance $\epsilon$ is eventually achieved by the sequence. ::: :::definition[Negation of a Sequential Limit] The statement $$\begin{equation*} \lim_{n\to\infty}r_n\neq L \end{equation*}$$ is the negation of $$\begin{equation*} \forall \epsilon>0\ \exists k>0\ \forall n[(n>k)\to |r_n-L|<\epsilon]. \end{equation*}$$ Therefore, $$\begin{equation*} \lim_{n\to\infty}r_n\neq L \end{equation*}$$ is equivalent to $$\begin{equation*} \exists \epsilon>0\ \forall k>0\ \exists n[(n>k)\land |r_n-L|\geq \epsilon]. \end{equation*}$$ ::: The negation of a limit statement says that one positive tolerance keeps failing no matter how far out we look. We observe a proposed limit by comparing sequence terms with the band from $L-\epsilon$ to $L+\epsilon$. Choose a sequence, a proposed limit, an epsilon value, and a cutoff $k$. The graph marks the terms after $k$ so you can check whether all later terms stay inside the tolerance band or whether some later term still misses it. This matters because the symbolic negation changes every quantifier and turns the implication into a concrete failure condition. :::scientific-preview[Sequential Limit Negation Explorer] @libraries: plotly ::: :::solved-problem Express $\lim_{n\to\infty}r_n\neq L$ in symbolic form. ::: :::solution Given that $$\begin{equation*} \lim_{n\to\infty}r_n=L \end{equation*}$$ means $$\begin{equation*} \forall \epsilon>0\ \exists k>0\ \forall n[(n>k)\to |r_n-L|<\epsilon]. \end{equation*}$$ To express $\lim_{n\to\infty}r_n\neq L$, negate the whole statement. Using the negation rules for quantifiers, we get $$\begin{equation*} \exists \epsilon>0\ \forall k>0\ \exists n\neg[(n>k)\to |r_n-L|<\epsilon]. \end{equation*}$$ Since $\neg(A\to B)\equiv A\land\neg B$, we have $$\begin{equation*} \neg[(n>k)\to |r_n-L|<\epsilon]\equiv (n>k)\land |r_n-L|\geq\epsilon. \end{equation*}$$ Therefore, $$\begin{equation*} \lim_{n\to\infty}r_n\neq L \end{equation*}$$ means $$\begin{equation*} \exists \epsilon>0\ \forall k>0\ \exists n[(n>k)\land |r_n-L|\geq\epsilon]. \end{equation*}$$ Hence the symbolic form is obtained. ::: :::example[Rectangle as a Biconditional Definition] Let the universe be all quadrilaterals in the plane. Define $p(x):x$ is a rectangle and $q(x):x$ has four equal angles. The statement $\forall x[p(x)\to q(x)]$ means every rectangle has four equal angles. The statement $\forall x[q(x)\to p(x)]$ means every quadrilateral with four equal angles is a rectangle. Therefore the definition of rectangle is $$\begin{equation*} \forall x[p(x)\leftrightarrow q(x)]. \end{equation*}$$ Thus a quadrilateral is a rectangle if and only if it has four equal angles. ::: :::definition[Even Integer by Divisibility] Let $n$ be an integer. Then $n$ is called an even integer if and only if $n$ is divisible by $2$. In symbolic form, define $p(n):n$ is an even integer and $q(n):n$ is divisible by $2$. Then the definition is $$\begin{equation*} \forall n[q(n)\leftrightarrow p(n)]. \end{equation*}$$ ::: :::definition[Divisibility by Two] The statement that $n$ is divisible by $2$ means that there exists an integer $k$ such that $$\begin{equation*} n=2k. \end{equation*}$$ Thus $$\begin{equation*} q(n)\equiv \exists k[n=2k]. \end{equation*}$$ Hence $$\begin{equation*} n\ \text{is even}\leftrightarrow \exists k\in\mathbb{Z}[n=2k]. \end{equation*}$$ ::: :::definition[Prime Integer] Let $n$ be a positive integer greater than $1$. Then $n$ is called a prime integer if the only positive integers that divide $n$ exactly are $1$ and $n$. Equivalently, $n$ is prime if and only if for every positive integer $d$, $$\begin{equation*} d\mid n\to(d=1\lor d=n). \end{equation*}$$ ::: :::definition[Prime Integer Formula] Let $n$ be a positive integer greater than $1$. Then $$\begin{equation*} n\ \text{is prime}\leftrightarrow\forall d\in\mathbb{Z}^{+}[d\mid n\to(d=1\lor d=n)]. \end{equation*}$$ The hypothesis that $n>1$ is part of the usual definition of primality. ::: :::solved-problem Find the primes in the finite list $$\begin{equation*} 2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17. \end{equation*}$$ ::: :::solution Given that a prime integer greater than $1$ has only $1$ and itself as positive divisors. Checking each integer in the list, the primes are $$\begin{equation*} 2,3,5,7,11,13,17. \end{equation*}$$ Therefore, $$\begin{equation*} P=\{2,3,5,7,11,13,17\}. \end{equation*}$$ Hence the finite list of primes is obtained. ::: :::exercise Answer the following. (1) Explain why a mathematical definition usually requires both directions of a biconditional. (2) Write the negation of $\forall \epsilon>0\ \exists k>0\ \forall n[(n>k)\to |r_n-L|<\epsilon]$. (3) Write the definition of an even integer using an existential quantifier. (4) Write the definition of a prime integer using a universal quantifier. ::: :::answer (1) One direction gives a necessary condition and the other gives a sufficient condition. Together they make the definition exact. (2) $\exists \epsilon>0\ \forall k>0\ \exists n[(n>k)\land |r_n-L|\geq\epsilon]$. (3) $n$ is even if and only if $\exists k\in\mathbb{Z}[n=2k]$. (4) For $n>1$, $n$ is prime if and only if $\forall d\in\mathbb{Z}^{+}[d\mid n\to(d=1\lor d=n)]$. ::: :::faq[Frequently Asked Questions] Q: Why are definitions often biconditionals? A: A definition must say exactly when a term applies, so both directions are needed. Q: What does the negation of a limit statement assert? A: It asserts that some positive tolerance is missed infinitely far out in the sequence. Q: Why is the universe important in a definition? A: The variables and quantifiers have meaning only after the universe is fixed. ::: :::call-to-action[Use Definitions Precisely] subtitle: Practise reading every definition as a quantified biconditional before studying proof by exhaustion. button: Next Lesson | /discrete-mathematics/mathematical-logic/quantifiers-definitions-and-proofs-of-theorems/proof-by-exhaustion-and-theorem-terminology button-ghost: Previous Lesson | /discrete-mathematics/mathematical-logic/predicates-and-quantifiers/unique-existence :::