http://www.4shared.com/office/owdlH3mI/ ... ecisi.htmlHeres the link, bit easier to read.
Title- “ General Optimisation in decision making using logic”
I
Introduction
It gives out a simple theorem of logic, a statement, and a corollary.
The theorem gives out a simple max. way of solving for problems, either in finite boundary conditions or at infinite randomness.
The corollary examines how a sample point would deviate from the “max. true strategy” , as obtained for the group by using the theorem.
Applications:
Solved, within this paper,
1.)Firstly, for two problems of Game Theory – { Best matchup for 4 boys/4 girls , as well as Prisoner’s Dilemma (Iterative) }, it gives a scalable(in the sense best repeatable strategy) solution to both the problems in the real world. It also solves the same problems using more “precise” assumptions as well as lesser assumptions than game theory.
2.) Upon application to basic mathematics, points out to a question of mistake/misconception in Aryabhatta’s zero. Also tries to gives an explanation/definition for pi.
3.) Surprisingly,the same principles apply to physics.
Fresh and simpler approach to physics and mathematics consistent with the theorem.
Other possible applications
Can be applied, along with principles in maths, to problems where human element is involved.
Author - Nishank Gupta (NG) – IIT Roorkee(2009)
General optimization in decision making using logic
Statement 0: Any undefined quantity or let’s say infinity, I can assign a set of mean and deviation.Let me define this in two symbols "0" and "pi".
I might not know any specific “qualities” of this "0" and "pi", both might as well be irrational.
Let’s say I am studying a “property” of the undefined quantity. Hence, for multiple properties it can possibly have multiple mean, multiple deviation .{subsets}
Statement 1: Observations can only be made on the points of change.( Also till there is no change, no observation need/can be made).
Statement 2: With respect to change, there will be two qualities – one that of convergence, one that of divergence.
Statement 3:The more assumptions are made in a thoery, solution is only valid under the said assumptions, fails a lot more when the assumptions fail.
Defn:
Convergence- as changes occurs, collapses to a certain mean.(or restricts)
Divergence- as many changes, sometimes tries to converge to a mean, sometimes divergent, may as well be irrational.(eg pi in mathematics, human emotion(till date).)
Current No. of observations = N
Theorem : { C} R [V] , for this maxima weighted presence {C}, [V] on R give maxima truth.
{C} – Set of Constants.
[V] – Set of Optimized Variables.
R – Rules Applicable
Now,
we can say a Constant has a definite property of convergence, Variable has the definite property of Divergence.(essentialy C = will converge around some "0". V can diverge to some "pi". i.e irrationally never converges around at least one particular "0".("0" and "pi" as defined above)
{C} = w1*c1, w2*c2,w3*c3... etc. basically the weigthed average set of {C}.
similarly
[V] = w1*v1,w2*v2,w3*v3... etc, weighted average set of {V}.
R - Set of all the rules, under which {C} and {V} operate.
End of Defn.
Aim: To give a maxima/ minima output between, by the “presence” or “absence” of the weighted constants, variables that make up the undefined quantity.
Body: To arrive at any undefined quantity or infinity , the most logical way to do so is solve for the constants involved in the process by applying all the rules applicable in it, and then optimize all the random variables if needed using optimization techniques. The variables should be optimized last, first we should arrive at constants to simplify the problem.This is because if we assume the starting point of a theory from a variable. Theory will not be consistent when variable changes.
Note: we might not be able to say total "presence" or "absence"( in an maths allegory no exact 0 or 1 probability, still i can plot a spectrum.
Full: In any abstract or random infinity to arrive at ,lets say the constants involved are C1,C2,C3,C4….
The rules are R1,R2,R3,R4….
And the variables are V1,V2,V3,V4…..
Now, the most important thing would be to find the constants first.
Constant can come from a certain minimum assumption (wherein you made the mean of a min. variable as fixed, making it a constant).
Eg. Sun rises in the east ( only point of view of observer on earth)
Constant could be a statistical or mathematical fact, can come from general observation.
There are only 3 points of observations you can have for finding constants.
1.) In the en - masse (larger picture/integration) of things do we observe a constant behaviour?
2.)In the linear observation (single observation considered). do we observe something constant?
3.)In the way observations change , can we observe any constant property in the change?
Repeat: ( Detailed Explanation Appendix 1)
Variable – cannot be solved for exactly, unless we make it a constant, using one more assumption- in which case my error increases. I can only optimize a variable.Yet if i do the best optimisation the error would be very small. I would have best solved the problem to the desired accuracy if my optimisation was best(in the sense of robust).
This since it has divergence present too.
Examples of variables : emotions, people’s thoughts, speech , player’s form, weather,unknown quantity like the amount of charge left in the battery, would be a variable unless you can solve for it,pi in mathematics.
Repeat:The best(most robust) way to arrive at an abstract quantity or quality would be to first solve for the constant/constants in the equation, simplifying the problem, then optimize the variables in it.(basically first try and solve it with minimal assumptions, then assume more if you still cant solve it.) Let’s say the rules R1, R2, R3, R4 apply to the problem.
I am stressing robustness because sometimes problems are required to be solved for most accuracy, time is not a consideration.
Lets say that you have to take a decision between 0 and 1, fo x no. of observations.We can calculate the probability spectra around "0" and "pi", for the no of observations done till current "N".Essentially i can assign a probability min/max. solution on the presence or absence of constants and variables viz depending on how many weighted constants and weighted variables found in the current observations.This we can compare with all the previous outputs to give a current min/max probability( at what deviation it stands to the mean).We can now choose between the best and the worst probabilities, till current time of observation.
Since the process could be infinitely random, it could be that you may not arrive at absolute 1 or 0, implying that there is no absolute truth or false, unless you solve it using constants and rules alone. This would be the most robust way of decision making using observations.
End of Theorem.
Explanation:
Statement/ Mean and Deviation:
Any undefined object I can give some mean and deviation, a set of {0},s and {pi},s
First ,
We take a collection of the objects, see their mean and then try to identify if the collection has some definite property.
Basically, certainty increases in a larger set.
Eg. Human emotion.
If I give an individual’s emotions a mean and a deviation, then with no certainty can I say anything about the properties of that individual’s emotions.
If we take a collection of individuals, my certainty increases in a large enough set.
i.e in a large enough collection of soccer games, the average confidence of the average player from the home side is greater than that of the away side. ( This assumption would be way more fair than any assumption I make about the individual) So I fix the average confidence(home) as more than average confidence(away). I found a fix property in the mean.
The property being, C(H) > C(A). I found a constant.
Detailed Explanation –Appendix 1.
Corollary:
Now, for the undefined quantity, once we have obtained a maximum true strategy, or maximum true observation, identified by the “presence” of all/most constants and variables, on the rules-
For an individual observation, the “probabilistic” deviation from the max true strategy is proportional to the absence of the same constants and the variables. Deviation also identified using weights.
Basically, we can just see the deviation from max. true strategy instead of from minimum true strategy, to check how much an individual element might deviate from the maximum.
(Only used in Prisoner’s Dilemma).
Application in Game Theory.
Game Theory Problems.
Application in Game Theory.
Q1. John Nash went to a bar and saw 4 girls. He went there in a group of 4(including himself).
He wanted a strategy for best pairing up of 4 girls and 4 boys. The boys were to make a strategy in approach. Given is the order of looks/alpha to omega.
A B C D are the girls. {G} – set of girls
1 2 3 4 are the boys. {B} – set of boys
Sol: ( Method must be best scalable to apply the same strategy/ decision making in real world - So that problem is solved en-masse(bet on the highest probabilities).
or as demonstrated you try and bet on the emotional mean of society, to maximise your chances of winning, rather than optimising from self or for one general case)
Now applying logic.
Deriving the smallest assumption from the emotional mean of society.
Assumption : Emotional mean in girls of lets say ego is greater than boys.
In the sense girls are more likely to say no. E(G)>E(B)
Now, this is the fairest assumption ( also applies to most other animals around us, mate selection upto the female). This assumption comes from an observational mean of society. Might not apply to an individual girl/boy, but applies en masse.
So we have a constant with us ( which i obtained by applying min fair assumption)
E(g)>E(b)
The statement says, emotional mean of Ego in girls is greater than that of boys, en masse.(when concerning game)
Rule. : Game - All of them desire to match up. (desire means can still say no, but playing the game, else no game)
[ defining rules of game. again this is a min rule, just like min fair assumption and since E(g) > E(b), one of the girls can still say no, the desire for matchup would be more for boys from assumption]
Now for defining a strategy among boys, they have a variable to optimise - the girls ( their behavior en masse is a variable, for the boys they must use max strategy for max value desired)
Using an optimisation technique – Defining a line of sight for girls.
A - would be looking at 1, 2,3. Obviously highest chances for 1.
B- would be looking at 1,2,3.
C would be looking at 2,3,4.
D would be looking at 2,3,4.
I assigned them a mean and deviation in line of sight based on E(g). 1 is at more deviation than 2 to D.(giving a range of choice- no need to give it more range)
Looking at least E(g) girl , D, chances are less she'd go out with 4. if 3 goes and asks she might still refuse. For the most robust way, to get most number of girls the best risk reward would for 2 matching up to D.so i sacrifice 2 for D. (Note: it will eventually match up E(g) to E(b), less choice less E difference in sum, from rule)
hence.
2 = D
Now,
for A, she only has a choice between 1,3 . 2 is gone.Compare this with all {1,2,3}.
The chances are higher now that she pairs up with 1. ( if she still says no, well she'd have said mostly no anyways,she would have quite probably said no to 2 and 3)
If A says yes,
1=A.
now ,
B,C= 3,4
Now for B,C the only choices left are 3,4.
we can offer 3 to B first, if not then 3 to C.
If A says no you can get the best strategy anyways by now offering 1 to B.
This will maximise your chances of maximum boys pairing up.
The robustness of this method can be easily checked with the theorem.
In the sense that first i have bet on the constant, which was arrived at from a statistical mean, then optimised the variable later.Essentially i have bet on a fact first.
In this we are only betting on the emotional observable mean of society for max chances of winning.
Well so steps,
2 -- D
1 -- A
(3,4) -- (B,C) { Apply If’s else’s)
This solution is more scalable in the real world than the one obtained by
applying Game Theory.
Q 2. Prisoner’s Dilemma.
Similarly, we can apply the same method for Prisoner's Dilemma Problem .
Two prisoners A and B
Emotional mean Fear , F(A), F(B)
If A says guilty for B, B is imprisoned, for lets say 9 years.
If A says not guilty for B. B is imprisoned for 2 years.
similarly for B, and if both A and B say NG- Not Guilty, both get 3 years each.
Scalability.
Rule ( Both want to use highest probability strategy)
Now for real world, the problem is A isnt exactly sure what B is going to say.
If both A and B are to have a strategy, knowing the rules of the game, and the problem.
Both should just maximise their risk/reward for scalability. ( knowing if they use this strategy they win max en masse)
Both should just say NG. ( tradeoff for their F()). If a group of prisoners employ this strategy, they'd win maximum.Basically payoff for the group is much greater than individual's risk.
Solution:If iteration’s are allowed. Let me take a case. Prisoner’s A and B.
Case : One player is playing the game again and again. He remembers the previous inputs and outputs of the iteration and his real time decision is influenced by the risk/reward estimate he got from the previous iterations.Let’s say A is the subject. B is variable i.e B’s are changing for A.
Now, we have to optimise the individual A.( A and B being both the prisoner’s).
I can only optimise an irrationality, cannot exactly solve for A. Give him a probabalistic mean and a deviation from max . truth (his deviation from the mean of A's). Doing so would can help B in predicting A’s behaviour such that B can now Maximise his own Risk/Reward, based on A’s previous decisions.
Let us examine how A would deviate from the maximum true strategy of saying NG, every time.
Assumption 1: Deviations being controlled by an emotional quotient of fear E(F).(Only reason A would want to say Guilty would be out of fear of B pronouncing A Guilty, or also greed E(G), but more E(F), since strategy has been discussed).
Assumption 2:Memory function M for A. How many past games does he remember for decision making. M(A) = some n.
Note: All the assumptons are made for a mass of A’s . I say individually they might not hold in one A, but in let’s say 100 A’s the mean would act on these minimum assumptions.
Now,
Player A would deviate from rational decision making when E(F) goes beyond a certain point.
The feedback for A would be B’s decisions.
A would try to maximise his risk/reward, on the next iteration, based on previous iterations.
Now, lets say for A, B’s decisions would be infinitely random. Since B keeps on changing. (only A is fixed, many B’s - from case)
Giving out levels on E(F) where A’s decision making might deviate from mean.
0,1,2 --
Between 0 and 1 - most probability of rationality.ie. least deviation.
Between 1 and 2 - lesser probability of rationality and more deviation.
Beyond 2 - even lesser rationality and still more prob. of irrational decision. and so on.
Essentially, give {A} , set of A's a mean and deviation from max. strategy (NG), and then observe how individual A, diverges from that mean of {A} or give a probabalistic deviation of A from the prisoner’s mean to best predict his outcome.
Now, first solving for A ( to determine how A deviates from the mean).
A will try more to deviate to guilty if it has received as guilty more from the previous iterations, in the memory function.Basically E(F), fear or A has increases with G past inputs.
It will try and deviate to Guilty more if the other party says G.
i.e
A(mean) B
NG NG
NG G
NG G
--- ---
A might want to go for a deviation(Assum 1) on iteration 3, since the last time B had said Guilty, even though A said NG.
It would want more on 4th iteration and so on . (Assumption will hold unless E(F) decreases instead- much unlikelier case still)
The decision making would change only on the approach/breaking of some threshold value (The no. of hits A(mean) can take to definitely diverge to an irrational decision)
This threshold value can actually be arrived at after social experiments. But the value would only apply more precisely to a mass of A’s {A} and not to any individual A. It would be more accurate for the en-masse, rather than for individual A.
Lets say threshold would be, when E(F) crosses level 2.
we say threshold value = k times (punishment from B)/(payoff from max rational strategy)
Both punishment and payoff values are derived from Memory function of A.
So, once i know the threshold for {A}.
If now A is playing , for an iterative solution i can just see how A’s individual threshold differs from that of {A} i.e more threshold or less threshold, and then the likely or more probability decision that A is going to make on the next iteration if i know his memory function.
Each time A deviates faster from {A}(mean) i add a +1, and each time he deviates slower i subtract a 1, from 0 . Present value would be the current state of A, based on which i want to predict A’s next move.Values will give a probability spectrum on A.
In this way B can now actually decide to "punish" or "reward" A, depending on if A has a tendency to deviate "faster" from {A} mean or "slower" from {A} mean.
I can simply examine on the point of divergence to maximum predict A.
Game Theory only gives the chances of convergence given a long enough time
Examining now from Statement 3:
Assumptions of Game Theory.
"Game theory is a method of studying strategic decision making. More formally, it is the study ofmathematical models of conflict and cooperation between intelligent rational decision-makers.
The first known use is to describe and model how human populations behave. Some scholars believe that by finding the equilibria of games they can predict how actual human populations will behave when confronted with situations analogous to the game being studied. This particular view of game theory has come under recent criticism. First, it is criticized because the assumptions made by game theorists are often violated. Game theorists may assume players always act in a way to directly maximize their wins (the Homo economicus model), but in practice, human behavior often deviates from this model. Explanations of this phenomenon are many; irrationality, new models of deliberation, or even different motives (like that of altruism). Game theorists respond by comparing their assumptions to those used in physics. Thus while their assumptions do not always hold, they can treat game theory as a reasonable scientific ideal akin to the models used by physicists. However, additional criticism of this use of game theory has been levied because some experiments have demonstrated that individuals do not play equilibrium strategies. For instance, in the centipede game, guess 2/3 of the average game, and the dictator game, people regularly do not play Nash equilibria. There is an ongoing debate regarding the importance of these experiments.[10]
Alternatively, some authors claim that Nash equilibria do not provide predictions for human populations, but rather provide an explanation for why populations that play Nash equilibria remain in that state. However, the question of how populations reach those points remains open."
"" Source : en.wikipedia.org/wiki/Game_theory
Game Theory applies to a rational set of thinkers. Eg. Computers are wholly rational. It does not exactly apply to people.It assumes that and tries to model human beings from scratch. Tries to give an optimisation for a variable first.
My point of argument is not that optimization, I know it is right, but it is still under those assumptions, which do not hold in the real world. In the real world, this can solve the same problems by using less assumptions, which will include the set that people are rational/irrational.
Well since i thought that the fault was in its assumptions, i might as well question the assumptions in other theories and try what happens, using this theorem.
Application to Mathematics
Basic assumption in mathematics is zero. Irrational numbers recur around rational numbers and rational numbers around irrational, on the number line.
Zero is a constant, wholly rational.
Now, assume if it has an irrational deviation from its mean, i.e you can never tell from 0’s Point of view, but still not hard to imagine very much.
It can pretty much have both irrational as well as rational components.
The rational component is fixed around a mean.
Well, no equation in mathematics can solve for this paradox, through mathematics. (you have to put it equal to zero). Also, Limit tending to 0+, and limit tending to 0-, point of convergence of both.
Well nonetheless it is assumed to be static. Which is not really a problem, since rationally we can only solve things by assuming a static starting point , zero. You have to define a zero to solve for everything else in mathematics. But the next assumption from there would make the problem even more complex, and specific.Also, more prone to error.
Coming on to pi.
Well, in terms of logic, attempt at defining pi is equal to.
Linearity of a circle / Linearity of a line
(line’s circumference/line’s length), for pi line’s length equal to diameter.
A circle might not have the property of linearity. Constant for a circle is, it has a property of bend or circularity.
Hence, pi is an error.
Let me explain more.
For circumference,
{Pi(r+theta)^2 – pi(r)^2}/theta , Limit. theta tending to 0.
We get, 2pi*r + pi*theta ,Limit. theta tending to 0.
Definition holds quite well except when r also closes to 0.
Also basically you are trying to cut a circle and straighten it into a line. The attempt will always have an error pi.
The number line might as well be discontinuous at pi.
The length, breadth , height we see around us are all closed spaces, why not the number line?
No, the number line is open.
At pi, imagine a slight bend, which you straightened into a line, to solve further using rational means, since you cannot anyways solve for that slightest of bends(can’t really cut it and make it into a line).
So, the attempt at finding value of pi is , the attempt to define an irrationality, in terms of rational numbers.
But, we have rational numbers between irrational too.
So a more correct form would be Max. rational distance between 0 and pi. Easier to define rational distances around irrational numbers. Both taken as symbols could denote min, as well as max. irrationality.(or recursive).(Number line being circular or…)
Hence, as you look rationally, more and more closer to 0, you will always find differentiable elements, or more irrational. Or, there would be no rational fractal/set.
The number line is infinite.i.e sample space is open
,in reality there is no open sample space.
at pi you make a mistake
if you start from 0.
if you fix 0 as a constant, you will never arrive at a rational value for pi.
pi is just a bend on the number line, the minimum of bends though.
No sample space is wholly open w.r.t to the quantity we are studying.
The divide by sign. Let’s say 4/5. 4 is defined from 0,5 is defined from 0.
now it is very true that probability is 0.8, but if 0 itself is irrational,then probability
is sometimes converging to 0.8 and sometimes diverging from 0.8, but it is very very close to it.
same logic.
0.000004/0.000005. would be more divergent from 0.8 than 4/5 was.
the more you differentiate things the more error you make.
Coming back to pi.
The basic statement in mathematics is distance between 0 and 1 is unity.( Would not really like to cite Brahmagupta’s Rules too)
Or is rational.
Well so coming from bend, d/dx of a circle is rational . i.e equal to 2pi*r if pi is also fixed.
Which is circle having the property of linearity – in its differentiation.
Again, a circle has no such property, it is just different.
For a circle.
d/dx^2 != rational. (!= not equal to or not similar to)
d/dx^3 != rational.
So on so on. , however a line can be defined as max you can enclose in that area, within a certain accuracy.
It should have been [pi]r from the start for a line.
(Pi*r)^2 for an area and so on.
Well, in the real world, no exact straight edges, all end up in circles, deeper you go, just find a circle, closed loop.
Even cosine, sine functions would fail, defined for sharp triangles, for small triangles, angle will become irrational too. Well so mathematics fails at a very microscopic view of thingsi.e comparing symmetry in the real world at microscopic scale. It would still hold pretty well for large values, since that error in symmetry is smaller now, compared to the value.
- Detailed Explanation Appendix 3.
Close.
Logic
Logic: Elements in logic.
Set
Symmetry/asymmetry in comparison
Change
Recursion
Error
Reset.
Set: Collection of symmetrical objects. Then subsets and supersets, based on what line of symmetry.
Comparison between two sets can be done on point of symmetry. ( =0).
Can also be done, if asymmetry, using “error” e and then symmetry.
There will be a change due to observation, and also, only change can be observed.
Once compared sets can be “clubbed”, around points of symmetry.
Starting from a basic fractal, a fractal set can be obtained.
The whole process can repeat on different “scales”.
The error is best observed as from the mean , rather than to a zero (just another mean).
Since we can observe basic “up” or “down” from mean. There would not be any problem even if mean is irrational, if the error is large enough – the difference can be quantized rational.
But if we observe the error as to a mean, then error itself will sometimes converge, sometimes diverge to the mean, if mean is also irrational.
These are the basic elements in logic.
Now,
The points in symmetry, can be either linear or circular
Also,
Simplest Equation in Nature.
( [ {A} = {B} ] )Probability of being equal.
{A} is set of symmetrical A’s.
{B} is set of symmetrical B’s.
[] – Repeat function, things might repeat asymmerically.
The aim is the comparison between, set of A’s and set of B’s, to get a line of symmetry.
The equality symbol will only hold a probability, since the act of observation will also bring about a change.we can assume rational symmetry.(we miss out on a few cases, but still again to solve it we are using minimum assumptions)
(or)
Observing along a set of A’s and comparing them to B’s. If all changes between both are symmetrical , then A would be symmetrical to B, with an error in observation e.
Statement: Change is a universal constant.
Ergo, even if you observe change, there will be a change in change.The “nature” of change is not linear. So for a long enough observation, eventually the feedback would be “bent”.
Thus, you would find a bend eventually, even if you go in a maximum straight line.
(Due to recursive nature of things, even if you run along symmetry, you will eventually find an asymmetry).
Now, along change there will be both attraction as well as repulsion. For balance, equal attraction and repulsion. Assuming balance.
Detailed explanation – Appendix 2.
Universe is more around logic than maths or physics.
Maths and physics are based on logic.
Appendix 1
In an infinite set of games, with fixed constant rules for all the said games, a general way of optimizing your bets.
First we identify useful constants. The constants could come from comparing a general mean of collection of things to another mean, simply as the mean being greater or smaller than the other i.e a useful property in the sum of things, which does not occur individually. Another way of finding a constant , would be to observe the change in the game. i.e if the change in a property of the game is constant or helps me arrive at a maximum probability of winning. Another constant, would be a simple rational constant. Eg. the number of players in the game is fixed.
The rules would be given, for the said game.( games could all have a variable output, but follow the said rules)
Lastly, we identify the variables like player’s form, weather, change in pitch conditions. These things cannot be exactly fixed around any mean.
Since, the number of games is infinite, I can assign a weighted average to each of the constants, then to each of the variables, depending on how much they impact the result of the game.
Lets say constants found are C1,C2,C3,C4.
Since, I have an infinite timeline, my best strategy of betting, so as to optimize my chances of winning –more rationally than by intuition, the best way to do so would be to identify the occurrence or recurrence of the constants on the timeline. I need not bet if there is no constant available at this time, since there would be no point in calculating the probability of winning if I start my bet on a variable. My maximum bets would be placed, when I see the concurrence of maximum constants. ( or you need not vary the bet size, simply place bets only when most constants are available, since anyways you have infinite set of games).
Let’s say at time t1, concurrence of constants, C1,C2,C3,C4.
At this time, I would want to optimize my variables now, so as to further identify my probability of winning.
The main point is that the process has to be scalable, so that you have you have a max rational strategy to apply.
Applying an analogy to soccer.
Eg.Suppose that you were given the problem of making money on a sample of infinite soccer games, there is no obvious or logical solution to the process, generally it would involve an emotive decision on part of the decision maker or the better.
First we’d try to solve for all the constants in the game,
ex: No. of players in each game in each side is 11 etc. But the individual players, their forms , the team’s performance etc are all variables. To set either as 1 or 0 would require an emotive judgement on part of one betting.
Now, the constants involved in the process could come from a statistical mean of lets say a large sample set of soccer games, using a fair set of assumptions.
Assumption: the player involved in the games are emotive and the average confidence of the average player in a team will influence the chances of winning.
The average confidence over a set of lets say a 100 games could be defined as a side being home/away.
The average confidence for average player of the home side over a set of 100 games would be larger and the chances of a home’s side winning would be larger.
Eg : in a set of 100 games lets say home side would win more than 50.(statistical mean)
Thus we have one constant E(C) home mean > E(C ) home away.
Similarly,
Stating that average fatigue of the average player will influence the side’s chances of winning.
The average fatigue over a set of lets say a 100 games could be defined as the average number of hours the average player has slept, the previous day before match.
More chances of less fatigue players winning the games.
Thus, one more constant.
E(F) More sleep < E(F) Less sleep ( Fatigue of those who sleep less is more on an average).
You cannot really make money by betting on just one constant.
Explanation: Even though for 100 games, the home side would win more games on an average (The quality of the teams will average out if I take a large enough sample space of games).
The money you make will depend on the rate being offered. Now, If a simple bid/offer rate is floated, since everyone knows about the home/away constant, this factor is automatically factored in into the rate through a feedback loop. Yet it is a statistical constant, better than any variable I have with me.
I look for other constants like fatigue.( the constants like no of players in a team, no of teams etc do not help at all, no difference between the two teams )
Now, to give a scalable strategy for betting on soccer, I simply optimize my variables such as a player’s form, team’s form, weather, as much as I can and choose only the games which have all the constants present, as well as all my optimized variables , to get the maximum probability of winning.
I have an infinite choice of soccer games, if let’s say in a game I have a few constants absent, or the variables are not optimized, I can simply choose not to bet. Since I have an infinite number of games anyways, I’ll find other games with constants being applicable as well as variables optimized.
End of Appendix 1
Appendix 2
Truth is defined as the value arrived at after thought for observation, in your sample space. The thinking process has both rational and irrational parts. Hence decision making is both rational and irrational, logic and emotion. Rationality and irrationality. Rationality is arrived at by first assuming the change in observation linear. D/dx = some constant.
Explanation:If I say the simple fractal for any object would be a line and circle. Even minutely , every line would have a circular end. No exact sharp corners observed in this world.( You can only call them sharp at an approximation, the more you observe , the more that approximation will tend to go wrong.) So rationality would be the maximum straight line you can draw or the maximum unbiased you can go, till a curve or circle is arrived at. Now, you optimize the smallest curve to be a straight line (d/dx= c, or if not d/dx2= c ,etc)(min assumption), and solve further(optimize), to arrive at the maximum rationality in your observations.
Basic logic by which you can arrive at the truth, is solve for the constants in the problem, apply the rules check if problem solved, then optimize another variable to become a constant. Every time you do this, check for the maximum truth obtained, i.e you get a truth maxima or minima along your observations.
Each time you go to measure the change, the measurement is through observation. For measurement you applied mathematics which had a basic assumption that 0 is fixed. One can only measure the change from yourself, or from the designed instrument. Since every instrument is rational, it would miss the irrational part.I can simply define the change as positive or negative from a mean, and then as more observations occur, more positive or less positive, from the previous observations. Same, with negative change . Only the change is fixed, your observation still has an inherent flaw for measuring it. If you take the first change to be linear. Eg. Assuming that 0 , which is an undefined quantity or infinity, has a mean and no deviation.
Lets define any unknown quantity, undefined thing as infinity[A]. Alone, [A] has no property. You can observe lets say a set of {A]’s and say the mean of this observation is ‘a’, a statistical constant from observations and give it an irrational deviation {[D]}. i.e set of [D], which when I add or subtract to mean, give me different [A]’s .
Now the maximum possible truth you can arrive at would be to solve for minimum ‘a’, minimum is being defined as least assumption constant. Constant has a basic property it has a mean and no deviation. Random variable has no mean, it sometimes converges or diverges to a mean.
Now, the equality symbol only has a probability , since you can only try and measure the change in A w.r.t B or vice – versa. If we assume both A and B to be rational, minimum first assumption, since without this we cannot compare. Or if we compare both their rational parts – then the equality symbol holds, since we can never say two irrational things are equal.
Hence change on a long enough scale can never be linear, somewhere along it will take a curve or bend – i.e things in nature have spiral behavior, or to state things simply, there is no such thing as an exact straight line. Mathematics maximizes rationality and assumes this change to be linear, by fixing 0 as a rational beginning of number line.
It does not hold true if the starting point 0, is not defined as a constant, but as a variable, which has both a mean and a deviation. Physics is the application of mathematics to real world observations.
Well so you were only trying to differentiate things from yourself.
First in length, breadth, height. Then mass , then time etc. Points of change.
Mathematics only applies in a model where the starting point of a thing is linear. Real world is more complicated, in the real world that assumption may not hold true.It only has a probability of holding true. You can only observe a change from a state.If I fix my starting point of things to a variable, may or may not be a constant i.e may or may not have affixed mean. But a collection of these things might have a few properties, might fix its mean around a few points eg{a,b,c,d } constant means, around which irrationality can be defined, as the deviation from the mean.since a change you cannot measure exactly, your observation will be inherently flawed. Basically there are only fixed points on irrationality, not irrationality between fixed points. To arrive at the max truth I would,
{[A]} how close to {[B]} how close only has a probability , which keeps on improving to arriving at the maximum rational thought in observation. If you say two things are exactly close. Eg 1 is a fixed distance away from 0. i.e 1 is 1 away in itself, your first assumption of 1 being mean is wrong in the real world, if you apply this mathematics in the real world.the problem is how many times a unity repeats in itself to give the maximum rational thought process. You cannot rationalize thinking beyond that. The other things are irrational in the decision making process. So if I base my number system around infinities or unknowns, rather than around constants i.e rational numbers. (there is no rational number) number in itself is a linear approximation of change. If I do that, there is no 0 or 1 , no exact 0 or 1 but we can arrive closer and closer by integrating the observation or by differentiating it. By seeing a collection of things or by seeing a difference in them. Since there is no exact 0 or 1. No exact truth or false. But for any decision making process we can give it a maximum optima based on past observations. The future has an irrational part too, is a result from this theory. And everything from Einstein’s relativity to number system. The problem of irrational numbers recurring in a rational number system, and applying that rationality to the real world. The most optimal way to arrive at the truth was simply based around the irrational things. The least effort method would be.
Desired change using minimum assumptions – Apply the rules of the game(question what is 0 or 1)(maxima or minima from observation) = Change seen? 0 or 1(1 if best till now , otherwise 0)
Recursively, increasing or decreasing the assumptions.
Prediction of GUT:
Quantity defined as mass, for the super set of universe , (i.e amount needed for the whole set to be in balance) compared to the quantity of mass found by rational means
is square root of (p)- 1. This can be checked easily on even wiki.
Solves for dark matter.
Uncertainty in symmetry solves for higgs boson.
Eg. First assumption linearity. That starting point of anything is constant. i.e 0 with just a mean and no deviation. i.e no irrational part in it. We get mathematics
A=B , the equality symbol has a 100% probability.
Second Assumption. Linearity in change in Linearity
If B=A, C=B, A=B, since ‘=’ symbol was probabilistic , you arrived at a lesser maxima of the truth.
Physics is derived from this, since first based on mathematics, then change in things if you apply maths to ordinary life and observation. You would assume you are the starting point. Which is a mean, but in reality your thought process has both a rational and irrational part. Logic and emotion, from which all thought is defined. Logic is linear to rationaltyi.e the process converges to a mean, and emotion has the property of deviation and irrationality, that it diverges in essence, has no true mean, and hence is irrational, has some deviation, what you try and measure can only be some change.
End of Appendix 2