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.
Identities and inverses in a field are unique
Statement
In a field (Field) the additive identity, the multiplicative identity, each additive inverse, and each multiplicative inverse are unique. Hence the notations , , , and denote well-defined elements, as the field definition and its consequences assume.
Facts & Assumptions
Proof
The additive identity is unique: if and both satisfy and for all , then , using that is an identity, commutativity, and that is an identity.
Additive inverses are unique: if and both satisfy and , then , using associativity and commutativity.
The same two arguments in the abelian group give uniqueness of the multiplicative identity, , and of multiplicative inverses: if and with , then (using ).
Therefore , and, for each , its additive inverse and (for ) its multiplicative inverse are the unique elements with their defining properties, so all four notations are well-defined.
Depends on
Used by
- Field homomorphism and embedding Definition
- Integer powers aᵐ Definition
- Epsilon characterisation of the infimum Lemma
- Every field is a commutative ring with 1 ≠ 0; it is an integral domain, and it is a commutative division ring Lemma
- In any vector space 0_F v = 0_V, λ 0_V = 0_V, (-λ)v = -(λ v), (-1_F)v = -v, and λ v = 0_V forces λ = 0_F or v = 0_V Lemma
- Laws of integer exponents Lemma
- Reflection through zero exchanges upper and lower bounds 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
- Every nonempty set bounded below has an infimum Theorem
Cited to discharge well-definedness by Field.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 1 result over 1 level. 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
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- Field (mathematics) (Wikipedia) (standard reference, not scraped)
- Janssen and Lindsey, Rings with Inquiry: Fields (standard reference, not scraped)