Metraipolis › archive › dc_843d64e75fb2

Bézout's theorem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T17:09:04.153Z
SHA-256 of the archived text
2f65f273bb4b9f5351628fc3a86416db78c1bc9d5d68bea85395c36a517967c6
Stable URL of this page
https://metraipolis.com/documento/dc_843d64e75fb2

How to cite

Bézout's theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_843d64e75fb2 (Metraipolis archive dc_843d64e75fb2, sha256 2f65f273bb4b9f5351628fc3a86416db78c1bc9d5d68bea85395c36a517967c6)
BibTeX
@misc{dc843d64e75fb2,
  title = {Bézout's theorem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_843d64e75fb2; sha256 2f65f273bb4b9f5351628fc3a86416db78c1bc9d5d68bea85395c36a517967c6},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 d 1 {\displaystyle d_{1}} and d 2 {\displaystyle d_{2}} have no component in common, they have d 1 d 2 {\displaystyle d_{1}d_{2}} 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.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»).
Fonte: Wikipedia in inglese, voce «Bézout's theorem» — https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem
Wikidata Q1542114 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1542114
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1363286967, consultata il 2026-10-15T16:17:03.630Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fb70183d2599851d20ba72eedd2b25e5706ac1b3903813bbaa1a5daa459c19c2