DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-07-28 (claude-fable-5)
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.
Field
Definition
A field is a set equipped with two binary operations (addition) and (multiplication) and two distinguished elements of , satisfying:
- (A) is an abelian group with identity : addition is associative and commutative, for all , and every has an additive inverse with .
- (M) Multiplication is associative and commutative on all of , and for every ; moreover is an abelian group with identity , so every has a multiplicative inverse with .
- (D) Multiplication distributes over addition: .
We write and (for ), and abbreviate as .
Remarks
- The rationals (The rationals form a field) and both constructions of the reals (The reals form a field, The Dedekind reals form a field) are fields. This definition states the field axioms once, abstractly, so that every field fact proved from them applies to all of these at once.
- The requirement excludes the trivial one-element structure.
- Why (M) quantifies over all of explicitly (amended 2026-07-28, owner approved). An earlier wording headed (M) with the group alone, and under that strict reading the axioms do not pin down the products : take and redefine , which leaves (A) untouched, leaves the trivial group, and satisfies (D) in all eight instances, yet has — making Multiplication by zero: false in a purported model of the axioms. Associativity, commutativity and are therefore asserted on all of , the element included. Commutativity on all of is also what turns (D) into its right-hand form , which Multiplication by zero: uses.
- The identities and the inverses are unique (Identities and inverses in a field are unique), so writing them as single-valued notation, and the abbreviations and , are legitimate.
Used by
- Certified complex-polynomial root isolation in exact algebraic arithmetic Algorithm
- Fixed-pattern ILU(0) factorization and application Algorithm
- ∑_k<n+1C(n, k) = 2ⁿ, and ∑_k<n+1(-1)ᵏiotaC(n, k) = 0 for n ≥ 1 Corollary
- A rational root of xᵏ = m is an integer: if k ≥ 1, m ∈ ℤ, x ∈ ℚ and xᵏ is the image of m, then x is the image of an integer Corollary
- Every linear subspace U of a vector space V has a complement: a linear subspace W with V = U ⊕ W Corollary
- Every spanning subset of a vector space contains a basis Corollary
- Every vector space has a basis Corollary
- Finite-dimensional coherent cohomology over a field Corollary
- For a field K, K⟦ x⟧ is a domain and its nonunits form the unique maximal ideal xK⟦ x⟧ Corollary
- For an odd prime p, ℚ(ζₚ) has exactly one intermediate field of degree two over ℚ Corollary
- For every field F, F[x] is a Euclidean domain with degree as Euclidean function Corollary
- For every ε > 0 in a complete ordered field there is a natural n ≥ 1 with 1/n < ε Corollary
- Global functions on geometrically connected and geometrically reduced proper schemes Corollary
- If V = ⨁_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
- If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with ℕ Corollary
- If X is nonempty, some row fibre is at least the average size and some row fibre is at most the average size Corollary
- Over an infinite field, a finite linear system has no solution, exactly one solution, or infinitely many solutions according to its pivots Corollary
- The multiplicative identity is positive Corollary
- ι(Dₙ) = ι(n) ι(Dₙ₋₁) + (-1)ⁿ for n ≥ 1, and Dₙ = (n-1)(Dₙ₋₁ + Dₙ₋₂) for n ≥ 2 Corollary
- {(1,0), (0,1), (1,1)} spans F² and is linearly dependent, so a spanning set need not be a basis; each of its three two-element subsets is a basis Counterexample
- A coproduct coideal with nonzero counit does not give a quotient coalgebra map Counterexample
- A null sequence times an unbounded sequence need not be null: (k+1)⁻¹·(k+1) = 1 Counterexample
- A projective generator need not be small Counterexample
- A rank-one Hecke algebra with a perfect symmetrizing form and degenerate regular trace Counterexample
- A relation whose row fibres all differ from the average size, so the averaging principle gives a bound that no fibre meets exactly Counterexample
- A three-set count that drops the triple intersection and returns the wrong answer Counterexample
- h0 differs from the Euler characteristic before vanishing Counterexample
- Inside the space of eventually zero families, the linear subspace spanned by { eᵢ : i ≥ 1 } is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension Counterexample
- On (0,∞) the metrics |x-y| and |1/x - 1/y| have the same topology and are not uniformly equivalent Counterexample
- On a closed interval of ℚ there is a continuous unbounded function, a bounded one with no maximum, and one without the intermediate value property Counterexample
- Quasi-finite does not imply finite Counterexample
- The degree-zero projection is exact and cocontinuous but not a graded tensor functor Counterexample
- The first quadrant of ℝ² contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by -1 Counterexample
- The left-to-right exact equivalence need not preserve the identity Counterexample
- The Maurer–Cartan equation alone does not specify gauge classes Counterexample
- The maximal-contact mechanism fails in positive characteristic Counterexample
- The ordered-to-unordered two-point quotient is not one-to-one Counterexample
- The quotient rule needs a nonzero limit in the denominator: 1/(k+1)⁻¹ = k+1 Counterexample
- The standard unit families { eᵢ : i ∈ ℕ } are linearly independent in F^ℕ but do not span it: the constant family 1_F is not a finite linear combination of them Counterexample
- The sum of two divergent sequences can converge: k + (-k) Counterexample
…and 326 more results.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- M. Spivak, Calculus, 4th ed., Ch. 1 (standard reference, not scraped)
- Elias Zakon, Mathematical Analysis: Axioms and Basic Definitions (standard reference, not scraped)