Difference between revisions of "Main Page"

From MWiki
Jump to: navigation, search
(Universal multistep theorem)
(29 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 ==
=== Fermat's Last Theorem ===
 
  
For all <math>p \in {}^{\omega }{\mathbb{P}_{\ge 3}}</math> and <math>x, y, z \in {}^{\omega }{\mathbb{N}^{*}}</math>, always <math>x^p + y^p \ne z^p</math> holds and thus for all <math>m \in {}^{\omega }{\mathbb{N}_{\ge 3}}</math> instead of <math>p</math>.
+
=== Universal multistep theorem ===
  
==== Proof: ====
+
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>
Because of [[w:Fermat's little theorem|<span class="wikipedia">Fermat's little theorem</span>]], rewritten, <math>f_{akp}(n) := (2n + a - kp)^p - n^p - (n + a)^p \ne 0</math> is to show for <math>a, k, n \in {}^{\omega }{\mathbb{N}^{*}}</math> where <math>kp &lt; n</math>.
 
<div class="toccolours mw-collapsible mw-collapsed" style="width:100%; overflow:auto;">
 
<div style="font-weight:bold;line-height:1.6;">Proof details</div>
 
<div class="mw-collapsible-content">From <math>x := n, y:= n + a</math> and <math>z := 2n + a + d</math> where <math>d \in {}^{\omega }{\mathbb{N}^{*}}</math>, it follows due to <math>z^p \equiv y, y^p \equiv y</math> and <math>z^p \equiv z</math> first <math>d \equiv 0 \mod p</math>, then <math>d = \pm kp</math>. Since <math>x + y = 2n + a &gt; z</math> is required, <math>f_{akp}(n)</math> is chosen properly.</div></div>
 
  
[[w:Mathematical induction|<span class="wikipedia">Induction</span>]] for <math>n</math> implies the claim due to the case <math>m = 4</math><ref name="Ribenboim">[[w:Paulo Ribenboim|<span class="wikipedia">Ribenboim, Paulo</span>]]: ''Thirteen Lectures on Fermat's Last Theorem'' : 1979; Springer; New York; ISBN 9780387904320, p. 35 - 38.</ref> and <math>y &gt; x &gt; p</math><ref name="loccit">loc. cit., p. 226.</ref>:
+
=== Goldbach’s theorem ===
  
'''Induction basis''' <math>(n \le p): f_{akp}(n) \ne 0</math> for all <math>a, k</math> and <math>p</math>. Let <math>r \in {}^{\omega }{\mathbb{N}_{&lt; p}}</math>.  
+
Every even whole number greater than 2 is the sum of two primes.
  
'''Induction step''' <math>\,(n = q + r \; \rightarrow \; n^{*} = n + p):</math> Let <math>f_{akp}(n^{*}) \ge 0</math>, but <math>f_{akp}(n) &lt; 0</math>, since <math>f_{akp}(n)</math> is [[w:Monotonic function|<span class="wikipedia">strictly monotonically increasing</span>]] and otherwise nothing to prove.
+
==== Proof: ====
<div class="toccolours mw-collapsible mw-collapsed" style="width:100%; overflow:auto;">
+
Induction over all prime gaps until the maximally possible one each time.<math>\square</math>
<div style="font-weight:bold;line-height:1.6;">Proof details</div>
 
<div class="mw-collapsible-content">The strict monotonicity follows from (continuously) differentiating by <math>n</math> such that <math>f_{akp}(n)' = p(2(2n + a - kp)^{p - 1} - n^{p - 1} - (n + a)^{p - 1}) &gt; 0</math>.</div></div>
 
  
It holds <math>f_{akp}(n^{*}) = (\int_0^{n^{*}}{f_{akp}(v)}dv)' \ne 0</math>, since <math>(n^{*})^{p + 1} + (n^{*} + a)^{p + 1}</math> does not divide <math>((n^{*})^p + (n^{*} + a)^p)^2</math> after separating the positive factor as [[w:Polynomial long division|<span class="wikipedia">polynomial division</span>]] shows.<math>\square</math>
+
=== Foundation theorem ===
<div class="toccolours mw-collapsible mw-collapsed" style="width:100%; overflow:auto;">
 
<div style="font-weight:bold;line-height:1.6;">Proof details</div>
 
<div class="mw-collapsible-content"><math>\int_0^{n^{*}}{f_{akp}(v)}dv = ((2n^{*} + a - kp)^{p + 1} / 2 - (n^{*})^{p + 1} - (n^{*} + a)^{p + 1})/(p + 1) + t = ((2n^{*} + a - kp)^{(p + 1)/2} \pm \sqrt{2(n^{*})^{p + 1} + 2(n^{*} + a)^{p + 1}})^2/(2p + 2) + t</math> for <math>t \in {}^{\omega}{\mathbb{Q}}</math> where the third binomial formula <math>r^2 - s^2 = (r \pm s)^2 := (r + s)(r - s)</math> was used. After separating the negligible factor <math>\hat{2}((2n^{*} + a - kp)^{(p + 1)/2} + \sqrt{2(n^{*})^{p + 1} + 2(n^{*} + a)^{p + 1}})/(p + 1)</math>, the derivative is just <math>(\hat{2}(2n^{*} + a - kp)^{(p - 1)/2} - \hat{2}((n^{*})^p + (n^{*} + a)^p)/\sqrt{2(n^{*})^{p + 1} + 2(n^{*} + a)^{p + 1}})</math>. After squaring the terms, the polynomial division gives <math>(n^{*})^{p - 1} + (n^{*} + a)^{p - 1} + a^2(n^{*})^{p - 1}(n^{*} + a)^{p - 1}/((n^{*})^{p + 1} + (n^{*} + a)^{p + 1})</math> as recalculating by multiplication confirms.</div></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: ====
 +
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 ==
  
 
[https://en.calameo.com/books/003777977258f7b4aa332 Nonstandard Mathematics]
 
[https://en.calameo.com/books/003777977258f7b4aa332 Nonstandard Mathematics]
 
== References ==
 
<references />
 
  
 
[[de:Hauptseite]]
 
[[de:Hauptseite]]

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