Manuscript IX-C-ST@1 · IX-C-ST.tex · theorem · 892f50c4
Theorem: Scalar relation tests
Descent, scalar tests, and coherence equations · lines 1272–1299 · proof included or linked
IX-C-ST@1#thm:scalarfactor
The calibrated scalar assignments
descend exactly when
The permitted real set is empty, a singleton, or all of .
Proof. The descent criterion gives precisely those linear relation equations, using injectivity of the remaining sharp argument. Each equation is affine in . If two distinct real values solve every equation, their difference forces , and then ; all real values solve. If there are not two solutions, the solution set is empty or a singleton.
Displayed formulas in this passage
unlabeled · line 1275
unlabeled · line 1283
Nearby in this section
- section: Descent, scalar tests, and coherence equations
- theorem: Theorem: Algebraic descent criterion
- section: Descent, scalar tests, and coherence equations
- section: Descent, scalar tests, and coherence equations
- theorem: Theorem: Coefficientwise coherence criterion
- section: Descent, scalar tests, and coherence equations
- proposition: Proposition: Conditional presentation independence