I was trying to do exercise 1 on page 30 from some logic notes. The question was to show:
t∗A(a1,…,an)=tA(τA1(a1,…,an),…,τAm(a1,…,an))
I was trying to do it by induction on length of L-terms. I was having trouble with the base cases. When |t∗|=1 then its either a variable or a constant. Lets consider the constant which seems easier. In that case t∗(y1,…,yn)=t(τ1(y1,…,yn),…,τm(y1,…,yn))=c_ for some c_∈Lf. What confuses me is what happens to the above once we bring the interpretation in the given L-structure A. What is clear to me is:
t(τ1(1,…,yn),…,τm(y1,…,yn))=c_
if we interpret t in Awe would get:
tA(τ1(a1,…,an),…,τm(a1,…,an))=c_A=c
whats not specifically clear to me is if I can just bring in the interpretation inside to the tau's also. If I did that it feels like cheating, nearly as if I just asserted what I wanted to prove instead of actually proving it. Or am I allowed to just pretend that I can evaluate τA(a1,…,am)? Like it feels very weird to me to assert:
tA(τA1(a1,…,an),…,τAm(a1,…,an))
without proof or anything. I thought that exactly what we wanted to prove, that evaluating the top L-term trickled down to the remaining L-terms. What exactly makes:
t∗A(a1,…,an)=tA(τA1(y1,…,yn),…,τAm(y1,…,yn))=c_A
correct?
Intuitively I know that evaluating t gives just out the constant and that we can ignore whatever was fed into the L-term since we are just outputting the constant regardless. Is that why its valid? Because we would have ignored the input not matter what it was and if it was τA(a1,…,an) or any other element of A would have not mattered.
Regardless of the answer, it seems that assuming τA(a1,…,an) evaluates to something assuming the hypothesis (i.e. τ could be any arbitrary L-term, including of the ones in the form of the theorem we are trying to prove. Thus, it might be we need to assume the theorem to be true about composite L-term evaluation for us to assume τA evaluates to something sensible). So as far as I can tell that should be part of the induction hypothesis (or its only valid to say we have access to tau evaluated on the L-structure by the induction hypothesis, since that could also be of the same for as our hypothesis). So the crux:
τA(a1,…,an)
is actually something I can assume I can do without assuming what I am trying to prove?
Answer
Just to be clear about notation, t(x1,…,xm) is a term, τi(y1,…,yn) are terms for all 1≤i≤m, and t∗(y1,…,yn) is the composite term t(τ1(y1,…,yn),…,τm(y1,…,yn)).
I'm confused about why you write "assuming τA(a1,…,an) evaluates to something assumes the hypothesis" and "am I allowed to just pretend I can evaluate τA(a1,…,an)?". Given any structure A and any term τ(y1,…,yn), there is a function τA:An→A (this is the first definition on p.29 of your notes). So yes, of course you can evaluate τA(a1,…,an). This is not what the problem is about.
Ok, so as for handling your concern about the base case. Suppose t(x1,…,xm) is the constant symbol c. Then also t∗(y1,…,yn) is the constant symbol c, and the evaluations tA:Am→A and t∗A:An→A are both constant functions with value cA.
So the left-hand side of the equation you're supposed to show is t∗A(a1,…,an)=cA. For the right-hand side, suppose τAi(a1,…,an)=bi. Then we have tA(τA1(a1,…,an),…,τAm(a1,…,an))=tA(b1,…,bm)=cA.
You write "Intuitively I know that evaluating t gives just out the constant and that we can ignore whatever was fed into the L-term since we are just outputting the constant regardless. Is that why its valid?" Yes!
No comments:
Post a Comment