Proof that it is impossible for every object to be well defined without using at least one tautology or...
up vote
1
down vote
favorite
This resulted from trying to write a proof for the definition of equality. In the end I gave up, but I did realise that under the specifications I had provided, any definition for anything would ultimately be either circular or tautological.
I thought this was worth working on, because it could serve to explain and justify some of the seemingly arbitrary conventions in different areas of mathematics.
But, I don't usually write proofs, I'm not a mathematician, and my vocabulary is somewhat limited - so I would like
Definition: A system is a set $S$, along with all operations and relations defined on $S$.
Definition: The definition of an element $sin S$ is a unique, true statement $s=x$, for which $s,xin S$. Each element of $S$ may have one and only one definition.
Definition: A definition is a tautology, when it is written as $x=x$.
Definition: A definition is circular when it is written as $x=yast_0z,y=xast_1z,z=xast_2y$, thus $x=(xast_1z)ast_0z=(xast_1xast_2y)ast_0(xast_2 y)=(xast_1xast_2(xast_1z))ast_0(xast_2(xast_1z))=cdots$ - i.e. the definition contains terms which are defined by, or which contain terms which are defined by, etc., $x$.
Theorem:
For every system $X$ with finitely many elements for which every element is defined, there is at least one element whose definition in $X$ is a tautology. If no element of $X$ is defined by tautology, then the definition of every element in $X$ belongs to a cyclic sequence of codependent definitions (the definition of $x$ is circular for all $xin X$).
Proof:
- Let $X_n$ be the system containing the elements in $bigcup_{i=0}^n{x_i}$.
- Let $Defleft(xmid Xright)$ be the definitions of $x$ in $X$.
- From 1. and 2., it follows that $forall x_iin X_n.Defleft(x_imid X_nright)in Y:\ Y=left{{''x_i=x_i}''mid0leq ileq nright}cupleft{''x_i=f_i(textbf{x})''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$
- If $exists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$ then the definition of $x_i$ is a tautology
- If $nexists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$, then
$Defleft(x_imid X_nright)in Z: Z=left{{''x_i=f_i(textbf{x})}''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$; Thus, the definition of $x_i$ is circular for all $x_iin X_n$.
$square$
What this is supposed to mean:
It is impossible to have any system, including but not limited to groups, algebras, theories, and natural language, where every object is defined and no definitions are circular or tautological. As a system, mathematics itself cannot be closed without introducing tautologies or circular definitions.
So, is this correct and is there anything I can do to improve? Have I misapplied any terms? Is the notation (ignoring $x_iintextbf{x}$ which is a deliberate abuse of notation to save space) correct?
abstract-algebra proof-verification conjectures meta-math
add a comment |
up vote
1
down vote
favorite
This resulted from trying to write a proof for the definition of equality. In the end I gave up, but I did realise that under the specifications I had provided, any definition for anything would ultimately be either circular or tautological.
I thought this was worth working on, because it could serve to explain and justify some of the seemingly arbitrary conventions in different areas of mathematics.
But, I don't usually write proofs, I'm not a mathematician, and my vocabulary is somewhat limited - so I would like
Definition: A system is a set $S$, along with all operations and relations defined on $S$.
Definition: The definition of an element $sin S$ is a unique, true statement $s=x$, for which $s,xin S$. Each element of $S$ may have one and only one definition.
Definition: A definition is a tautology, when it is written as $x=x$.
Definition: A definition is circular when it is written as $x=yast_0z,y=xast_1z,z=xast_2y$, thus $x=(xast_1z)ast_0z=(xast_1xast_2y)ast_0(xast_2 y)=(xast_1xast_2(xast_1z))ast_0(xast_2(xast_1z))=cdots$ - i.e. the definition contains terms which are defined by, or which contain terms which are defined by, etc., $x$.
Theorem:
For every system $X$ with finitely many elements for which every element is defined, there is at least one element whose definition in $X$ is a tautology. If no element of $X$ is defined by tautology, then the definition of every element in $X$ belongs to a cyclic sequence of codependent definitions (the definition of $x$ is circular for all $xin X$).
Proof:
- Let $X_n$ be the system containing the elements in $bigcup_{i=0}^n{x_i}$.
- Let $Defleft(xmid Xright)$ be the definitions of $x$ in $X$.
- From 1. and 2., it follows that $forall x_iin X_n.Defleft(x_imid X_nright)in Y:\ Y=left{{''x_i=x_i}''mid0leq ileq nright}cupleft{''x_i=f_i(textbf{x})''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$
- If $exists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$ then the definition of $x_i$ is a tautology
- If $nexists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$, then
$Defleft(x_imid X_nright)in Z: Z=left{{''x_i=f_i(textbf{x})}''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$; Thus, the definition of $x_i$ is circular for all $x_iin X_n$.
$square$
What this is supposed to mean:
It is impossible to have any system, including but not limited to groups, algebras, theories, and natural language, where every object is defined and no definitions are circular or tautological. As a system, mathematics itself cannot be closed without introducing tautologies or circular definitions.
So, is this correct and is there anything I can do to improve? Have I misapplied any terms? Is the notation (ignoring $x_iintextbf{x}$ which is a deliberate abuse of notation to save space) correct?
abstract-algebra proof-verification conjectures meta-math
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
This resulted from trying to write a proof for the definition of equality. In the end I gave up, but I did realise that under the specifications I had provided, any definition for anything would ultimately be either circular or tautological.
I thought this was worth working on, because it could serve to explain and justify some of the seemingly arbitrary conventions in different areas of mathematics.
But, I don't usually write proofs, I'm not a mathematician, and my vocabulary is somewhat limited - so I would like
Definition: A system is a set $S$, along with all operations and relations defined on $S$.
Definition: The definition of an element $sin S$ is a unique, true statement $s=x$, for which $s,xin S$. Each element of $S$ may have one and only one definition.
Definition: A definition is a tautology, when it is written as $x=x$.
Definition: A definition is circular when it is written as $x=yast_0z,y=xast_1z,z=xast_2y$, thus $x=(xast_1z)ast_0z=(xast_1xast_2y)ast_0(xast_2 y)=(xast_1xast_2(xast_1z))ast_0(xast_2(xast_1z))=cdots$ - i.e. the definition contains terms which are defined by, or which contain terms which are defined by, etc., $x$.
Theorem:
For every system $X$ with finitely many elements for which every element is defined, there is at least one element whose definition in $X$ is a tautology. If no element of $X$ is defined by tautology, then the definition of every element in $X$ belongs to a cyclic sequence of codependent definitions (the definition of $x$ is circular for all $xin X$).
Proof:
- Let $X_n$ be the system containing the elements in $bigcup_{i=0}^n{x_i}$.
- Let $Defleft(xmid Xright)$ be the definitions of $x$ in $X$.
- From 1. and 2., it follows that $forall x_iin X_n.Defleft(x_imid X_nright)in Y:\ Y=left{{''x_i=x_i}''mid0leq ileq nright}cupleft{''x_i=f_i(textbf{x})''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$
- If $exists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$ then the definition of $x_i$ is a tautology
- If $nexists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$, then
$Defleft(x_imid X_nright)in Z: Z=left{{''x_i=f_i(textbf{x})}''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$; Thus, the definition of $x_i$ is circular for all $x_iin X_n$.
$square$
What this is supposed to mean:
It is impossible to have any system, including but not limited to groups, algebras, theories, and natural language, where every object is defined and no definitions are circular or tautological. As a system, mathematics itself cannot be closed without introducing tautologies or circular definitions.
So, is this correct and is there anything I can do to improve? Have I misapplied any terms? Is the notation (ignoring $x_iintextbf{x}$ which is a deliberate abuse of notation to save space) correct?
abstract-algebra proof-verification conjectures meta-math
This resulted from trying to write a proof for the definition of equality. In the end I gave up, but I did realise that under the specifications I had provided, any definition for anything would ultimately be either circular or tautological.
I thought this was worth working on, because it could serve to explain and justify some of the seemingly arbitrary conventions in different areas of mathematics.
But, I don't usually write proofs, I'm not a mathematician, and my vocabulary is somewhat limited - so I would like
Definition: A system is a set $S$, along with all operations and relations defined on $S$.
Definition: The definition of an element $sin S$ is a unique, true statement $s=x$, for which $s,xin S$. Each element of $S$ may have one and only one definition.
Definition: A definition is a tautology, when it is written as $x=x$.
Definition: A definition is circular when it is written as $x=yast_0z,y=xast_1z,z=xast_2y$, thus $x=(xast_1z)ast_0z=(xast_1xast_2y)ast_0(xast_2 y)=(xast_1xast_2(xast_1z))ast_0(xast_2(xast_1z))=cdots$ - i.e. the definition contains terms which are defined by, or which contain terms which are defined by, etc., $x$.
Theorem:
For every system $X$ with finitely many elements for which every element is defined, there is at least one element whose definition in $X$ is a tautology. If no element of $X$ is defined by tautology, then the definition of every element in $X$ belongs to a cyclic sequence of codependent definitions (the definition of $x$ is circular for all $xin X$).
Proof:
- Let $X_n$ be the system containing the elements in $bigcup_{i=0}^n{x_i}$.
- Let $Defleft(xmid Xright)$ be the definitions of $x$ in $X$.
- From 1. and 2., it follows that $forall x_iin X_n.Defleft(x_imid X_nright)in Y:\ Y=left{{''x_i=x_i}''mid0leq ileq nright}cupleft{''x_i=f_i(textbf{x})''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$
- If $exists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$ then the definition of $x_i$ is a tautology
- If $nexists x_iin X_n:Defleft(x_imid X_nright)={''x_i=x_i}''$, then
$Defleft(x_imid X_nright)in Z: Z=left{{''x_i=f_i(textbf{x})}''mid f_i:textbf{x}mapsto x_iland x_inotintextbf{x}right}$; Thus, the definition of $x_i$ is circular for all $x_iin X_n$.
$square$
What this is supposed to mean:
It is impossible to have any system, including but not limited to groups, algebras, theories, and natural language, where every object is defined and no definitions are circular or tautological. As a system, mathematics itself cannot be closed without introducing tautologies or circular definitions.
So, is this correct and is there anything I can do to improve? Have I misapplied any terms? Is the notation (ignoring $x_iintextbf{x}$ which is a deliberate abuse of notation to save space) correct?
abstract-algebra proof-verification conjectures meta-math
abstract-algebra proof-verification conjectures meta-math
asked Nov 24 at 0:15
R. Burton
1417
1417
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32
add a comment |
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3011009%2fproof-that-it-is-impossible-for-every-object-to-be-well-defined-without-using-at%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
You are encroaching on a subject called mathematical logic that has been very extensively studied over the last 120 years. I suggest you study an elementary textbook on this topic, before you try to formulate metamathematical proofs of the kind contained in your question.
– Rob Arthan
Nov 24 at 0:32