Bézout's theorem
Bézout's theorem is a theorem calculating the number of intersection points of two algebraic curves in terms of their degrees.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2550157434
- Described as
- theorem calculating the number of intersection points of two algebraic curves in terms of their degrees
- What it is
- theorem
- Named after
- Étienne Bézout
- Wikipedias with a page
- 20
Wikidata item Q1542114 (wikidata.org/wiki/Q1542114), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1363286967
In algebraic geometry, Bézout's theorem is a statement concerning the number of common zeros of n polynomials in n indeterminates. In its original form the theorem states that in general the number of common zeros equals the product of the degrees of the polynomials. It is named after Étienne Bézout.
In some elementary texts, Bézout's theorem refers only to the case of two variables, and asserts that, if two plane algebraic curves of degrees d1 and d2 have no component in common, they have d1d2 intersection points, counted with their multiplicity, and including points at infinity and points with complex coordinates.
In its modern formulation, the theorem states that, if N is the number of common points over an algebraically closed field of n projective hypersurfaces defined by homogeneous polynomials in n + 1 indeterminates, then N is either infinite, or equals the product of the degrees of the polynomials. Moreover, the finite case occurs almost always.
In the case of two variables and in the case of affine hypersurfaces, if multiplicities and points at infinity are not counted, this theorem provides only an upper bound of the number of points, which is almost always reached. This bound is often referred to as the Bézout bound.
Bézout's theorem is fundamental in computer algebra and effective algebraic geometry, by showing that most problems have a computational complexity that is at least exponential in the number of variables. It follows that in these areas, the best complexity that can be hoped for will occur with algorithms that have a complexity that is polynomial in the Bézout bound.
From the Wikipedia article “Bézout's theorem” (en.wikipedia.org/wiki/Bézout's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
