CyI(I, y)
Let $y$ be a variable of the polynomial ring $R = k[x_1,\ldots,x_n]$. A monomial ordering $<$ on $R$ is said to be $y$compatible if the initial term of $f$ satisfies ${\rm in}_<(f) = {\rm in}_<({\rm in}_y(f))$ for all $f \in R$. Here, ${\rm in}_y(f)$ is the initial $y$form of $f$, that is, if $f = \sum_i \alpha_iy^i$ and $\alpha_d \neq 0$ but $\alpha_t = 0$ for all $t >d$, then ${\rm in}_y(f) = \alpha_d y^d$.
Given an ideal $I$ and a $y$compatible monomial ordering $<$, let $G(I) = \{ g_1,\ldots,g_m\}$ be a Gröbner basis of $I$ with respect to this ordering. For $i=1,\ldots,m$, write $g_i$ as $g_i = y^{d_i}q_i + r_i$, where $y$ does not divide any term of $q_i$; that is, ${\rm in}_y(g_i) = y^{d_i}q_i$. Given this setup, the ideal $C_{y,I}$ is given by $$C_{y,I} = \langle q_1,\ldots,q_m\rangle$$ This functions takes an ideal $I$ and variable $y$, and returns $C_{y,I}$.
The ideal $C_{y,I}$ does not depend upon the choice of the Gröbner basis or a particular $y$compatible order (see comment after [KR, Definition 2.3]). When computing $C_{y,I}$ we use a lexicographical ordering on $R$ where $y > x_j$ for all $i \neq j$ if $y = x_i$ since this gives us a $y$compatible order.
The ideal $I$ in the example below is the edge ideal of the complete graph $K_4$. For more on edge ideals, see the EdgeIdeals package.





[KR] P. Klein and J. Rajchgot. Geometric Vertex Decomposition and Liaison. Forum of Math, Sigma, 9 (2021) e70:123.
This method is a shortcut to extract the ideal $C_{y,I}$ as computed in oneStepGVD. That is, to compute $C_{y,I}$, oneStepGVD is called in the background. As a result, work is also done in the background to compute $N_{y,I}$ at the same time, and as such, we encourage calling oneStepGVD directly if we want both the $C_{y,I}$ and $N_{y,I}$ ideals to avoid performing the same computation twice.
The object CyI is a method function with options.