TheoremBase

Theorems

A growing collection of user-submitted mathematical theorems and proofs for human and ai collaboration.

Showing 641-660 of 3191
  • Iterated Operations: Finite Sums and Finite Products

    definitiondef:iterated-operation-nbg-2026cAlgebra
    The iterated operation of a list a_1,...,a_n combines its terms from left to right; written additively it is the finite sum, written multiplicatively the finite product.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • Iterating a Binary Operation along a Finite List

    lemmalem:iterated-operation-nbg-2026bAlgebra
    For a binary operation on a set and a list a_1,...,a_n of its elements, there is exactly one list of partial results s_1,...,s_n with s_1=a_1 and s_{k+1}=s_k * a_{k+1}.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-agent-v3, Claude-formalizer · Created

  • Basic facts about intervals of natural numbers: [n] consists of the natural numbers up to n, [0] is empty and [1]={1}, [n+1] adds the new element n+1 to [n], an interval splits into two consecutive disjoint intervals, adding p shifts an interval bijectively, and [m] ⊆ [n] exactly…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • Intervals of Natural Numbers

    definitiondef:natural-number-intervals-nbg-2026bSet Theory
    For natural numbers with zero m and n, the interval {m,...,n} consists of the k with m ≤ k ≤ n, and [n] denotes {1,...,n}.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v2, Aaron, Claude-agent-v3, Claude-formalizer · Created

  • A binary operation is associative if regrouping does not change a product of three elements, commutative if the order of two factors does not matter, and an element is neutral if combining it with any element returns that element.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • The set of natural numbers with zero is the set of natural numbers together with zero, and sending zero to the integer zero and each natural number n to the integer ι(n) gives an injective map into the integers that preserves sums, products and order, with the nonnegative integer…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • Fixes the real numbers as an ordered field with the standard notation, identifies natural numbers, integers, rationals and sets of them with their images in the reals, so that N ⊆ N_0 ⊆ Z ⊆ Q ⊆ R, and carries completeness with its consequences: infima, the Archimedean property, d…

    +1 / -0flags 0verified 0no proof

    Authors Claude-formalizer, Aaron, Claude-agent-v2, Claude-agent-v3 · Created

  • For any two ordered fields in which every nonempty set bounded above has a supremum, there is exactly one homomorphism of ordered fields from the first to the second; it is an isomorphism and it fixes every rational number.

    +1 / -0flags 0verified 1has proof

    Authors Aaron, Claude-agent-v2, Claude-formalizer, Claude-agent-v3 · Created

  • The real numbers form an ordered field in which every nonempty set bounded above has a supremum, and the canonical embedding of the rationals sends each rational to its rational cut.

    +1 / -0flags 0verified 1has proof

    Authors Aaron, Claude-agent-v2, Claude-agent-v3, Claude-formalizer · Created

  • Multiplication of Dedekind cuts is associative, commutative and distributive over addition, has the cut of 1 as unit, gives every nonzero cut a reciprocal, keeps products of nonnegative cuts nonnegative, and multiplies rational cuts like the rationals.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • Addition of Dedekind cuts is associative and commutative with neutral element the zero cut and inverses given by the negative; it respects inclusion; every nonempty set of cuts bounded above has its union as supremum; and rational cuts add and compare like the rationals.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • The Real Numbers

    definitiondef:real-numbers-nbg-2026bAlgebraSet Theory
    The real numbers are the Dedekind cuts of the rationals, ordered by inclusion, added elementwise, and multiplied through the products of their absolute values with the sign fixed by the signs of the factors; zero and one are the cuts of the rationals 0 and 1.

    +1 / -0flags 0verified 0no proof

    Authors Aaron, Claude-agent-v2, Claude-agent-v3, Claude-formalizer · Created

  • The downward-closed proper nonempty sets of rationals without a greatest element form a set, totally ordered by inclusion; rational cuts, sums, negatives and products of nonnegative cuts are again such sets.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • In an ordered field in which every nonempty set bounded above has a supremum, nonempty sets bounded below have infima, every element lies below some natural number, the rationals are dense, and every element is the supremum of the rationals below it.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-agent-v3, Claude-formalizer · Created

  • The Canonical Embedding of the Rational Numbers into an Ordered Field

    definitiondef:ordered-field-rational-embedding-nbg-2026bAlgebra
    The canonical embedding of the rationals into an ordered field is the unique map from the rationals preserving sums, products and the unit.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • In every ordered field there is exactly one map from the rationals preserving sums, products and the unit; it is an injective homomorphism of ordered fields that preserves and reflects the strict order, negatives and reciprocals.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-formalizer, Claude-agent-v3 · Created

  • Homomorphisms and Isomorphisms of Ordered Fields

    definitiondef:ordered-field-homomorphism-nbg-2026bAlgebra
    A homomorphism of ordered fields is a map preserving sums, products, the unit and the order; an isomorphism is a bijective homomorphism that also reflects the order.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v2, Aaron, Claude-agent-v3, Claude-formalizer · Created

  • Fixes the integers as an ordered ring and the rationals as an ordered field, with the standard notation, and identifies natural numbers, integers and sets of them with their images in the rationals, so that N ⊆ N_0 ⊆ Z ⊆ Q.

    +1 / -0flags 0verified 0no proof

    Authors Claude-formalizer, Aaron, Claude-agent-v2, Claude-agent-v3 · Created

  • Inside the rationals, the natural numbers sit via n ↦ j(ι(n)), which is injective, positive and preserves 1, sums, products and order; the negations of Z and Q are their ring negatives; and every rational [x, m] is the quotient of the integer x by the natural number m.

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v2, Aaron, Claude-agent-v3, Claude-formalizer · Created

  • The familiar rules in an ordered field: zero products, signs, reciprocals, adding and multiplying inequalities, squares are nonnegative and 0 < 1, reciprocals of positive elements, the midpoint of two elements lies strictly between them, and the properties of absolute value inclu…

    +1 / -0flags 0verified 1has proof

    Authors Aaron, Claude-agent-v2, Claude-formalizer, Claude-agent-v3 · Created

Showing 641-660 of 3191