Let C denote a universal set of commodities.
Let Q denote a set of quantities.
Let V denote a function V:C×C→Q.
Let P denote a set of people.
Let Vp denote a V-function associated with person p.
For all a,b,c∈C,p∈P:
- Vp(a,b)=Vp(b,a)1
- Vp(a,c)=Vp(a,b)∗Vp(b,c)
- Vp(a,a)=1
What kind of algebraic object is this?
You seem to be assuming Q is a group (since you're multiplying its elements, dividing them and talking about an element 1), but you're not telling us that it's a group - you're calling it a mere 'set'. This will make mathematicians say 'tut-tut'. I'm warning you because I've seen some of them around here.
Right.
- Q needs inverses, an identity, and a closed operation ∗. We might want more properties, like associativity, commutativity and total order.
- Vp maps elements of C×C into Q, but C and P are bare sets with no structure. V is an index. We can say that Q is an algebraic structure imposed on an indexed family of elements {Vp,a,b}.
You have to make up your mind on these issues before I can say anything interesting. Some choices are 'mathematically better' than others, in the sense that mathematicians can tell you more interesting things about them. Thus, I would want Q to be a group, and probably an abelian group. But order structure on it would be just distracting at this stage, because it throws mud into what is otherwise a rather beautiful question.
Thanks!
I’ll keep adding details :)
That is: it's beautiful if your set of people consists of one person. If there's more than one, you can separately analyze the situation one person at a time, since you've put in no interactions between people.
(This would be like talking about a set that is a group in two different ways, with no interaction between those ways: mathematically boring.)
RIGHT! And that is what I will do :)
Q can be a commutative ring.
Each person p is associated with a function C→Q.
The family of functions {C→Q}p is called an economy. It is the disjoint union of this family.
Denote the economy E, and the range of possible states of an economy E. A transfer is an update function t:P×P×C×Q×E→E, which takes a giver, a getter, a commodity, and a quantity for an economy and updates it:
t(pgive,pget,c,q,E) is E except where q in (c,q)pgive is now qprevious−q, and where q in (c,q)pget is now qprevious+q.
I would like help improving the formulation before moving on. There will be a set of states S to index the economy, to define t:Es∈S→Es+1∈S.
This is a different formulation I am liking.
Let there be:
- A group of states, (S,+), represented by the integers.
- A set of owners, O.
- A set of commodities, C.
- A commutative ring of quantities, Q.
There is a function has:S→O→C→Q.
There is a function willing-to-trade:S→O→C→C→Q.
The economy E at state S is identified with the set of values of the 'has' function.
There is a function
give:S→O→O→C→Q→has
which returns a new version of the 'has' function (in which owner 1 has q less quantity of C, and owner 2 has q more).
Here is an updated work-in-progress model I am quite happy about. I’m open to any comments, questions or criticisms. Thanks.
We extend ZFC with this signature:
Σ:=
{{Thing,Owner,Time,Amount,Economy},
{give,own,offer},
{}}
and these axioms:
- own:Time→Owner×Thing→Amount
- offer:Time→Owner×Thing×Thing→Amount×Amount
- give:Time→Owner2×Thing×Amount
- Economy∈AmountOwner×Thing×Time
Some observations:
- The ownership function tells us who owned what when. It describes the evolution of an economy over a continuum of states. But there are different possible such economic histories. That’s why an economy is an element in the set of all possible economies, which is the set of all possible ways of mapping owner-thing-time triples to amounts.
- give is a function which describes who gave what to whom when. It can also be considered an update function which takes an economy at time t and returns the ownership function of an economy at time t+1. In future versions of this draft, it may be crucial to differentiate between an economy at time tk vs. the set of states of an economy for all times ti.
- A constraint of the give relation is that at time ti, the amount a of a thing c given by an owner o1 to an owner o2 must satisfy an identity between ownt and ownt+1, which is that own(t,o1,c)−a=own(t+1,o1,c) and own(t,o2,c)+a=own(t+1,o2,c).