pub enum RailTailEvidence {
AnalyticFaceProof {
min_curvature: f64,
curvature_margin: f64,
},
ProbedTail {
noise_floor: f64,
drift_band: f64,
},
}Expand description
What established a rail coordinate’s tail law, and the standard it cleared (#2348 Inc 5 build-out).
The two routes are not two ways of measuring one quantity. They apply
different standards to different evidence, and the floors they clear are not
comparable: one is a threshold on a finite-difference estimate of ĉ, the
other a backward-error threshold on the smallest eigenvalue of a matrix.
Carrying both in a single noise_margin: f64 — documented as “the
pencil-constant noise floor for a measured tail, or the eigen-backward-error
margin of the analytic face form” — left every reader unable to tell which
number they held, including this module’s own well-formedness guard.
Variants§
AnalyticFaceProof
PROVEN at the face. The λ = ∞ limit was formed exactly and the
first-order form C on the released subspace is positive definite, so
the criterion strictly increases for every finite smoothing parameter on
the face, and on every sub-face, at once.
A coordinate whose own penalty releases nothing once the REST of the
face is at λ = ∞ is unidentified there, and the proof derives
tail_constant = 0 for it exactly: V does not depend on its smoothing
parameter at all. That zero is a result of the proof, not a missing
measurement — which is precisely why the two routes cannot share one
well-formedness rule.
Fields
ProbedTail
MEASURED by probing back from the rail: the pencil constant
ĉ = −e^{ρ}·∂V/∂ρ held across a finite-difference-clean window. The
evidence is a window at finite λ, so a constant that is not strictly
positive is the instrument reporting itself rather than a tail law.
Implementations§
Source§impl RailTailEvidence
impl RailTailEvidence
Sourcepub fn admits(&self, tail_constant: f64) -> bool
pub fn admits(&self, tail_constant: f64) -> bool
Whether tail_constant is well formed FOR THIS ROUTE.
The routes disagree about zero, and both are right. A probed tail reads
ĉ off a finite-difference window, where a non-positive constant is
noise being reported as a law. A proven face derives ĉ from the limit
itself, and derives exactly zero for a coordinate the rest of the face
has already pinned; refusing that would refuse a face the proof covers.
Such a coordinate needs another face coordinate to pin its directions, so
it can only arise on a face of two or more — which is why a
single-coordinate certificate never exercised the disagreement.
Trait Implementations§
Source§impl Clone for RailTailEvidence
impl Clone for RailTailEvidence
Source§fn clone(&self) -> RailTailEvidence
fn clone(&self) -> RailTailEvidence
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Copy for RailTailEvidence
Source§impl Debug for RailTailEvidence
impl Debug for RailTailEvidence
Source§impl<'de> Deserialize<'de> for RailTailEvidence
impl<'de> Deserialize<'de> for RailTailEvidence
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<RailTailEvidence, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<RailTailEvidence, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Source§impl PartialEq for RailTailEvidence
impl PartialEq for RailTailEvidence
Source§impl Serialize for RailTailEvidence
impl Serialize for RailTailEvidence
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl StructuralPartialEq for RailTailEvidence
Auto Trait Implementations§
impl Freeze for RailTailEvidence
impl RefUnwindSafe for RailTailEvidence
impl Send for RailTailEvidence
impl Sync for RailTailEvidence
impl Unpin for RailTailEvidence
impl UnsafeUnpin for RailTailEvidence
impl UnwindSafe for RailTailEvidence
Blanket Implementations§
impl<T> Allocation for T
impl<T> Boilerplate for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.