Forward referencing in mathematics

  • Thread starter Thread starter V0ODO0CH1LD
  • Start date Start date
  • Tags Tags
    Mathematics
V0ODO0CH1LD
Messages
278
Reaction score
0
In most programming languages, mentioning an object inside it's definition can cause a lot of trouble at compile time because what's being mentioned doesn't technically exist yet.

But in mathematics is "forward referencing" allowed? Can I, for instance, define a set and use the set being defined in the definition??

For example, using set builder notation:

S = {x in X : P(x)}.

Where the formula P makes mention of S? Like,

S = {(a,b) in AxB : for all b' [((a,b) in S and (a,b') in S) => (b = b')]}.

Is that allowed in mathematics? If not, is there always a way to define things not mentioning them? In the case of the functional relation above, how would I do it?
 
Mathematics news on Phys.org
V0ODO0CH1LD said:
For example, using set builder notation:

S = {x in X : P(x)}.

Where the formula P makes mention of S? Like,

S = {(a,b) in AxB : for all b' [((a,b) in S and (a,b') in S) => (b = b')]}.

Is that allowed in mathematics? If not, is there always a way to define things not mentioning them? In the case of the functional relation above, how would I do it?

Unless B is either empty or a singleton your definition of S makes no sense anyway. So I would work on fixing that first before worrying about the whole "forward referencing" issue.
 
My second definition of S does not matter, it was just an example.. You can forget about it completely if it helps. The actual question has to do with referencing objects within their definition. I'm just wondering if that is allowed or if it raises some contradiction.
 
V0ODO0CH1LD said:
I'm just wondering if that is allowed or if it raises some contradiction.

If people are careless with their writing, then it happens sometimes. In principle one should be able to avoid this however.
 
I don't see any reason why you can't make a valid recursive definition, in a similar way to defining a recursive function in a programming language. But you need at least one alternative in the definition that is not recursive.

But be careful - if you try to define "the set of all sets that are not members of themselves", bad stuff happens :smile:
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top