How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Addition is associative
Statement
For all : .
Facts & Assumptions
Given: Addition with and (Addition of natural numbers).
Induction principle (The principle of mathematical induction).
Proof
Base : and , so they are equal.
Inductive hypothesis: .
Step: , using twice and the hypothesis.
By induction [L1], for all , hence for all .
Depends on
Used by
- If V = bigoplus_i<n Uᵢ with every Uᵢ finite-dimensional, then V is finite-dimensional and dim_F V = ∑_i<n dim_F Uᵢ; in particular dim_F(U ⊕ W) = dim_F U + dim_F W Corollary
- A commutative monoid in which cancellation holds need not be a group: (ℕ, +) Counterexample
- A finite sum is unchanged by a permutation of its index range: ∑_k<n a_π(k) = ∑_k<n aₖ for every bijection π : n → n Lemma
- Convergence depends only on the tail Lemma
- Distributivity and the successor law for multiplication Lemma
- Integer addition and negation are well defined Lemma
- Integer multiplication is well defined Lemma
- Laws of finite sums and products in ℕ, and ι(∑_k<n aₖ) = ∑_k<n ι(aₖ) Lemma
- Order is compatible with addition Lemma
- The integer-defining relation is an equivalence relation Lemma
- Trichotomy of the order on ℕ Lemma
- ≤ is a linear order on ℕ Theorem
- For every forest, |V|=|E|+c, where c is the number of connected components Theorem
- Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either Theorem
- ℕ × ℕ ≈ ℕ Theorem
- The arithmetic mean, geometric mean inequality Theorem
- The dimension formula: for finite-dimensional linear subspaces U and W of V, the subspaces U + W and U ∩ W are finite-dimensional and dim_F(U+W) + dim_F(U ∩ W) = dim_F U + dim_F W Theorem
- The integers form a commutative ring Theorem
- The integers form a totally ordered ring Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 15 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- T. Tao, Analysis I, 3rd ed., §2.1-2.3 (Peano axioms, recursion, arithmetic) (standard reference, not scraped)
- Mathematical induction (Wikipedia) (standard reference, not scraped)
- W. Aitken, MATH 378 Ch. 1: The Peano Axioms (CSU San Marcos) (standard reference, not scraped)
- Mathematics 144: Set Theory (UC Riverside lecture notes) (standard reference, not scraped)