I'm posting this here to see how it looks online. It is my first instance of my paper online incase I wish to show it to someone instead of using email. I hope you don't mind. I basically worked like 5 years on this. If you wish to contact me for further discussion then contact the Fields Institute or Clay Math Institute they have my paper and my email.
------------------------------------------------------
------------------------
Proving the Relative Consistency of Both Hilberts 1st Problem and the Polynomial Time/Non-Polynomial Time Problem
Paper Outline:
Part 1 - Introduction
Part 2 - History
Part 3 - Proving the Relative Consistency of Hilberts 1st Problem
A) First Method of Proving the Relative Consistency of Hilberts 1st Problem
B)Second Method of Proving the Relative Consistency of Hilberts 1st Problem
Part 4 - Proving the Relative Consistency of the P-NP Problem
Part 5 - Relative Consistency Principles Similiar To Hilberts 1st and P-NP Problem in Other Areas of Math
Part 6 - Conclusion
------------------------------------------------------------
------------------------------------------------------------
-------------------------------
Part 1: Introduction
"A disciple asked, "What is the difference between the enlightened and the unenlightened man?"
The Master replied, "The unenlightened man sees a difference, but the enlightened man does not."" - old monist teaching
It all comes back to Schrodingers Cat. The ultimate duality of circumstance. Did the cat live or die? Until we open the box, we will always have 2 possible outcomes to consider but we have forever known the principle of the uncertainty would leave us with this dual perspective encountered as one tries to foresee the outcome. This paper deals with Hiberts 1st Problem and the P-NP Problem and I will be attempting to "prove their relative consistency by finitistic methods". Ironically, I could have wrote up a near infinite long paper (hehe) considering the most fundamental and basic principles and foundations of math are required with this paper where I inevitably found that most of these relative types of math and algebra that I came across always applied in some way. I tried to sift through and only use what was relevant or important in any quotes or examples I use. I know what empirical equations are and I know how they can be used. My greatest challenge is teaching the laymen what "Relativity" means ... or that many principles are relative. Any ideas based on measure, comparing, ratios, or probabilitys etc. would be relative. My other key word is "Axiom". Once I focused on what an axiom is and how to use it to show what relativity was, was when I found I could maybe write up some fundamentals regarding Hilberts 1st Problem and the P-NP Problem and try to present a paper on them. I'll be honest, I have a good idea that these are "Relative Problems" and relative problems most likely occur in most of todays top listed math problems not as of yet solved ... or perhaps half of them but I think many of them are relative problems although I'll admit I have only read up on these 2 problems in this paper and have not looked at the other problems!
"The First If"
Without axioms math wouldn't exist. Axioms simply ARE what mathematics and measurement is about. As you read my quotes from information websites, watch to see how axioms determine the "System" that is being used as the tool for solving. Remember that when we encounter an"If", we have obviously used an axiom. I also liked the following word and will quote it since it's a great start for what you are about to read in my paper;
http://en.wikipedia.org/wiki/Syntax
"The term syntax is also used to refer to the rules governing the behavior of mathematical systems, such as formal languages used in logic—see syntax (logic)—and computer programming languages—see syntax (programming languages)"
Every word of that definition will be relevant to this paper. I will discuss relative axioms showing relative qualitys in the relative principles. Inevitably, we will see how computer language/logic applys as well and I feel is just as relevant to proving these relative principles. I basically consider Hilberts 1st Problem and the P-NP Problem to be the same problems but only in a different form based on their obvious relative nature ... and have already guessed that many more unsolved problems fall into this "Relative Problem" category. I am going to base most of the paper on 1 diagram found on Wikipedia ( http://en.wikipedia.org/wiki/File:P_np_np-complete_np-hard.s
vg ) because its the most fundamental diagram showing the principles discussed in both problems I talk about in this paper.
I apologize for not linking any math equation.jpg or chart.jpg mentioned in any quoted links I use because it would take a long time to upload every symbol or chart and then insert its link into the information I quoted in this paper. If you go to the link I give it will be there to better see but yes you will haveto sift through the page to find the quote I used for it sorry. This is actually my first real math paper. I've written a couple other math/physics papers before this but its just an amateur hobby of mine really and I just write these up as best I can hoping its understandable. My earlier papers were bold and eager but I'm going to try to be more straight forward and convincing in this one. Thank-you for your time and I hope this paper makes sense to you.
------------------------------------------------------------
------------------------------------------------------------
-------------------------------
Part 2: History
I became interested in String Theory around the late 90's in my twentys. I had drawn up an image of what I only just recently discovered to be the fractal Koch Snowflake and visited a math professor at the local university with a simple equation that read "x=1/13y". I had with me a 12-sided die (dodecahedron) and tried to explain that when adding up all 13 spheres that make up a dodecahedron (12 spheres around 1 sphere in the middle) that if all 13 spheres were numbered 1-13 that the total is 91 and so thus the average (or Mean) of 91 is 91 divided by 13 so 7 is the Mean. I had heard that " 7" was the biblical "number of completion" and thought that interesting but , anyways, I felt that this geometric truth must be significant since the dodecahedron is very sphere-like and therefore common and also many consider the 12 houses of the zodiac, 12 apostles, and 12 hours of a clock etc. to be more than just coincidences (article depicting our universe as a dodecahedron;> http://www.world-science.net/exclusives/041005_univshapefrm.
htm ) ... So, the math teacher I was talking with said my diagram was fractal and that I was doing fractals. I didn't have any philosophy to why I liked "x=1/13y". I said it was empirical to the dodecahedron and so must be of some value to other structures but I really did not have any real clue as to what I was trying to say. I left somewhat deflated but still enthused and considered it just one step in my journey. I took a 3 or 4 year break and then got back into String Theory maybe around 2004. I started reading on many topics and learned a great deal but it was only maybe around 2006 or 2007 that I finally stumbled upon something called Sample Space. It was when reading Sample Space that I saw literally the step I used to add all 13 spheres of the dodecahedron as simply being a Sample Space of 13 numbers! I soon realized that now I could not only find a Mean average of the 13 digit string/spheres of the dodecahedron, but I now could apply an equation that always added any length string/spheres which could be summed and then divided to find its Mean and so this equation now empirically handles ANY size string and so I right away assumed I had a String Theory or a type of String Theory. I was excited and did not have the easiest time putting into an equation this function of finding a Mean for any length of string. I finally came up with "Energy= (sum Sample Space)/Length". Also, and still surprising to me, I looked at this equation for quite awhile and wrote down its solved values. I was always looking for patterns and so I also thought I'd like to see if theres any pattern in looking at the percentages between the numbers of the various lengths of strings I was calculating ... and so I found a very handy percentage calculator on the internet and it had both "percentage of" and "percentage from" functions so I could look for even more patterns. Thus, by fortune, I saw some pattern showing that inevitably helped me eliminate one of the variables in my first formula. I now had an equation that read "(sum Sample Space)/Length=(Length+1)/2". Both these equations performed the same function and both empirically worked for any length string and so I was even more excited and thought I must have a String Theory equation here somewhere. I wrote up a physics paper covering many topics and I also tried very specifically to factor in the various pivotal fundamentals involved with important topics like String Theory such as Bosons, Tachyons, and also Dimensions, and Blackholes, and Superfluids etc. etc. and I made philosophy an absolute necessity for being the foundation and logic to my theorys and ideas in regards to celestial mechanics and Blackholes and Photons and String Theory etc. etc. I'm bringing this up because I know how deep many of these particles and concepts are and I know how tedius and similiar many particles and concepts can be! I will just get to the point here and say that many, many concepts and particles tend to share many of the same qualitys and often many concepts are discussed across various fields but have many different names. Ideas like Convergance, Wave Collapse, Focal Points, or Locality, Wilson Loops, and things like Feedback, or Rings, or Solitons all can be found in many different forms but still be basically the same concept or action. When I was trying to pinpoint what my 2 equations were, I felt that the empirical geometric and symmetrical nature of my equations surely meant we were discussing quantum propertys or possibly Blackholes and even Tachyons. Still, to this day, I have learned that Mathematical Induction (discussed by Plato and Socrates) is empirically a quality of the geometric and symmetrical realm that we may very well call Blackholes, or Tachyons, or even the Higgs Boson. I am explaining this for those that read my first ever physics paper where I tried to distinguish the more important qualitys of my 2 equations that I felt could be describing Blackholes, Tachyons, Holonomy, Superfluids, or Zero-Point etc. etc. These equations may very well describe those qualitys since they added empirically and we do not yet understand completely just what Blackholes are or what Zero-Point is or how the Higgs Boson functions etc. I am bringing this up really because my first physics paper tried to sort into 2 basic groups the property of Scalars versus Vectors and so I had 1 equation as Scalar and 1 equation as Vector and I tried very hard to sort what category Zero-Point would be in or where the Tachyon should go or if I had a "Blackhole Equation" or a "Higgs Equation". My ambitiousness resulted in a paper with tons of assumptions and many things left open for debate. To start, I didn't actually have String Theory equations since only now recently is when I found out my first equation was actually a form of a Pythagorea Mean and my second equation was my rediscovery of a process called Mathematical Induction. That glaring error of me thinking I had done String Theory really deflated the sails of anyone with the slightest bit of doubt about my paper. Right from the start, in my paper, I had stated my first equation looked very Pythagorean and I also was absolutely certain both equations were empirical, since they were, and that both equations must be significant to the physics world because I added a "proofs" section where I tried to post as many Wikipedia articles I could find that showed any equation using a pattern simply known as "an Infinite Set". I even found that the pattern of my equations that were finding the Mean could be found in whats known as "Magic Squares" that interestingly were used to teach Chinese creation myths with the I-Ching and is also used as the international symbol for Feng Shui (hehe). The pattern showed itself easily in odd-numbered Magic Squares with my Mean number solved from the equations being the centre number of the Magic Square when you added the total number of squares and then divided by that number. You see, I had noticed all along that the function I was using Sample Space for was the very exact and same function of the Infinite Set. I was finding examples of Infinite Sets in many, many classic and empirical equations and therefore I was using this to show that if my equations use Sample Space and its function is seen in the use of Infinite Sets in many other formulas, then surely my equations must be verifiable and legitimate! Well, despite eventually discovering that my equations were legitimate once I found them online, after finding about 4 or 5 university and physics and math proffessors to email my paper around to , I still did not get one person to respond back to me except for the local university math teacher whom I emailed and insisted he give me some feedback. He did recognize my first equation and said it already existed but he never did actually identify it as a form of a Pythagorean Mean equation as I later figured out by myself (alltough to be honest, my version of a Mean equation was original and only the Quadratic Mean equation even comes closest to looking like it, but I digress.). He did not even recognize my second equation as to be a form of Induction but, either way, he seemed to think I knew nothing about math. He even called me crazy. I've been called crazy twice infact (the other person knows who he is). Basically, I sent out a very deep and thought provoking paper (my first ever) to about 10 people asking for any kind of feedback but only a couple responded with unkind words yet not one of those people ever replied back to say, "Hey, your first equation is a form of Pythagorean Mean equation and your second equation is whats known as Mathematical Induction". Had even one person emailed back I would have felt a little better about myself but instead it wasn't until only recently, like a year after my first paper, that it would be myself that would find out I had rediscovered legitimate empirical equations. I actually had called up an old highschool math teacher named Mr. Dajka to help me solve and reduce down the Induction equation that had only 2 variables. By luck, while reading Wikipedia, right after Mr Dajka solved my equation down farther did I by chance happen to be reading the article about Summation and it gave a classic example equation of Mathematical Induction. I was gazing upon literally my reduced second equation. So, there's where I was. I was proud that my equations did mean something but dissatisfied that they weren't original or ground-breaking. I let this stage of my journey chill for awhile and then maybe 5 months later I got back to reading and delving deep into various concepts and philosophys ... re-reading about Pythagoreans 3 Means and then I'll guess around February 2011 where I stumbled upon Transfinite Numbers. The write-up for Transfinite Numbers right away seemed to imply or hint at a "Mean" or "middle-point" paradox that could be conceptualized to exist somewhere between the rational and the infinite. I had realized that the function of summing the Sample Space gave the empirical value of what was the outcome of the Induction equation that used Summation. Sample Space as a single variable was giving the same answer that a summed Infinite Set was giving and so I thought there must be some new equation that exists where I find the Mean between an Infinte Set(or summed Sample Space) and another set that wasn't infinte. I felt the answer to that equation would be the Mean or Transfinite Number since that would philosophically and logically be what the Mean should be. My theory was that if I can find the Mean between an Infinite Set of Natural numbers with another set that is anything but Infinite, it should beTransfinite and maybe a Theory of Everything could be an equation that computed a value between the rational and the irrational or the Quantum and Classical realms. I looked very long at the classic Mathematical Induction equation I stumbled upon and realized the Summation notation of that equation could be used to create a larger more complex Induction formula but that now included another set to be added to this classic Induction pattern and then divided by 2 to get its Mean average. By looking for the pattern I somehow came up with the equation that I am now finally about to explain as my Extended Diophantine Mean equation. I also consider it luck that I wandered into Set Theory and learned about Alephnaught and Alephone as perfect "book-ends" to be used as variables for finding the Mean between the two. I want to repeat, as good as the equation looks with the variables named Alephnaught and Alephone, still, all that matters is the overall pattern. Any real knowledgable mathematician knows that many variables have the same qualitys but just a different name or letter. Even the "constants" like e, pi, the speed of light c, or phi, all can be found in many, many equations and from similiar structured formulas. Changing the letters around does not invalidate the structure. Anyways, the next section explains my handy examples of Tautological Ontological Empirical equations I call TOE's (hehe) and eventually why I think I can show how that the Continuum Hypothesis and the P-NP Problems are relative and that I have equations to solve #1 of Hilberts 23 Problems where he asks if Alephone and Bethone are the same cardinality. If anything in this paper, I show that the Pythagorean Means and Mathematical Induction are related in function and I show that Infinite Sets and Sample Space also share similiar functions. I decided only far more recently (May 2011) as I write up this paper now that it seems the Polynomial Time/Non-Polynomial Time Problem may well also be one and the same type of relative consistency problem as the Continuum Hypothesis. I also recently had noticed that an article on Divergent Series explained how the late mathematician Srinivasa Ramanujan had claimed that the sum of an infinite Divergent Series equaled "-1/12" ... which I found intrigueing since that is only 1 sphere off of a dodecahedron (13 total spheres) of which my first ever empirical equation I created for the dodecahedron was "x=1/13y". Could the difference of just that 1 centre sphere be the difference between Convergence from Divergence or a plane from a point? Also interestingly, I decided to compute the percentage difference of just 1 sphere of the dodecahedron to another ... or 12/13 from 13/13. I found that 12/13ths was 92% and therefore the Mean between 92% and 100% was 96% ... is 96% significant? Well, intrigueingly, yes it may be significant. The ratio of all dark "stuff" in our universe is roughly 96% dark to 4% visible. Also, it was surprising to do an internet search and find out that humans' nearest animal relation, the chimpanzees, are 96% related!
*Final note,I would love to find the person who created this diagram (http://en.wikipedia.org/wiki/File:P_np_np-complete_np-hard.
svg ) That diagram IS my entire paper and whoemever created that diagram should enjoy this work and I consider that person a peer to whom I owe much gratitude.
--------------------------
------------------------------------------------------------
------------------------------------------------------------
-----
Part 3: Proving The Relative Consistency Of Hilberts 1st Problem
Comment: I will show 2 different forms of determining the cardinality(size) of the sets a and b. The first form will be an axiom of choice applied to the diagram used to explain the P-NP Problem which uses 1 Extention applied on one side of the diagram from the other side. The second form to determine the cardinality(size) of the sets a and b will be an axiom of choice applied to an Extended form of a Diophantine Mean equation. First, I will link to a basic tutorial with basics I want to make sure are understood;
http://s134.photobucket.com/albums/q107/m
rgf/?action=view¤t=MathematicalInductionFoundInExample
s.jpg
http://s134.photobucket.com/albums/q107/mrgf/?action=view&cu
rrent=MathematicalInductionin1DimensionalStrings.jpg
http://s134.photobucket.com/albums/q107/mrgf/?action=view&cu
rrent=MathematicalInductionin2DimensionalSurfaces.jpg
http://s134.photobucket.com/albums/q107/mrgf/?action=view&cu
rrent=MathematicalInductionin3DimensionalSolids
http:
//s134.photobucket.com/albums/q107/mrgf/?action=view¤t
=OhmsLaw.jpg
http://s134.photobucket.com/albums/q107/
mrgf/?action=view¤t=fig6y-MeanEquations.jpg
http://en.wikipedia.org/wiki/Diophantine_equation
htt
p://en.wikipedia.org/wiki/Thurston_model_geometry
htt
p://en.wikipedia.org/wiki/Venn_diagram
ӌ
8;
A) First Method Of Proving The Relative Consitency of Hilberts 1st Problem:
Comment: First, lets create an axiom of choice that we could use to solve the problem of the cardinality of sets a and b. Let's create a "Circle Axiom" that says that "All circles are the same cardinality" and apply it to the P-NP Problem diagram which is found at the website link (http://en.wikipedia.org/wiki/File:P_np_np-complete_np-hard.
svg ). Remember to consider, ironicallly, that pi is the same size for any circle. ;
http://s134.photobucket.com/albums/q107/mrg
f/?action=view¤t=VenndiagramofContinuumHypothesisusing
1AxiomCircleAxiomand1Extension.jpg
Comment: Notice only 1 more circle has been added to the left diagram than on the right diagram. This is key since its merely an expansion (OR EXTENSION) of 1 more circle to the left diagram which thus now represents more "integers/sets/choices" or "colors/dimensions" to the universe.
On the right, we see that since a does not equal b, then obviously b must be greater than a (the integers) and certainly not greater than c (the infinite reals), and so therefore b exists between them and thus the Continuum Hypothesis would not hold since it states that "no set exists between the integers and the reals". On the left, we see that a=b (by the Circle Axiom since both a and b are circles) and therefore we could assume by syllogism (a 3-step logic) then that ,"If all circles are the same cardinality, and all sets are circles, then all sets are the same cardinality" and therefore no set exists between the integers and the reals and therefore the Continuum Hypothesis does hold.
In again some ironic (yet logical) way, we see that this diagram tells us that only in the "expanded by 1 circle" left side diagram can it even be possible to solve and confirm the cardinality of sets using a "Circle Axiom" (we see 2 full circles a and b on the left diagram and therefore only in that expanded side of the diagram can we say that yes a = b). I am saying this is ironic since its this very notion of "expansion" that is the very same technique called "Extention" used to find other empirical functions such as Bézout's identity. Also, ironically, I had called an equation I used to show the relative nature of Hilberts 1st Problem an "Expanded" Diophantine equation only to later learn that it was the same technique used to find Bézout's identity which was called "Extention"!
B)Second Method of Proving The Relative Consistency Of Hilberts 1st Problem:
Comment: First, let's revisit Aritys and Induction;
http://en.wikipedia.org/wiki/Arity
"Arities greater than 2 are seldom encountered in mathematics, except in specialized areas, and arities greater than 3 are seldom encountered in theoretical computer science. In computer programming there is often a syntactical distinction between operators and functions; syntactical operators usually have arity 0, 1 or 2."
http://en.wikipedia.org/w
iki/Mathematical_induction
"Mathematical induction is a method of mathematical proof typically used to establish that a given statement is true of all natural numbers (non-negative integers). It is done by proving that the first statement in the infinite sequence of statements is true, and then proving that if any one statement in the infinite sequence of statements is true, then so is the next one."
http://en.wikipedia.org
/wiki/Extended_real_number_line
"In mathematics, the affinely extended real number system is obtained from the real number system R by adding two elements: +∞ and −∞ (read as positive infinity and negative infinity respectively)."
"The affinely extended real number system turns into a totally ordered set by defining −∞ ≤ a ≤ +∞ for all a. This order has the desirable property that every subset has a supremum and an infimum: it is a complete lattice."
Comment: Next, let's learn what Extension is and where it's used;
http://en.wikipedia.org
/wiki/Extended_Euclidean_algorithm
"The extended Euclidean algorithm is an extension to the Euclidean algorithm. Besides finding the greatest common divisor of integers a and b, as the Euclidean algorithm does, it also finds integers x and y (one of which is typically negative) that satisfy Bézout's identity
ax + by = gcd(a,b).
The extended Euclidean algorithm is particularly useful when a and b are coprime, since x is the multiplicative inverse of a modulo b, and y is the multiplicative inverse of b modulo a."
Comment: We see here that by "extending" or "expanding" Euclid's algorithm by 2 additional sets of variables (g,c and a,b), it now can be used to find further algebraic properties called "the Bézout coefficients for (a,b)". I am just an amateur mathematician but I am going to presume the "Surgery" that Grigori Perelman used for proof of the Poincare Conjecture was most certainly a form of Extension as given above in my couple of examples;
http://en.wikipedia.org/wiki/Grigori_Perelman
"Accord
ing to Perelman, a modification of the standard Ricci flow, called Ricci flow with surgery, can systematically excise singular regions as they develop, in a controlled way."
http://en.wikipedia.org
/wiki/Surgery_theory
"Therefore, given a manifold M of dimension n = p + q and an embedding , define another n-dimensional manifold M' to be
One says that the manifold M' is produced by a surgery cutting out and glueing in , or by a p-surgery if one wants to specify the number p."
"Surgery is symmetric in the sense that the manifold M can be re-obtained from M' by a (q − 1)-surgery, the trace of which coincides with the trace of the original surgery, up to orientation.
In most applications, the manifold M comes with additional geometric structure, such as a map to some reference space, or additional bundle data. One then wants the surgery process to endow M' with the same kind of additional structure. For instance, a standard tool in surgery theory is surgery on normal maps: such a process changes a normal map to another normal map within the same bordism class."
*KEY* "In the classical approach, as developed by Browder,Novikov,Sullivan, and Wall, surgery is done on normal maps of degree one. Using surgery, the question "Is the normal map of degree one cobordant to a homotopy equivalence?" can be translated (in dimensions greater than four) to an algebraic statement about some element in an L-group of the group ring Z[π1(X)]. More precisely, the question has a positive answer if and only if the surgery obstruction is zero, where n is the dimension of M."
http://en.wikipedia.org/wiki/Forc
ing_%28mathematics%29
"Intuitions:
Forcing is equivalent to the method of Boolean-valued models, which some feel is conceptually more natural and intuitive, but usually much more difficult to apply.
Intuitively, forcing consists of expanding the set theoretical universe V to a larger universe V*. In this bigger universe, for example, one might have lots of new subsets of w = {0,1,2,…} that were not there in the old universe, and thereby violate the continuum hypothesis. While impossible on the face of it, this is just another version of Cantor's paradox about infinity. In principle, one could consider
,
identify with (x,0), and then introduce an expanded membership relation involving the "new" sets of the form (x,1). Forcing is a more elaborate version of this idea, reducing the expansion to the existence of one new set, and allowing for fine control over the properties of the expanded universe."
http://en.
wikipedia.org/wiki/Set_theory
*KEY* "Forcing(mathematics):
Paul Cohen invented the method of forcing while searching for a model of ZFC in which the axiom of choice or the continuum hypothesis fails. Forcing adjoins to some given model of set theory additional sets in order to create a larger model with properties determined (i.e. "forced") by the construction and the original model. For example, Cohen's construction adjoins additional subsets of the natural numbers without changing any of the cardinal numbers of the original model. Forcing is also one of two methods for proving relative consistency by finitistic methods, the other method being Boolean-valued models."
http://en.wikipedia.
org/wiki/Uncountable_set
*KEY* "The cardinality of R is often called the cardinality of the continuum and denoted by c, or , or (beth-one).
"A more abstract example of an uncountable set is the set of all countable ordinal numbers, denoted by Ω (omega) or ω1. The cardinality of Ω is denoted (aleph-one). It can be shown, using the axiom of choice, that is the smallest uncountable cardinal number. Thus either , the cardinality of the reals, is equal to or it is strictly larger. Georg Cantor was the first to propose the question of whether is equal to . In 1900, David Hilbert posed this question as the first of his 23 problems. The statement that is now called the continuum hypothesis and is known to be independent of the Zermelo-Fraenkel axioms for set theory (including the axiom of choice).
Without the axiom of choice:
Without the axiom of choice, there might exist cardinalities incomparable to (namely, the cardinalities of Dedekind-finite infinite sets). Sets of these cardinalities satisfy the first three characterizations above but not the fourth characterization. Because these sets are not larger than the natural numbers in the sense of cardinality, some may not want to call them uncountable.
If the axiom of choice holds, the following conditions on a cardinal are equivalent:
and
, where and is least initial ordinal greater than
However, these may all be different if the axiom of choice fails. So it is not obvious which one is the appropriate generalization of "uncountability" when the axiom fails. It may be best to avoid using the word in this case and specify which of these one means."
http://en.wikipedia.org/wiki
/Set_theory
"Set theory is commonly employed as a foundational system for mathematics, particularly in the form of Zermelo–Fraenkel set theory with the axiom of choice. Beyond its foundational role, set theory is a branch of mathematics in its own right, with an active research community. Contemporary research into set theory includes a diverse collection of topics, ranging from the structure of the real number line to the study of the consistency of large cardinals."
"Some basic sets of central importance are the empty set (the unique set containing no elements), the set of natural numbers, and the set of real numbers."
"Some ontology:
"A set is pure if all of its members are sets, all members of its members are sets, and so on. For example, the set {{}} containing only the empty set is a nonempty pure set. In modern set theory, it is common to restrict attention to the von Neumann universe of pure sets, and many systems of axiomatic set theory are designed to axiomatize the pure sets only. There are many technical advantages to this restriction, and little generality is lost, since essentially all mathematical concepts can be modeled by pure sets. Sets in the von Neumann universe are organized into a cumulative hierarchy, based on how deeply their members, members of members, etc. are nested. Each set in this hierarchy is assigned (by transfinite recursion) an ordinal number α, known as its rank. The rank of a pure set X is defined to be one more than the least upper bound of the ranks of all members of X. For example, the empty set is assigned rank 0, while the set {{}} containing only the empty set is assigned rank 1. For each ordinal α, the set Vα is defined to consist of all pure sets with rank less than α. The entire von Neumann universe is denoted V."
"Determinacy:
Determinacy refers to the fact that, under appropriate assumptions, certain two-player games of perfect information are determined from the start in the sense that one player must have a winning strategy. The existence of these strategies has important consequences in descriptive set theory, as the assumption that a broader class of games is determined often implies that a broader class of sets will have a topological property. The axiom of determinacy (AD) is an important object of study; although incompatible with the axiom of choice, AD implies that all subsets of the real line are well behaved (in particular, measurable and with the perfect set property). AD can be used to prove that the Wadge degrees have an elegant structure."
Comment: Let's now see where axioms of choice are used;
http://en.wikipedia.org/wiki/Ty
chonoff%27s_theorem
"All of the above proofs use the axiom of choice (AC) in some way. For instance, the third proof uses that every filter is contained in an ultrafilter (i.e., a maximal filter), and this is seen by invoking Zorn's Lemma. Zorn's Lemma is also used to prove Kelley's theorem, that every net has a universal subnet. In fact these uses of AC are essential: in 1950 Kelley proved that Tychonoff's theorem implies the axiom of choice. Note that one formulation of AC is that the Cartesian product of a family of nonempty sets is nonempty; but since the empty set is most certainly compact, the proof cannot proceed along such straightforward lines. Thus Tychonoff's theorem joins several other basic theorems (e.g. that every nonzero vector space has a basis) in being equivalent to AC."
Comment: Axioms are quintessential to analyizing any non-singular system. The best forms to analyze would haveto be the geometric and symmetrical forms. Geometric and symmetric are empirical qualities utalized by algebraic equations to help us understand the fundamental properties of more complex systems. Diophantine equations are first order empirical structures to be used to solve and comprehend such geometric and symmetric qualities.;
http://en.wikipedia.org/wiki/Field_with_one_element
&
#12288;
"Another angle comes from Arakelov geometry, where Diophantine equations are studied using tools from complex geometry. The theory involves complicated comparisons between finite fields and the complex numbers. Here the existence of F1 is useful for technical reasons."
http://en.wikipedia
.org/wiki/Diophantine_equation
"In mathematics, a Diophantine equation is an indeterminate polynomial equation that allows the variables to be integers only. "
"In more technical language, they define an algebraic curve, algebraic surface, or more general object, and ask about the lattice points on it."
"A linear Diophantine equation is an equation between two sums of monomials of degree zero or one.
While individual equations present a kind of puzzle and have been considered throughout history, the formulation of general theories of Diophantine equations (beyond the theory of quadratic forms) was an achievement of the twentieth century."
*KEY* "The point of view of Diophantine geometry, which is the application of techniques from algebraic geometry in this field, has continued to grow as a result; since treating arbitrary equations is a dead end, attention turns to equations that also have a geometric meaning.The central idea of Diophantine geometry is that of a rational point, namely a solution to a polynomial equation or system of simultaneous equations, which is a vector in a prescribed field K, when K is not algebraically closed"
Comment: I noticed that Diophantine equations not only reflect geometric properties but they also display an important concept known as Recursion which is simply another anologue of Induction;
http://en.wikipedia.org/wiki/Recursion
"Many mathematical axioms are based upon recursive rules. For example, the formal definition of the natural numbers in set theory follows: 1 is a natural number, and each natural number has a successor, which is also a natural number. By this base case and recursive rule, one can generate the set of all natural numbers."
http://en.wikipedia.org/wiki/Diophantine_set
"Matiyasevich's theorem says:
Every computably enumerable set is Diophantine. "
http://en.wikipedia.org/wik
i/Hilbert%27s_tenth_problem
"Diophantine sets:
Sets of natural numbers, of pairs of natural numbers (or even of n-tuples of natural numbers) that have Diophantine definitions are called Diophantine sets. Diophantine definitions can be provided by simultaneous systems of equations as well as by individual equations because the system
is equivalent to the single equation
A recursively enumerable set can be characterized as one for which there exists an algorithm that will ultimately halt when a member of the set is provided as input, but may continue indefinitely when the input is a non member. It was the development of computability theory (also known as recursion theory) that provided a precise explication of the intutitive notion of algorithmic computability, thus making the notion of recursive enumerability perfectly rigorous. It is evident that Diophantine sets are recursively enumerable. This is because one can arrange all possible tuples of values of the unknowns in a sequence and then, for a given value of the parameter(s), test these tuples, one after another, to see whether they are solutions of the corresponding equation. The unsolvability of Hilbert's tenth problem is a consequence of the surprising fact that the converse is true:
Every recursively enumerable set is Diophantine."
http://
en.wikipedia.org/wiki/Recursively_enumerable
"Equivalent formulations:
The following are all equivalent properties of a set S of natural numbers:
Semidecidability:
The set S is recursively enumerable. That is, S is the domain (co-range) of a partial recursive function.
There is a partial recursive function f such that:
Enumerability:
The set S is the range of a partial recursive function.
The set S is the range of a total recursive function or empty. If S is infinite, the function can be chosen to be injective.
The set S is the range of a primitive recursive function or empty. Even if S is infinite, repetition of values may be necessary in this case.
Diophantine:
There is a polynomial p with integer coefficients and variables x, a, b, c, d, e, f, g, h, i ranging over the natural numbers such that
There is a polynomial from the integers to the integers such that the set S contains exactly the non-negative numbers in its range.
The equivalence of semidecidability and enumerability can be obtained by the technique of dovetailing.
The Diophantine characterizations of a recursively enumerable set, while not as straightforward or intuitive as the first definitions, were found by Yuri Matiyasevich as part of the negative solution to Hilbert's Tenth Problem. Diophantine sets predate recursion theory and are therefore historically the first way to describe these sets (although this equivalence was only remarked more than three decades after the introduction of recursively enumerable sets). The number of bound variables in the above definition of the Diophantine set is the best known so far; it might be that a lower number can be used to define all diophantine sets."
Comment: In the History part of this paper I discovered that Induction was a form of a Mean equation ... and the last line in that last quote I linked asks if there is a form of Diophantine Set with a lower number of bound variables than in the defintion of a Diophantine Set that the article gives. Well, we see that yes my Extended Diophantine Mean equation shows there is a Diophantine Set equation with a lower number of bound variables. The point is is that Diophantine equations have not only historically been used to solve previously unsolvable math problems, but they are quite fundamentally the perfect vehicles to be used for such a purpose. I explained in the History section how I came to chose an Extended Diophantine Mean equation to be used to solve Hilberts 1st Problem, and now I am going to also link the articles describing the sets that I decided upon to be used as variables in my Extended Diophantine Mean equation which can be used to solve Hilberts 1st Problem. Notice above it said Alephone was reresented by an Omega and Sample Space can also use the same symbol Omega of which I said a summed Sample Sapce represented the same function of an infinite set that I had eventually found out through reading and my 2 equations( Diohantine and Induction equations)? The sets I am chosing for the equations to prove these relative consistency problems are Alephnaught and Alephone;
http://en.wikipedia.org/wik
i/Aleph-naught#Aleph-naught
" is the cardinality of the set of all natural numbers, and is the first transfinite cardinal. A set has cardinality if and only if it is countably infinite, which is the case if and only if it can be put into a direct bijection, or "one-to-one correspondence", with the natural numbers. Such sets include the set of all prime numbers, the set of all integers, the set of all rational numbers, the set of algebraic numbers, the set of binary strings of all finite lengths, and the set of all finite subsets of any countably infinite set.
If the axiom of countable choice (a weaker version of the axiom of choice) holds, then is smaller than any other infinite cardinal."
http://en.wikipedia.org/wi
ki/Aleph_number#Aleph-one
" is the cardinality of the set of all countable ordinal numbers, called ω1 or (sometimes) Ω. Note that this ω1 is itself an ordinal number larger than all countable ones, so it is an uncountable set. Therefore is distinct from . The definition of implies (in ZF, Zermelo-Fraenkel set theory without the axiom of choice) that no cardinal number is between and . If the axiom of choice (AC) is used, it can be further proved that the class of cardinal numbers is totally ordered, and thus is the second-smallest infinite cardinal number."
Comment: Therefore, I have my type of equation determined (Extended Diophantine Mean equation) and now have my variables specified (as opposed to simply using a and b) to create an Extended Diophantine Mean equation from which an axiom of choice can be applied to show the relative nature of Hilberts 1st Problem. I am proposing that in Computability Theory, that if an axiom of choice is applied to an Extended Diophantine Mean equation that results in an unchanged outcome from the equation, then the Continuum Hypothesis will hold. I am proposing that it is the wording of the axiom of choice that determines the result of the changed or unchanged outcome of the equation that is being used to test the Continuum Hypothesis (or Hilberts 1st Problem)! *Please note, calling any equation a "Theory of Everything" today draws extreme scrutiny and originally I felt all Induction/Recursion/Diophantine equations WERE what many conjectured would be a Theory of Everything and so in my early first draft of my class of Extended Diophantine Mean equations I had labelled them TOE's since I knew they were empirical and foundational but I have now since decided to label this handy group of fundamental equations simply "Tautological Ontological Empirical" equations or "TOE" for short *grin. *Please also note, that the first example of my TOE equations is just the Summation example of the Extended Diophantine Mean equation and its only the latter 2 example equations where theres more than one Alephnaught and Alephone in the equation that can be used via an axiom of choice to show the relative nature of the Continuum Hypothesis;
http://s134.photobucket.com/albums/q107/mrgf/?action=view&cu
rrent=SummationInductionandTautologicalOntologicalEmpiricale
xamples.jpg
Comment: The Extended Diophantine Mean equations are at the bottom - only the last 2 are for use in solving Hilberts 1st Problem because they have 2 sets of Alephnaught's and Alephone's - the first equation at the bottom is the Summation version which still equals the other Extended Diophantine Mean equations but has only 1 Alephnaught and 1 Alephone and therefore cannot be used to solve Hilberts 1st Problem.
This is where we create an "Axiom of Choice" that states, "Change all Alephone's to Bethone's" to an Extended Diophantine Mean equation . If, in Computational Theory, the resulted outcome still computes the same size ratio/mean value - meaning: although the variables may be different (Bethone instead of Alephone), the size of the value of the final outcome is still the same as before the variables were changed from Alephone to Bethone and therefore the Continuum Hypothesis still holds because obviously Alephone must equal Bethone in cardinality. Conversely, if the axiom of choice is reworded so that it instead states, "Change only one Alephone to Bethone" in an Extended Diophantine Mean equation, we will see that now the final outcome computed no longer shows the same size ratio/mean value as it did before only one Alephone was changed to Bethone and therefore the Continuum Hypothesis does not hold and we would more convincingly see that the axiom of choice is what determines the relative result of the Continuum Hypothesis of whether Alephone equals Bethone (Hilberts 1st Problem)! This is simply a logic gate that computes a different size value determinant on how the axiom of choice is worded.
-----------------------------------------------------
------------------------------------------------------------
--------------------------------------
Part 4: Proving The Relative Consistency of the P-NP Problem
http://en.wikipedia.org/wiki/File:P_np_np-complete_n
p-hard.svg
Comment: I am going to simply state that if I have proven through 1 axiom and an Extended Diophantine Mean equation the relativite consistency of the Continuum Hypothesis (does set a = set b?) and then have shown in Venn diagram form the relative consistency of the Contiuum Hypothesis is the same seen in the exact same Venn diagram used to show the relative consistency of the P-NP problem, then I'd think intuitively that both problems must be equivalent or similiar.
I believe the difference between the sets of integers (Alephnaught) and the sets of reals (Bethone) in the Continuum Hypothesis must be the same difference between the group of Polynomial Time type problems with the group of Non-Polynomial Time type problems.
The following I would consider a relevant point about the relative consistency observation that Potential Theory in two dimensions is different from Potential Theory in more dimensions. Again, I am saying that Potential Theory may also be another anologue of the Continuum Hypothesis or the P-NP Problem;
http://en.wikipedia.org/wiki/Potenti
al_theory
"Two dimensions:
From the fact that the group of conformal transforms is infinite dimensional in two dimensions and finite dimensional for more than two dimensions, one can surmise that potential theory in two dimensions is different from potential theory in other dimensions. This is correct and, in fact, when one realizes that any two-dimensional harmonic function is the real part of a complex analytic function, one sees that the subject of two-dimensional potential theory is substantially the same as that of complex analysis. For this reason, when speaking of potential theory, one focuses attention on theorems which hold in three or more dimensions. In this connection, a surprising fact is that many results and concepts originally discovered in complex analysis (such as Schwartz's theorem, Morera's theorem, the Weierstrass-Casorati theorem, Laurent series, and the classification of singularities as removable, poles and essential singularities) generalize to results on harmonic functions in any dimension. By considering which theorems of complex analysis are special cases of theorems of potential theory in any dimension, one can obtain a feel for exactly what is special about complex analysis in two dimensions and what is simply the two-dimensional instance of more general results."
http://en.wikipedia.org/wiki/P_%28complexity%29
"P can also be viewed as a uniform family of boolean circuits"
"P is known to contain many natural problems, including the decision versions of linear programming, calculating the greatest common divisor, and finding a maximum matching. In 2002, it was shown that the problem of determining if a number is prime is in P."
Comment: Here we see that the prime numbers are in P and we know that Set Theory deals with natural and prime numbers. It is simply a case of apples and oranges when it comes to differentiating between Hilberts 1st Problem and the P-NP Problem. From the following quote I want to say I was very pleased to know there is other people out there pondering the common relativity of these various famous math problems;
http://rjlipton.wordpress.com/conventional-wisdom-and-pnp/
12288;
"Miklos/December 30, 2010 6:44 pm
I keep wondering if P=NP could be independent of the ZFC axioms, just like the continuum hypothesis. This would mean that a practical implementation of P = NP could not be found, but it would not be possible to prove that they are different either. Very intriguing…"
------------------------------------------------------------
------------------------------------------------------------
-------------------------------
Part 5: Relative Consistency Principles Similiar To Hilberts 1st and P-NP Problem in Other Areas of Math
Comment: Pay attention to all the instances of the set of pairs a and b or multiple sets. It may seem trivial or arbitrary to list many examples of the set of pairs a and b but I say it is anything but arbitrary and quite obviously the essential foundation of empirical formulations or axioms found in mathematics and thus relevant to my paper discussing the relativity of set a with set b (Hilberts 1st Problem) or the relativity of the group of Polynomial Time problems with the group of Non-Polynomial Time problems (the P-NP Problem);
http://s134.photobucket.com/albums/
q107/mrgf/?action=view¤t=ANDorOR.gif
http://s134.photob
ucket.com/albums/q107/mrgf/?action=view¤t=XOR.gif
http://itee.uq.edu.au/~cogs2010/cmc/
chapters/BackProp/index2.html
"From a geometrical perspective, the perceptron attempts to solve the AND, OR, and XOR problems by using a straight line to separate the two classes: inputs labelled "0" are on one side of the line and inputs labelled "1" are on the other side. For the AND and OR functions, this is easy to do whereas for XOR it is not. The line separating the two classes is determined by net = theta. For two-diminensional problems such as AND, OR, and XOR, the line corresponds to
(I1 w1) + (I2 w2) = theta
Solving for I2 yields
I2 = -(w1/w2)I1 + (theta/w2).
In higher dimensions the boundary separating the two classes is a hyperplane
net = (sum)iwiIi.
All problems which can be solved by separating the two classes with a hyperplane are called linearly separable. The XOR problem (as presented) is not a linearly separable problem.
However, we can recode the XOR problem in three dimensions so that it becomes linearly separable "
Comment: I consider the difference between the set of integers (Alephnaught) and the set of reals (Bethone) to not only represent the difference between the group of Polynomial Time problems and the group of Non-Polynomial Time problems but also another anologue of the difference between the basic AND/OR logic gates with the XOR logic gate. I also believe the dual nature of the relative unprovable contradicting states found in both the Continuum Hypothesis and the P-NP Problem is also seen not only in Hardys Paradox, but also in the "quantum pairing" of Cooper Pairs. I'd simply refer to the decisions by the 2 "persons" involved in the Hardys Paradox example to represent both sides of the axiom of choice and I would also simply refer to the gate capacitor in the Cooper-pair box to represent an on/off axiom of choice ;
http://www.sciencedaily.com/release
s/2009/03/090304091231.htm
"Hardy's Paradox, the axiom that we cannot make inferences about past events that haven't been directly observed while also acknowledging that the very act of observation affects the reality we seek to unearth, poses a conundrum that quantum physicists have sought to overcome for decades."
http://granades.com/2009/03/30/hardy
s-paradox-or-the-economist-is-dismal-at-science/
http
://granades.com/wordpress/wp-content/uploads/2009/03/paths3.
jpg
"It turns out weak-valued probabilities don’t have to be positive definite, but what does that mean? In their paper, Lundeen and Steinberg say,
"Recall that the joint values are extracted by studying the polarization rotation of both photons in conicidence…. As in all weak measurement experiments, a negative weak value implies that the shift of a physical "pointer" (in this case, photon polarization) has the opposite sign from the one expected from the measurement interaction itself." "
http://en.wikipedia.org/wiki/File:C
ooper_pair_box_circuit.png
http://en.wikipedia.org/wiki/Weierstrass_approximati
on_theorem
"In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on an interval [a,b] can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the simplest functions, and because computers can directly evaluate polynomials, this theorem has both practical and theoretical relevance, especially in polynomial interpolation. The original version of this result was established by Karl Weierstrass in 1885."
http://en.wikipedia.org/wiki/B%C3%A9zout%27s
_identity
"In number theory, Bézout's identity for two integers a, b is an expression
ax+by=d \,
where x and y are integers (called Bézout coefficients for (a,b)), which is such that d is a common divisor of a and b. Bézout's lemma states that such coefficients exist for every pair of nonzero integers (a,b), with in addition d > 0, which is then in fact their greatest common divisor and also the smallest positive integer that can be written in this form for any integers x,y. This value of d is therefore uniquely determined by a and b, but the Bézout coefficients are not unique. A pair of Bézout coefficients (in fact the ones that are minimal in absolute value) can be computed by the extended Euclidean algorithm. "
http://en.wikipedia.org/wiki/Diophantine_equation
2288;
"It follows that there are also infinite solutions if c is a multiple of the greatest common divisor of a and b. If c is not a multiple of the greatest common divisor of a and b, then the Diophantine equation ax + by = c has no solutions."
http://en.wikiped
ia.org/wiki/Diophantine_set
"Examples:
The well known Pell equation
x2 − d(y + 1)2 = 1
is an example of a Diophantine equation with a parameter. As has long been known, the equation has a solution in the unknowns x,y precisely when the parameter d is 0 or not a perfect square. In the present context, one says that this equation provides a Diophantine definition of the set
{0,2,3,5,6,7,8,10,...}
consisting of 0 and the natural numbers that are not perfect squares. Other examples of Diophantine definitions are as follows:
The equation a = (2x + 3)y defines the set of numbers that are not powers of 2.
The equation a = (x + 2)(y + 2) defines the set of numbers greater than 1 that are not prime numbers.
The equation a + x = b defines the set of pairs such that "
http://en.wikipedia.org/wiki/Kernel_extensio
n_theorem
"Formally, the dimension theorem for vector spaces states that
Given a vector space V, any two linearly independent generating sets (in other words, any two bases) have the same cardinality.
If V is finitely generated, then it has a finite basis, and the result says that any two bases have the same number of elements.
The proof of the existence of a basis for any vector space in the general case requires Zorn's lemma and is in fact equivalent to the axiom of choice, and the proof given below assumes trichotomy (all cardinal numbers are comparable), which is also equivalent to the axiom of choice. The theorem can be generalized to arbitrary R-modules for rings R having invariant basis number."
http://en.wikipedia.
org/wiki/Algebraic_extension
"If a is algebraic over K, then K[a], the set of all polynomials in a with coefficients in K, is not only a ring but a field: an algebraic extension of K which has finite degree over K. In the special case where K = Q is the field of rational numbers, Q[a] is an example of an algebraic number field.
A field with no proper algebraic extensions is called algebraically closed. An example is the field of complex numbers. Every field has an algebraic extension which is algebraically closed (called its algebraic closure), but proving this in general requires some form of the axiom of choice.
An extension L/K is algebraic if and only if every sub K-algebra of L is a field."
http://en.wikipedia.org/wiki/Euler%27s_formula
ӌ
8;
"The original proof is based on the Taylor series expansions of the exponential function ez (where z is a complex number) and of sin x and cos x for real numbers x (see below). In fact, the same proof shows that Euler's formula is even valid for all complex numbers z."
"Now, taking this derived formula, we can use Euler's formula to define the logarithm of a complex number. To do this, we also use the definition of the logarithm (as the inverse operator of exponentiation) that
and that
both valid for any complex numbers a and b.
Therefore, one can write:
for any z ≠ 0. Taking the logarithm of both sides shows that:
and in fact this can be used as the definition for the complex logarithm. The logarithm of a complex number is thus a multi-valued function, because φ is multi-valued.
Finally, the other exponential law
which can be seen to hold for all integers k, together with Euler's formula, implies several trigonometric identities as well as de Moivre's formula."
http://en.wikipedia.
org/wiki/Irrational_number
"The first proof of the existence of irrational numbers is usually attributed to a Pythagorean (possibly Hippasus of Metapontum),[7] who probably discovered them while identifying sides of the pentagram.[8] The then-current Pythagorean method would have claimed that there must be some sufficiently small, indivisible unit that could fit evenly into one of these lengths as well as the other. However, Hippasus, in the 5th century BC, was able to deduce that there was in fact no common unit of measure, and that the assertion of such an existence was in fact a contradiction. He did this by demonstrating that if the hypotenuse of an isosceles right triangle was indeed commensurable with an arm, then that unit of measure must be both odd and even, which is impossible. His reasoning is as follows:
* The ratio of the hypotenuse to an arm of an isosceles right triangle is c:b expressed in the smallest units possible.
* By the Pythagorean theorem: c2 = a2+b2 = 2b2. (Since the triangle is isosceles, a = b.)
* Since c2 is even, c must be even.
* Since c:b is in its lowest terms, b must be odd.
* Since c is even, let c = 2y.
* Then c2 = 4y2 = 2b2
* b2 = 2y2 so b2 must be even, therefore b is even.
* However we asserted b must be odd. Here is the contradiction."
http://en.wikipedia.org/wiki/%CE%98_%28set_theory%29
" In set theory, Θ (pronounced like the letter theta) is the least nonzero ordinal α such that there is no surjection from the reals onto α.
If the axiom of choice (AC) holds (or even if the reals can be wellordered) then Θ is simply , the cardinal successor of the cardinality of the continuum. However, Θ is often studied in contexts where the axiom of choice fails, such as models of the axiom of determinacy.
Θ is also the supermum of the lengths of all prewellorderings of the reals.
Proof of existance:
It may not be obvious that it can be proved, without using AC, that there even exists a nonzero ordinal onto which there is no surjection from the reals (if there is such an ordinal, then there must be a least one because the ordinals are wellordered). However, suppose there were no such ordinal. Then to every ordinal α we could associate the set of all prewellorderings of the reals having length α. This would give an injection from the class of all ordinals into the set of all sets of orderings on the reals (which can to be seen to be a set via repeated application of the powerset axiom). Now the axiom of replacement shows that the class of all ordinals is in fact a set. But that is impossible, by the Burali-Forti paradox."
http://en.w
ikipedia.org/wiki/Intersection_theory
"This is a symmetric form for n even, in which case the signature of M is defined to be the signature of the form, and an alternating form for n odd"
"By Poincaré duality, it turns out that there is a way to think of this geometrically. If possible, choose representative n-dimensional submanifolds A, B for the Poincaré duals of a and b. Then λM(a, b) is the oriented intersection number of A and B, which is well-defined because of the dimensions of A and B. This explains the terminology intersection form."
"Intersection theory in algebraic geometry:
William Fulton in Intersection Theory (1984) writes
... if A and B are subvarieties of a non-singular variety X, the intersection product A.B should be an equivalence class of algebraic cycles closely related to the geometr
view post as summary