Bernstein polynomials
E480872
Bernstein polynomials are a family of polynomials used in approximation theory that provide a constructive proof of the Weierstrass approximation theorem by uniformly approximating continuous functions on a closed interval.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bernstein polynomials canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T4927203 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bernstein polynomials Context triple: [Weierstrass approximation theorem, relatedTo, Bernstein polynomials]
-
A.
Bernstein inequalities
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
-
B.
Jacobi polynomials
Jacobi polynomials are a family of classical orthogonal polynomials depending on two parameters, widely used in approximation theory, numerical analysis, and solutions of differential equations.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Orthogonal Polynomials
Orthogonal Polynomials is a classic mathematical monograph by Gábor Szegő that systematically develops the theory and applications of orthogonal polynomial systems in analysis and approximation theory.
-
E.
Weierstrass approximation theorem
The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bernstein polynomials Target entity description: Bernstein polynomials are a family of polynomials used in approximation theory that provide a constructive proof of the Weierstrass approximation theorem by uniformly approximating continuous functions on a closed interval.
-
A.
Bernstein inequalities
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
-
B.
Jacobi polynomials
Jacobi polynomials are a family of classical orthogonal polynomials depending on two parameters, widely used in approximation theory, numerical analysis, and solutions of differential equations.
-
C.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
D.
Orthogonal Polynomials
Orthogonal Polynomials is a classic mathematical monograph by Gábor Szegő that systematically develops the theory and applications of orthogonal polynomial systems in analysis and approximation theory.
-
E.
Weierstrass approximation theorem
The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
family of polynomials
ⓘ
mathematical concept ⓘ tool in approximation theory ⓘ |
| associatedWithTheorem | Weierstrass approximation theorem NERFINISHED ⓘ |
| basisOf |
Bézier curve representation
ⓘ
space of polynomials of degree at most n on [0,1] ⓘ |
| belongsTo |
functional analysis
ⓘ
real analysis ⓘ |
| constructionMethod | probabilistic interpretation via binomial distribution ⓘ |
| convergenceType | uniform convergence ⓘ |
| convergesTo | given continuous function uniformly on [0,1] ⓘ |
| definedOn | closed interval [0,1] ⓘ |
| degree | n ⓘ |
| domain | continuous functions on a closed interval ⓘ |
| field | approximation theory ⓘ |
| formsBasis | polynomial space P_n ⓘ |
| generalizedTo | closed interval [a,b] ⓘ |
| hasEndpointValue |
B_{n,0}(0) = 1
ⓘ
B_{n,k}(0) = 0 for k>0 ⓘ B_{n,k}(1) = 0 for k<n ⓘ B_{n,n}(1) = 1 ⓘ |
| hasGeneralForm | B_{n,k}(x) = C(n,k) x^k (1-x)^{n-k} ⓘ |
| hasParameter |
degree n
ⓘ
index k ⓘ |
| hasProbabilisticInterpretation | B_{n,k}(x) as probability of k successes in n Bernoulli trials with parameter x ⓘ |
| hasSymmetryProperty | B_{n,k}(x) = B_{n,n-k}(1-x) ⓘ |
| indexRange | k = 0,1,...,n ⓘ |
| introducedBy | Sergei Natanovich Bernstein NERFINISHED ⓘ |
| introducedIn | early 20th century ⓘ |
| namedAfter | Sergei Natanovich Bernstein NERFINISHED ⓘ |
| nonNegativeOn | [0,1] ⓘ |
| partitionOfUnityOn | [0,1] ⓘ |
| preserves |
convexity under suitable conditions
ⓘ
monotonicity under suitable conditions ⓘ positivity of functions ⓘ |
| relatedTo |
Bernstein operator
NERFINISHED
ⓘ
Bézier curves ⓘ |
| satisfiesProperty |
B_{n,k}(x) ≥ 0 for x in [0,1]
ⓘ
sum_{k=0}^n B_{n,k}(x) = 1 for all x in [0,1] ⓘ |
| stableUnder | shape-preserving approximation ⓘ |
| typicalDomain | continuous functions on [0,1] ⓘ |
| usedFor |
approximating continuous functions
ⓘ
constructive proof of the Weierstrass approximation theorem ⓘ uniform approximation on closed intervals ⓘ |
| usedIn |
computer-aided geometric design
ⓘ
finite element methods ⓘ geometric modeling ⓘ numerical analysis ⓘ |
| usedToDefine |
Bernstein approximation
NERFINISHED
ⓘ
Bernstein basis ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Bernstein polynomials Description of subject: Bernstein polynomials are a family of polynomials used in approximation theory that provide a constructive proof of the Weierstrass approximation theorem by uniformly approximating continuous functions on a closed interval.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Bézier curve