# 2.5 Examples Across Fields

## 2.5 Examples Across Fields

The distinction between truth, provability, and independence is not confined to mathematical logic. It appears throughout mathematics whenever a statement depends on axioms, interpretation, or the chosen structure.

In arithmetic, the intended structure is usually the natural numbers.

```text
N = {0, 1, 2, 3, ...}
```

A statement may be true about the standard natural numbers but unprovable in a chosen formal system. This is the central lesson of incompleteness. Arithmetic is simple enough to state elementary facts, but expressive enough to encode proofs, programs, and self-reference.

In geometry, truth depends on the axioms of space. Euclidean geometry, spherical geometry, and hyperbolic geometry use different assumptions. A statement about parallel lines may hold in one geometry and fail in another.

| Field      | Statement                           | Depends on                 |
| ---------- | ----------------------------------- | -------------------------- |
| Arithmetic | Some true statements are unprovable | Formal system              |
| Geometry   | Parallel line behavior              | Geometry axioms            |
| Set theory | Continuum hypothesis                | Set-theoretic axioms       |
| Algebra    | Existence of bases                  | Choice principles          |
| Analysis   | Pathological functions              | Set-theoretic assumptions  |
| Topology   | Compactness theorems                | Choice and covering axioms |

Set theory provides some of the most direct examples. The continuum hypothesis is independent of ZFC, assuming ZFC is consistent. This means the usual axioms of set theory do not decide whether there is a cardinal strictly between the natural numbers and the real numbers.

Algebra often hides foundational assumptions. The statement “every vector space has a basis” is standard in classical mathematics, but it depends on the axiom of choice in full generality. For finite-dimensional vector spaces, no such issue arises. A basis can be constructed by finite procedures.

Analysis contains many existence theorems whose proofs use nonconstructive principles. Some theorems assert that an object exists without giving a computable construction. This is acceptable in classical analysis, but it changes interpretation in constructive or computable analysis.

Topology gives another common pattern. Compactness statements often convert infinite data into finite data. Some forms are constructive, while others require choice-like principles. The exact status depends on the space and the covering notion.

A practical rule is to identify the framework before interpreting the theorem.

| Question                                      | Why it matters                             |
| --------------------------------------------- | ------------------------------------------ |
| What are the axioms?                          | Determines what can be proved              |
| What is the intended model?                   | Determines semantic truth                  |
| Is the proof constructive?                    | Determines whether witnesses are available |
| Are choice principles used?                   | Determines foundational strength           |
| Is the statement invariant under equivalence? | Determines structural meaning              |

Across fields, the same lesson repeats. A theorem is never just a sentence. It belongs to a language, a structure, and a proof system.

When these are explicit, mathematical statements become portable. When they are hidden, the same sentence may change meaning from one field to another.