Can You Help Me Answer Post #4 in Line 2?

  • Thread starter Thread starter sneaky666
  • Start date Start date
  • Tags Tags
    Functions
AI Thread Summary
The discussion centers on the relationship between two functions, f(n) and g(n), both mapping natural numbers to natural numbers. It questions whether g(n), if not an upper bound for f(n), can be considered a lower bound. Participants highlight that f(n) is arbitrary and may not be bounded, raising concerns about the implications for g(n) as a bound. There is confusion regarding the nature of g(n) and its selection in relation to f(n). The original query remains unresolved, emphasizing the need for clarity in addressing the questions posed.
sneaky666
Messages
64
Reaction score
0
Lets say if g(n) is not an upper bound on f(n), then does that mean g(n) is a lower bound on f(n)?
Can anyone help with this please?
 
Last edited:
Physics news on Phys.org
depends: how did you find g(n)? does f(n) have to be bounded at all?
 
They are functions that map N to N (natural numbers).
I guess f(n) is just an arbitrary function.
 
They are functions that map N to N (natural numbers).
I guess f(n) is just an arbitrary function.
... good, what I figured, and the answers to the questions?

Since f(n) is an arbitrary mapping N to N, does it have to be bounded? Can it not be unbounded in both directions? What does this say about g(n) as a bound?

You did not say that g(n) is arbitrary - so how is it found? Is it selected from all possible N to N mappings to have some special relationship with f(n)?
 
f(n) and g(n) is arbitrary. Both map from N to N.

I think that the statement in the first post is true but I just don't understand how to show this...
 
Line 2, post #4 remains unanswered. It is a repeat of a question asked in post #2.
(If you did answer it, I missed it.)

If you do not answer questions I cannot help you.
 
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