Difference between revisions of "Main Page"

From MWiki
Jump to: navigation, search
(Universal multistep theorem)
(31 intermediate revisions by the same user not shown)
Line 2: Line 2:
 
= Welcome to MWiki =
 
= Welcome to MWiki =
 
== Theorem of the month ==
 
== Theorem of the month ==
=== Finite representation for odd <math>\zeta</math>-arguments ===
 
  
Using the digamma function <math>\psi</math>, it holds for <math>n \in {}^{\omega}2\mathbb{N}^{*}</math>, small <math>\varepsilon \in ]0, 1]</math> and <math>{{d}_{\varepsilon k n}}:={{\varepsilon}^{{\hat{n}}}}{e}^{\hat{n}2k\pi i}</math> that<div style="text-align:center;"><math>\zeta(\grave{n}) = \underset{\varepsilon \to 0}{\mathop{\lim }}\,\widehat{-\varepsilon n}\sum\limits_{k=1}^{n}{\left( \gamma +\psi ({{d}_{\varepsilon k n}}) \right)}+\mathcal{O}(\varepsilon )</math></div>and<div style="text-align:center;"><math>\zeta(\grave{n}) = \underset{\varepsilon \to 0}{\mathop{\lim }}\,\widehat{2\varepsilon n}\sum\limits_{k=1}^{n}{\left( \psi ({{d}_{\varepsilon k n}}{{i}^{\hat{n}2}})-\psi ({{d}_{\varepsilon k n}}) \right)}+\mathcal{O}({{\varepsilon }^{2}}).</math></div>
+
=== Universal multistep theorem ===
 +
 
 +
For <math>n \in {}^{\nu}\mathbb{N}_{\le p}, k, m, p \in {}^{\nu}\mathbb{N}^{*}, d_{\curvearrowright B} x \in\, ]0, 1[, x \in [a, b] \subseteq {}^{\omega}\mathbb{R}, y : [a, b] \rightarrow {}^{\omega}\mathbb{R}^q, f : [a, b] \times {}^{\omega}\mathbb{R}^{q \times n} \rightarrow {}^{\omega}\mathbb{R}^q, g_k(\curvearrowright B x) := g_{\acute{k}}(x)</math> and <math>g_0(a) = f((\curvearrowleft B)a, y_0, ... , y_{\acute{n}})</math>, the Taylor series of the initial value problem <math>y^\prime(x) = f(x, y((\curvearrowright B)^0 x), ... , y((\curvearrowright B)^{\acute{n}} x))</math> of order <math>n</math> implies <div style="text-align:center;"><math>y(\curvearrowright B x) = y(x) - d_{\curvearrowright B}x\sum\limits_{k=1}^{p}{i^{2k} g_{p-k}((\curvearrowright B) x)\sum\limits_{m=k}^{p}{\widehat{m!}\binom{\acute{m}}{\acute{k}}}} + \mathcal{O}((d_{\curvearrowright B} x)^{\grave{p}}).\square</math></div>
 +
 
 +
=== Goldbach’s theorem ===
 +
 
 +
Every even whole number greater than 2 is the sum of two primes.
  
 
==== Proof: ====
 
==== Proof: ====
The claim results easily via the geometric series from <div style="text-align:center;"><math>\psi (z)+\gamma +\hat{z}=\sum\limits_{m=1}^{\omega }{\left( \hat{m}-\widehat{m+z} \right)}=-\sum\limits_{m=1}^{\omega }{\zeta(\grave{m}){{(-z)}^{m}}}=z\sum\limits_{m=1}^{\omega }{\hat{m}\widehat{m+z}}.\square</math></div>
+
Induction over all prime gaps until the maximally possible one each time.<math>\square</math>
 +
 
 +
=== Foundation theorem ===
  
 +
Only the postulation of the axiom of foundation that every nonempty subset <math>X \subseteq Y</math> contains an element <math>x_0</math> such that <math>X</math> und <math>x_0</math> are disjoint guarantees cycle freedom.
 +
 +
==== Proof: ====
 +
Set <math>X := \{x_m : x_0 := \{\emptyset\}, x_{\omega} := \{x_1\}</math> and <math>x_{\acute{n}} := \{x_n\}</math> for <math>m \in {}^{\omega}\mathbb{N}</math> and <math>n \in {}^{\omega}\mathbb{N}_{\ge 2}\}</math> .<math>\square</math>
 
== Recommended reading ==
 
== Recommended reading ==
  

Revision as of 02:05, 1 June 2021

Welcome to MWiki

Theorem of the month

Universal multistep theorem

For [math]\displaystyle{ n \in {}^{\nu}\mathbb{N}_{\le p}, k, m, p \in {}^{\nu}\mathbb{N}^{*}, d_{\curvearrowright B} x \in\, ]0, 1[, x \in [a, b] \subseteq {}^{\omega}\mathbb{R}, y : [a, b] \rightarrow {}^{\omega}\mathbb{R}^q, f : [a, b] \times {}^{\omega}\mathbb{R}^{q \times n} \rightarrow {}^{\omega}\mathbb{R}^q, g_k(\curvearrowright B x) := g_{\acute{k}}(x) }[/math] and [math]\displaystyle{ g_0(a) = f((\curvearrowleft B)a, y_0, ... , y_{\acute{n}}) }[/math], the Taylor series of the initial value problem [math]\displaystyle{ y^\prime(x) = f(x, y((\curvearrowright B)^0 x), ... , y((\curvearrowright B)^{\acute{n}} x)) }[/math] of order [math]\displaystyle{ n }[/math] implies

[math]\displaystyle{ y(\curvearrowright B x) = y(x) - d_{\curvearrowright B}x\sum\limits_{k=1}^{p}{i^{2k} g_{p-k}((\curvearrowright B) x)\sum\limits_{m=k}^{p}{\widehat{m!}\binom{\acute{m}}{\acute{k}}}} + \mathcal{O}((d_{\curvearrowright B} x)^{\grave{p}}).\square }[/math]

Goldbach’s theorem

Every even whole number greater than 2 is the sum of two primes.

Proof:

Induction over all prime gaps until the maximally possible one each time.[math]\displaystyle{ \square }[/math]

Foundation theorem

Only the postulation of the axiom of foundation that every nonempty subset [math]\displaystyle{ X \subseteq Y }[/math] contains an element [math]\displaystyle{ x_0 }[/math] such that [math]\displaystyle{ X }[/math] und [math]\displaystyle{ x_0 }[/math] are disjoint guarantees cycle freedom.

Proof:

Set [math]\displaystyle{ X := \{x_m : x_0 := \{\emptyset\}, x_{\omega} := \{x_1\} }[/math] and [math]\displaystyle{ x_{\acute{n}} := \{x_n\} }[/math] for [math]\displaystyle{ m \in {}^{\omega}\mathbb{N} }[/math] and [math]\displaystyle{ n \in {}^{\omega}\mathbb{N}_{\ge 2}\} }[/math] .[math]\displaystyle{ \square }[/math]

Recommended reading

Nonstandard Mathematics