function [innerOpts, useEig, eigsSigma] = extraChecks(innerOpts, B, n, k, spdB, useEig, eigsSigma)

% Do remaining argument checks that require knowing the problem type

% If B not HPD, OP is not Hermitian (even if A is)

innerOpts.ishermprob = innerOpts.ishermprob && (isempty(B) || spdB); 

% Maintain old sigma behavior and convert to new sigma

if ismember(innerOpts.method, {'LI', 'SI'}) 

    if innerOpts.isrealprob && ~innerOpts.ishermprob

        if strcmp(innerOpts.method, 'LI')

            eigsSigma = 'bothendsimag';

            innerOpts.method = eigsSigma;

        else

            eigsSigma = 'smallestimagabs';

            innerOpts.method = eigsSigma;

        end

    else

        if strcmp(innerOpts.method, 'LI')

            eigsSigma = 'largestimag';

            innerOpts.method = eigsSigma;

        else

            eigsSigma = 'smallestimag';

            innerOpts.method = eigsSigma;

        end

    end

end

% Extra Checks on sigma

if innerOpts.ishermprob 

    if ismember(innerOpts.method, {'largestimag', 'smallestimag', 'bothendsimag'})

        % Problem has all real eigenvalues, and therefore we cannot sort

        % them by imaginary part. Sort instead by abs(real)

        innerOpts.method = 'largestabs';

    end

    if ~isreal(innerOpts.sigma)

        % Problem has all real eigenvalues but a complex shift

        % Taking the real part keeps the problem real and symmetric but

        % results will be the same

        innerOpts.sigma = real(innerOpts.sigma);

    end

end

% Extra check/set default for input OPTS.p

if ~innerOpts.userp && innerOpts.isrealprob && ~innerOpts.ishermprob ... 

        && ismember(innerOpts.method, {'largestimag', 'smallestimag'}) 

    % Raise p to account for needing to add conjugate pairs to the subspace

    innerOpts.p = min(max(4*k,20),n);

    if innerOpts.p == n

        % Since we are building the whole space anyway, do a full

        % decomposition

        useEig = true;

    end

end

end