Difference between revisions of "Economic definition of true love"

From edegan.com
Jump to navigation Jump to search
imported>Ed
m (Protected "Dating Ed" [edit=private:move=private])
imported>Ed
Line 8: Line 8:
  
 
then please stop by my office (F533) at the Haas School of Business ([http://maps.google.com/maps?msid=218233511539606995594.0004adfa2636c2d290827&msa=0&ll=37.872008,-122.252512&spn=0.011501,0.015535&t=m&z=16&vpsrc=6 map]) at your earliest convenience.
 
then please stop by my office (F533) at the Haas School of Business ([http://maps.google.com/maps?msid=218233511539606995594.0004adfa2636c2d290827&msa=0&ll=37.872008,-122.252512&spn=0.011501,0.015535&t=m&z=16&vpsrc=6 map]) at your earliest convenience.
 
  
 
==Future Availability==
 
==Future Availability==
  
 
Please check back for updates.
 
Please check back for updates.
 +
 +
==True Love==
 +
 +
===Definition===
 +
 +
Let <math>H</math> denote the set of all entities, perhaps Humans, though we might also include dogs, cats and horses, according to historical precedent.
 +
 +
Let <math>T</math> denote the set of pairs of individuals who have True Love, such that:
 +
 +
:<math>\forall\{i,j\} \in T: \quad (i \succ_j h \forall h \ne i) \and (j \succ_i h \forall h \ne j), \; h \in H \cap \{\emptyset\}</math>

Revision as of 16:04, 25 February 2012

Current Availability

I'm afraid that Ed is currently unavailable for dating at this time. Exceptions to this can be made if you have a Math(s) Ph.D.

That said, if you genuinely believe:

[math]p\left(You \cap The\,One \ne \{\empty\}\,|\,First\,Glance\right) \gg 0[/math]

then please stop by my office (F533) at the Haas School of Business (map) at your earliest convenience.

Future Availability

Please check back for updates.

True Love

Definition

Let [math]H[/math] denote the set of all entities, perhaps Humans, though we might also include dogs, cats and horses, according to historical precedent.

Let [math]T[/math] denote the set of pairs of individuals who have True Love, such that:

[math]\forall\{i,j\} \in T: \quad (i \succ_j h \forall h \ne i) \and (j \succ_i h \forall h \ne j), \; h \in H \cap \{\emptyset\}[/math]