hasProofMethod
P7024
predicate
Indicates that there exists a specific method or technique used to establish or demonstrate the validity of something (such as a statement, claim, or theorem).
All labels observed (19)
| Label | Occurrences |
|---|---|
| proofTechnique | 48 |
| hasProofMethod canonical | 38 |
| hasProofTechnique | 28 |
| proofMethod | 28 |
| canBeProvedBy | 7 |
| methodOfProof | 7 |
| proofMethods | 7 |
| proofType | 6 |
| proofMethodsInclude | 5 |
| laterProofMethod | 4 |
| alternativeProofMethod | 3 |
| hasMethodOfIdentification | 3 |
| isProvedUsing | 3 |
| originalProofMethod | 3 |
| hasProofSystem | 2 |
| VoisinProofMethod | 1 |
| hasProofType | 1 |
| hasStandardProofMethod | 1 |
| hasVerificationType | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasProofMethod
Generated description
Indicates that there exists a specific method or technique used to establish or demonstrate the validity of something (such as a statement, claim, or theorem).
Sample triples (196)
| Subject | Object |
|---|---|
| Fermat's theorem on sums of two squares | algebraic number theory via predicate surface "proofTechnique" ⓘ |
| Fermat's theorem on sums of two squares | geometry of numbers via predicate surface "proofTechnique" ⓘ |
| Halting problem | diagonalization via predicate surface "proofTechnique" ⓘ |
| Halting problem | self-reference via predicate surface "proofTechnique" ⓘ |
| Halting problem | reduction ad absurdum via predicate surface "proofTechnique" ⓘ |
| Lagrange's theorem in group theory | partition of the group into left cosets of a subgroup via predicate surface "proofMethod" ⓘ |
| Cantor–Bernstein–Schröder theorem | construction via chains of elements under injections via predicate surface "hasStandardProofMethod" ⓘ |
| Conway’s soldiers | potential function argument via predicate surface "proofMethod" ⓘ |
| Conway’s soldiers | invariant based on weights assigned to board positions via predicate surface "proofMethod" ⓘ |
| Vandermonde's identity | combinatorial counting argument via predicate surface "canBeProvedBy" ⓘ |
| Vandermonde's identity | generating functions via predicate surface "canBeProvedBy" ⓘ |
| Vandermonde's identity | algebraic manipulation of binomial theorem via predicate surface "canBeProvedBy" ⓘ |
| Vandermonde's identity | induction on r via predicate surface "canBeProvedBy" ⓘ |
| Cauchy–Kovalevskaya theorem | power series expansion via predicate surface "proofTechnique" ⓘ |
| Cauchy–Kovalevskaya theorem | majorant series method via predicate surface "proofTechnique" ⓘ |
| quadratic reciprocity law |
Gauss sum
via predicate surface "proofMethodsInclude"
ⓘ
surface form:
Gauss sums
|
| quadratic reciprocity law | genus theory via predicate surface "proofMethodsInclude" ⓘ |
| quadratic reciprocity law |
global class field theory
via predicate surface "proofMethodsInclude"
ⓘ
surface form:
class field theory
|
| quadratic reciprocity law | Galois theory via predicate surface "proofMethodsInclude" ⓘ |
| quadratic reciprocity law | lattice point counting via predicate surface "proofMethodsInclude" ⓘ |
| Hasse bound for elliptic curves | uses properties of L-functions and complex analysis in Hasse's original proof via predicate surface "proofMethod" ⓘ |
| de Bruijn–Erdős theorem | compactness argument ⓘ |
| de Bruijn–Erdős theorem | ultrafilter techniques ⓘ |
| de Bruijn–Erdős theorem | topological methods ⓘ |
| de Bruijn–Erdős theorem | combinatorial argument ⓘ |
| Cauchy condensation test | grouping terms in blocks of dyadic length via predicate surface "proofTechnique" ⓘ |
| Cauchy condensation test | comparison of grouped sums with condensed series via predicate surface "proofTechnique" ⓘ |
| geometrization conjecture |
Ricci flow
via predicate surface "proofMethod"
ⓘ
surface form:
Ricci flow with surgery
|
| geometrization conjecture | analysis of singularities in Ricci flow via predicate surface "proofMethod" ⓘ |
| Dehn lemma | use of towers of covering spaces via predicate surface "proofMethod" ⓘ |
| Dehn lemma | use of group-theoretic techniques in topology via predicate surface "proofMethod" ⓘ |
| Green–Tao theorem | non-constructive proof via predicate surface "hasProofType" ⓘ |
| Euler’s theorem | group-theoretic argument via predicate surface "proofMethod" ⓘ |
| Euler’s theorem | combinatorial counting argument via predicate surface "proofMethod" ⓘ |
| Picard theorem | normal families ⓘ |
| Picard theorem | Montel theorem ⓘ |
| Picard theorem |
Riemann surfaces
ⓘ
surface form:
Riemann surface theory
|
| Picard theorem | potential theory ⓘ |
| Hadamard inequality | induction on matrix size via predicate surface "proofTechnique" ⓘ |
| Hadamard inequality | Cauchy–Binet formula via predicate surface "proofTechnique" ⓘ |
| Hadamard inequality | Cauchy–Schwarz inequality via predicate surface "proofTechnique" ⓘ |
| Valiant–Vazirani theorem | probabilistic method via predicate surface "proofMethod" ⓘ |
| Federal Rule of Evidence 1007 | testimony of the party against whom the evidence is offered via predicate surface "methodOfProof" ⓘ |
| Federal Rule of Evidence 1007 | testimony of the party’s representative via predicate surface "methodOfProof" ⓘ |
| Federal Rule of Evidence 1007 | written statement of the party against whom the evidence is offered via predicate surface "methodOfProof" ⓘ |
|
MIP equals NEXP
surface form:
MIP = NEXP
|
oracularization techniques via predicate surface "isProvedUsing" ⓘ |
|
MIP equals NEXP
surface form:
MIP = NEXP
|
parallel repetition ideas via predicate surface "isProvedUsing" ⓘ |
|
MIP equals NEXP
surface form:
MIP = NEXP
|
algebraic encoding of computations via predicate surface "isProvedUsing" ⓘ |
| Böhm–Jacopini theorem | program transformation via predicate surface "proofTechnique" ⓘ |
| Böhm–Jacopini theorem | flowchart normalization via predicate surface "proofTechnique" ⓘ |