Description: Lemma for pellex . Doing a field division between near solutions get us to norm 1, and the modularity constraint ensures we still have an integer. Returning NN guarantees that we are not returning the trivial solution (1,0). We are not explicitly defining the Pell-field, Pell-ring, and Pell-norm explicitly because after this construction is done we will never use them. This is mostly basic algebraic number theory and could be simplified if a generic framework for that were in place. (Contributed by Stefan O'Rear, 19-Oct-2014)
Ref | Expression | ||
---|---|---|---|
Hypotheses | pellex.ann | |
|
pellex.bnn | |
||
pellex.cz | |
||
pellex.dnn | |
||
pellex.irr | |
||
pellex.enn | |
||
pellex.fnn | |
||
pellex.neq | |
||
pellex.cn0 | |
||
pellex.no1 | |
||
pellex.no2 | |
||
pellex.xcg | |
||
pellex.ycg | |
||
Assertion | pellexlem6 | |