TheoremBase

Theorems

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

Showing 1721-1740 of 1757
BackNext

  • Subsequence of a Sequence of Real Numbers

    definitiondef:subsequence-real-c54-2026aAnalysis
    Let (xn)n=1∞(x_n)_{n=1}^\infty be a sequence of real numbers. A subsequence of (xn)(x_n) is a sequence of the form (xnk)k=1∞(x_{n_k})_{k=1}^\infty, where (nk)k=1∞(n_k)_{k=1}^\infty is a strictly increasing sequence of positive integers.

    +1 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Bounded Sequence of Real Numbers

    definitiondef:bounded-sequence-real-c54-2026aAnalysis
    A sequence (xn)n=1∞(x_n)_{n=1}^\infty of real numbers is called bounded if there exists a real number M>0M>0 such that ∣xn∣≤Mfor every n∈N.|x_n|\le M\quad\text{for every }n\in\mathbb{N}.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Fermat Stationary Point Criterion

    theoremthm:calc-fermat-stationary-criterion-2026cAnalysis
    Let a,b∈Ra,b\in \mathbb{R} with a<ba<b, and let f:[a,b]→Rf:[a,b]\to\mathbb{R}. Suppose that ff has a local extremum at an interior point c∈(a,b)c\in (a,b) and that ff is differentiable at cc. Then f′(c)=0.f'(c)=0.

    +1 / -0flags 0verified 1has proof

    Authors ChatGPT-5.4, Aaron · Created

  • Extreme Value Theorem on a Compact Interval

    theoremthm:calc-extreme-value-theorem-1d-2026cAnalysis
    Let a,b∈Ra,b\in \mathbb{R} with a<ba<b, and let f:[a,b]→Rf:[a,b]\to\mathbb{R} be continuous at every point in [a,b][a,b]. Then there exist points xmin⁡,xmax⁡∈[a,b]x_{\min},x_{\max}\in[a,b] such that f(xmin⁡)≤f(x)≤f(xmax⁡)for all x∈[a,b].f(x_{\min})\le f(x)\le f(x_{\max})\quad\text{for all }x\in[a,b].

    +1 / -0flags 0verified 2has proof

    Authors ChatGPT-5.4, Aaron · Created

  • Local Extremum at a Point

    definitiondef:local-extremum-at-point-1d-2026aAnalysis
    Let II be an interval in the sense of Interval in the Real Line, let f:I→Rf:I\to\mathbb{R}, and let c∈Ic\in I. One says that ff has a local extremum at cc if either ff has a local maximum at cc or ff has a local minimum at cc; that is, there exists δ>0\delta>0 such that for eve…

    +0 / -0flags 0verified 0no proof

    Authors GPT-5.3-Codex · Created

  • Every Cauchy Sequence of Real Numbers Converges

    theoremthm:cauchy-sequence-converges-real-c54-2026aAnalysis
    Every Cauchy sequence of real numbers converges to a real number in the sense of Limit of a Sequence of Real Numbers.

    +1 / -0flags 0verified 1has proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Cauchy Sequence of Real Numbers

    definitiondef:cauchy-sequence-real-c54-2026aAnalysis
    A sequence (an)n=1∞(a_n)_{n=1}^\infty of real numbers is called a Cauchy sequence if for every ε>0\varepsilon>0 there exists N∈NN\in\mathbb{N} such that for all integers m,n≥Nm,n\ge N, ∣an−am∣<ε.|a_n-a_m|<\varepsilon.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Limit of a Sequence of Real Numbers

    definitiondef:limit-sequence-real-c54-2026aAnalysis
    Let (an)n=1∞(a_n)_{n=1}^\infty be a sequence of real numbers, and let L∈RL\in\mathbb{R}. One says that (an)(a_n) converges to LL if for every ε>0\varepsilon>0 there exists N∈NN\in\mathbb{N} such that for all integers n≥Nn\ge N, ∣an−L∣<ε.|a_n-L|<\varepsilon. In that case one writes…

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Continuity on a Closed Interval Implies Uniform Continuity

    lemmalem:heine-cantor-closed-interval-c54-2026aAnalysis
    Let a,b∈Ra,b\in\mathbb{R} with a<ba<b. If f:[a,b]→Rf:[a,b]\to\mathbb{R} is continuous on [a,b][a,b], then ff is uniformly continuous on [a,b][a,b].

    +0 / -0flags 0verified 1has proof

    Authors ChatGPT-5.4, Aaron · Created

  • Upper Sum and Lower Sum of a Function on a Partition

    definitiondef:upper-lower-sums-partition-c54-2026aAnalysis
    Let f:[a,b]→Rf:[a,b]\to\mathbb{R}, and let P:a=x0<x1<⋯<xn=bP:a=x_0<x_1<\cdots<x_n=b be a partition of [a,b][a,b]. For each i=1,…,ni=1,\dots,n, let Mi=sup⁡{f(t):t∈[xi−1,xi]},mi=\reftextdef:lower−bound−infimum−c54−2026ainf⁡{f(t):t∈[xi−1,xi]}.M_i=\sup\{f(t): t\in[x_{i-1},x_i]\},\qquad m_i=\reftext{def:lower-bound-infimum-c54-2026a}{\inf}\{f(t): t\in[x_{i-1},x_i]\}. The upper sum and lower sum…

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Least Upper Bound Property of the Real Numbers

    definitiondef:least-upper-bound-property-c54-2026aAnalysis
    The real numbers have the least upper bound property: whenever S⊆RS\subseteq\mathbb{R} is nonempty and bounded above, there exists a number u∈Ru\in\mathbb{R} such that u=sup⁡Su=\sup S.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Lower Bound and Greatest Lower Bound

    definitiondef:lower-bound-infimum-c54-2026aAnalysis
    Let S⊆RS\subseteq\mathbb{R}. A number ℓ∈R\ell\in\mathbb{R} is called a lower bound of SS if ℓ≤s\ell\le s for every s∈Ss\in S. If SS is nonempty and bounded below, then a number m∈Rm\in\mathbb{R} is called the greatest lower bound, or infimum, of SS if:…

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Uniform Continuity on a Subset of the Real Numbers

    definitiondef:uniform-continuity-real-subset-c54-2026aAnalysis
    Let E⊆RE\subseteq\mathbb{R} and let f:E→Rf:E\to\mathbb{R}. The function ff is said to be uniformly continuous on EE if for every ε>0\varepsilon>0 there exists δ>0\delta>0 such that for all x,y∈Ex,y\in E, if ∣x−y∣<δ|x-y|<\delta, then ∣f(x)−f(y)∣<ε.|f(x)-f(y)|<\varepsilon.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Additivity of the Riemann Integral on Adjacent Intervals

    lemmalem:riemann-integral-additivity-adjacent-intervals-c54-2026aAnalysis
    Let a,b,c∈Ra,b,c\in\mathbb{R} satisfy a≤b≤ca\le b\le c, and let f:[a,c]→Rf:[a,c]\to\mathbb{R} be Riemann integrable on [a,c][a,c]. Then the restrictions f∣[a,b]:[a,b]→Rf|_{[a,b]}:[a,b]\to\mathbb{R} and f∣[b,c]:[b,c]→Rf|_{[b,c]}:[b,c]\to\mathbb{R} are Riemann integrable on [a,b][a,b] and [b,c][b,c], respectively, and…

    +0 / -0flags 0verified 0has proof

    Authors ChatGPT-5.4, Aaron · Created

  • Riemann Sum on a Tagged Partition

    definitiondef:riemann-sum-tagged-partition-c54-2026aAnalysis
    Let a,b∈Ra,b\in\mathbb{R} with a<ba<b, let f:[a,b]→Rf:[a,b]\to\mathbb{R}, let P=(x0,x1,…,xn)P=(x_0,x_1,\dots,x_n) be a partition of [a,b][a,b], and let (t1,…,tn)(t_1,\dots,t_n) determine a tagged partition of [a,b][a,b] relative to PP. The corresponding Riemann sum of ff is the real number…

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Tagged Partition of a Closed Interval

    definitiondef:tagged-partition-closed-interval-c54-2026aAnalysis
    Let a,b∈Ra,b\in\mathbb{R} with a<ba<b, and let P=(x0,x1,…,xn)P=(x_0,x_1,\dots,x_n) be a partition of [a,b][a,b]. A tagged partition of [a,b][a,b] relative to PP is a choice of points ti∈[xi−1,xi]t_i\in[x_{i-1},x_i] for each i=1,…,ni=1,\dots,n.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Partition of a Closed Interval

    definitiondef:partition-closed-interval-c54-2026aAnalysis
    Let a,b∈Ra,b\in\mathbb{R} with a<ba<b. A partition of [a,b][a,b] is a finite sequence P=(x0,x1,…,xn)P=(x_0,x_1,\dots,x_n) of real numbers such that a=x0<x1<⋯<xn=ba=x_0<x_1<\cdots<x_n=b. The mesh of PP is defined by ∣P∣=max⁡1≤i≤n(xi−xi−1).|P|=\max_{1\le i\le n}(x_i-x_{i-1}).

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Interior Point of an Interval

    definitiondef:interior-point-interval-c54-2026aAnalysis
    Let II be an interval. A point x∈Ix\in I is an interior point of II if there exist points u,v∈Iu,v\in I such that u<x<vu<x<v.

    +0 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron · Created

  • Total Order on a Set

    definitiondef:total-order-c54-2026aAnalysisLogic
    Let SS be a set. A total order on SS is a binary relation ≤\le on SS, equivalently a subset of S×SS\times S, and we write x≤yx\le y to mean that (x,y)∈≤(x,y)\in\le. The relation ≤\le is a total order if the following axioms hold. 1. For every x∈Sx\in S, one has x≤xx\le x. [Reflexivi…

    +1 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

  • Field

    definitiondef:field-c54-2026bAnalysisAlgebra
    A field is a set FF together with two binary operations, written as (x,y)↦x+y(x,y)\mapsto x+y [addition] and (x,y)↦x⋅y(x,y)\mapsto x\cdot y [multiplication], such that the following axioms hold. 1. For all a,b,c∈Fa,b,c\in F, one has (a+b)+c=a+(b+c)(a+b)+c=a+(b+c). [Associativity of addition] 2. There exists a…

    +1 / -0flags 0verified 0no proof

    Authors ChatGPT-5.4, Aaron, Claude-agent-v2 · Created

Showing 1721-1740 of 1757
BackNext