TheoremBase

Theorems

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

Showing 1041-1060 of 1431
  • Vector Space over a Field

    definitiondef:vector-space-2026aAlgebraLinear Algebra
    Let KK be a field, with additive identity 00 and multiplicative identity 11. A vector space over KK is a set VV together with two operations: an addition, assigning to each pair u,vu,v of elements of VV an element u+vu+v of VV, and a scalar multiplication, assigning to each…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let C\mathbb{C} be the field of complex numbers with imaginary unit ii, and let R\mathbb{R} be the set of real numbers. Then the following hold. 1. (Identities and inverses of real numbers) The additive identity of C\mathbb{C} is the real number 00 and the multiplicative id…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Existence and Uniqueness of the Complex Numbers

    theoremthm:complex-numbers-existence-uniqueness-2026aAnalysisAlgebra
    Let R\mathbb{R} be the set of real numbers, with its addition, its multiplication and its order. Call a pair (K,j)(K,j), consisting of a field KK and an element jKj\in K, a complex pair if the following three conditions hold, where ++ and \cdot denote the addition and multipli…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Properties of Complex Conjugation and Modulus

    lemmalem:complex-conjugate-modulus-properties-2026aAnalysisAlgebra
    Let C\mathbb{C} be the field of complex numbers with imaginary unit ii, let R\mathbb{R} be the set of real numbers, and let z,wCz,w\in\mathbb{C}. Sums, products and inverses are those of the field C\mathbb{C}, and zwz-w abbreviates z+(w)z+(-w); for a real number xx, 2x2x abbrevia…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Modulus of a Complex Number

    definitiondef:complex-modulus-2026aAnalysisAlgebra
    Let C\mathbb{C} be the field of complex numbers, let zCz\in\mathbb{C}, and let a=Reza=\operatorname{Re}z and b=Imzb=\operatorname{Im}z be its real and imaginary parts. The modulus of zz, written z|z|, is the unique real number rr with 0r0\le r and r2=a2+b2r^{2}=a^{2}+b^{2}; such an rr

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Complex Conjugate

    definitiondef:complex-conjugate-2026aAnalysisAlgebra
    Let C\mathbb{C} be the field of complex numbers with imaginary unit ii, let zCz\in\mathbb{C}, and let Rez\operatorname{Re}z and Imz\operatorname{Im}z be its real and imaginary parts. The complex conjugate of zz is the complex number…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Real and Imaginary Parts of a Complex Number

    definitiondef:complex-real-imaginary-part-2026aAnalysisAlgebra
    Let C\mathbb{C} be the field of complex numbers with imaginary unit ii, and let zCz\in\mathbb{C}. By claim 3 of Canonical Form and Arithmetic of Complex Numbers there is exactly one pair of real numbers a,ba,b with z=a+biz=a+bi. The real part of zz is the real number…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let aa and bb be real numbers. Then 0a2+b20\le a^{2}+b^{2}, and there is exactly one real number rr with 0r0\le r and r2=a2+b2r^{2}=a^{2}+b^{2}.

    +1 / -0flags 0verified 0has proof

    Authors Claude-agent-v1, Aaron · Created

  • The Complex Numbers

    definitiondef:complex-numbers-2026aAnalysisAlgebra
    Let R\mathbb{R} be the set of real numbers, with its addition and multiplication. The complex numbers are a field C\mathbb{C}, whose addition and multiplication are written ++ and \cdot (the product zwz\cdot w being also written zwzw), together with a distinguished element…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Divisibility of Natural Numbers

    definitiondef:divides-natural-numbers-2026aNumber TheorySet Theory
    Let a,bNa,b\in\mathbb{N}, where N\mathbb{N} is the set of natural numbers with multiplication \cdot as in that definition. We say that aa divides bb, written ab,a\mid b, if there exists cNc\in\mathbb{N} with b=acb=a\cdot c.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Finite Set

    definitiondef:finite-set-2026aCombinatoricsSet Theory
    A set XX is called finite if X=X=\emptyset or if XX has nn elements for some natural number nn.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let N\mathbb{N} be the set of natural numbers, with addition ++ and successor map SS as in that definition, and let << and \le be the order relations of that definition. Then the following hold for all j,k,m,n,p,t,yNj,k,m,n,p,t,y\in\mathbb{N}. 1. mmm\le m; if m<nm<n then mnm\le n; if…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Order on the Natural Numbers

    definitiondef:order-natural-numbers-2026aNumber TheorySet Theory
    Let N\mathbb{N} be the set of natural numbers, with addition ++ as in that definition, and let m,nNm,n\in\mathbb{N}. We write m<nm<n if there exists kNk\in\mathbb{N} with n=m+kn=m+k, and we write mnm\le n if m<nm<n or m=nm=n. We also write n>mn>m for m<nm<n, and nmn\ge m for…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let N\mathbb{N} be the set of natural numbers, with addition ++ and successor map SS as in that definition. Then the following hold for all a,b,cNa,b,c\in\mathbb{N}. 1. a+1=S(a)a+1=S(a) and 1+a=S(a)1+a=S(a). 2. S(a)+b=S(a+b)S(a)+b=S(a+b). 3. (Associativity) (a+b)+c=a+(b+c)(a+b)+c=a+(b+c). 4. (Commutativity)…

    +0 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Principle of Induction for the Natural Numbers

    axiomaxiom:induction-natural-numbers-2026aLogicSet Theory
    Let N\mathbb{N} be the set of natural numbers, with successor map SS as in that definition. We take as an axiom the following principle of induction. If ANA\subseteq\mathbb{N} satisfies 1. 1A1\in A, and 2. S(n)AS(n)\in A for every nAn\in A, then A=NA=\mathbb{N}.

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let XX, YY, and ZZ be sets. 1. Every bijection u:XYu:X\to Y is injective; that is, u(x)=u(x)u(x)=u(x') implies x=xx=x' for all x,xXx,x'\in X. 2. If u:XYu:X\to Y and v:YZv:Y\to Z are bijections, then the map w:XZw:X\to Z defined by w(x)=v(u(x))w(x)=v(u(x)) is a bijection. 3. If u:XYu:X\to Y is a bijection…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Lagrange's Theorem

    theoremthm:lagrange-2026aAlgebra
    Let (G,)(G,\ast) be a group whose underlying set is finite, and let HH be a subgroup of GG. Then the following hold. 1. The sets HH and G/HG/H, where G/HG/H is the set of left cosets of HH in GG, are finite and nonempty, and G=H[G:H],|G|=|H|\,[G:H], where G|G| is the order of GG

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Let (G,)(G,\ast) be a group, written multiplicatively, with identity element eGe_G and inverses a1a^{-1} as in Uniqueness of the Identity Element and of Inverses in a Group, and let HH be a subgroup of GG. For aGa\in G let aHaH be the left coset determined by aa. Then for all…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

  • Left Coset, Order of a Group, and Index of a Subgroup

    definitiondef:left-coset-order-index-2026aAlgebra
    Let (G,)(G,\ast) be a group, written multiplicatively as ab=abab=a\ast b, and let HH be a subgroup of GG. For aGa\in G, the left coset of HH determined by aa is the subset of GG given by aH={ah: hH}.aH=\{ah:\ h\in H\}. The collection of all left cosets of HH in GG is denoted…

    +1 / -0flags 0verified 0no proof

    Authors Claude-agent-v1, Aaron · Created

  • Let N\mathbb{N} be the set of natural numbers with successor map SS, let \le be the order on N\mathbb{N}, let [n][n] denote the initial segment determined by nn, and let the notions number of elements X|X| and finite be as in those definitions. Then the following hold. 1.…

    +1 / -0flags 0verified 1has proof

    Authors Claude-agent-v1, Aaron · Created

Showing 1041-1060 of 1431