MHB Proof of Knaster-Tarski Theorem

  • Thread starter Thread starter Fermat1
  • Start date Start date
  • Tags Tags
    Proof
AI Thread Summary
The discussion centers on proving that if F is a monotone function and C is the union of sets invariant under F, then F(C) equals C. A participant questions the correctness of their proof, specifically regarding the relationship between elements of C and subsets X of A. They express uncertainty about why an element B in C implies the existence of a corresponding subset X such that X is a subset of F(X). The conversation highlights the need for clarity in establishing this connection within the proof. The thread ultimately seeks to validate the proof's logic and completeness.
Fermat1
Messages
180
Reaction score
0
Let $F:P(A)->P(A$) be monotone and $C$ be the union of sets whose image is invariant under F. Prove $F(C)=C$

https://i.stack.imgur.com/3Wjdg.png
 
Physics news on Phys.org
What is your question?
 
Evgeny.Makarov said:
What is your question?

Hi, my question is my proof (in the image) correct?
 
Fermat said:
$C$ be the union of sets whose image is invariant under F
So, if I understand correctly, $$C=\bigcup_{X\subseteq A}F(F(X))=F(X)$$. But then it is not clear why $B\in C$ implies $B\in X$ for some $X\subseteq A$ such that $X\subseteq F(X)$.

Why don't you type the proof as text?
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top