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.
Left identity for addition
Statement
For all : . The right identity is definitional, so together with this law is a two-sided identity for addition.
Facts & Assumptions
Given: Addition with and (Addition of natural numbers).
Induction principle (The principle of mathematical induction).
Proof
Base : by the clause at .
Inductive hypothesis: .
Step: , using at , then the hypothesis.
By induction [L1], 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
- (ℕ, ≤) has no maximal element: Zorn's chain hypothesis fails Counterexample
- A commutative monoid in which cancellation holds need not be a group: (ℕ, +) Counterexample
- Finite sums and finite products of natural numbers, ∑_k<n aₖ and ∏_k<n aₖ in ℕ Definition
- 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
- A strictly increasing index map satisfies nₖ ≥ k Lemma
- Addition is commutative Lemma
- Laws of finite sums and products in ℕ, and ι(∑_k<n aₖ) = ∑_k<n ι(aₖ) Lemma
- On ℕ the order is membership: m < n ⟺ m ∈ n Lemma
- The naturals embed in the integers Lemma
- Trichotomy of the order on ℕ Lemma
- Zero and one under multiplication Lemma
- ω is the least limit ordinal Lemma
- ≤ is a linear order on ℕ Theorem
- ℕ × ℕ ≈ ℕ Theorem
- The integers form a commutative ring Theorem
- The well-ordering principle 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.2 (Addition) (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)
- B. Kaya, MATH 320 Set Theory (METU lecture notes) (standard reference, not scraped)