OAI/NumberTheory/DukePrimeDegree/Geometry/FirstCoverCode.lean
8 declarations, 0 contain sorry, 0 declared as axioms
One covering label instead of the full vector of cut tests
A point is labeled by one cut containing it. There are N+1 labels for N cuts. Equality of labels still puts covered points in the same small set, while constancy of all cut tests implies constancy of this label.
- def
OAI.DukePrimeDegree.firstTrueline 16 - lemma
OAI.DukePrimeDegree.firstTrue_commonline 19 - def
OAI.DukePrimeDegree.firstCoverCodeline 35 - lemma
OAI.DukePrimeDegree.firstCoverCode_measurableline 39 - lemma
OAI.DukePrimeDegree.firstCoverCode_eq_of_cutCode_eqline 49 - lemma
OAI.DukePrimeDegree.firstCoverCode_selectedline 56 - lemma
OAI.DukePrimeDegree.firstCoverCode_commonline 66 - lemma
OAI.DukePrimeDegree.layered_firstCover_eq_of_cutCode_eqline 77