MathTalk Vernacular

Mathematicians use a stylized language called MathTalk (or
mathematical vernacular) to write claims precisely and concisely.

Building blocks:

Examples:
- $\forall x \in \mathbb{N}.\ x \geq 0$ — every natural is non-negative.
- $\exists x \in \mathbb{N}.\ x^2 = 4$ — there exists a natural whose square is 4.
- $\forall A, B.\ A \subseteq B \Rightarrow A \cup B = B$ — for all sets $A, B$, if $A \subseteq B$ then $A \cup B = B$.

Aggregations combine multiple quantified statements into one. Common examples from real math textbooks:

Example 1 (Spivak, Calculus). 'There is a function $f$ such that $f(x) = x^2$ for all $x$ in $\mathbb{R}$.' Decomposition:
- $\exists f.\, \forall x.\, (f(x) = x^2)$

Example 2 (Halmos, Naive Set Theory). 'For every set $X$, there exists a unique power set $\mathcal{P}(X)$.'
- $\forall X.\, \exists! P.\, (P = \mathcal{P}(X))$

Example 3 (notes). 'For all $x$ in $S$, there exists $y$ in $T$ with $x < y$.'
- $\forall x.\, (x \in S \Rightarrow \exists y.\, (y \in T \wedge x < y))$

Example 4 (Lamport, TLA+). 'Every process eventually completes.' Common reformulation:
- $\forall p.\, \Diamond (\text{complete}(p))$ (temporal logic).

Example 5 (Russell & Whitehead, Principia). '$\exists x.\, \forall y.\, (R(x, y) \Rightarrow \neg R(y, x))$' — '$x$ is a maximal element of $R$'.

Practice pattern. When reading a MathTalk sentence, identify:
1. The outermost quantifier ($\forall$ vs $\exists$).
2. The middle connective ($\Rightarrow$, $\wedge$, $\lor$, $\Leftrightarrow$).
3. The inner quantified part.

This 3-level pattern matches the grammar of most math textbooks.