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.
Cancellation for multiplication by a nonzero factor
Statement
For all with : if then .
Facts & Assumptions
Given: multiplication defined by and ; the order , with meaning and .
Trichotomy: for all exactly one of , , holds (Trichotomy of the order on ).
Strict monotonicity: if and then (Order is compatible with multiplication).
Proof
Suppose with but .
By trichotomy [L1], forces or .
If then by [L2] (since ); if then by [L2]; either way .
This contradicts , so the assumption is impossible and .
Depends on
Used by
- For K≤ H≤ G with G finite, [G:K]=[G:H][H:K] Corollary
- The factorial n! and the falling factorial n^underlinek, defined by recursion in ℕ Definition
- Arrangements of a word with repeated letters, counted by the multinomial coefficient Example
- Five-card hands from a 52-card deck: binom525 = 2598960, and the count of hands with all cards of one suit Example
- The 15 weak compositions of 4 into 3 parts, listed and matched against stars and bars Example
- Vandermonde's identity checked at m = 4, n = 3, k = 3, both sides equal to 35 Example
- Laws of finite sums and products in ℕ, and ι(∑_k<n aₖ) = ∑_k<n ι(aₖ) Lemma
- binomnk k! (n-k)! = n! for k ≤ n; hence binomnk k! = n^underlinek, the quotient n!/(k!(n-k)!) is a natural number, and binomnk = binomnn-k Theorem
- ℕ × ℕ ≈ ℕ Theorem
- The multinomial coefficient equals n!/∏_i<m kᵢ!, and (x₀+…+xₘ₋₁)ⁿ = ∑ ιbinomnk∏_i<m xᵢ^kᵢ in ℝ Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 13 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)
- Peano axioms (Wikipedia) (standard reference, not scraped)
- W. Aitken, MATH 378 Ch. 1: The Peano Axioms (CSU San Marcos) (standard reference, not scraped)