Difference between revisions of "Main Page"

From MWiki
Jump to: navigation, search
(Cube and Fickett's Theorem)
(Universal multistep theorem)
(19 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
__NOTOC__
 
__NOTOC__
 
= Welcome to MWiki =
 
= Welcome to MWiki =
== Theorems of the month ==
+
== Theorem of the month ==
=== Cube Theorem ===
 
  
A sum <math>m \in {}^{\omega }{\mathbb{Z}}</math> consists of three cubes for <math>a, b, c, n \in {}^{\omega }{\mathbb{Z}}</math> if and only if
+
=== Universal multistep theorem ===
  
<div style="text-align:center;"><math>m=n^3 + (n + a)^3 + (n - b)^3 = 3n^3 + a - b + 6c \ne \pm 4\mod 9</math></div>
+
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>
  
is true. This implicitly quadratic equation yields the formula to be satisfied by <math>n.\square</math>
+
=== Goldbach’s theorem ===
  
=== Fickett's Theorem ===
+
Every even whole number greater than 2 is the sum of two primes.
  
For any relative positions of two overlapping congruent rectangular <math>n</math>-prisms <math>Q</math> and <math>R</math> with <math>n \in {}^{\omega }\mathbb{N}_{\ge 2}</math>, it can be stated for the exact standard measure <math>\mu</math>, where <math>\mu</math> for <math>n = 2</math> needs to be replaced by the Euclidean path length <math>L</math>, that:
+
==== Proof: ====
 +
Induction over all prime gaps until the maximally possible one each time.<math>\square</math>
  
 +
=== Foundation theorem ===
  
<div style="text-align:center;"><math>1/(2n - 1) &lt; r := \mu(\partial Q \cap R)/\mu(\partial R \cap Q) &lt; 2n - 1.</math></div>
+
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: ====
 
==== Proof: ====
Since the underlying extremal problem has its maximum for rectangles with the side lengths <math>s</math> and <math>s + 2d0</math>, min <math>r = s/(3s - 2d0) \le r \le</math> max <math>r = (3s - 2d0)/s</math> holds. The proof for <math>n &gt; 2</math> is analogous.<math>\square</math>
+
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