Struct CollapsedDual 

pub struct CollapsedDual {
    pub types: Vec<Structure>,
    pub rows: BTreeSet<u64>,
}

The collapsed dual system at one scale: columns = canonical orbit types of the degree-≤ d basis, rows = the distinct type-vectors of the admitted NS generators m·g, taken over one multiplier per orbit × every generator (complete by the invariance lemma: the row of σ(m)·g equals the row of m·σ⁻¹(g), and the group permutes the generator set). An invariant functional L (one bit per type, L(∅-type) = 1) is a valid degree-d pseudo-expectation iff it annihilates every row.

Fields

types: Vec<Structure>

Canonical types, the empty monomial’s type first; the column order of rows.

rows: BTreeSet<u64>

Distinct constraint rows, each a bitmask over types (types ≤ 64 at the degrees this runs).

Implementations

impl CollapsedDual

pub fn solve(&self) -> Option<u64>

Does an invariant degree-d pseudo-expectation exist — is the system L ⊥ rows, L(∅) = 1 solvable? Returns the type-bitmask of a solution.

pub fn lift( &self, inst: &SymmetricInstance, degree: usize, solution: u64, ) -> Vec<Mono>

Lift a type-solution back to the full monomial witness at a concrete scale.