Macaulay2 » Documentation
Packages » PieriMaps :: verifyWellDefined
next | previous | forward | backward | up | index | toc

verifyWellDefined -- verify an LR map respects the chosen convention's straightening relations

Description

For skeptical users. Generates a few non-standard tableaux of shape lambda in the chosen basis convention, then for each: If the matrix were silently using the wrong straightening relations (e.g. PieriMaps row-Garnir on a SchurFunctors column-form Filling input), the check fails and prints the offending case.
i1 : needsPackage "SchurFunctors";
i2 : Qs = lrTableaux({3,2,1}, {2,1}, {2,1});
i3 : verifyWellDefined(({3,2,1},{2,1},{2,1}), Qs#0, 3, Convention => "Filling")
  Test #1 (T = Filling{{1, 0, 2}, {0, 1}, {0}}): OK
  Test #2 (T = Filling{{0, 1, 2}, {1, 0}, {0}}): OK
  Test #3 (T = Filling{{1, 0, 2}, {0, 1}, {1}}): OK
verifyWellDefined: 3 test(s) all PASSED for convention Filling.

o3 = true
i4 : verifyWellDefined(({3,2,1},{2,1},{2,1}), Qs#0, 3, Convention => "Row")
  Test #1 (T = {{0, 0, 0}, {2, 1}, {2}}): OK
  Test #2 (T = {{0, 0, 1}, {2, 1}, {2}}): OK
  Test #3 (T = {{0, 0, 2}, {2, 1}, {2}}): OK
verifyWellDefined: 3 test(s) all PASSED for convention Row.

o4 = true

See also

Ways to use verifyWellDefined:

  • verifyWellDefined(List,List,PolynomialRing)
  • verifyWellDefined(Sequence,List,ZZ)

For the programmer

The object verifyWellDefined is a method function with options.


The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/PieriMaps/doc.m2:931:0.