A minimum-valley-must-feed-regulator scan holds the peak and ripple fixed so the valley V_valley = V_peak - delta-V is fixed, then varies the regulator minimum across three rows, checking the gate V_valley >= V_min row by row. The arithmetic is exact only for the stated peak voltages, ripple voltages, valley voltages, minimum voltages, gate states, and rows in the ideal capacitor and ideal regulator model. Real reservoirs add ESR, capacitance tolerance, diode drops, load transients, ripple waveform shape, meter/probe calibration limits, finite precision, and measurement uncertainty.
A regulator claim needs the reservoir valley to clear the required input. Exact arithmetic here means exact results for the stated model inputs; measured inputs still carry uncertainty and significant-figure limits.
highlighted = computed this step
The valley is peak minus ripple
The checked peak is 10 V and the checked ripple is 3 V, so the valley is fixed before any minimum is tested.
Vvalley=Vpeak−ΔV
The same valley can pass or fail different minimums
The inclusive boundary row passes exactly at the valley; a higher required minimum fails.